Abstract
Matrix Riccati Differential Equations (MRDEs) are initial value problems of the form:X′=A21-XA11+A22X-XA12X,X(0)=X0.These equations arise frequently throughout applied mathematics, science, and engineering. It can happen that even when the Aij are smooth functions of t or constant, the solution X may have a singularity or even infinitely many singularities.This paper shows several classes of numerical algorithms, which we call GIP integrators, that can solve for X past its singularities. Furthermore, none of the algorithms require knowledge of the placement or even existence of singularities in X. Also, it is shown how embedded Runge–Kutta methods can be used to construct GIP integrators to not only approximate X past singularities but also provide for error estimation to allow efficient time stepping. Finally, several examples are shown to validate the theory.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.