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

Matrix Sign Function Methods for Solving Projected Generalized Continuous-Time Sylvester Equations

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

3 Author(s)
Yiqin Lin ; Dept. of Math. & Comput. Sci., Hunan Univ. of Sci. & Eng., Yongzhou, China ; Liang Bao ; Yimin Wei

In this technical note, we investigate the numerical solution of the projected generalized Sylvester equations via a matrix sign function method. Such equations arise in stability analysis and control problems for descriptor systems including model reduction based on balanced truncation. Unlike the classical matrix sign function iteration, we propose a modification of the matrix sign function method that converges quadratically for pencils of arbitrary index. Numerical experiments report the effectiveness of the modified method.

Published in:

Automatic Control, IEEE Transactions on  (Volume:55 ,  Issue: 11 )

Date of Publication:

Nov. 2010

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.