A refinement of an iterative orthogonal projection method
From MaRDI portal
Publication:2279843
DOI10.1016/j.cam.2018.02.025OpenAlexW2791275548WikidataQ130188616 ScholiaQ130188616MaRDI QIDQ2279843
Noreen Jamil, M. Asif Naeem, Nilufar Baghaei, Farhaan Mirza
Publication date: 16 December 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.02.025
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Convex programming (90C25) Iterative numerical methods for linear systems (65F10) Randomized algorithms (68W20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Two-subspace projection method for coherent overdetermined systems
- Extending linear relaxation for non-square matrices and soft constraints
- Block-iterative methods for consistent and inconsistent linear equations
- On the acceleration of Kaczmarz's method for inconsistent linear systems
- Domain specific high-level constraints for user interface layout
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Randomized Extended Kaczmarz for Solving Least Squares
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
This page was built for publication: A refinement of an iterative orthogonal projection method
