The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques
From MaRDI portal
Publication:3615673
DOI10.1007/978-3-642-00464-3_35zbMath1233.65031MaRDI QIDQ3615673
Dimitrios Triantafyllou, Athanasios A. Pantelous, Grigoris I. Kalogeropoulos, Marilena Mitrouli
Publication date: 24 March 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00464-3_35
65F15: Numerical computation of eigenvalues and eigenvectors of matrices
Related Items
Discretizing LTI descriptor (Regular) differential input systems with consistent initial conditions, The (multi-player) linear quadratic state feedback control problem for index one descriptor systems, Optimal Hankel norm model reduction for discrete-time descriptor systems
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
- A fast algorithm for index of annihilation computations
- The prime and generalized nullspaces of right regular pencils
- Partial singular value decomposition algorithm
- On the Segré, Weyr characteristics of right (left) regular matrix pencils