Show simple item record

dc.contributor.authorNeta, Beny
dc.date.accessioned2015-01-07T02:16:37Z
dc.date.available2015-01-07T02:16:37Z
dc.date.issued2007
dc.identifier.citationComputers and Mathematics with Applications, 54, (2007), pp. 117â 126
dc.identifier.urihttp://hdl.handle.net/10945/44243
dc.descriptionThe article of record as published may be found at http://dx.doi.org/10.1016/j.camwa.2005.11.041en_US
dc.description.abstractThis paper discusses the numerical solution of periodic initial value problems. Two classes of methods are discussed, superimplicit and Obrechkoff. The advantage of Obrechkoff methods is that they are high-order one-step methods and thus will not require additional starting values. On the other hand they will require higher derivatives of the right-hand side. In cases when the right-hand side is very complex, we may prefer super-implicit methods. We develop a super-implicit P-stable method of order 12 and Obrechkoff method of order 18.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 high-order super-implicit and Obrechkoff methods for periodic initial value problemsen_US
dc.typeArticleen_US
dc.contributor.departmentApplied Mathematicsen_US
dc.subject.authorObrechkoff methodsen_US
dc.subject.authorSuper-impliciten_US
dc.subject.authorInitial value problemsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record