Computing discrete convolutions with verified accuracy via Banach algebras and the FFT. (Q1785642)

From MaRDI portal





scientific article; zbMATH DE number 6945730
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing discrete convolutions with verified accuracy via Banach algebras and the FFT.
    scientific article; zbMATH DE number 6945730

      Statements

      Computing discrete convolutions with verified accuracy via Banach algebras and the FFT. (English)
      0 references
      1 October 2018
      0 references
      Let \(u_j\), \(j=1,\ldots,p\) be given \((2\pi/L)\)-periodic trigonometric polynomials of order \(M-1\) with corresponding sequences of Fourier coefficients \(a^{(j)}\in\mathbb{C}^{2M-1}\). Then the Fourier coefficients of the product \(u_1\,u_2\,\ldots\,u_p\) can be computed by discrete convolutions \(a^{(1)}\ast a^{(2)}\ast\,\ldots\,\ast a^{(p)}\). Using fast Fourier transforms, properties of Banach sequence spaces, and interval arithmetic, the author determines rigorous enclosures of these discrete convolutions. The method is applied to the numerical solution of the nonlinear Swift-Hohenberg partial differential equation \[u_t=(\lambda -1)\,u-2u_{xx}-u_{xxxx}+\mu u^3-u^5\] with periodic boundary conditions.
      0 references
      trigonometric polynomials
      0 references
      Fourier coefficients
      0 references
      discrete convolution
      0 references
      fast Fourier transform
      0 references
      Banach sequence space
      0 references
      interval arithmetic
      0 references
      nonlinear Swift-Hohenberg partial differential equation
      0 references

      Identifiers

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