Skip to search formSkip to main contentSkip to account menu

Minimax approximation algorithm

Known as: Minimax (disambiguation), L∞ approximation, Uniform approximation algorithm 
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Allpass filters have found many applications in signal processing areas. In this paper, an iterative linear programming (LP… 
2013
2013
In the bottleneck hyperplane clustering problem, given n points in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage… 
2006
2006
AbstractThis paper is concerned with further developing and refining the analysis of a recent algorithmic paradigm for nonlinear… 
2005
2005
This paper gives a sufficient condition for a robust control problem in terms of minimax polynomial optimization. A minimax… 
2001
2001
A FPGA implementation of a method for the calculation of faithfully rounded single-precision floating-point powering (X/sup p… 
1998
1998
The paper is devoted to l1 and l∞ approximation with parametric spline curves. We discuss the questions of existence and… 
1994
1994
Summary.This paper studies polynomials used in polynomial preconditioning for solving linear systems of equations. Optimum… 
1989
1989
Let S={s1, s2,...,s n } be a set of sites in E d , where every site s i has a positive real weight ω i . This paper gives an… 
1971
1971
This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A… 
1966
1966
Some new methods for obtaining the minimax polynomial approximation of degree n to a continuous function are introduced, and…