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

DOI10.1134/S0965542520020025MaRDI QIDQ2206478zbMATH OpenOpenAlexFDO

Authors A. P. Afanas'ev, S. M. Dzyuba

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

decomposition of computation processHorner's schememultidimensional polynomialsordinary differential equations

Mathematics Subject Classification ID

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

Recommendations

• The multivariate Horner scheme revisited
• scientific article; zbMATH DE number 4135287
• Evaluation of Multivariate Polynomials and Their Derivatives
• On the multivariate Horner scheme. II: Running error analysis
• scientific article; zbMATH DE number 4082824

Cites work

• A Fast Parallel Horner Algorithm
• Construction of the minimal sets of differential equations with polynomial right-hand side
• scientific article; zbMATH DE number 3225762 (Why is no real title available?)
• Introduction to algorithms.
• Method for constructing approximate analytic solutions of differential equations with a polynomial right-hand side
• On the Multivariate Horner Scheme
• On the multivariate Horner scheme. II: Running error analysis

Cited in

(1)

• scientific article; zbMATH DE number 4135287 (Why is no real title available?)

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

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