Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method

From MaRDI portal
Publication:3336575

DOI10.1137/0721026zbMath0546.65010OpenAlexW2049644675WikidataQ105708884 ScholiaQ105708884MaRDI QIDQ3336575

Vance Faber, Thomas A. Manteuffel

Publication date: 1984

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0721026



Related Items

A generalized conjugate gradient, least square method, A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems, On a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type method, On the squared unsymmetric Lanczos method, Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms, Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces, Parallel multidomain iterative algorithms for the Helmholtz wave equation, GMRES-Accelerated ADMM for Quadratic Objectives, Breakdowns and stagnation in iterative methods, A new taxonomy of conjugate gradient methods, Newton-Krylov methods applied to a system of convection-diffusion-reaction equations, Nested Krylov methods based on GCR, Artificial damping techniques for scalar waves in the frequency domain, A linear system solver based on a modified Krylov subspace method for breakdown recovery, A two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matching, SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix, Block jacobi preconditioning of the conjugate gradient method on a vector processor, Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory, A unitary similarity transform of a normal matrix to complex symmetric form, Reliability Investigation of BiCGStab and IDR Solvers for the Advection-Diffusion-Reaction Equation, A condensed representation of almost normal matrices, Preconditioning strategies for models of incompressible flow, A non-iterative method for vertex corrections of the Kubo formula for electric conductivity, Comparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methods, Explicit approximate inverse preconditioning techniques, Principally normal matrices, Tensor Equivalents for Solution of Linear Systems: A Parallel Algorithm, Higher-order schemes for the Laplace transformation method for parabolic problems, A survey of subspace recycling iterative methods, A stochastic unknown input realization and filtering technique, A flexible short recurrence Krylov subspace method for matrices arising in the time integration of port-Hamiltonian systems and ODEs/DAEs with a dissipative Hamiltonian, On generating Sobolev orthogonal polynomials, Superlinear PCG Algorithms: Symmetric Part Preconditioning and Boundary Conditions, A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices, Block tridiagonal reduction of perturbed normal and rank structured matrices, Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives, Weighted Inner Products for GMRES and GMRES-DR, On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices, Krylov Subspace Solvers and Preconditioners, Exponential time differencing for mimetic multilayer Ocean models, QMR: A quasi-minimal residual method for non-Hermitian linear systems, A mesh independent superlinear algorithm for some nonlinear nonsymmetric elliptic systems, On an Economic Arnoldi Method for $BML$-Matrices, Superlinearly convergent PCG algorithms for some nonsymmetric elliptic systems, On a condensed form for normal matrices under finite sequences of elementary unitary similarities, Quasi-kernel polynomials and their use in non-Hermitian matrix iterations, Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices, An Iteration for Indefinite Systems and Its Application to the Navier--Stokes Equations, On IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear Systems, Efficient preconditioning of the linearized Navier-Stokes equations for incompressible flow, Multicomponent transport algorithms for partially ionized mixtures, Recursive interpolation algorithm: A formalism for solving systems of linear equations. II: Iterative methods, Projected iterative algorithms for complex symmetric systems arising in magnetized multicomponent transport, Symmetric Part Preconditioning for the Conjugate Gradient Method in Hilbert Space, Lanczos-type algorithms for solving systems of linear equations, Equivalent operator preconditioning for elliptic problems, Adaptive polynomial preconditioning for Hermitian indefinite linear systems, Minimum residual methods for augmented systems, On orthogonal reduction to Hessenberg form with small bandwidth, The structured distance to normality of banded Toeplitz matrices, A Bramble--Pasciak Conjugate Gradient Method for Discrete Stokes Equations with Random Viscosity, On the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRES, The Arnoldi process, short recursions, and displacement ranks, Stabilized Reconstruction in Signal and Image Processing, Unnamed Item, A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices, On a conjugate gradient-type method for solving complex symmetric linear systems, Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems, Iterative solution of linear systems in the 20th century, Analysis of acceleration strategies for restarted minimal residual methods, Efficient and reliable iterative methods for linear systems, Revisiting \((k,\ell)\)-step methods, Experiments with Krylov subspace methods on a massively parallel computer, Methods of minimal iterations using a generalized Krylov basis