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

by   Haibo Li, et al.

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.



There are no comments yet.


page 27


Tensor Arnoldi-Tikhonov and GMRES-type methods for ill-posed problems with a t-product structure

This paper describes solution methods for linear discrete ill-posed prob...

Solving large linear least squares with linear equality constraints

We consider the problem of efficiently solving large-scale linear least ...

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

A trained-based Born iterative method (TBIM) is developed for electromag...

Relaxed regularization for linear inverse problems

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

Quantum-inspired algorithm for truncated total least squares solution

Total least squares (TLS) methods have been widely used in data fitting....

An Inner-Outer Iterative Method for Edge Preservation in Image Restoration and Reconstruction

We present a new inner-outer iterative algorithm for edge enhancement in...

A comparison of eigenvalue-based algorithms and the generalized Lanczos trust-region algorithm for Solving the trust-region subproblem

Solving the trust-region subproblem (TRS) plays a key role in numerical ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.