Abstract
Algorithms to calculate the weights of quadrature formulas for regular, weakly singular, and singular integrals are constructed and analyzed. The algorithms are easily realized by computer for any number, multiplicity, and distribution of quadrature nodes, and for systems of power, trigonometric, and hyperbolic basis functions as well as a given strictly monotone function used as the integration variable.
Similar content being viewed by others
References
A. F. Kalaida, High-Rank Collocation Approximations and Matrix Algorithms of Numerical Differentiation and Integration [in Russian], Unpublished manuscript, VINITI 31.12.82, No. 6562, Kiev (1982).
A. F. Kalaida, Matrix Algorithms for Approximate and Numerical Integration [in Russian], Unpublished manuscript, VINITI 09.07.82, No. 3672, Kiev (1982).
A. F. Kalaida, Matrix Algorithms for Numerical Differentiation and Integration of Discontinuous Functions [in Russian], Unpublished manuscript, VINITI 16.11.82, No. 5607, Kiev (1982).
A. F. Kalaida, Matrix Algorithms for Numerical Differentiation Using Powers of Monotone Basis Functions [in Russian], Unpublished manuscript, UkrNIINTI 25.05.84, No. 915, Kiev (1984).
A. F. Kalaida, Unremovable Error of Matrix Numerical Differentiation and Integration Algorithms [in Russian], Unpublished manuscript, VINITI 31.12.82, No. 6561, Kiev (1982).
Additional information
Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 68, pp. 3–14, 1989.
Rights and permissions
About this article
Cite this article
Kalaida, A.F. Matrix numerical integration algorithm. J Math Sci 69, 1369–1378 (1994). https://doi.org/10.1007/BF01250578
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01250578