An alternative givens ordering |
| |
Authors: | J. J. Modi M. R. B. Clarke |
| |
Affiliation: | (1) Computing Laboratory, 19 Parks Road, OX1 3PL Oxford, UK;(2) Department of Computer Science and Statistics, Queen Mary College, Mile End Road, E1 4NS London, UK |
| |
Abstract: | 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. |
| |
Keywords: | AMS(MOS): 65F05 CR: 5.14 |
本文献已被 SpringerLink 等数据库收录! |
|