.png){kind=icon}
Return
Matrix decomposition algorithms for modified spline collocation for Helmholtz problems
.png){kind=icon}
PRE
AI
DOI：10.1137/S106482750139964X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the solution of various boundary value problems for the Helmholtz equation in the unit square using a nodal cubic spline collocation method and modi. cations of it which produce optimal (fourth-) order approximations. For the solution of the collocation equations, we formulate matrix decomposition algorithms, fast direct methods which employ fast Fourier transforms and require O(N-2 logN) operations on an N x N uniform partition of the unit square. A computational study confirms the published analysis for the Dirichlet problem and indicates that similar results hold for Neumann, mixed, and periodic boundary conditions. The numerical results also exhibit superconvergence phenomena not reported in earlier studies.
Keywords:
spline collocation
Helmholtz equation
boundary conditions
tensor product
fast Fourier transforms
convergence rates
superconvergence
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSave
View more