Implicit methods of computation of integrals on modern computer systems

MaRDI QIDQ2764341zbMATH OpenFDO

Authors V. I. Kireev, G. V. Tsirkov

Publication date 18 July 2002

Published in Matematicheskoe Modelirovanie (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mm/v13/i6/p117

zbMATH Keywords

implicit algorithmmodern computer systemsnumerical integrationquadrature formulasingular functiontabulated function

Mathematics Subject Classification ID

Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Packaged methods for numerical algorithms (65Y15)

Review text

The paper is concerned with the numerical integration of functions given by a table in the form \(y_i=f(x_i)\), \(x_i \in [a,b]\), \(i=0,\dots,n\), where the nodes \(x_i\) are non-equidistant and the function \(f\) has singularities. Implicit algorithms for numerical integration of such functions are presented. These algorithms are based on the calculation of integrals \(I_i^{i+1}=\int _{x_i} ^{x_{i+1}}f(x) dx\).

Recommendations

• On numerical computation of singular integrals
• scientific article; zbMATH DE number 703533
• Numerical integration of functions with boundary singularities
• scientific article; zbMATH DE number 868507
• A numerical integration method for a class of the functions with singular points

Cited in

(1)

• Implicit numerical integration algorithms with de Casteljau predictors

This page was built for publication: Implicit methods of computation of integrals on modern computer systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2764341)