Solution of large-scale sparse least squares problems using auxiliary storage

Technical Report · Fri Aug 01 00:00:00 EDT 1980

DOI:https://doi.org/10.2172/5171529· OSTI ID:5171529

George, A.; Heath, M. T.; Plemmons, R. J.

Very large sparse linear least-squares problems arise in a variety of applications, such as geodetic network adjustments, photogrammetry, earthquake studies, and certain types of finite element analysis. Many of these problems are so large that it is impossible to solve them without using auxiliary storage devices. Some problems are so massive that the storage needed for their solution exceeds the virtual address space of the largest machines. A method for solving such problems on a typical (large) computer is described, and the results of some experiments illustrating the effectiveness of this approach are provided. The method includes an automatic partitioning scheme that is essential to the efficient management of the data on auxiliary files. 8 figures, 2 tables

• Research Organization: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
• DOE Contract Number: W-7405-ENG-26
• OSTI ID: 5171529
• Report Number(s): ORNL/CSD-63
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
FINITE ELEMENT METHOD
COMPUTER CALCULATIONS
GEODESY
DATA PROCESSING
LEAST SQUARE FIT
ALGORITHMS
EARTHQUAKES
MATRICES
MATHEMATICAL LOGIC
MAXIMUM-LIKELIHOOD FIT
NUMERICAL SOLUTION
PROCESSING
SEISMIC EVENTS
990200* - Mathematics & Computers