Two near minimax norms for polynomial approximation are presented. They are designed for approximation of both a function and its first derivative uniformly by polynomials over a given finite interval ...
Kövari and Pommerenke [19], and Elliott [8], have shown that the truncated Faber series gives a polynomial approximation which (for practical values of the degree of the polynomial) is very close to ...
Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...
Dominique Guillot, an associate professor in the University of Delaware's Department of Mathematical Sciences, was recently awarded the grant "Polynomial approximation in spaces of analytic functions" ...
Approximation theory and asymptotic methods form a foundational framework that bridges classical ideas with modern numerical analysis, enabling researchers to obtain practical, near‐optimal solutions ...
Structured low-rank approximation (SLRA) is a mathematical framework that seeks to approximate a given data matrix by another matrix of lower rank while preserving intrinsic structural properties.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results