GKB-FP: An algorithm for large-scale discrete ill-posed problems
type: Item
instance of: scholarly article
title: GKB-FP: An algorithm for large-scale discrete ill-posed problems
zbMATH Open document ID: 1207.65039
author: Leonardo Borges
author: Fermín S. V. Bazán
published in: BIT
publication date: 2010-10-13T00:00:00Z
review text: The authors present a new algorithm for discrete ill-posed problems, which is called GKB-FP. This method exploits the Golub-Kahan bidiagonalization algorithm together with Tikhonov regularization in the generated Krylov subspace. The regularization parameter for the projected problem is chosen by the fixed-point method already presented by the first author. A detailed convergence analysis is provided. The paper is enriched by many numerical results on well-known problems so that the effectiveness of the method appears comparable with other methods already used, and even better.
Mathematics Subject Classification ID: 65F20
zbMATH DE Number: 5799393
zbMATH Keywords: Tikhonov regularization
zbMATH Keywords: large-scale problems
zbMATH Keywords: discrete ill-posed problems
zbMATH Keywords: Golub-Kahan bidiagonalization
zbMATH Keywords: Krylov subspace
zbMATH Keywords: fixed-point method
zbMATH Keywords: convergence
zbMATH Keywords: numerical results
reviewed by: Raffaella Pavani
describes a project that uses: CRAIG
describes a project that uses: LSQR
describes a project that uses: Regularization tools
describes a project that uses: RestoreTools
MaRDI profile type: Publication
full work available at URL: s10543-010-0275-3
OpenAlex ID: W2106084033
cites work: Fixed-point iterations in determining the Tikhonov regularization parameter
cites work: An improved fixed-point algorithm for determining a Tikhonov regularization parameter
cites work: Efficient determination of multiple regularization parameters in a generalized L-curve framework
cites work: A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
cites work: An implicit shift bidiagonalization algorithm for ill-posed systems
cites work: Estimation of the \(L\)-curve via Lanczos bidiagonalization
cites work: Tikhonov regularization of large linear problems
cites work: L-curve and curvature bounds for Tikhonov regularization
cites work: On the regularizing properties of the GMRES method
cites work: A weighted-GCV method for Lanczos-hybrid regularization
cites work: Algorithms for the regularization of ill-conditioned least squares problems
cites work: Q4895893
cites work: Fast CG-Based Methods for Tikhonov--Phillips Regularization
cites work: Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
cites work: Calculating the Singular Values and Pseudo-Inverse of a Matrix
cites work: Q4251275
cites work: On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data
cites work: Use of extrapolation in regularization methods
cites work: Regularization methods for large-scale problems
cites work: The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
cites work: Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
cites work: The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
cites work: An Analysis of the Zero-Crossing Method for Choosing Regularization Parameters
cites work: Regularization Parameter Selection in Discrete Ill-Posed Problems — The Use of the U-Curve
cites work: A Projection‐Based Approach to General‐Form Tikhonov Regularization
cites work: Choosing regularization parameters in iterative methods for ill-posed problems
cites work: Iterative Regularization and MINRES
cites work: Iterative methods for ill-posed problems and semiconvergent sequences
cites work: Iterative methods for image deblurring: A Matlab object-oriented approach
cites work: A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
cites work: LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
cites work: A Regularization Parameter in Discrete Ill-Posed Problems
cites work: Residual periodograms for choosing regularization parameters for ill-posed problems
cites work: Q5515676
cites work: Determining the regularization parameters for super-resolution problems
DOI: 10.1007/S10543-010-0275-3
description: scientific article; zbMATH DE number 5799393