Greedy algorithms for optimizing multivariate Horner schemes

DOI10.1145/980175.980179zbMath1343.65049OpenAlexW2105313514MaRDI QIDQ5739496

Martine Ceberio, Vladik Ya. Kreinovich

Publication date: 18 July 2016

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.utep.edu/cgi/viewcontent.cgi?article=1402&context=cs_techrep

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)

Related Items

Decoupling multivariate fractions, Code optimization in FORM, Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics, Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects, Improving multivariate Horner schemes with Monte Carlo tree search, Optimising code generation with haggies