Journal of Inequalities and Applications · 2018 · 10 citations · 22 references
ComputingComputer ScienceMathematicsAlgorithmsOptimizationTheory Of ComputationApproximation AlgorithmsApproximation MethodsNumerical AlgorithmsNumerical AnalysisApproximation By Trigonometric PolynomialsBounding FunctionsLower Bound ComputationPadé ApproximationTrigonometric Series
Inequalities are frequently used for solving practical engineering problem. There are two key issues of bounding inequalities; one is to find the bounds, and the other is to prove the bounds. This paper takes Wilker type inequalities as an example, presents a two-point-Padé-approximant-based method for finding the bounds, and it also provides a method to prove the bounds in a new way. It not only recovers the estimates in Mortici's method, but it also provides new improvements of estimates obtained from prevailing methods. In principle, it can be applied for other inequalities.
22
Interpolation and Approximation
O. Shisha, Philip J. Davis · Mathematics of Computation · 1966 · 431 citations