A class of incomplete orthogonal factorization methods. I: Methods and theories

DOI10.1023/A:1021913700691zbMath0990.65038OpenAlexW2473084598MaRDI QIDQ5937099

Andrew J. Wathen, Zhong Zhi Bai, Iain S. Duff

Publication date: 3 December 2001

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021913700691

zbMATH Keywords

preconditionersKrylov subspace methodsGiven's rotationsincomplete orthogonal factorization methodslarge sparse unsymmetrical systemsleast squares problemsmodified Gram-Schmidt orthogonalization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Related Items (25)

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 ⋮ A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems ⋮ A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations ⋮ On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Incomplete hyperbolic Gram-Schmidt-based preconditioners for the solution of large indefinite least squares problems ⋮ An optimized discrete grey multi-variable convolution model and its applications ⋮ A modified SSOR-like preconditioner for non-Hermitian positive definite matrices ⋮ A flexible and adaptive simpler block GMRES with deflated restarting for linear systems with multiple right-hand sides ⋮ Fourier analysis of frequency filtering decomposition preconditioners ⋮ Motivations and realizations of Krylov subspace methods for large sparse linear systems ⋮ Numerical study on incomplete orthogonal factorization preconditioners ⋮ Optimization of the parameterized Uzawa preconditioners for saddle point matrices ⋮ Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems ⋮ Structured preconditioners for nonsingular matrices of block two-by-two structures ⋮ Generalized skew-Hermitian triangular splitting iteration methods for saddle-point linear systems ⋮ Modified incomplete orthogonal factorization methods using Givens rotations ⋮ A two-parameter shift-splitting preconditioner for saddle point problems ⋮ A class of incomplete orthogonal factorization methods. II: Implemetation and results ⋮ Preconditioner based on the Sherman-Morrison formula for regularized least squares problems ⋮ Combined gradient methods for multiobjective optimization ⋮ Solving large linear least squares problems with linear equality constraints ⋮ On an iterative method for solving the least squares problem of rank-deficient systems

This page was built for publication: A class of incomplete orthogonal factorization methods. I: Methods and theories