Modified incomplete orthogonal factorization methods using Givens rotations

DOI10.1007/s00607-009-0065-4zbMath1176.65034OpenAlexW2079921357MaRDI QIDQ1034737

Jun-Feng Yin, Zhong Zhi Bai

Publication date: 6 November 2009

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-009-0065-4

zbMATH Keywords

stabilitynumerical resultsGMRESlarge sparse systemsKrylov subspace iteration methodsGivens orthogonalizationlarge sparse nonsymmetric matricespreconditioners incomplete

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (11)

Multistep matrix splitting iteration preconditioning for singular linear systems ⋮ A quasi-minimal residual variant of IDRstab using the residual smoothing technique ⋮ Global simpler GMRES for nonsymmetric systems with multiple right-hand sides ⋮ Stable Computation of Least Squares Problems of the OGM(1,N) Model and Short-Term Traffic Flow Prediction ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations ⋮ An optimized discrete grey multi-variable convolution model and its applications ⋮ A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides ⋮ Motivations and realizations of Krylov subspace methods for large sparse linear systems ⋮ Combined gradient methods for multiobjective optimization ⋮ Solving large linear least squares problems with linear equality constraints

Uses Software

• MatrixMarket
• ILUT
• CIMGS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Numerical study on incomplete orthogonal factorization preconditioners
• Preconditioning techniques for nonsymmetric and indefinite linear systems
• Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems
• Sharp error bounds of some Krylov subspace methods for non-Hermitian linear systems
• Numerical methods for generalized least squares problems
• A class of incomplete orthogonal factorization methods. II: Implemetation and results
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• An Incomplete Factorization Technique for Positive Definite Linear Systems
• Second Order Strongly Implicit Symmetric Factorization Methods for the Solution of Elliptic Difference Equations
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Iterative Krylov Methods for Large Linear Systems
• ILUT: A dual threshold incomplete LU factorization
• An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations
• Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
• A class of incomplete orthogonal factorization methods. I: Methods and theories

This page was built for publication: Modified incomplete orthogonal factorization methods using Givens rotations