Decomposition implementation of Horner's scheme for calculating the values of multidimentional polynomials

DOI10.1134/S0965542520020025zbMath1452.65047OpenAlexW3016565469MaRDI QIDQ2206478

S. M. Dzyuba, Alexander P. Afanas'ev

Publication date: 22 October 2020

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542520020025

zbMATH Keywords

ordinary differential equationsHorner's schememultidimensional polynomialsdecomposition of computation process

Mathematics Subject Classification ID

Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Cites Work

• Unnamed Item
• Unnamed Item
• Construction of the minimal sets of differential equations with polynomial right-hand side
• Method for constructing approximate analytic solutions of differential equations with a polynomial right-hand side
• A Fast Parallel Horner Algorithm
• On the Multivariate Horner Scheme
• On the multivariate Horner scheme. II: Running error analysis

This page was built for publication: Decomposition implementation of Horner's scheme for calculating the values of multidimentional polynomials