Neville elimination for rank-structured matrices (Q2469525)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neville elimination for rank-structured matrices |
scientific article |
Statements
Neville elimination for rank-structured matrices (English)
0 references
6 February 2008
0 references
The author deals with Neville elimination of rank-structured matrices for computing its bidiagonal decomposition efficiently. It is then possible to obtain an efficient representation of a non singular totally positive (TP) rank-stuctured matrix as the product of bidiagonal factors. This makes it possible to provide a \(O(n^2)\) fast and accurate algorithm to compute approximate of eigenvalues of TP rank-stuctured matrices.
0 references
Neville elimination
0 references
totally positive matrices
0 references
rank-structured matrices
0 references
eigenvalue computation
0 references
complexity
0 references
algorithm
0 references
0 references
0 references
0 references
0 references
