On recursive computation of coprime factorizations of rational matrices
From MaRDI portal
Publication:2029863
DOI10.1016/J.LAA.2020.01.030zbMATH Open1472.15021arXiv1703.07307OpenAlexW2605345276WikidataQ114152274 ScholiaQ114152274MaRDI QIDQ2029863FDOQ2029863
Authors: Andreas Varga 
Publication date: 4 June 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1703.07307
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
- Title not available (Why is that?)
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Title not available (Why is that?)
- Title not available (Why is that?)
- The computation of Kronecker's canonical form of a singular pencil
- Title not available (Why is that?)
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- Properties of the system matrix of a generalized state-space system†
- Minimal Degree Coprime Factorization of Rational Matrices
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- A generalized state-space for singular systems
- Numerical solution of generalized Lyapunov equations
- A Schur method for pole assignment
- On stabilization methods of descriptor systems
- An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- Title not available (Why is that?)
- Solving fault diagnosis problems. Linear synthesis techniques
- Constructive solutions to spectral and inner-outer factorizations with respect to the disk
- On the irreducible cascade synthesis of a system with a real rational transfer matrix
- Computation of coprime factorizations of rational matrices
Cited In (7)
- Remarks on computing coprime factors for distributed parameter systems
- A recursive algorithm for coprime fractions and Diophantine equations
- Numerical computation of a coprime factorization of a transfer function matrix
- On computing normalized-coprime factorizations of general rational matrices
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- Optimal factorizations of rational numbers using factorization trees
- A polynomial matrix method for computing stable rational doubly coprime factorizations
Uses Software
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)
