The blended linear multistep methods of Skeel and Kong (1977) are fairly simply expressed in Nordsieck form, but the underlying multistep method turns out to be much more complicated.

Roundoff error m the solution of hnear algebraic systems is stud,ed using a more reahstsc notion of what st means to perturb a problem, namely, that each datum :s subject to a relatwely small change Th:s ,s particularly appropriate for sparse linear systems The condition number :s determined for th:s approach The effect of scahng on the stabdlty of Gaussmn ellmmat,on is stud:ed, and st is d:scovered that the proper way to scale a system depends on the right-hand s:de However, ff only the norm of the error is of concern, then there ~s a good way to scale that does not depend on the right-hand stde

article Blended Linear Multistep Methods Share on Authors: Robert D. Skeel Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, ILView Profile , Antony K. Kong Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, ILView Profile Authors Info & Claims ACM Transactions on Mathematical SoftwareVolume 3Issue 4Dec. 1977 pp 326–345https://doi.org/10.1145/355759.355762Published:01 December 1977 43citation532DownloadsMetricsTotal Citations43Total Downloads532Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access