Numerical computation of a coprime factorization of a transfer function matrix
From MaRDI portal
Publication:1094368
DOI10.1016/0167-6911(87)90052-1zbMath0629.93027OpenAlexW2109184371MaRDI QIDQ1094368
Publication date: 1987
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(87)90052-1
algorithmcoprime factorizationmatrix pencilgeneralized Schur formminimal polynomial basisrational transfer function matrix
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
Robust fault detection in descriptor linear systems via generalized unknown input observers ⋮ Minimal bases of matrix pencils: Algebraic Toeplitz structure and geometric properties ⋮ Parametric control systems design with applications in missile control ⋮ A new method for computing a column reduced polynomial matrix ⋮ Unified parametric approaches for high-order integral observer design for matrix second-order linear systems ⋮ Column reduction of polynomial matrices; some remarks on the algorithm of Wolovich ⋮ Fiedler companion linearizations for rectangular matrix polynomials ⋮ A polynomial matrix method for computing stable rational doubly coprime factorizations ⋮ A parametric poles assignment algorithm for second-order linear periodic systems ⋮ Two parametric approaches for eigenstructure assignment in second-order linear systems ⋮ Numerical computation of minimal polynomial bases: a generalized resultant approach ⋮ Solutions to generalized Sylvester matrix equation by Schur decomposition ⋮ A new solution to the generalized Sylvester matrix equation \(AV-EVF=BW\) ⋮ On minimal bases and indices of rational matrices and their linearizations ⋮ An improved Toeplitz algorithm for polynomial matrix null-space computation ⋮ Column reduction of polynomial matrices ⋮ Computing normal external descriptions and feedback design ⋮ Eigenstructure assignment design for proportional-integral observers: the discrete-time case ⋮ An explicit solution to right factorization with application in eigenstructure assignment ⋮ Sampling method for semidefinite programmes with non-negative Popov function constraints
Cites Work
- Unnamed Item
- The computation of Kronecker's canonical form of a singular pencil
- Fast projection methods for minimal design problems in linear system theory
- 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
- Design of multivariable feedback systems with stable plant
This page was built for publication: Numerical computation of a coprime factorization of a transfer function matrix