An improved Toeplitz algorithm for polynomial matrix null-space computation
From MaRDI portal
Publication:1004243
DOI10.1016/j.amc.2008.10.037zbMath1161.65035OpenAlexW2003256174MaRDI QIDQ1004243
Didier Henrion, J. C. Zúñiga Anaya
Publication date: 2 March 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.10.037
algorithmpolynomial matricesnumerical stabilityalgorithmic complexitySylvester matrixcomputer-aided control system designmatrix algorithmsblock Toeplitz structureminimal null-space basis
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Parameter identifiability for nonlinear LPV models ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ A local construction of the Smith normal form of a matrix polynomial ⋮ New properties of ARE solutions for strictly dissipative and lossless systems ⋮ Revisiting the Matrix Polynomial Greatest Common Divisor ⋮ Nearest rank deficient matrix polynomials ⋮ Nearest Matrix Polynomials With a Specified Elementary Divisor ⋮ The generalized Schur algorithm and some applications ⋮ On computing root polynomials and minimal bases of matrix pencils
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- A Toeplitz algorithm for polynomial \(J\)-spectral factorization
- Numerical computation of a coprime factorization of a transfer function matrix
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Fast projection methods for minimal design problems in linear system theory
- Column reduction of polynomial matrices
- Diophantine equations in control. -- A survey
- A robust solution of the generalized polynomial Bézout identity
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Numerical operations with polynomial matrices
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- A novel method to determine the finite and infinite frequency structure of a rational matrix
- Polynomial and rational matrix interpolation: theory and control applications
- A Componentwise Perturbation Analysis of the $QR$ Decomposition
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
- Greatest common divisor via generalized Sylvester and Bezout matrices
- On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Reliable numerical methods for polynomial matrix triangularization
- Normwise Scaling of Second Order Polynomial Matrices
- Computing multiple roots of inexact polynomials
- Numerical Polynomial Algebra
- Polynomial Roots from Companion Matrix Eigenvalues
- Decoupling and Pole Assignment in Linear Multivariable Systems: A Geometric Approach
- Structural Invariants of Linear Multivariable Systems
- Numerical condition of polynomials in different forms
- A minimal polynomial basis solution to residual generation for fault diagnosis in linear systems
This page was built for publication: An improved Toeplitz algorithm for polynomial matrix null-space computation
