Saving computer memory and computation time in the differential sweep method

MaRDI QIDQ5954394zbMATH OpenFDO

Authors B. S. Pariiskii

Publication date 9 June 2002

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

boundary value problemcomputational efficiencydifferential sweep method

Mathematics Subject Classification ID

Linear boundary value problems for ordinary differential equations (34B05) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Complexity and performance of numerical algorithms (65Y20)

Review text

The author proposes a sweep method based on the use of a matrix in the form of an exponential function for the integration of systems of linear ordinary differential equations. By an example of two boundary value problems, it is found that the computation speed of the method is many times higher than that of other methods. Then, the author employs an efficient technique for saving crucial computer memory in the differential sweep method.

Recommendations

• Publication:3486768
• On stability of differential sweep methods
• scientific article; zbMATH DE number 4203619
• scientific article; zbMATH DE number 3992845
• scientific article; zbMATH DE number 1006841

This page was built for publication: Saving computer memory and computation time in the differential sweep method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5954394)