s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
This paper reviews the following conjugate gradient-like methods, in order to solve linear systems, with a non necessarily symmetric positive definite matrix: conjugate residuals (CR), generalized CR (GRC), GRC(k), Orthomin(k), \(s\)-step minimal residual (\(s\)-MR), \(s\)-GRC, \(s\)- Orthomin(k), \(s\)-step minimal residual (\(s\)-MR), \(s\)-Orthomin(k) and GMRES\((s)\). The \(s\)-versions deal in the \(i\)-th iteration with the Krylov affine subspaces spanned by the first \(s\) terms in the Krylov sequence generated by the \(i\)-th residual; thus 1-MR is the classical steepest descent method; \(s\)-MR is algebraically equivalent to GMRES\((s)\) as defined by \textit{Y. Saad} and \textit{M. Schultz} [SIAM J. Sci. Stat. Comput. 7, 856-869 (1986; Zbl 0599.65018)], when considered as a direct method, i.e. in error free computations. The author proves several new convergence results for some of the methods already mentioned and also gives a detailed description of their operational cost. He also points out that the \(s\)-versions are expected to have better performance than the standard ones on parallel computers, which is to be examined in a forthcoming paper.
- scientific article; zbMATH DE number 1569012
- s-step iterative methods for symmetric linear systems
- On a generalized conjugate gradient orthogonal residual method
- scientific article; zbMATH DE number 1748480
- scientific article; zbMATH DE number 1167541
- scientific article; zbMATH DE number 671780
- Projection-minimization methods for nonsymmetric linear systems
- scientific article; zbMATH DE number 440647
- scientific article; zbMATH DE number 1293810
- Numerical results on the SD and CG methods for slightly non-symmetric matrices
- s-step iterative methods for symmetric linear systems
- On the squared unsymmetric Lanczos method
- Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems
- An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems
- Varying the \(s\) in your \(s\)-step GMRES
- Periodic conjugate direction algorithm for symmetric periodic solutions of general coupled periodic matrix equations
- Developing Kaczmarz method for solving Sylvester matrix equations
- Conjugate gradient-like methods for solving general tensor equation with Einstein product
- Weighted and flexible versions of block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides
- Solving constrained quadratic inverse eigenvalue problem via conjugate direction method
- Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems
- Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints
- Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm
- Block-s-step Krylov iterative methods
- scientific article; zbMATH DE number 434537 (Why is no real title available?)
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- A Positive Barzilai–Borwein-Like Stepsize and an Extension for Symmetric Linear Systems
- A generalization of s-step variants of gradient methods
- On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems
- A block variant of the GMRES method for unsymmetric linear systems
- Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations
- An EM-based iterative method for solving large sparse linear systems
- Scalable linear solvers based on enlarged Krylov subspaces with dynamic reduction of search directions
- A s-step variant of the double orthogonal series algorithm
- Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product
- A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state-space model in the presence of disturbance and uncertainty
- Modified block product preconditioner for a class of complex symmetric linear systems
- BCR algorithm for solving quadratic inverse eigenvalue problems for partially bisymmetric matrices
- Developing variable s-step CGNE and CGNR algorithms for non-symmetric linear systems
- A numerically stable communication-avoiding s-step GMRES algorithm
- Parallel iterative S-step methods for unsymmetric linear systems
- An optimal stepwise optimization based approach to solve generalized linear matrix equation
- A unified preconditioned minimal residual (PMR) algorithm for matrix problems: linear systems, multiple right-hand sides linear systems, least squares problems, inversion and pseudo-inversion with application to color image encryption
- Variable s-step technique for planar algorithms in solving indefinite linear systems
- Efficient image reconstruction via regularized variable s-step conjugate gradient method for Sylvester matrix equations
- Gradient descent-based parameter-free methods for solving coupled matrix equations and studying an application in dynamical systems
- Variable s-step technique for new conjugate residual algorithms for solving non-square linear systems arising in control problems
- Gradient neural network for time-varying matrix inversion with momentum acceleration and applications in image encryption
- A parameterized block preconditioner for solving a class of complex symmetric linear systems
- Gradient adaptive parameter method for coupled matrix equations with applications in transient heat conduction problem and image steganography
- On-the-Fly Reduced Bases Through the Lens of Augmented Krylov Methods
This page was built for publication: s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984475)