An implementation of the dqds algorithm (positive case) (Q1976917)
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: An implementation of the dqds algorithm (positive case) |
scientific article; zbMATH DE number 1443451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An implementation of the dqds algorithm (positive case) |
scientific article; zbMATH DE number 1443451 |
Statements
An implementation of the dqds algorithm (positive case) (English)
0 references
15 January 2001
0 references
The authors discuss in detail the issues that have to be faced in the computer realization of the differential quotient-difference algorithm with shifts algorithm: criteria accepting a value, splitting the matrix, choosing shift, as well as using IEEE arithmetic, and avoiding unnecessary over/underflows. Some new formulae are also developed to approximate the smallest eigenvalue from a twisted factorization of a matrix.
0 references
splitting
0 references
shifting
0 references
IEEE arithmetic
0 references
dqds algorithm
0 references
differential quotient-difference algorithm with shifts
0 references
smallest eigenvalue
0 references
0.8071045279502869
0 references
0.7945370078086853
0 references
