Results 271 to 280 of about 1,820,249 (291)

Lebesgue constants in polynomial interpolation

2006
Summary: Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the 'nodes'). However, the accuracy of the approximation is greatly influenced by the location of these nodes.
openaire   +2 more sources

Area-Optimized Constant-Time Hardware Implementation for Polynomial Multiplication

IEEE Embedded Systems Letters, 2023
Safiullah Khan, Abdul Majeed, Ayesha Khalid   +2 more
exaly  

A constant round quantum secure protocol for oblivious polynomial evaluation

Journal of Information Security and Applications, 2023
Sumit Kumar Debnath, Vikas Srivastava, Sihem Mesnager   +2 more
exaly  

Constant-Degree Polynomial Partitioning and Incidences in C2

2022
Adam Sheffer
exaly  

An estimate of the constant term of a nonnegative trigonometric polynomial with integer coefficients

Mathematical Notes, 1996
A S Belov, S V Konyagin
exaly  

A polynomial optimization approach to constant rebalanced portfolio selection

Computational Optimization and Applications, 2011
Renata Sotirov, Yuichi Takano
exaly  

Polynomial solutions to linear PDEs with constant coefficients

Georgian Mathematical Journal, 2019
Vakhtang Lomadze
exaly  

Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

Operations Research Letters, 2012
Ayse Akbalik, Christophe Rapine
exaly  

Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae

2011
Ilya Volkovich, Dieter van Melkebeek
exaly  

Hypersurfaces of constant mean curvature with finite index and volume of polynomial growth

Archiv Der Mathematik, 1993
Hilario Alencar, M do Carmo
exaly