Rigorous global search using taylor models

DOI10.1145/1577190.1577198zbMath1356.90110OpenAlexW1994097280MaRDI QIDQ2959013

Martin Berz, Kyoko Makino

Publication date: 3 February 2017

Published in: Proceedings of the 2009 conference on Symbolic numeric computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1577190.1577198

zbMATH Keywords

error bounddynamical systeminterval arithmeticHénon mapTaylor modelTaylor polynomialHénon attractorBeale functionrigorous global optimization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Approximation methods and heuristics in mathematical programming (90C59) Interval and finite arithmetic (65G30) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (3)

Chebyshev model arithmetic for factorable functions ⋮ Efficient and accurate computation of upper bounds of approximation errors ⋮ Certification of real inequalities: templates and sums of squares

This page was built for publication: Rigorous global search using taylor models