Efficient algorithms for the block Hessenberg form

DOI10.1023/A:1011192320367MaRDI QIDQ5946366zbMATH OpenOpenAlexFDO

Authors Enrique S. Quintana-Ortí, Gregorio Quintana-Ortí, Maribel Castillo, V. Hernández

Publication date 14 December 2003

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1011192320367

zbMATH Keywords

block Hessenberg formcontrollabilitylinear control systemsminimal realizationsparallel computationuniprocessor architecture

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Controllability (93B05) Minimal systems representations (93B20) Linear systems in control theory (93C05)

Review text

The paper describes efficient algorithms for the block Hessenberg form for the purpose of solving linear control systems problems such as controllability or minimal realizations. Algorithms are implemented in the uniprocessor architecture and in parallel as well.

Recommendations

• Efficient generalized Hessenberg form and applications
• scientific article; zbMATH DE number 3978914
• Efficient algorithm for simultaneous reduction to the \(m\)-Hessenberg-triangular-triangular form
• Blocked algorithms for the reduction to Hessenberg-triangular form revisited
• Hessenberg and Hessenberg/triangular forms in linear system thcory†

Cited in

(4)

• Efficient generalized Hessenberg form and applications
• Block algorithms for reordering standard and generalized Schur forms
• scientific article; zbMATH DE number 3978914 (Why is no real title available?)
• scientific article; zbMATH DE number 1066966 (Why is no real title available?)

This page was built for publication: Efficient algorithms for the block Hessenberg form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946366)