An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem (Q2084252)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7602906
Language Label Description Also known as
default for all languages
No label defined
    English
    An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem
    scientific article; zbMATH DE number 7602906

      Statements

      An optimal two-step quadratic spline collocation method for the Dirichlet biharmonic problem (English)
      0 references
      0 references
      0 references
      0 references
      18 October 2022
      0 references
      The authors of this article consider the Dirichlet biharmonic problem on a unit square. First, they rewrite the problem at hand as a coupled system of two Poisson equations. Second, the fast Fourier transform is used to solve the discretizations using orthogonal spline collocation of these Poisson equations with either Dirichlet or Neumann conditions. This has the advantage that one has to solve a system of equations with a symmetric and positive matrix instead of a nonsymmetric one because they use the Schur complement method. Those systems are then solved efficiently with a preconditioned conjugate gradient method. It is shown that the complexity of the method on a \(N\times N\) partition of the unit square is \(\mathcal{O}\left(N^2\log N\right)\). Finally, several numerical results are given to show that the optimal accuracy of their proposed method is indeed fourth-order accurate. However, a theoretical proof of this observation is still open and subject to future research.
      0 references
      biharmonic equation
      0 references
      quadratic spline collocation
      0 references
      fast Fourier transforms
      0 references
      preconditioned conjugate gradient method
      0 references
      optimal global convergence rates
      0 references
      superconvergence
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references