Projection methods for linear systems
From MaRDI portal
A unified framework is introduced to derive several known projection methods for solving systems of linear equations. It is shown that these methods can be derived from a special minimization problem. As particular cases, the methods of steepest descent, Richardson and conjugate gradients are discussed in details. Projection acceleration procedures for accelerating the convergence of an arbitrary iteration scheme are also discussed.
Recommendations
Cites work
- Acceleration properties of the hybrid procedure for solving linear systems
- Augmentability in optimization theory
- Block descent methods and hybrid procedures for linear systems
- Changing the Norm in Conjugate Gradient Type Algorithms
- Complex conjugate gradient methods
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- How Fast are Nonsymmetric Matrix Iterations?
- scientific article; zbMATH DE number 440636 (Why is no real title available?)
- scientific article; zbMATH DE number 3120437 (Why is no real title available?)
- scientific article; zbMATH DE number 3133812 (Why is no real title available?)
- scientific article; zbMATH DE number 3768853 (Why is no real title available?)
- scientific article; zbMATH DE number 3786054 (Why is no real title available?)
- scientific article; zbMATH DE number 52854 (Why is no real title available?)
- scientific article; zbMATH DE number 88927 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 3617419 (Why is no real title available?)
- scientific article; zbMATH DE number 804728 (Why is no real title available?)
- scientific article; zbMATH DE number 915500 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3242808 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Hybrid procedures for solving linear systems
- Iterative solution of large sparse systems of equations. Transl. from the German
- Lanczos-type algorithms for solving systems of linear equations
- Line search acceleration of iterative methods
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Methods of conjugate gradients for solving linear systems
- New implementations of Lanczos method
- On Complex Second-Degree Iterative Methods
- Preconditioning strategies for models of incompressible flow
- Some practically important stress-systems in solids of revolution
- Stationary second-degree iterative methods
- Sur-décomposition de normes générales et procédés itératifs
- The N‐Step Iteration Procedures
- The general theory of relaxation methods applied to linear systems
- Variations on Richardson's method and acceleration
Cited in
(43)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- Projection methods solving rectangular systems of linear equations
- Vector sequence transformations: Methodology and applications to linear systems
- Projection methods for systems of equations
- Extrapolation methods for improving the convergence of oligomer calculations to the infinite chain limit of quasi-one-dimensional stereoregular polymers.
- A fully-implicit model of the global ocean circulation
- Prediction proberties of Aitken's iterated \(\Delta^2\) process, of Wynn's epsilon algorithm, and of Brezinski's iterated theta algorithm
- Iterative solution of linear systems in the 20th century
- Biorthogonal vector sequence transformations and Padé approximation of vector series
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- A convex optimization approach for solving large scale linear systems
- A general projection algorithm for solving systems of linear equations
- Preconditioning techniques for large linear systems: A survey
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Minimal residual based iterative methods and its parallel implementation for sparse linear systems
- Some hyperbolic iterative methods for linear systems
- Variant of greedy randomized Kaczmarz for ridge regression
- Performance analysis of preconditioners based on Broyden method
- Randomized block Kaczmarz methods with k-means clustering for solving large linear systems
- The direct-projection methods
- Explicit level-set-based topology optimization using an exact Heaviside function and consistent sensitivity analysis
- scientific article; zbMATH DE number 4211385 (Why is no real title available?)
- scientific article; zbMATH DE number 3951420 (Why is no real title available?)
- scientific article; zbMATH DE number 4086424 (Why is no real title available?)
- Nonlinear hybrid procedures and fixed point iterations
- On Hessenberg type methods for low-rank Lyapunov matrix equations
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- Orthogonal projectors and systems of linear algebraic equations
- A line projection method for solving linear systems of equations
- A projection method to solve linear systems in tensor format
- A partially greedy randomized extended Gauss-Seidel method for solving large linear systems
- Convergence acceleration during the 20th century
- On Kaczmarz's projection iteration as a direct solver for linear least squares problems
- On randomized sampling Kaczmarz method with application in compressed sensing
- A randomized block extended Kaczmarz method with hybrid partitions for solving large inconsistent linear systems
- Computing projections with LSQR
- On multi-step greedy Kaczmarz method for solving large sparse consistent linear systems
- Variable s-step technique for new conjugate residual algorithms for solving non-square linear systems arising in control problems
- A generalized iterative method and comparison results using projection techniques for solving linear systems
- Convergence of a randomized Douglas-Rachford method for linear system
- Finding the orthogonal projection of a point onto an affine subspace
- On a new iterative method for solving linear systems and comparison results
This page was built for publication: Projection methods for linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674417)
