Hyperbolic Pairs in the Method of Conjugate Gradients
From MaRDI portal
Publication:5578439
DOI10.1137/0117118zbMATH Open0187.09704OpenAlexW2047813092MaRDI QIDQ5578439FDOQ5578439
Authors: David G. Luenberger
Publication date: 1969
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0117118
Cited In (25)
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- A composite step conjugate gradients squared algorithm for solving nonsymmetric linear systems
- Computational methods of linear algebra
- Iterative solution of linear systems in the 20th century
- A framework for generalized conjugate gradient methods -- with special emphasis on contributions by Rüdiger Weiß
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems
- Rational interpolation via orthogonal plynomials
- Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Conjugate gradient-type algorithms for a finite-element discretization of the Stokes equations
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- A new taxonomy of conjugate gradient methods
- A minimization method for the solution of large symmetriric eigenproblems
- A breakdown of the block CG method
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Exploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systems
- The method of conjugate gradients used in inverse iteration
- Use of indefinite pencils for computing damped natural modes
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Generating conjugate directions for arbitrary matrices by matrix equations. I
- On preconditionad iterative methods for solving (A-lambdaB)x=0
- Planar quasi-Newton algorithms for unconstrained saddlepoint problems
- Conjugate direction methods and polarity for quadratic hypersurfaces
- A composite step bi-conjugate gradient algorithm for nonsymmetric linear systems
This page was built for publication: Hyperbolic Pairs in the Method of Conjugate Gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5578439)