A Numerical Procedure for Proving Specific Strict One-Variable Inequalities in Specific Finite Intervals
Man Kam Kwong
TL;DR
This paper introduces a numerical method implemented in MAPLE to rigorously prove strict one-variable inequalities within finite intervals, aiding in establishing strict bounds of functions.
Contribution
It presents a brute-force numerical procedure and MAPLE implementation for rigorously proving specific strict inequalities in finite intervals.
Findings
Successfully proves strict inequalities within finite intervals.
Provides a MAPLE implementation for the numerical procedure.
Useful for affirming strict lower bounds of functions.
Abstract
A numerical procedure and its MAPLE implementation capable of rigorously, albeit in a brute-force manner, proving specific strict one-variable inequalities in specific finite intervals is described. The procedure is useful, for instance, to affirm strict lower bounds of specific functions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Numerical methods for differential equations · Numerical Methods and Algorithms