Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,148,747 papers from all fields of science
Search
Sign In
Create Free Account
Minimax approximation algorithm
Known as:
Minimax (disambiguation)
, L∞ approximation
, Uniform approximation algorithm
Expand
A minimax approximation algorithm (or L∞ approximation or uniform approximation) is a method to find an approximation of a mathematical function that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Equioscillation theorem
List of numerical analysis topics
Remez algorithm
Trigonometric tables
Broader (1)
Numerical analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
HOW THE CHOICE OF ACTIVATION AFFECTS TRAINING OF OVERPARAMETRIZED NEURAL NETS
A. Panigrahi
,
Abhishek Shetty
,
Navin Goyal
International Conference on Learning…
2020
Corpus ID: 211095190
It is well-known that overparametrized neural networks trained using gradient based methods quickly achieve small training error…
Expand
2017
2017
A Parameterizable Activation Function Generator for FPGA-Based Neural Network Applications
Sam M. H. Ho
,
C.-H. Dominic Hung
,
Ho-Cheung Ng
,
Maolin Wang
,
Hayden Kwok-Hay So
IEEE Symposium on Field-Programmable Custom…
2017
Corpus ID: 9191641
Neural network applications on FPGAs at times require arithmetic operators that are either not available in the manufacturer's…
Expand
2014
2014
Using the Best Uniform Approximation with Compression for Efficient Computation of Monostatic Scattering
Zhiwei Liu
,
Shan He
,
Xiaoyan Zhang
,
Yingting Liu
,
Yueyuan Zhang
2014
Corpus ID: 59046951
─ The best uniform approximation method hybridized with Singular Value Decomposition (SVD) is proposed to reduce the time…
Expand
2013
2013
A two-phase heuristic for the bottleneck k-hyperplane clustering problem
E. Amaldi
,
Kanika Dhyani
,
Leo Liberti
Computational optimization and applications
2013
Corpus ID: 10750553
In the bottleneck hyperplane clustering problem, given n points in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage…
Expand
2012
2012
Numerical Analysis of Diagonal-Preserving, Ripple-Minimizing and Low-Pass Image Resampling Methods
Chantal Racette
arXiv.org
2012
Corpus ID: 21767455
Image resampling is a necessary component of any operation that changes the size of an image or its geometry. Methods tuned for…
Expand
2006
2006
"Push-the-Error" Algorithm for Nonlinear n-Term Approximation
W. Dahmen
,
P. Petrushev
2006
Corpus ID: 17929572
AbstractThis paper is concerned with further developing and refining the analysis of a recent algorithmic paradigm for nonlinear…
Expand
1998
1998
Computational Methods for discrete parametric ℓ1 and ℓ∞ Curve Fitting
B. Jüttler
International journal of shape modeling
1998
Corpus ID: 36220231
The paper is devoted to l1 and l∞ approximation with parametric spline curves. We discuss the questions of existence and…
Expand
1971
1971
Conditions for a minimax optimum
J. Bandler
1971
Corpus ID: 122718500
This paper derives and discusses necessary conditions for an optimum in nonlinear minimax approximation problems. A…
Expand
1970
1970
Efficiency of a Procedure for Near-Minimax Approximation
L. Shampine
JACM
1970
Corpus ID: 2092303
A procedure using the minimax polynomial fit of degree <italic>n</italic> on the set of extrema of the Chebyshev polynomial…
Expand
1966
1966
Minimax polynomial approximation
H. Denman
1966
Corpus ID: 51735152
Some new methods for obtaining the minimax polynomial approximation of degree n to a continuous function are introduced, and…
Expand