Fast Collocation Methods for Second Kind Integral Equations (Q4539428)

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 1764416
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast Collocation Methods for Second Kind Integral Equations
    scientific article; zbMATH DE number 1764416

      Statements

      Fast Collocation Methods for Second Kind Integral Equations (English)
      0 references
      0 references
      0 references
      0 references
      8 July 2002
      0 references
      fast collocation methods
      0 references
      Fredholm integral equations of the second kind with weakly singular kernels
      0 references
      multiscale interpolating functions
      0 references
      multiscale bases
      0 references
      multiscale interpolation
      0 references
      collocation functionals
      0 references
      truncation strategy
      0 references
      convergence
      0 references
      stability
      0 references
      condition number
      0 references
      refinable sets
      0 references
      Based on an estimate for the entries of the coefficient matrix for the collocation method, the authors develop a fast collocation method for solving Fredholm integral equations of the second kind with weakly singular kernels defined on a bounded domain in \(\mathbb R^d\), \(d\geq 1\). For this purpose, multiscale interpolating functions and collocation functionals having vanishing moments are constructed. The matrix truncation algorithm including the optimal order of convergence of the approximate solutions obtained from the fast algorithms, stability of the numerical methods, condition number of the truncated coefficient matrix and computational complexity of the algorithms are analyzed. A concrete construction of multiscale bases on an invariant set in \(\mathbb R^d\) and collocation functionals needed for fast collocation algorithms are presented.
      0 references

      Identifiers