文摘
This paper proposes an efficient algorithm for simultaneous reduction of three matrices by using orthogonal transformations, where \(A\) is reduced to \(m\)-Hessenberg form, and \(B\) and \(E\) to triangular form. The algorithm is a blocked version of the algorithm described by Miminis and Paige (Int J Control 35:341-54, 1982). The \(m\)-Hessenberg-triangular–triangular form of matrices \(A\), \(B\) and \(E\) is specially suitable for solving multiple shifted systems \((\sigma E-A)X=B\). Such shifted systems naturally occur in control theory when evaluating the transfer function of a descriptor system, or in interpolatory model reduction methods. They also arise as a result of discretizing the time-harmonic wave equation in heterogeneous media, or originate from structural dynamics engineering problems. The proposed blocked algorithm for the \(m\)-Hessenberg-triangular-triangular reduction is based on aggregated Givens rotations, and is a generalization of the blocked algorithm for the Hessenberg-triangular reduction proposed by K?gstr?m et al. (BIT 48:563-84, 2008). Numerical tests confirm that the blocked algorithm is much faster than its non-blocked version based on regular Givens rotations only. As an illustration of its efficiency, two applications of the \(m\)-Hessenberg-triangular-triangular reduction from control theory are described: evaluation of the transfer function of a descriptor system at many complex values, and computation of the staircase form used to identify the controllable part of the system. Keywords \(m\)-Hessenberg-triangular-triangular form Orthogonal transformations Level 3 BLAS Blocked algorithm Solving shifted system Transfer function evaluation Staircase form