Error Estimates of a Space‐Time Spectral Method for Nonlinear Klein–Gordon Equation With Unknown Coefficients

ABSTRACT A space‐time spectral method combined with mollification method is proposed for the inverse coefficient problem of the nonlinear Klein–Gordon equation. The spectral scheme is utilized to reconstruct an unknown time‐dependent coefficient and wave displacement in a nonlinear Klein–Gordon equa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Numerical methods for partial differential equations Ročník 41; číslo 4
Hlavní autoři: Qiao, Yan, Wu, Hua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken, USA John Wiley & Sons, Inc 01.07.2025
Wiley Subscription Services, Inc
Témata:
Chebyshev approximation
Convergence
error estimates
Estimates
fully‐discrete
Galerkin method
implicit–explicit iterative scheme
inverse problem
Iterative solution
Klein-Gordon equation
mollification method
nonlinear Klein–Gordon equation
Numerical differentiation
Regularization
Smooth boundaries
space‐time spectral scheme
Spectral methods
Stability analysis
Time dependence
ISSN:0749-159X, 1098-2426
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:ABSTRACT A space‐time spectral method combined with mollification method is proposed for the inverse coefficient problem of the nonlinear Klein–Gordon equation. The spectral scheme is utilized to reconstruct an unknown time‐dependent coefficient and wave displacement in a nonlinear Klein–Gordon equation. We apply the Legendre–Galerkin method in spatial direction and the Legendre–Petrov–Galerkin method in temporal direction. We calculate the nonlinear term with the pseudospectral treatment by using Chebyshev‐Gauss‐Lobatto interpolation, which is efficiently computed via the fast Legendre transform. For the perturbed measurements, we apply the appropriate mollification method to obtain stable numerical differentiation and smooth boundary data. Using rigorous error estimates, we establish the convergence and stability of the iterative solution for the fully‐discrete algorithm. Especially, we also present, for the first time, the convergence and stability analysis of the iterative solution that combines spectral methods with regularization techniques. Numerical results show the efficiency and stability of this approach and agree well with the theoretical analysis.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0749-159X
1098-2426
DOI:10.1002/num.70013