One method for proving inequalities by computer

08/31/2006
by   Branko J. Malesevic, et al.
0

In this article we consider a method for proving a class of analytical inequalities via minimax rational approximations. All numerical calculations in this paper are given by Maple computer program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2017

The natural algorithmic approach of mixed trigonometric-polynomial problems

The aim of this paper is to present a new algorithm for proving mixed tr...
research
02/06/2022

Proving Information Inequalities and Identities with Symbolic Computation

Proving linear inequalities and identities of Shannon's information meas...
research
02/14/2022

Some New Inequalities for Beta Distributions

This note provides some new inequalities and approximations for beta dis...
research
09/15/2022

Inequalities for entropies and dimensions

We show that linear inequalities for entropies have a natural geometric ...
research
01/03/2022

Parametric Root Finding for Supporting Proving and Discovering Geometric Inequalities in GeoGebra

We introduced the package/subsystem GeoGebra Discovery to GeoGebra which...
research
10/29/2021

How to Find New Characteristic-Dependent Linear Rank Inequalities using Secret Sharing

Determining information ratios of access structures is an important prob...
research
02/12/2019

Inequalities and Approximations for Fisher Information in the Presence of Nuisance Parameters

Many imaging systems are used to estimate a vector of parameters associa...

Please sign up or login with your details

Forgot password? Click here to reset