An improved Toeplitz algorithm for polynomial matrix null-space computation

DOI10.1016/J.AMC.2008.10.037zbMATH Open1161.65035OpenAlexW2003256174MaRDI QIDQ1004243FDOQ1004243

Authors: J. C. Zúñiga Anaya, Didier Henrion 

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

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

zbMATH Keywords

algorithmnumerical stabilitypolynomial matricesalgorithmic complexitySylvester matrixcomputer-aided control system designmatrix algorithmsblock Toeplitz structureminimal null-space basis

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

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
• Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
• Title not available (Why is that?)
• The computation of Kronecker's canonical form of a singular pencil
• Structural Invariants of Linear Multivariable Systems
• Structured Backward Error and Condition of Generalized Eigenvalue Problems
• Title not available (Why is that?)
• Numerical Polynomial Algebra
• Title not available (Why is that?)
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• Decoupling and Pole Assignment in Linear Multivariable Systems: A Geometric Approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial Roots from Companion Matrix Eigenvalues
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• Computing multiple roots of inexact polynomials
• Title not available (Why is that?)
• Column reduction of polynomial matrices
• Diophantine equations in control. -- A survey
• On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
• Normwise Scaling of Second Order Polynomial Matrices
• Numerical computation of a coprime factorization of a transfer function matrix
• Numerical operations with polynomial matrices
• A minimal polynomial basis solution to residual generation for fault diagnosis in linear systems
• Numerical condition of polynomials in different forms
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Polynomial and rational matrix interpolation: theory and control applications
• A Componentwise Perturbation Analysis of the $QR$ Decomposition
• A Toeplitz algorithm for polynomial \(J\)-spectral factorization
• Reliable numerical methods for polynomial matrix triangularization
• A robust solution of the generalized polynomial Bézout identity
• Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
• 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

Cited In (13)

• On computing root polynomials and minimal bases of matrix pencils
• On the computation of the null space of Toeplitz-like matrices
• 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
• Nearest Matrix Polynomials With a Specified Elementary Divisor
• 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

Uses Software

• MultRoot
• mctoolbox
• DESCRIPTOR SYSTEMS Toolbox

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)