An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem
DOI10.1007/s11075-022-01294-yzbMath1501.65138OpenAlexW4226312340MaRDI QIDQ2084252
Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis
Publication date: 18 October 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01294-y
fast Fourier transformsbiharmonic equationsuperconvergencepreconditioned conjugate gradient methodquadratic spline collocationoptimal global convergence rates
Numerical computation using splines (65D07) Spectral, collocation and related methods for boundary value problems involving PDEs (65N35) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Iterative numerical methods for linear systems (65F10) Numerical methods for discrete and fast Fourier transforms (65T50) Biharmonic, polyharmonic functions and equations, Poisson's equation in two dimensions (31A30) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Preconditioners for iterative methods (65F08)
Cites Work
- Matrix decomposition algorithms for elliptic boundary value problems: A survey
- Modified nodal cubic spline collocation for biharmonic equations
- Quadratic spline collocation methods for elliptic partial differential equations
- A fast solver for the orthogonal spline collocation solution of the biharmonic Dirichlet problem on rectangles
- A fourth order finite difference method for the Dirichlet biharmonic problem
- Fast Fourier transform solvers and preconditioners for quadratic spline collocation
- A quadratic spline collocation method for the Dirichlet biharmonic problem
- A Fast Direct Solver for the Biharmonic Problem in a Rectangular Grid
This page was built for publication: An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem
