Estimation of spectral bounds in gradient algorithms (Q385581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimation of spectral bounds in gradient algorithms |
scientific article; zbMATH DE number 6235212
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimation of spectral bounds in gradient algorithms |
scientific article; zbMATH DE number 6235212 |
Statements
Estimation of spectral bounds in gradient algorithms (English)
0 references
2 December 2013
0 references
One often uses the minimization of convex quadratic functions with the help of gradient algorithms to solve systems of linear equations whose coefficient matrix is symmetric positive-definite. In this paper, the authors give a nice estimate for spectral bounds which allow the construction of simple and cost-effective gradient algorithms with fast convergence.
0 references
estimation of leading eigenvalues
0 references
arcsine distribution
0 references
gradient algorithms
0 references
conjugate gradient
0 references
Fibonacci numbers
0 references
minimization of convex quadratic functions
0 references
spectral bounds
0 references
convergence
0 references
0 references
