A least squares space-time approach for parabolic equations

Abstract We propose a least squares formulation for abstract parabolic equations in the natural $$L^2(0,T;V^\star )\times H$$ L 2 ( 0 , T ; V ⋆ ) × H norm which only relies on natural regularity assumptions on the data of the problem. The resulting bilinear form then is symmetric, coercive, and continuous and contains the $$V^\star $$ V ⋆ -norm. We propose a solution approach that uses a conforming Galerkin discretization of an equivalent saddle point problem to circumvent the evaluation of $$V^\star $$ V ⋆ -norms. We prove strong convergence of discrete solutions towards continuous solutions and provide a preconditioner for efficient numerical solution of the discrete saddle point problem. We illustrate our analytical findings by selected numerical experiments.

Authors

Institutions

Publication Details

Journal
Advances in Computational Mathematics
Published
2026-08-20
DOI
https://doi.org/10.1007/s10444-026-10345-0
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

A least squares space-time approach for parabolic equations

Christian Kahle, Michael Hinze
Advances in Computational Mathematics
Advanced Numerical Methods in Computational Mathematics
article

A least squares space-time approach for parabolic equations

Christian Kahle, Michael Hinze
article en

Abstract

Abstract We propose a least squares formulation for abstract parabolic equations in the natural $$L^2(0,T;V^\star )\times H$$ L 2 ( 0 , T ; V ⋆ ) × H norm which only relies on natural regularity assumptions on the data of the problem. The resulting bilinear form then is symmetric, coercive, and continuous and contains the $$V^\star $$ V ⋆ -norm. We propose a solution approach that uses a conforming Galerkin discretization of an equivalent saddle point problem to circumvent the evaluation of $$V^\star $$ V ⋆ -norms. We prove strong convergence of discrete solutions towards continuous solutions and provide a preconditioner for efficient numerical solution of the discrete saddle point problem. We illustrate our analytical findings by selected numerical experiments.

Advances in Computational MathematicsVol. 52(5)
Koblenz University of Applied Sciences (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 100%
Advanced Numerical Methods in Computational Mathematics
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.