On recursive computation of coprime factorizations of rational matrices
From MaRDI portal
Abstract: General computational methods based on descriptor state-space realizations are proposed to compute coprime factorizations of rational matrices with minimum degree denominators. The new methods rely on recursive pole dislocation techniques, which allow to successively place all poles of the factors into a "good" region of the complex plane. The resulting McMillan degree of the denominator factor is equal to the number of poles lying in the complementary "bad" region and therefore is minimal. The developed pole dislocation techniques are instrumental for devising numerically reliable procedures for the computation of coprime factorizations with proper and stable factors of arbitrary improper rational matrices and coprime factorizations with inner denominators. Implementation aspects of the proposed algorithms are discussed and illustrative examples are given.
Recommendations
- Computation of coprime factorizations of rational matrices
- Coprime factorizations of multivariate rational matrices
- Computation of normalized coprime factorizations of rational matrices
- Minimal Degree Coprime Factorization of Rational Matrices
- A polynomial matrix method for computing stable rational doubly coprime factorizations
Cites work
- A generalized state-space for singular systems
- A Schur method for pole assignment
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects
- Computation of coprime factorizations of rational matrices
- Constructive solutions to spectral and inner-outer factorizations with respect to the disk
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 4070711 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 1445419 (Why is no real title available?)
- scientific article; zbMATH DE number 3274455 (Why is no real title available?)
- Minimal Degree Coprime Factorization of Rational Matrices
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Numerical solution of generalized Lyapunov equations
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- On stabilization methods of descriptor systems
- On the irreducible cascade synthesis of a system with a real rational transfer matrix
- Properties of the system matrix of a generalized state-space system†
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- Solving fault diagnosis problems. Linear synthesis techniques
- The computation of Kronecker's canonical form of a singular pencil
Cited in
(10)- Numerical computation of a coprime factorization of a transfer function matrix
- Computation of normalized coprime factorizations of rational matrices
- Computation of coprime factorizations of rational matrices
- A recursive algorithm for coprime fractions and Diophantine equations
- Remarks on computing coprime factors for distributed parameter systems
- On computing normalized-coprime factorizations of general rational matrices
- Minimal Degree Coprime Factorization of Rational Matrices
- Optimal factorizations of rational numbers using factorization trees
- A polynomial matrix method for computing stable rational doubly coprime factorizations
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
This page was built for publication: On recursive computation of coprime factorizations of rational matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029863)
