s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
From MaRDI portal
Publication:3984475
DOI10.1137/0728088zbMath0741.65026OpenAlexW2026991672MaRDI QIDQ3984475
Publication date: 27 June 1992
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0728088
performanceconvergencesteepest descent methodconjugate gradient-like methodsnonsymmetric indefinite matricesconjugate residualserror free computationsKrylov affine subspaces
Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items (22)
An efficient algorithm based on Lanczos type of BCR to solve constrained quadratic inverse eigenvalue problems ⋮ On the squared unsymmetric Lanczos method ⋮ Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations ⋮ Conjugate gradient-like methods for solving general tensor equation with Einstein product ⋮ Modified block product preconditioner for a class of complex symmetric linear systems ⋮ A generalization of \(s\)-step variants of gradient methods ⋮ 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 ⋮ Varying the \(s\) in your \(s\)-step GMRES ⋮ Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems ⋮ Periodic conjugate direction algorithm for symmetric periodic solutions of general coupled periodic matrix equations ⋮ On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems ⋮ An EM-based iterative method for solving large sparse linear systems ⋮ Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints ⋮ Block s-step Krylov iterative methods ⋮ Some recursions on Arnoldi's method and IOM for large non-Hermitian linear systems ⋮ Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions ⋮ Computing symmetric solutions of general Sylvester matrix equations via Lanczos version of biconjugate residual algorithm ⋮ Developing Kaczmarz method for solving Sylvester matrix equations ⋮ A block varaint of the GMRES method for unsymmetric linear systems ⋮ 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
This page was built for publication: s-Step Iterative Methods for (Non)Symmetric (In)Definite Linear Systems
