Efficient implementations of the SOLA mollifier method

¹ Department of Computer Science, University of Aarhus, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark
² UNI$\bullet$C, Danish Computing Center for Research and Education, Building 304, Technical University of Denmark, DK-2800 Lyngby, Denmark

Send offprint request to: R.M. Larsen

Received: 29 November 1995
Accepted: 20 June 1996

Abstract

We describe efficient implementations of the Subtractive Optimally Localized Averages (SOLA) mollifier method for solving linear inverse problems in, e.g., inverse helioseismology. We show that the SOLA method can be regarded as a constrained least squares problem, which can be solved by means of standard “building blocks” from numerical linear algebra. We compare the standard implementation of the SOLA algorithm with our new approaches based on bidiagonalization of the kernel matrix, which allow fast re-computation of the solution when the regularization parameter or the target function are changed. We also illustrate our methods with an example from helioseismology.