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

Journal Article · Tue Dec 01 04:00:00 EST 1981 · SIAM J. Sci. Stat. Comput.; (United States)

DOI:https://doi.org/10.1137/0902034· OSTI ID:6367914

George, J A ^[1]; Heath, M T; Plemmons, R J

---

1. Univ., of Waterloo, Ontario

LVery 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. In this paper we describe a method for solving such problems on a typical (large) computer and provide the results of some experiments illustrating the effectiveness of our approach. The method includes an automatic partitioning scheme which is essential to the efficient management of the data on auxiliary files.

• DOE Contract Number: W-7405-ENG-26
• OSTI ID: 6367914
• Journal Information: SIAM J. Sci. Stat. Comput.; (United States), Journal Name: SIAM J. Sci. Stat. Comput.; (United States) Vol. 2:4; ISSN SIJCD
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
COMPUTER CALCULATIONS
DATA BASE MANAGEMENT
LEAST SQUARE FIT
MANAGEMENT
MAXIMUM-LIKELIHOOD FIT
MEMORY DEVICES
NUMERICAL SOLUTION