An Algorithm for $Ax = \lambda Bx$ with Symmetric and Positive-Definite <i>A</i> and <i>B</i> (Q3980609)
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 Algorithm for $Ax = \lambda Bx$ with Symmetric and Positive-Definite A and B |
scientific article; zbMATH DE number 22702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Algorithm for $Ax = \lambda Bx$ with Symmetric and Positive-Definite <i>A</i> and <i>B</i> |
scientific article; zbMATH DE number 22702 |
Statements
An Algorithm for $Ax = \lambda Bx$ with Symmetric and Positive-Definite <i>A</i> and <i>B</i> (English)
0 references
26 June 1992
0 references
algorithm
0 references
generalized eigenvalue problem
0 references
Cholesky decompositions
0 references
generalized singular value problem
0 references
\(CS\) decomposition
0 references
\(QR\) decomposition
0 references
\(QZ\) algorithm
0 references
numerical examples
0 references
