Abstract

The approximation of y . . = A y + B ( t ) y . + c ( t ) {y^{..}} = Ay + B(t){y^.} + c(t) by linear multistep methods is studied. It is supposed that the matrix A is real symmetric and negative semidefinite, that the multistep method has an interval of absolute stability [ − s , 0 ] [ - s,0] , and that h 2 ‖ A ‖ ⩽ s {h^2}\left \| A \right \| \leqslant s where h is the time step. A priori error bounds are derived which show that the exponential multiplication factor is of the form exp ⁡ { Γ s | | | B | | | n ( n h ) } \exp \{ {\Gamma _s}|||B|||_{n}(nh)\} , | | | B | | | n = max 0 ⩽ t ⩽ n h ‖ B ( t ) ‖ |||B|||_{n} = {\max _{0 \leqslant t \leqslant nh}}\left \| {B(t)} \right \| .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.