|
DRUM >
College of Computer, Mathematical & Natural Sciences >
Computer Science >
Technical Reports from UMIACS >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1903/642
|
| Title: | Implementing an Algorithm for Solving Block Hessenberg Systems |
| Authors: | Stewart, G. W. |
| Type: | Technical Report |
| Issue Date: | 15-Oct-1998 |
| Series/Report no.: | UM Computer Science Department; CS-TR-3295
UMIACS; UMIACS-TR-94-70 |
| Abstract: | This paper describes the implementation of a recursive descent method
for solving block Hessenberg systems. Although the algorithm is
conceptually simple, its implementation in C (a natural choice of
language given the recursive nature of the algorithm and its data) is
nontrivial. Particularly important is the balance between ease of
use, computational efficiency, and flexibility.
(Also cross-referenced as UMIACS-TR-94-70) |
| URI: | http://hdl.handle.net/1903/642 |
| Appears in Collections: | Technical Reports of the Computer Science Department
Technical Reports from UMIACS
|
All items in DRUM are protected by copyright, with all rights reserved.
|
