An improved Toeplitz algorithm for polynomial matrix null-space computation
From MaRDI portal
Recommendations
- On the computation of the null space of Toeplitz-like matrices
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
- Computing minimal nullspace bases
- On rank and null space computation of the generalized Sylvester matrix
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3673938 (Why is no real title available?)
- scientific article; zbMATH DE number 49560 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1350351 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 4189084 (Why is no real title available?)
- A Componentwise Perturbation Analysis of the $QR$ Decomposition
- A Toeplitz algorithm for polynomial J-spectral factorization
- A minimal polynomial basis solution to residual generation for fault diagnosis in linear systems
- A novel method to determine the finite and infinite frequency structure of a rational matrix
- A robust solution of the generalized polynomial Bézout identity
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Column reduction of polynomial matrices
- Computing multiple roots of inexact polynomials
- Decoupling and Pole Assignment in Linear Multivariable Systems: A Geometric Approach
- Diophantine equations in control. -- A survey
- Fast projection methods for minimal design problems in linear system theory
- Greatest common divisor via generalized Sylvester and Bezout matrices
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Normwise Scaling of Second Order Polynomial Matrices
- Numerical Polynomial Algebra
- Numerical computation of a coprime factorization of a transfer function matrix
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- Numerical condition of polynomials in different forms
- Numerical operations with polynomial matrices
- On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
- Polynomial Roots from Companion Matrix Eigenvalues
- Polynomial and rational matrix interpolation: theory and control applications
- Reliable numerical methods for polynomial matrix triangularization
- Structural Invariants of Linear Multivariable Systems
- Structured Backward Error and Condition of Generalized Eigenvalue Problems
- Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
- The computation of Kronecker's canonical form of a singular pencil
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
Cited in
(13)- On the computation of the null space of Toeplitz-like matrices
- On computing root polynomials and minimal bases of matrix pencils
- Nearest matrix polynomials with a specified elementary divisor
- Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach
- Computationally Efficient Reduced Polynomial Based Algorithms for Hermitian Toeplitz Matrices
- Nearest rank deficient matrix polynomials
- Revisiting the Matrix Polynomial Greatest Common Divisor
- Parameter identifiability for nonlinear LPV models
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- A local construction of the Smith normal form of a matrix polynomial
- The generalized Schur algorithm and some applications
- New properties of ARE solutions for strictly dissipative and lossless systems
- On computing minimal proper nullspace bases with applications in fault detection
This page was built for publication: An improved Toeplitz algorithm for polynomial matrix null-space computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004243)
