Fast accurate eigenvalue methods for graded positive definite matrices (Q1923282): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s002110050209 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2081925639 / rank | |||
Normal rank |
Revision as of 20:10, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast accurate eigenvalue methods for graded positive definite matrices |
scientific article |
Statements
Fast accurate eigenvalue methods for graded positive definite matrices (English)
0 references
11 February 1997
0 references
If \(A\) is a positive definite matrix, and its condition number is much less than that of a diagonal matrix \(D\), then \(H=DAD\) is called a graded matrix. The Cholesky factorization of \(H\) is used to propose fast algorithms for the computation of the eigenvalues of \(H\). The eigenvalues can be computed to high relative accuracy and more efficiently than by Jacobi's method. In some cases the new methods can be four times faster than tridiagonalization methods.
0 references
positive definite matrix
0 references
condition number
0 references
graded matrix
0 references
Cholesky factorization
0 references
fast algorithms
0 references
eigenvalues
0 references
Jacobi's method
0 references