On inner iterations of the joint bidiagonalization based algorithms for solving large scale linear discrete ill-posed problems

08/11/2020
by   Haibo Li, et al.
0

The joint bidiagonalization process of a large matrix pair A,L can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization min_x{Ax-b_2^2+λ^2Lx_2^2} or the essentially equivalent one minLx_2 s.t. x∈𝒮 = {x|Ax-b_2≤ηe_2}, where e is a Gaussian white noise, L is a regularization matrix and η>1 slightly. A bottleneck of the algorithms is that a large scale inner least squares problem with (A^T, L^T)^T as the coefficient matrix must be solved at each outer iteration, which may be costly, especially when the solution accuracy of these problems is high. We investigate the solution accuracy requirement on the inner least squares problems and give a reliable stopping tolerance of the LSQR for iteratively solving the inner least squares problems. The results show that the solution accuracy of the inner least squares problems can be relaxed considerably while it will not reduce the accuracy of regularized solutions, thus the overall efficiency of the algorithms can be improved substantially. We also discuss some details for implementing the joint bidiagonalization based regularization algorithms efficiently and stably. Numerical experiments are made to illustrate our results and show some numerical performance of the algorithms.

READ FULL TEXT
research
01/10/2023

First-projection-then-regularization hybrid algorithms for large-scale general-form regularization

The paper presents first-projection-then-regularization hybrid algorithm...
research
08/09/2022

Towards Practical Large-scale Randomized Iterative Least Squares Solvers through Uncertainty Quantification

As the scale of problems and data used for experimental design, signal p...
research
06/26/2020

Relaxed regularization for linear inverse problems

We consider regularized least-squares problems of the form min_x1/2‖ Ax ...
research
06/24/2021

Solving large linear least squares with linear equality constraints

We consider the problem of efficiently solving large-scale linear least ...
research
12/26/2021

A Trained Regularization Approach Based on Born Iterative Method for Electromagnetic Imaging

A trained-based Born iterative method (TBIM) is developed for electromag...
research
02/27/2023

Residual QPAS subspace (ResQPASS) algorithm for bounded-variable least squares (BVLS) with superlinear Krylov convergence

This paper presents the Residual QPAS Subspace method (ResQPASS) method ...
research
05/16/2021

Regularization by inexact Krylov methods with applications to blind deblurring

This paper is concerned with the regularization of large-scale discrete ...

Please sign up or login with your details

Forgot password? Click here to reset