Approximations and error bounds for computing the inverse mapping
From MaRDI portal
A procedure for constructing approximations of the inverse of a smooth mapping of a finite-dimensional Banach space into itself is developed. The author's main idea starts with showing that the theoretical inverse mapping can be expressed in terms of solutions of matrix differential equations. These equations are then solved by an original one-step-method and the discretization error is estimated. The results are illustrated by a numerical example.
Recommendations
Cites work
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 3163006 (Why is no real title available?)
- scientific article; zbMATH DE number 3689809 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3209538 (Why is no real title available?)
- scientific article; zbMATH DE number 3212889 (Why is no real title available?)
- scientific article; zbMATH DE number 3393631 (Why is no real title available?)
- scientific article; zbMATH DE number 3182507 (Why is no real title available?)
- Non-autonomous Riccati-type matrix differential equations: existence interval, construction of continuous numerical solutions and error bounds
- Solution of the Equation AX + XB = C by Inversion of an M \times M or N \times N Matrix
- Solution of the Matrix Equations $AX + XB = - Q$ and $S^T X + XS = - Q$
Cited in
(2)
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)