On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
From MaRDI portal
The author of this short paper considers inverse problems modeled by Fredholm integral equations of the first kind. A discretization of the integral equation in a system of linear equations is performed and an iterative approximate orthogonalization algorithm to solve this system of linear equations is proposed. Some numerical experiences and the behaviour of the presented method are studied.
Recommendations
- The orthogonal-symmetric solutions of the matrix equation and the optimal approximation
- An iterative algorithm for approximate orthogonalisation of symmetric matrices
- scientific article; zbMATH DE number 4141392
- The anti-symmetric ortho-symmetric solution of a linear matrix equation and its optimal approximation
- An orthogonally accumulated projection method for symmetric linear system of equations
- Numerical experiments with the symmetric algorithm in the ABS class for linear systems
- On sparse approximations of solutions to linear systems with orthogonal matrices
- scientific article; zbMATH DE number 5733269
- scientific article; zbMATH DE number 7746914
- scientific article; zbMATH DE number 2109094
Cites work
- Extension of an approximate orthogonalization algorithm to arbitrary rectangular matrices
- scientific article; zbMATH DE number 4169087 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3353461 (Why is no real title available?)
- Inverse Problems and Torricelli's Law
- Linear integral equations
- Regularization methods for the stable solution of inverse problems
- Some Iterative Methods for Improving Orthonormality
Cited in
(3)
This page was built for publication: On numerical solution of arbitrary symmetric linear systems by approximate orthogonalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010019)