Show simple item record

dc.contributor.authorNeta, Beny
dc.date.accessioned2015-01-07T02:13:43Z
dc.date.available2015-01-07T02:13:43Z
dc.date.issued2005
dc.identifier.citationComputer and Mathematics with Applications, 50, 2005, pp. 701-705
dc.identifier.urihttp://hdl.handle.net/10945/44242
dc.descriptionThe article of record as published may be found at http://dx.doi.org/10.1016/j.camwa.2005.04.013en_US
dc.description.abstractThe idea of super-implicit methods (requiring not just past and present but also future values) was suggested by Fukushima recently. Here, we construct P-stable super-impliclt methods for the solution of second-order initial value problems. The benefit of such methods is realized when using vector or parallel computers.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.en_US
dc.titleP-stable symmetric super-implicit methods for periodic initial value problemsen_US
dc.typeArticleen_US
dc.contributor.departmentApplied Mathematicsen_US
dc.subject.authorsuper-impliciten_US
dc.subject.authorInitial value problemsen_US
dc.subject.authorP-stabilityen_US
dc.subject.authorCowellen_US
dc.subject.authorPicard iterationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record