Skip to Main content Skip to Navigation
Conference papers

A parametric Kantorovich theorem with application to tolerance synthesis

Abstract : We propose a parametric Kantorovich theorem, which will achieve these two tasks. The idea is to compute worst case Kantorovich constants with respect to parameters q using a branch and bound algorithm dedicated to nonlinear nonsmooth global optimization. A rigorous first order model of the dependence with respect to parameters p is used to enforce the convergence of the error upper-bound. Details about these developments can be found in [1]. We provide here a different point of view, in particular emphasizing the reason why not using the interval Newton operator, in spite of its theoretical superiority on Kantorovich theorem in this context [2].
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Stéphane Caro <>
Submitted on : Wednesday, August 29, 2018 - 4:16:29 AM
Last modification on : Wednesday, January 6, 2021 - 10:28:02 PM
Long-term archiving on: : Friday, November 30, 2018 - 12:31:54 PM


Files produced by the author(s)


  • HAL Id : hal-01863731, version 1


Alexandre Goldsztejn, Stéphane Caro, Gilles Chabert. A parametric Kantorovich theorem with application to tolerance synthesis. The 18th International Symposium on Scientific Computing, Computer Arithmetic, and Verified Numerical Computations, Sep 2018, Tokyo, Japan. ⟨hal-01863731⟩



Record views


Files downloads