The Shifted Hessenberg System Solve Computation
Greg Henry · 1994
We present methods for improving data reuse in solving sequences of linear systems that are Hessenberg matrices shifted by a sequence of scalars times the identity or a triangular matrix. The methods take into consideration the robust handling of overflow and include new condition estimation strategies. We provide timings on both scalar and vector machines to demonstrate both the diversity and importance of these ideas. We also