Parallel inverse iteration with reorthogonalization
Conference
·
OSTI ID:54435
- Pacific Northwest Lab., Richland, WA (United States)
The authors present algorithms which apply dynamically scaled fast plane rotations to the QR decomposition for stiff least squares problems. When an equality constrained linear least square problem is solved via extreme weighting of the constraint equations, a very stiff matrix is generated. Numerical test results show that the accuracy of our algorithm compares favorably with that of the Givens rotation based algorithm while the Householder method may produce very sensitive results. Moreover, both fast and standard Givens rotation based algorithms produce very accurate results regardless of row sorting and even with extremely large weights.
- DOE Contract Number:
- AC06-76RL01830
- OSTI ID:
- 54435
- Report Number(s):
- DOE/ER/25151--1-Vol.1; CONF-930331--Vol.1
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast QR decomposition for weighted least squares problems
Weighted linear least squares problem: an interval analysis approach to rank determination
A fast new algorithm for a robot neurocontroller using inverse QR decomposition
Conference
·
Thu Dec 30 23:00:00 EST 1993
·
OSTI ID:54433
Weighted linear least squares problem: an interval analysis approach to rank determination
Technical Report
·
Fri Aug 01 00:00:00 EDT 1980
·
OSTI ID:5047753
A fast new algorithm for a robot neurocontroller using inverse QR decomposition
Journal Article
·
Fri Dec 31 23:00:00 EST 1999
· International Journal of Robotics Research
·
OSTI ID:20005689