Skip to main navigation Skip to search Skip to main content

Iterative Runge-Kutta-Type Methods with Convex Penalty for Inverse Problems in Hilbert Spaces

  • Shanshan Tong
  • , Wei Wang*
  • , Zhenwu Fu
  • , Bo Han
  • *Corresponding author for this work
  • Shaanxi Normal University
  • Jiaxing University
  • School of Mathematics, Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

An s-stage Runge-Kutta-type iterative method with the convex penalty for solving nonlinear ill-posed problems is proposed and analyzed in this paper. The approach is developed by using a family of Runge-Kutta-type methods to solve the asymptotical regularization method, which can be seen as an ODE with the initial value. The convergence and regularity of the proposed method are obtained under certain conditions. The reconstruction results of the proposed method for some special cases are studied through numerical experiments on both parameter identification in inverse potential problem and diffuse optical tomography. The numerical results indicate that the developed methods yield stable approximations to true solutions, especially the implicit schemes have obvious advantages on allowing a wider range of step length, reducing the iterative numbers, and saving computation time.

Original languageEnglish
Pages (from-to)225-255
Number of pages31
JournalCSIAM Transactions on Applied Mathematics
Volume4
Issue number2
DOIs
StatePublished - 2023
Externally publishedYes

Keywords

  • Nonlinear ill-posed problem
  • convex penalty
  • diffuse optical tomography
  • iterative regularization method

Fingerprint

Dive into the research topics of 'Iterative Runge-Kutta-Type Methods with Convex Penalty for Inverse Problems in Hilbert Spaces'. Together they form a unique fingerprint.

Cite this