Computation of Kronecker-like forms of a system pencil: applications, algorithms and software

Author

Varga, A.

Author_Institution

Inst. for Robotics & Syst. Dynamics, DLR-Oberpfaffenhofen, Wessling, Germany

fYear

1996

Firstpage

77

Lastpage

82

Abstract

Kronecker-like forms of a system pencil are useful in solving many computational problems encountered in the analysis and synthesis of linear systems. The reduction of system pencils to various Kronecker-like forms can be performed by structure preserving O(n³) complexity numerically stable algorithms. The presented algorithms form the basis of a modular collection of LAPACK compatible FORTRAN 77 subroutines to perform the reduction of a system pencil to several Kronecker-like forms

Keywords

computational complexity; control system analysis; control system synthesis; linear systems; matrix algebra; numerical stability; system theory; Kronecker-like forms; LAPACK-compatible FORTRAN 77 subroutines; computational problems; structure-preserving numerically stable algorithms; system pencil; Algorithm design and analysis; Application software; Eigenvalues and eigenfunctions; Linear systems; Poles and zeros; Riccati equations; Robots; Software algorithms; State-space methods; Vectors;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer-Aided Control System Design, 1996., Proceedings of the 1996 IEEE International Symposium on

Conference_Location

Dearborn, MI

Print_ISBN

0-7803-3032-3

Type

conf

DOI

10.1109/CACSD.1996.555201

Filename

555201