A numerical method for solving the Dirichlet problem for the wave equation

In this paper we present a numerical method for solving the Dirichlet problem for a two-dimensional wave equation. We analyze the ill-posedness of the problem and construct a regularization algorithm. Using the Fourier series expansion with respect to one variable, we reduce the problem to a sequenc...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of applied and industrial mathematics Ročník 7; číslo 2; s. 187 - 198
Hlavní autori: Kabanikhin, S. I., Krivorot’ko, O. I.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht SP MAIK Nauka/Interperiodica 01.04.2013
Springer Nature B.V
Predmet:
Algebra
Algorithms
Applied mathematics
Boundary conditions
Boundary value problems
Computational mathematics
Construction
Dirichlet problem
Inverse problems
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Numerical analysis
Regularization
Studies
Theorems
Wave equations
Dirichlet problem
degree of ill-posedness
singular value decomposition
wave equation
ISSN:1990-4789, 1990-4797
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper we present a numerical method for solving the Dirichlet problem for a two-dimensional wave equation. We analyze the ill-posedness of the problem and construct a regularization algorithm. Using the Fourier series expansion with respect to one variable, we reduce the problem to a sequence of Dirichlet problems for one-dimensional wave equations. The first stage of regularization consists in selecting a finite number of problems from this sequence. Each of the selected Dirichlet problems is formulated as an inverse problem Aq = f with respect to a direct (well-posed) problem. We derive formulas for singular values of the operator A in the case of constant coefficients and analyze their behavior to judge the degree of ill-posedness of the corresponding problem. The problem Aq = f on a uniform grid is reduced to a system of linear algebraic equations A ll q = F . Using the singular value decomposition, we find singular values of the matrix A ll and develop a numerical algorithm for constructing the r -solution of the original problem. This algorithm was tested on a discrete problem with relatively small number of grid nodes. To improve the calculated r -solution, we applied optimization but observed no noticeable changes. The results of computational experiments are illustrated.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1990-4789
1990-4797
DOI:10.1134/S1990478913020075