Numerically stable algorithm for transfer function matrix evaluation

DOI10.1080/00207178108922980zbMath0468.93029OpenAlexW2150796044WikidataQ126255119 ScholiaQ126255119MaRDI QIDQ3922553

Vasile Sima, Andras Varga

Publication date: 1981

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207178108922980

zbMATH Keywords

minimal realizationeigenvaluestransfer function matrixorthogonal similarity transformationslinear time-invariant systemHessenberg systempoles and zerosstate-space descriptionEispack package

Mathematics Subject Classification ID

Related Items (7)

Pole-zero representation of descriptor systems ⋮ Computation of transfer-function matrices of generalized state-space models ⋮ New preconditioned AOR iterative method for Z-matrices ⋮ Computation of transfer function matrices of linear multivariable systems ⋮ Computation of transfer function matrices of periodic systems ⋮ A twisted block tangential filtering decomposition preconditioner ⋮ An algorithm for obtaining the redundancy equations of LTI systems

Uses Software

• EISPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Properties and calculation of transmission zeros of linear multivariable systems
• Matrix eigensystem routines - EISPACK guide. 2nd ed
• Matrix eigensystem routines. EISPACK guide extension
• Further discussion on the calculation of transmission zeros
• Direct computation of canonical forms for linear systems by elementary matrix operations
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• An algorithm for obtaining the minimal realization of a linear time-invariant system and determining if a system is stabilizable-detectable
• A computational procedure for transfer-function evaluation
• Comparison of algorithms for calculation of g.c.d. of polynomials

This page was built for publication: Numerically stable algorithm for transfer function matrix evaluation