ISSN:
0945-3245
Keywords:
AMS(MOS): 65F05
;
CR: 5.14
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Summary A new Givens ordering is shown, empirically and by an approximate theoretical analysis, to take appreciably fewer stages than the standard scheme. Sharper error bounds than Gentleman's ensue, and the scheme is better suited to parallel computation. Other schemes, less efficient but more easily analysed, are discussed. The effect of a possible limit in practice on the number of simultaneous computations is considered.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01389639
Permalink