A generalized projection iterative methods for solving non-singular linear systems
From MaRDI portal
Abstract: In this paper, we propose and analyze iterative method based on projection techniques to solve a non-singular linear system Ax = b. In particular, for a given positive integer m, m-dimensional successive projection method (mD-SPM) for symmetric definite matrix A, is generalized for non-singular matrix A. Moreover, it is proved that mD-SPM gives better result for large values of m. Numerical experiments are carried out to demonstrate the superiority of the proposed method in comparison with other schemes in the scientific literature.
Recommendations
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- Construction and investigation of non-stationary iteration methods of solving systems of linear equations and inverse of matrices
- A line projection method for solving linear systems of equations
- On a new iterative method for solving linear systems and comparison results
- Successive projection iterative method for solving matrix equation \(AX=B\)
Cites work
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- A modification of minimal residual iterative method to solve linear systems
- A new iterative method for solving linear systems
- How Fast are Nonsymmetric Matrix Iterations?
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On a new iterative method for solving linear systems and comparison results
Cited in
(11)- A projection method for solving nonsymmetric linear systems on multiprocessors
- A general projection algorithm for solving systems of linear equations
- Linear updates for a single-phase projective method
- A new iterative method for solving non-square systems of linear equations
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- A line projection method for solving linear systems of equations
- Approximate Solutions of Linear Systems at a Universal Rate
- A two-dimensional randomized extended Gauss-Seidel algorithm for solving least squares problems
- A maximal residual two subspace projection algorithm for solving least-squares problems
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- Parameter-related projection-based iterative algorithm for a kind of generalized positive semidefinite least squares problem
This page was built for publication: A generalized projection iterative methods for solving non-singular linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6336170)
