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

From MaRDI portal
Revision as of 13:54, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (74)

A generalized conjugate gradient, least square methodA composite step bi-conjugate gradient algorithm for nonsymmetric linear systemsOn a class of Chebyshev approximation problems which arise in connection with a conjugate gradient type methodOn the squared unsymmetric Lanczos methodNecessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithmsIterative k-step methods for computing possibly repulsive fixed points in Banach spacesParallel multidomain iterative algorithms for the Helmholtz wave equationGMRES-Accelerated ADMM for Quadratic ObjectivesBreakdowns and stagnation in iterative methodsA new taxonomy of conjugate gradient methodsNewton-Krylov methods applied to a system of convection-diffusion-reaction equationsNested Krylov methods based on GCRArtificial damping techniques for scalar waves in the frequency domainA linear system solver based on a modified Krylov subspace method for breakdown recoveryA two-sided short-recurrence extended Krylov subspace method for nonsymmetric matrices and its relation to rational moment matchingSYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrixBlock jacobi preconditioning of the conjugate gradient method on a vector processorParallelizable restarted iterative methods for nonsymmetric linear systems. part I: TheoryA unitary similarity transform of a normal matrix to complex symmetric formReliability Investigation of BiCGStab and IDR Solvers for the Advection-Diffusion-Reaction EquationA condensed representation of almost normal matricesPreconditioning strategies for models of incompressible flowA non-iterative method for vertex corrections of the Kubo formula for electric conductivityComparison of two-level preconditioners derived from deflation, domain decomposition and multigrid methodsExplicit approximate inverse preconditioning techniquesPrincipally normal matricesTensor Equivalents for Solution of Linear Systems: A Parallel AlgorithmHigher-order schemes for the Laplace transformation method for parabolic problemsA survey of subspace recycling iterative methodsA stochastic unknown input realization and filtering techniqueA flexible short recurrence Krylov subspace method for matrices arising in the time integration of port-Hamiltonian systems and ODEs/DAEs with a dissipative HamiltonianOn generating Sobolev orthogonal polynomialsSuperlinear PCG Algorithms: Symmetric Part Preconditioning and Boundary ConditionsA numerical comparison of two minimal residual methods for linear polynomials in unitary matricesBlock tridiagonal reduction of perturbed normal and rank structured matricesPreconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectivesWeighted Inner Products for GMRES and GMRES-DROn conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matricesKrylov Subspace Solvers and PreconditionersExponential time differencing for mimetic multilayer Ocean modelsQMR: A quasi-minimal residual method for non-Hermitian linear systemsA mesh independent superlinear algorithm for some nonlinear nonsymmetric elliptic systemsOn an Economic Arnoldi Method for $BML$-MatricesSuperlinearly convergent PCG algorithms for some nonsymmetric elliptic systemsOn a condensed form for normal matrices under finite sequences of elementary unitary similaritiesQuasi-kernel polynomials and their use in non-Hermitian matrix iterationsInverse eigenvalue problems for extended Hessenberg and extended tridiagonal matricesAn Iteration for Indefinite Systems and Its Application to the Navier--Stokes EquationsOn IOM(q): The Incomplete Orthogonalization Method for Large Unsymmetric Linear SystemsEfficient preconditioning of the linearized Navier-Stokes equations for incompressible flowMulticomponent transport algorithms for partially ionized mixturesRecursive interpolation algorithm: A formalism for solving systems of linear equations. II: Iterative methodsProjected iterative algorithms for complex symmetric systems arising in magnetized multicomponent transportSymmetric Part Preconditioning for the Conjugate Gradient Method in Hilbert SpaceLanczos-type algorithms for solving systems of linear equationsEquivalent operator preconditioning for elliptic problemsAdaptive polynomial preconditioning for Hermitian indefinite linear systemsMinimum residual methods for augmented systemsOn orthogonal reduction to Hessenberg form with small bandwidthThe structured distance to normality of banded Toeplitz matricesA Bramble--Pasciak Conjugate Gradient Method for Discrete Stokes Equations with Random ViscosityOn the residual norms, the Ritz values and the harmonic Ritz values that can be generated by restarted GMRESThe Arnoldi process, short recursions, and displacement ranksStabilized Reconstruction in Signal and Image ProcessingUnnamed ItemA Preconditioned MINRES Method for Nonsymmetric Toeplitz MatricesOn a conjugate gradient-type method for solving complex symmetric linear systemsRestrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systemsIterative solution of linear systems in the 20th centuryAnalysis of acceleration strategies for restarted minimal residual methodsEfficient and reliable iterative methods for linear systemsRevisiting \((k,\ell)\)-step methodsExperiments with Krylov subspace methods on a massively parallel computerMethods of minimal iterations using a generalized Krylov basis







This page was built for publication: Necessary and Sufficient Conditions for the Existence of a Conjugate Gradient Method