Rothe Time Discretization and Weak Solutions for a Cutoff Westervelt System

ABSTRACT We study a fully implicit Rothe time discretization for a cutoff first‐order formulation of the Westervelt equation. The key ingredients are the enthalpy variable and the primitive mobility variable, which turn each nonlinear time step into a uniformly monotone elliptic problem and avoid higher‐order energy estimates and inverse inequalities. For every time step, the discrete problem reduces to a monotone elliptic equation, which yields well‐posedness of the Rothe scheme by the Browder–Minty theorem. We derive a discrete energy inequality, establish compactness for the transformed variable by an Alt–Luckhaus type argument, and pass to the limit to obtain existence of weak solutions for the cutoff first‐order system. We prove a weak–strong uniqueness principle for the cutoff problem and formulate a conditional a posteriori criterion under which the cutoff is inactive. For sufficiently regular solutions of the forced cutoff problem, we establish consistency estimates which identify the temporal residuals produced by the Rothe approximation in the natural discrete‐in‐time weak norms. These estimates provide a rigorous consistency basis for the observed temporal behavior. Finally, numerical experiments illustrate the stability of the scheme, its observed near first‐order temporal behavior, and inactivity of the cutoff along the computed discrete trajectories in the tested regimes.

Authors

Institutions

Publication Details

Journal
Numerical Methods for Partial Differential Equations
Published
2026-08-21
DOI
https://doi.org/10.1002/num.70136
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Rothe Time Discretization and Weak Solutions for a Cutoff Westervelt System

Marvin Fritz
Numerical Methods for Partial Differential Equations
Optimization and Variational Analysis
article

Rothe Time Discretization and Weak Solutions for a Cutoff Westervelt System

Marvin Fritz
article en

Abstract

ABSTRACT We study a fully implicit Rothe time discretization for a cutoff first‐order formulation of the Westervelt equation. The key ingredients are the enthalpy variable and the primitive mobility variable, which turn each nonlinear time step into a uniformly monotone elliptic problem and avoid higher‐order energy estimates and inverse inequalities. For every time step, the discrete problem reduces to a monotone elliptic equation, which yields well‐posedness of the Rothe scheme by the Browder–Minty theorem. We derive a discrete energy inequality, establish compactness for the transformed variable by an Alt–Luckhaus type argument, and pass to the limit to obtain existence of weak solutions for the cutoff first‐order system. We prove a weak–strong uniqueness principle for the cutoff problem and formulate a conditional a posteriori criterion under which the cutoff is inactive. For sufficiently regular solutions of the forced cutoff problem, we establish consistency estimates which identify the temporal residuals produced by the Rothe approximation in the natural discrete‐in‐time weak norms. These estimates provide a rigorous consistency basis for the observed temporal behavior. Finally, numerical experiments illustrate the stability of the scheme, its observed near first‐order temporal behavior, and inactivity of the cutoff along the computed discrete trajectories in the tested regimes.

Numerical Methods for Partial Differential EquationsVol. 42(5)
University of Vienna (AT)
Openalex Percentile: Top 14%
Optimization and Variational Analysis
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.