Comparison of some numerical quadrature formulas for weakly singular periodic Fredholm integral equations (Q1263267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:44, 5 March 2024

scientific article
Language Label Description Also known as
English
Comparison of some numerical quadrature formulas for weakly singular periodic Fredholm integral equations
scientific article

    Statements

    Comparison of some numerical quadrature formulas for weakly singular periodic Fredholm integral equations (English)
    0 references
    0 references
    0 references
    1989
    0 references
    The author develops four types of quadrature formulae for the numerical solution of Fredholm integral equations of the form \(\omega f(t)+\int K(t,x)f(x)dx=g(t)\) (a\(\leq t\leq b)\), where K, g and (hence) f have period b-a and \(\omega\) is either 0 or 1. The kernel K is assumed to be weakly singular, with particular attention being given to kernels which can be written in the form \(H_ 1(t,x)\ln | t-x| +H_ 2(t,x).\) All the formulae are based on the trapezoidal rule with equidistant abscissae, and asymptotic expansions are derived for their respective errors. Comparison is made of their implementations in respect of their computational cost, accuracy, and efficiency when used in conjunction with the Richardson extrapolation. It is concluded that the formula which was developed by the author and \textit{M. Israeli} in a previous paper [J. Sci. Comput. 3, No.2, 201-231 (1988; Zbl 0662.65122)] is the most advantageous. A description of the numerical solution of a particular inhomogeneous equation of the second kind concludes the paper.
    0 references
    0 references
    weakly singular kernel
    0 references
    quadrature formulae
    0 references
    Fredholm integral equations
    0 references
    asymptotic expansions
    0 references
    computational cost
    0 references
    accuracy
    0 references
    efficiency
    0 references
    Richardson extrapolation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references