Efficient Algorithms for the Block Hessenberg Form

  • Authors:
  • Enrique S. Quintana-Ortí;Gregorio Quintana-Ortí;Maribel Castillo;Vicente Hernández

  • Affiliations:
  • Univ. Jaime I, Dept. de Informática 12080–Castellón, Spain quintana@icc.uji.es;Univ. Jaime I, Dept. de Informática 12080–Castellón, Spain gquintan@icc.uji.es;Univ. Jaime I, Dept. de Informática 12080–Castellón, Spain castillo@icc.uji.es;Univ. Politécnica de Valencia Dept. de Sistemas Informáticos y Computación 46071–Valencia, Spain vhernand@dsic.upv.es

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate in this paper the performance of parallel algorithms for computing the controllable part of a control linear system, with application to the computation of minimal realizations. Our approach is based on a method that transforms the matrices of the system to block Hessenberg form by using rank-revealing orthogonal factorizations.The experimental analysis on a high performance architecture includes two rank-revealing numerical tools: the SVD and the rank-revealing QR factorizations. Results are also reported, using the rank-revealing QR factorizations, on a parallel distributed architecture.