An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
DOI10.1016/0024-3795(88)90003-1zbMATH Open0645.65022OpenAlexW1984452258WikidataQ127642516 ScholiaQ127642516MaRDI QIDQ1103330FDOQ1103330
Authors: Th. Beelen, Paul van Dooren
Publication date: 1988
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(88)90003-1
Recommendations
- scientific article; zbMATH DE number 4016040
- scientific article; zbMATH DE number 4016039
- scientific article; zbMATH DE number 3862327
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
- The computation of the Kronecker canonical form of an arbitrary symmetric pencil
Numerical optimization and variational techniques (65K10) Controllability (93B05) Canonical forms, reductions, classification (15A21) Matrix pencils (15A22)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast projection methods for minimal design problems in linear system theory
- The generalized eigenstructure problem in linear system theory
- Title not available (Why is that?)
- The computation of Kronecker's canonical form of a singular pencil
- Kronecker's canonical form and the QZ algorithm
- Title not available (Why is that?)
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Computation of zeros of linear multivariable systems
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- AB-algorithm and its modifications for the spectral problems of linear pencils of matrices
- Properties of numerical algorithms related to computing controllability
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
- Deadbeat control: A special inverse eigenvalue problem
- A reduced order observer for descriptor systems
- Title not available (Why is that?)
- Polynomial matrices and feedback
- Title not available (Why is that?)
- Matrix pencils. Proceedings of a Conference Held at Pite Havsbad, Sweden, March 22-24, 1982
Cited In (59)
- Index reduction via unimodular transformations
- Matrix pencils and entanglement classification
- Preserving the DAE structure in the Loewner model reduction and identification framework
- Singular \(\mathcal {H}_2\)-optimization problems for discrete-time systems
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Combinatorial Analysis of Singular Matrix Pencils
- On computing root polynomials and minimal bases of matrix pencils
- Regularizing algorithm for mixed matrix pencils
- Legendre duality in combinatorial study of matrix pencils
- Stabilizing solution to the reverse discrete-time Riccati equation: A matrix-pencil-based approach
- Parallel algorithm for solving some spectral problems of linear algebra
- Regularity/controllability/observability of an NDS with descriptor form subsystems and generalized LFTs
- The quasi-Weierstrass form for regular matrix pencils
- An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects
- Pencils of complex and real symmetric and skew matrices
- A framework for structured linearizations of matrix polynomials in various bases
- A new look at pencils of matrix valued functions
- Squaring down with zeros cancellation in generalized systems
- Linear system matrices of rational transfer functions
- A structured staircase algorithm for skew-symmetric/symmetric pencils
- Disturbance decoupling by behavioral feedback for linear differential-algebraic systems
- Normal forms for general polynomial matrices
- On the Kronecker canonical form of mixed matrix pencils
- Isolation of the regular part of a singular matrix pencil as a rational algorithm
- A novel numerical method for exact model matching problem with stability
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- Zero cancellation for general rational matrix functions
- On generalized inverses of singular matrix pencils
- A canonical form for pencils of matrices with applications to asymptotic linear programs
- Title not available (Why is that?)
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Computing the regularization of a linear differential-algebraic system
- Placing zeroes and the Kronecker canonical form
- Where is the nearest non-regular pencil?
- Cryptanalysis of a combinatorial public key cryptosystem
- Index-aware model-order reduction for a special class of nonlinear differential-algebraic equations
- Interrogation of spline surfaces with application to isogeometric design and analysis of lattice-skin structures
- The Laurent expansion of pencils that are singular at the origin
- Computation of canonical matrices for chains and cycles of linear mappings.
- Minimum energy control of descriptor fractional discrete-time linear systems with two different fractional orders
- Computation of structural invariants of generalized state-space systems
- A canonical parametrization of the Kronecker form of a matrix pencil
- Computing the Jordan structure of an eigenvalue
- Title not available (Why is that?)
- Title not available (Why is that?)
- The numerical Jordan form
- On the Kronecker Canonical Form of Singular Mixed Matrix Pencils
- Essentially optimal computation of the inverse of generic polynomial matrices
- From Morse triangular form of ODE control systems to feedback canonical form of DAE control systems
- RGSVD—AN Algorithm for Computing the Kronecker Structure and Reducing Subspaces of Singular $A - \lambda B$ Pencils
- Submodules of Kronecker modules via extension monoid products
- On recursive computation of coprime factorizations of rational matrices
- Interconnection of Kronecker canonical form and special coordinate basis of multivariable linear systems
- LQ control of descriptor systems by cancelling structure at infinity
- Continuous-time non-symmetric algebraic Riccati theory: a matrix pencil approach
- The computation of the Kronecker canonical form of an arbitrary symmetric pencil
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Using permuted graph bases in \(\mathcal{H}_\infty\) control
- Numerical solution and perturbation theory for generalized Lyapunov equations
This page was built for publication: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103330)