A fast algorithm for index of annihilation computations
From MaRDI portal
Publication:1807796
DOI10.1016/S0377-0427(99)00103-XzbMath0952.93039MaRDI QIDQ1807796
Publication date: 11 January 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques ⋮ On the computation of the rank of block bidiagonal Toeplitz matrices
Cites Work
- Rang revealing QR factorizations
- Error analysis of QR decompositions by Givens transformations
- The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- Some Applications of the Rank Revealing QR Factorization
- An algorithm for numerical determination of the structure of a general matrix
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A fast algorithm for index of annihilation computations
