OpenAlex ·
Global smooth behavior in Kuznetsov and Westervelt type viscous wave equations: A unifying approach covering $W^{1,q}$-small initial data
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.02795
- Original
- Read it at the publisher
- Topics
Abstract
In a smoothly bounded domain $\Om\subset\R^n$ with $n\geq 1$ and $a>0$, we consider an initial-boundary value problem for the general viscous wave equation \bas h(u,u_t) u_{tt} = \Del u_t + a\Del u + f(u,u_t,\na u,\na u_t) \eas which appears in models of nonlinear acoustics wave propagation; well-established equations of Kuznetsov and Westervelt type form particular examples.\abs % While the existing literature offers extensive results on global solutions for sufficiently small initial data $(u_{0}, u_{0t})=(u, u_{t})|_{t=0}$ in second- and higher-order Sobolev spaces it appears to remain open how far global solvability can be established under smallness conditions involving only first-order Sobolev spaces. The present manuscript addresses this question by proving the existence of global classical solutions together with exponential decay of the pair $(u,u_{t})$ in $ W^{1,r}\times W^{1,p}$-Sobolev spaces whenever the nonlinearities $h$ and $f$ are sufficiently smooth and are such that $h(0,0)>0$ as well as $f(0,0,0,0)=0$ and $\na f(0,0,0,0)=0$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Systems & Control
The higher-dimensional Shepp problem: an exact criterion for random ball coverings of tori
A $p$-summability approach to the weak maximizing property
The truncated octahedron minimizes surface area among parallelohedra of equal volume
PRICE: A Systematic Study of LLM Adaptation Choices for Bitcoin Price Forecasting
Shallow neural network approximation in mixed Sobolev spaces
Get the few papers worth your time in Systems & Control every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.