Q3969773 (Q3969773): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:50, 13 June 2024

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

Fridrich Sloboda

0 references

publication date

1982

0 references

full work available at URL

https://eudml.org/doc/15263

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

imperfect conjugate gradient algorithm

0 references

symmetric, positive definite matrix

0 references

biorthogonalization

0 references

line searches

0 references

global efficiency

0 references

MaRDI profile type

MaRDI publication profile

0 references

Methods of conjugate gradients for solving linear systems

0 references

Function minimization by conjugate gradients

0 references

The Conjugate Gradient Method for Linear and Nonlinear Operator Equations

0 references

Conjugate Gradient Algorithms: Quadratic Termination without Linear Searches

0 references

A conjugate direction algorithm without line searches

0 references

A method to accelerate the rate of convergence of a class of optimization algorithms

0 references

On the relation between quadratic termination and convergence properties of minimization algorithms. Part I. Theory

0 references

On the relation between quadratic termination and convergence properties of minimization algorithms. Part II. Applications

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3969773

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3969773&oldid=34677278"