Paper Info
Title
A Numerical Algorithm For Computing Quasi-Weierstrass Form Of Descriptor Systems
Abstract
In this paper a numerical algorithm for computing quasi-Weierstrass form of descriptor systems is presented. A conventional algorithm depends on QZ algorithm that needs iterative computation until convergence. Since the proposed algorithm avoids QZ algorithm, the computational time will not be influenced even with repeated eigenvalues or close eigenvalues whereas the conventional one will be. Furthermore, the proposed algorithm is numerically stable. Numerical examples are given to confirm the validity of the proposed algorithm.
Year
Venue
Field
2017
2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC)
Convergence (routing),MATLAB,Computer science,Matrix decomposition,Algorithm,Descriptor systems,Time complexity,Eigenvalues and eigenvectors,Computation
DocType
ISSN
Citations 
Conference
0743-1546
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Akitoshi Mutsuro100.34
Masanobu Koga2202.97