Computation of coprime factorizations of rational matrices
This paper deals with the coprime decompositions of rational matrices. Numerically reliable state-space algorithms are proposed. These new algorithms are based on a recursive pole dislocation technique which can be seen as refinement of the general recursive pole dislocation approach described by \textit{P. Van Dooren} [ibid. 137/138, 663-697 (1990; Zbl 0709.15011)]. These new procedures are generally applicable whether the original descriptor state-space representation is minimal or not, and whether it is stabilizable/detectable or not. They are well suited for robust software implementations.
- On recursive computation of coprime factorizations of rational matrices
- Computation of normalized coprime factorizations of rational matrices
- Numerical computation of a coprime factorization of a transfer function matrix
- On computing normalized-coprime factorizations of general rational matrices
- Coprime factorizations of multivariate rational matrices
- A Generalized Eigenvalue Approach for Solving Riccati Equations
- A generalized state-space for singular systems
- A Schur method for pole assignment
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Computation of normalized coprime factorizations of rational matrices
- Computation of structural invariants of generalized state-space systems
- Computation ofJ-inner-outer factorizations of rational matrices
- Conjugation, interpolation and model-matching in H∞
- Controller reduction via stable factorization and balancing
- Doubly coprime fractional representations of generalized dynamical systems
- scientific article; zbMATH DE number 4179235 (Why is no real title available?)
- scientific article; zbMATH DE number 3858946 (Why is no real title available?)
- scientific article; zbMATH DE number 492897 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3274455 (Why is no real title available?)
- scientific article; zbMATH DE number 3390604 (Why is no real title available?)
- Loop transfer recovery for nonminimum phase plants
- On discrete-time H/sup infinity / control: a J-lossless coprime factorization approach
- On stabilization methods of descriptor systems
- On the irreducible cascade synthesis of a system with a real rational transfer matrix
- Rang revealing QR factorizations
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- Regularization of Descriptor Systems by Derivative and Proportional State Feedback
- The computation of Kronecker's canonical form of a singular pencil
- Numerical computation of a coprime factorization of a transfer function matrix
- Computation of normalized coprime factorizations of rational matrices
- Coprime factorizations of multivariate rational matrices
- On recursive computation of coprime factorizations of rational matrices
- Fraction-free computation of matrix rational interpolants and matrix GCDs
- Minimal bases of matrix pencils and coprime matrix fraction descriptions
- A recursive algorithm for coprime fractions and Diophantine equations
- scientific article; zbMATH DE number 23254 (Why is no real title available?)
- Periodic coprime matrix fraction decompositions
- On computing normalized-coprime factorizations of general rational matrices
- Coprime fraction computation of 2-D rational matrices
- H2 OPTIMAL MODEL REDUCTION OF COUPLED SYSTEMS ON THE GRASSMANN MANIFOLD
- Optimal factorizations of rational numbers using factorization trees
- Stability analysis and model order reduction of coupled systems
- A polynomial matrix method for computing stable rational doubly coprime factorizations
- Rational and polynomial matrix factorizations via recursive pole-zero cancellation
- Pseudoprime factorizations of integer matrices
This page was built for publication: 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 Q1379084)
