The Tchebysheffian approximation of one rational function by another
A. Talbot
Abstract
A. Talbot
Abstract
In a previous paper we discussed a uniform algebraic method of solution of problems in which a prescribed real rational function (or polynomial) g ( x ) was to be approximated in a given finite interval by a real rational function (or polynomial) f ( x ) with prescribed numerator and denominator degrees, the approximation being Tchebysheffian, i.e. such as to make the ‘deviation’ of f , max | f − g | in the interval, as small as possible.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In a previous paper we discussed a uniform algebraic method of solution of problems in which a prescribed real rational function (or polynomial) g ( x ) was to be approximated in a given finite interval by a real rational function (or polynomial) f ( x ) with prescribed numerator and denominator degrees, the approximation being Tchebysheffian, i.e. such as to make the ‘deviation’ of f , max | f − g | in the interval, as small as possible.
Key concepts: Rational function, Interval (graph theory), Mathematics, Polynomial and rational function modeling, Polynomial, Function (biology), Algebraic function, Algebraic number