Matrix Decomposition Algorithms for Modified Spline Collocation for Helmholtz Problems

DOI10.1137/S106482750139964XzbMath1035.65135MaRDI QIDQ4442133

Bernard Bialecki, Andreas Karageorghis, Graeme Fairweather

Publication date: 20 January 2004

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

algorithms; convergence rates; Dirichlet problem; numerical results; boundary conditions; fast Fourier transforms; superconvergence; Helmholtz equation; periodic boundary conditions; Neumann problem; tensor product; spline collocation; fast direct method

Mathematics Subject Classification ID

65N35: Spectral, collocation and related methods for boundary value problems involving PDEs

65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs

35J05: Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation

Related Items

Modified nodal cubic spline collocation for three-dimensional variable coefficient second-order partial differential equations, Matrix decomposition algorithms for elliptic boundary value problems: A survey, Matrix decomposition algorithms for the finite element Galerkin method with piecewise Hermite cubics, A fast direct solver for a fourth order finite difference scheme for Poisson's equation on the unit disc in polar coordinates, Optimal superconvergent one step quadratic spline collocation methods, Matrix decomposition algorithms for the \(C^{0}\)-quadratic finite element Galerkin method, Modified nodal cubic spline collocation for elliptic equations

Uses Software

• FFTPACK