Publication:3969773
From MaRDI portal
zbMath0503.65017MaRDI QIDQ3969773
Publication date: 1982
Full work available at URL: https://eudml.org/doc/15263
global efficiency; biorthogonalization; line searches; symmetric, positive definite matrix; imperfect conjugate gradient algorithm
65F10: Iterative numerical methods for linear systems
Related Items
Imperfect conjugate gradient algorithms for extended quadratic functions, New imperfect conjugate gradient algorithm, Unnamed Item, Unnamed Item
Cites Work
- A conjugate direction algorithm without line searches
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory
- On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications
- Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches
- A method to accelerate the rate of convergence of a class of optimization algorithms
- Function minimization by conjugate gradients
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- Methods of conjugate gradients for solving linear systems