Numerical computation of a coprime factorization of a transfer function matrix
The problem of computing a (right) coprime factorization \(N_ r(\lambda)D_ r^{-1}(\lambda)\) of a given rational transfer function matrix \(H(\lambda)=D_ L^{-1}(\lambda)N_ L(\lambda)\) has a well- known algebraic but not an efficient numerical solution. The authors reformulate this problem as a problem of constructing a minimal polynomial basis of the right nullspace of a matrix pencil \(\lambda\) B-A associated to the polynomial matrix \(P(\lambda)=[N_ L(\lambda),D_ L(\lambda)]\). This latter problem is solved by transformating \(\lambda\) B-A to a generalized Schur form of a pencil by numerically backward stable algorithms as analyzed in the first author's Ph.D. thesis. The complete algorithm is presented and illustrated by two numerical examples of coprime factorizations chosen from the literature.
- Computation of coprime factorizations of rational matrices
- A polynomial matrix method for computing stable rational doubly coprime factorizations
- Computation of normalized coprime factorizations of rational matrices
- On recursive computation of coprime factorizations of rational matrices
- On computing normalized-coprime factorizations of general rational matrices
- Design of multivariable feedback systems with stable plant
- Fast projection methods for minimal design problems in linear system theory
- scientific article; zbMATH DE number 4016040 (Why is no real title available?)
- Linear multivariable systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Properties of the system matrix of a generalized state-space system†
- Synthesis of linear multivariable regulators
- The computation of Kronecker's canonical form of a singular pencil
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- A new method for computing a column reduced polynomial matrix
- Column reduction of polynomial matrices
- Computing normal external descriptions and feedback design
- Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties
- An algorithm for coprime matrix fraction description using Sylvester matrices
- Computation of coprime factorizations of rational matrices
- Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich
- On minimal bases and indices of rational matrices and their linearizations
- Numerical computation of minimal polynomial bases: a generalized resultant approach
- A new solution to the generalized Sylvester matrix equation \(AV-EVF=BW\)
- Unified parametric approaches for high-order integral observer design for matrix second-order linear systems
- An explicit solution to polynomial matrix right coprime factorization with application in eigenstructure assignment
- Minimal bases of matrix pencils and coprime matrix fraction descriptions
- Structure, Smith-MacMillan form and coprime MFDs of a rational matrix inside a region P =ω∪{∞}
- An explicit solution to right factorization with application in eigenstructure assignment
- A connection between normalized coprime factorizations and linear quadratic regulator theory
- Remarks on computing coprime factors for distributed parameter systems
- Coprime matrix fraction description via orthogonal structure theorem
- Fiedler companion linearizations for rectangular matrix polynomials
- scientific article; zbMATH DE number 492897 (Why is no real title available?)
- Eigenstructure assignment design for proportional-integral observers: the discrete-time case
- Robust fault detection in descriptor linear systems via generalized unknown input observers
- scientific article; zbMATH DE number 775611 (Why is no real title available?)
- Two parametric approaches for eigenstructure assignment in second-order linear systems
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- Solutions to generalized Sylvester matrix equation by Schur decomposition
- scientific article; zbMATH DE number 4187997 (Why is no real title available?)
- Fully actuated system approach for high-order linear systems with high-order input derivatives
- A frequency-independent and parallel algorithm for computing the zeros of strictly proper rational transfer functions
- A parametric poles assignment algorithm for second-order linear periodic systems
- Minimal rank factorizations of polynomial matrices
- Parametric control systems design with applications in missile control
- A polynomial matrix method for computing stable rational doubly coprime factorizations
This page was built for publication: Numerical computation of a coprime factorization of a transfer function matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094368)