Estimates of eigenvalues for iterative methods
Mathematics of ComputationPublished 1 January 1989Open access
Gene H. Golub, Mark D. Kent
Citations34
SJR quartileQ1
SJR score1.84
SNIP1.96
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We describe a procedure for determining estimates of the eigenvalues of operators used in various iterative methods for the solution of linear systems of equations. We also show how to determine upper and lower bounds for the error in the approximate solution of linear equations, using essentially the same information as that needed for the eigenvalue calculations. The methods described depend strongly upon the theory of moments and Gauss quadrature.
Keywords
Computer ScienceMathematicsPhysics and Astronomy
The algebraic eigenvalue problem
5,785 Citations1965J. H. Wilkinson
Journal of research of the National Bureau of StandardsAn iteration method for the solution of the eigenvalue problem of linear differential and integral operators
4,376 Citations1950Cornelius Lanczos
SIAM ReviewSome Modified Matrix Eigenvalue Problems
729 Citations1973Gene H. Golub
This work considers the numerical calculation of several matrix eigenvalue problems which require some manipulation before the standard algorithms may be used, and studies several eigen value problems which arise in least squares.
Elsevier eBooksA GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
437 Citations1976Paul Concus, Gene H. Golub +1 more
A generalized conjugate gradient method for solving sparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations is considered.
SIAM Journal on Scientific and Statistical ComputingOn Generating Orthogonal Polynomials
388 Citations1982Walter Gautschi
Rocky Mountain Journal of MathematicsModified moments and Gaussian quadratures
183 Citations1974John C. Wheeler
Numerische MathematikAn algorithm for Gaussian quadrature given modified moments
172 Citations1971R. A. Sack, A. F. Donovan
Elsevier eBooksQuestions of Numerical Condition Related to Polynomials
92 Citations1978Walter Gautschi
Journal of Mathematical Analysis and ApplicationsBounds for the error of linear systems of equations using the theory of moments
64 Citations1972Germund Dahlquist, Stanley C. Eisenstat +1 more
It is shown that by examining δi = xi + 1 − xi, it is possible to construct upper and lower bounds for ∥ xi − x ∥, which indicates the euclidean norm.