A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems

DOI10.1080/17415977.2014.880905zbMath1336.65064OpenAlexW2331130384MaRDI QIDQ2938547

Chein-Shan Liu

Publication date: 14 January 2015

Published in: Inverse Problems in Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17415977.2014.880905

zbMATH Keywords

convergencenumerical examplesinverse Cauchy problemlinear inverse problemsheat source identificationbackward heat conductionbest descent directioninvariant-manifoldill-posed linear systemdouble optimal descent algorithmexternal force identificationoptimal iterative algorithmoptimization in Krylov subspace methods

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Heat equation (35K05) Ill-posed problems for PDEs (35R25) Inverse problems for PDEs (35R30) Iterative numerical methods for linear systems (65F10) Numerical methods for inverse problems for initial value and initial-boundary value problems involving PDEs (65M32) Numerical methods for ill-posed problems for initial value and initial-boundary value problems involving PDEs (65M30)

Related Items (2)

An algorithm with \(m\)-step residual history for solving linear equations: data interpolation by a multi-shape-factors RBF ⋮ A double optimal iterative algorithm in an affine Krylov subspace for solving nonlinear algebraic equations

Cites Work

• Unnamed Item
• Unnamed Item
• GMRES implementations and residual smoothing techniques for solving ill-posed linear systems
• Optimally scaled vector regularization method to solve ill-posed linear problems
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems
• QMR: A quasi-minimal residual method for non-Hermitian linear systems
• GMRES-type methods for inconsistent systems
• Iterative solution of linear systems in the 20th century
• A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
• FGMRES for linear discrete ill-posed problems
• A globally optimal tri-vector method to solve an ill-posed linear system
• A doubly optimized solution of linear equations system expressed in an affine Krylov subspace
• Differential equations and solution of linear systems
• Fast realization algorithms for determining regularization parameters in linear inverse problems
• An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
• Recent computational developments in Krylov subspace methods for linear systems
• Matrix Analysis
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Two-Point Step Size Gradient Methods
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Solution of Sparse Indefinite Systems of Linear Equations
• Iterative choices of regularization parameters in linear inverse problems
• An improved model function method for choosing regularization parameters in linear inverse problems
• Inexact Krylov Subspace Methods for Linear Systems
• A DISCREPANCY PRINCIPLE FOR THE SOURCE POINTS LOCATION IN USING THE MFS FOR SOLVING THE BHCP
• Regularization of ill-posed problems in Banach spaces: convergence rates
• Methods of conjugate gradients for solving linear systems

This page was built for publication: A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems