Cart (Loading....) | Create Account
Close category search window

Coprime fraction computation of 2-D rational matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yhean-Sen Lai ; AT&T Bell Laboratories, Allentown, PA, USA ; Chen, Chi-Tsong

This note presents a numerical method of computing a coprime fraction of a two-dimensional (2-D) rational matrix, not necessarily proper. It is achieved by searching the primary linearly dependent rows, in order from top to bottom, of the two generalized resultants. The procedure can be extended to the three- or higher dimensional case and the result can also be used to compute the greatest common divisor (GCD) of 2-D polynomial matrices without employing primitive factorizations which does not exist in the three- or higher dimensional case.

Published in:

Automatic Control, IEEE Transactions on  (Volume:32 ,  Issue: 4 )

Date of Publication:

Apr 1987

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.