Rigorous Polynomial Approximation Using Taylor Models in Coq-Reference-Cited by-同舟云学术

Rigorous Polynomial Approximation Using Taylor Models in Coq

Published:2012 Issue: Volume: Page:85-99
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Brisebarre Nicolas,Joldeş Mioara,Martin-Dorel Érik,Mayero Micaela,Muller Jean-Michel,Paşca Ioana,Rideau Laurence,Théry Laurent

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-28891-3_9.pdf

Reference43 articles.

1. Abramowitz, M., Stegun, I.A.: Handbook of mathematical functions with formulas, graphs, and mathematical tables. National Bureau of Standards Applied Mathematics Series, vol. 55. For sale by the Superintendent of Documents, U.S. Government Printing Office, Washington, D.C (1964)

2. Lecture Notes in Computer Science;M. Armand,2010

3. Lecture Notes in Computer Science;A. Benoit,2010

4. Texts in Theoretical Computer Science;Y. Bertot,2004

5. Berz, M., Makino, K.: Rigorous global search using Taylor models. In: SNC 2009: Proceedings of the 2009 Conference on Symbolic Numeric Computation, pp. 11–20. ACM, New York (2009)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PolyARBerNN: A Neural Network Guided Solver and Optimizer for Bounded Polynomial Inequalities;ACM Transactions on Embedded Computing Systems;2024-03-18

2. A Formal Proof of the Lax Equivalence Theorem for Finite Difference Schemes;Lecture Notes in Computer Science;2021

3. Bibliography;Floating-Point Algorithms and Formal Proofs;2017

4. A unified Coq framework for verifying C programs with floating-point computations;Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs;2016-01-18

5. Proving Tight Bounds on Univariate Expressions with Elementary Functions in Coq;Journal of Automated Reasoning;2015-10-05