An improved Toeplitz algorithm for polynomial matrix null-space computation
type: Item
instance of: scholarly article
title: An improved Toeplitz algorithm for polynomial matrix null-space computation
zbMATH Open document ID: 1161.65035
author: J. C. Zúñiga Anaya
author: Didier Henrion
published in: Applied Mathematics and Computation
publication date: 2009-03-02T00:00:00Z
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 93B40
zbMATH DE Number: 5522211
zbMATH Keywords: polynomial matrices
zbMATH Keywords: computer-aided control system design
zbMATH Keywords: matrix algorithms
zbMATH Keywords: algorithm
zbMATH Keywords: minimal null-space basis
zbMATH Keywords: block Toeplitz structure
zbMATH Keywords: Sylvester matrix
zbMATH Keywords: algorithmic complexity
zbMATH Keywords: numerical stability
describes a project that uses: MultRoot
describes a project that uses: mctoolbox
describes a project that uses: DESCRIPTOR SYSTEMS Toolbox
MaRDI profile type: Publication
full work available at URL: j.amc.2008.10.037
OpenAlex ID: W2003256174
cites work: Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
cites work: Fast projection methods for minimal design problems in linear system theory
cites work: Decoupling and Pole Assignment in Linear Multivariable Systems: A Geometric Approach
cites work: The computation of Kronecker's canonical form of a singular pencil
cites work: Structural Invariants of Linear Multivariable Systems
cites work: Sur la Modification de la Structure à l’Infini par un Retour D’État Statique
cites work: Column reduction of polynomial matrices
cites work: Q3870741
cites work: Diophantine equations in control. -- A survey
cites work: Numerical computation of a coprime factorization of a transfer function matrix
cites work: A minimal polynomial basis solution to residual generation for fault diagnosis in linear systems
cites work: A Toeplitz algorithm for polynomial \(J\)-spectral factorization
cites work: The eigenstructure of an arbitrary polynomial matrix: Computational aspects
cites work: Q3254327
cites work: Reliable numerical methods for polynomial matrix triangularization
cites work: On the determination of the Smith-Macmillan form of a rational matrix from its Laurent expansion
cites work: A novel method to determine the finite and infinite frequency structure of a rational matrix
cites work: A robust solution of the generalized polynomial Bézout identity
cites work: Numerical computation of minimal polynomial bases: a generalized resultant approach
cites work: Q4864704
cites work: Polynomial and rational matrix interpolation: theory and control applications
cites work: Q3998313
cites work: Greatest common divisor via generalized Sylvester and Bezout matrices
cites work: Numerical operations with polynomial matrices
cites work: Q4265495
cites work: Q5689624
cites work: Q4220521
cites work: Q5753437
cites work: A Componentwise Perturbation Analysis of the $QR$ Decomposition
cites work: Structured Backward Error and Condition of Generalized Eigenvalue Problems
cites work: Polynomial Roots from Companion Matrix Eigenvalues
cites work: Computing multiple roots of inexact polynomials
cites work: Numerical Polynomial Algebra
cites work: Normwise Scaling of Second Order Polynomial Matrices
cites work: Numerical condition of polynomials in different forms
cites work: An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
DOI: 10.1016/J.AMC.2008.10.037
description: scientific article; zbMATH DE number 5522211