Greedy algorithms for optimizing multivariate Horner schemes

DOI10.1145/980175.980179MaRDI QIDQ5739496zbMATH OpenOpenAlexFDO

Authors Martine Ceberio, Vladik 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)

Recommendations

• Greedy algorithms with regard to multivariate systems with special structure
• On the Multivariate Horner Scheme
• Greedy approximation and the multivariate Haar system
• The multivariate Horner scheme revisited
• Homogeneous algorithms for multiextremal optimization
• Stochastic greedy algorithms for multiple measurement vectors
• Greedy and randomized versions of the multiplicative Schwarz method
• scientific article; zbMATH DE number 1086990
• Greedy strategies for convex optimization
• Greedy algorithms for high-dimensional non-symmetric linear problems

Cited in

(8)

• Code optimization in FORM
• 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
• FastSpline: automatic generation of interpolants for lattice samplings
• Decoupling multivariate fractions
• Enhancing the implementation of mathematical formulas for fixed-point and floating-point arithmetics
• The multivariate Horner scheme revisited

This page was built for publication: Greedy algorithms for optimizing multivariate Horner schemes

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