Approximations and error bounds for computing the inverse mapping
DOI10.1023/A:1022291010828zbMATH Open0904.65051MaRDI QIDQ1265615FDOQ1265615
Authors: K. Appert
Publication date: 28 September 1998
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/32971
Recommendations
error boundsBanach spacenumerical examplematrix differential equationsinverse mappingone-step-method
Numerical computation of solutions to systems of equations (65H10) Implicit function theorems, Jacobians, transformations with several variables (26B10) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solution of the Equation $AX + XB = C$ by Inversion of an $M \times M$ or $N \times N$ Matrix
- Title not available (Why is that?)
- Non-autonomous Riccati-type matrix differential equations: existence interval, construction of continuous numerical solutions and error bounds
- Solution of the Matrix Equations $AX + XB = - Q$ and $S^T X + XS = - Q$
Cited In (1)
Uses Software
This page was built for publication: Approximations and error bounds for computing the inverse mapping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265615)