A recursive algorithm for coprime fractions and Diophantine equations

DOI10.1109/9.40774MaRDI QIDQ3468952zbMATH OpenOpenAlexFDO

Authors Feng Kuo, C. T. Chen

Publication date 1989

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.40774

zbMATH Keywords

coprime fractionsminimal design problemtime-invariant

Mathematics Subject Classification ID

Factorization of matrices (15A23) Factorization theory (including Wiener-Hopf and spectral factorizations) of linear operators (47A68) Synthesis problems (93B50) Linear systems in control theory (93C05) Multivariable systems, multidimensional control systems (93C35)

Recommendations

• An algorithm for coprime matrix fraction description using Sylvester matrices
• On recursive computation of coprime factorizations of rational matrices
• Coprime fraction computation of 2-D rational matrices
• Coprime factorizations of multivariate rational matrices
• Computation of coprime factorizations of rational matrices

Cited in

(2)

• A direct method for simulating partial recursive functions by Diophantine equations
• The design of linear controllers with symbolic algebra

This page was built for publication: A recursive algorithm for coprime fractions and Diophantine equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3468952)