Show simple item record

dc.contributor.authorNeta, Beny
dc.contributor.authorFukushima, Toshio
dc.date2000
dc.date.accessioned2014-03-12T22:48:00Z
dc.date.available2014-03-12T22:48:00Z
dc.date.issued2000
dc.identifier.urihttp://hdl.handle.net/10945/39476
dc.descriptionIn special issue on Numerical Methods in Physics, Chemistry and Engineering, Computers and Mathematics with Applications, 45, (2003), 383-390.en_US
dc.description.abstractThis paper discusses the numerical solution of first order initial value problems and a special class of second order ones (those not containing first derivative). Two classes of methods are discussed, super-implicit and Obrechkoff. We will show equivalence of super-implicit and Obrechkoff schemes. 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 case the right hand side is complex, we may prefer super-implicit methods. The disadvantage of super-implicit methods is that they, in general, have a larger error constant. To get the same error constant we require one or more extra future values. We can use these extra values to increase the order of the method instead of decreasing the error constant.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.titleObrechkoff versus super-implicit methods for the solution of first and second order initial value problemsen_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