Numerical algorithms to solve inverse problems for parabolic equations

This paper presents and analyzes robust numerical algorithms for solving inverse problems for parabolic equations, specifically focusing on the determination of an unknown time-dependent source function from an integral flux condition. The study is motivated by mathematical models based on Navier-Stokes equations, particularly those exhibiting Poiseuille-type solutions. We employ a variational approach, formulating the inverse problem as the minimization of a Tikhonov regularization cost functional. Discrete approximation schemes are rigorously derived using finite volume methods in space and both backward Euler and Crank-Nicolson schemes in time. A key contribution of this work is the strict justification of the gradient formula for the cost functional by deriving the adjoint problem directly from the fully discrete scheme, rather than discretizing the continuous adjoint problem. This methodology is extended to problems involving fractional powers of elliptic operators and two-dimensional domains. Numerical experiments are conducted to compare the efficiency of Gradient Descent and Conjugate Gradient methods. The results demonstrate that the Conjugate Gradient method significantly outperforms standard gradient descent, maintaining high accuracy and convergence rates even with the inclusion of regularization terms and complex diffusion operators.

Authors

Institutions

Publication Details

Journal
Mathematical Modelling and Analysis
Published
2026-02-12
DOI
https://doi.org/10.3846/mma.2026.25585
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Numerical algorithms to solve inverse problems for parabolic equations

Raimondas Čiegis, Olga Suboč, Vadimas Starikovičius
Mathematical Modelling and Analysis
Numerical methods in inverse problems
article

Numerical algorithms to solve inverse problems for parabolic equations

Raimondas Čiegis, Olga Suboč, Vadimas Starikovičius
article en

Abstract

This paper presents and analyzes robust numerical algorithms for solving inverse problems for parabolic equations, specifically focusing on the determination of an unknown time-dependent source function from an integral flux condition. The study is motivated by mathematical models based on Navier-Stokes equations, particularly those exhibiting Poiseuille-type solutions. We employ a variational approach, formulating the inverse problem as the minimization of a Tikhonov regularization cost functional. Discrete approximation schemes are rigorously derived using finite volume methods in space and both backward Euler and Crank-Nicolson schemes in time. A key contribution of this work is the strict justification of the gradient formula for the cost functional by deriving the adjoint problem directly from the fully discrete scheme, rather than discretizing the continuous adjoint problem. This methodology is extended to problems involving fractional powers of elliptic operators and two-dimensional domains. Numerical experiments are conducted to compare the efficiency of Gradient Descent and Conjugate Gradient methods. The results demonstrate that the Conjugate Gradient method significantly outperforms standard gradient descent, maintaining high accuracy and convergence rates even with the inclusion of regularization terms and complex diffusion operators.

Mathematical Modelling and AnalysisVol. 31(2)
Vilnius Gediminas Technical University (LT)
Lietuvos Mokslo Taryba
Reduced inequalities
Openalex Percentile: Top 53%
Numerical methods in inverse problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.