Avoiding communication in the Lanczos bidiagonalization routine and associated Least Squares QR solver
نویسنده
چکیده
Communication – the movement of data between levels of memory hierarchy or between processors over a network – is the most expensive operation in terms of both time and energy at all scales of computing. Achieving scalable performance in terms of time and energy thus requires a dramatic shift in the field of algorithmic design. Solvers for sparse linear algebra problems, ubiquitous throughout scientific codes, are often the bottlenecks in application performance due to a low computation/communication ratio. In this paper we develop three potential implementations of communication-avoiding Lanczos bidiagonalization algorithms and discuss their different computational requirements. Based on these new algorithms, we also show how to obtain a communication-avoiding LSQR least squares solver.
منابع مشابه
Lanczos bidiagonalization-based inverse solution methods applied to electrical imaging of the heart by using reduced lead-sets: A simulation study
In inverse problem of electrocardiography (ECG), electrical activity of the heart is estimated from body surface potential measurements. This electrical activity provides useful information about the state of the heart, thus it may help clinicians diagnose and treat heart diseases before they cause serious health problems. For practical application of the method, having fewer number of electrod...
متن کاملPartial least-squares vs. Lanczos bidiagonalization - I: analysis of a projection method for multiple regression
متن کامل
Tikhonov Regularization with a Solution Constraint
Many numerical methods for the solution of linear ill-posed problems apply Tikhonov regularization. This paper presents a modification of a numerical method proposed by Golub and von Matt for quadratically constrained least-squares problems and applies it to Tikhonov regularization of large-scale linear discrete ill-posed problems. The method is based on partial Lanczos bidiagonalization and Ga...
متن کاملIterative total least squares filter in robot navigation
In the robot navigation problem, noisy sensor data must be ltered to obtain the best estimate of the robot position. The discrete Kalman lter, which usually is used for prediction and detection of signal in communication and control problems has become a commonly used method to reduce the e ect of uncertainty from the sensor data. However, due to the special domain of robot navigation, the Kalm...
متن کاملHarmonic and refined extraction methods for the singular value problem, with applications in least squares problems
For the accurate approximation of the minimal singular triple (singular value and left and right singular vector), we may use two separate search spaces, one for the left, and one for the right singular vector. In Lanczos bidiagonalization, for example, such search spaces are constructed. In [3], the author proposes a Jacobi–Davidson type method for the singular value problem, where solutions t...
متن کامل