Norman Levenberg
Indiana University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Norman Levenberg.
Journal of Approximation Theory | 2008
Jean-Paul Calvi; Norman Levenberg
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximants. For analytic functions, similar results may be achieved on more general K by allowing the number of points to grow at a slightly larger rate.
Indagationes Mathematicae | 2008
Len Bos; Norman Levenberg; Shayne Waldron
Suppose that K ⊂ ℝd is either the unit ball, the unit sphere or the standard simplex. We show that there are constants c1, c2 > 0 such that for a set of Fekete points (maximizing the Vandermonde determinant) of degree n, Fn ⊂ K, Download full-size image for all a ∈ Fn. Here dist(a, b) is a natural distance on K that will be described in the text.
Journal of the American Mathematical Society | 2005
Dan Coman; Norman Levenberg; Evgeny A. Poletsky
be the graph of / in C2. The set Tf is always pluripolar when / is a real analytic function. In [DF], Diederich and Fornaess give an example of a C?? function / with nonpluripolar graph in C2. The paper [LMP] contains an example of a holomorphic function / on the unit disk U, continuous up to the boundary, such that the graph of / over S is not pluripolar as a subset of C2. Thus a priori the pluripolarity of graphs of functions on S is indeterminate. In this paper we prove that graphs of quasianalytic functions are still pluripolar (all necessary definitions can be found in the next section). More precisely,
Transactions of the American Mathematical Society | 2010
D. Burns; Norman Levenberg; Sione Ma'u; Szilárd Gy Révész
We use geometric methods to calculate a formula for the complex Monge-Ampere measure (dd c V K ) n , for K ⋐ ℝ n C ℂ n a convex body and V K its Siciak-Zaharjuta extremal function. Bedford and Taylor had computed this for symmetric convex bodies K. We apply this to show that two methods for deriving Bernstein-Markov type inequalities, i.e., pointwise estimates of gradients of polynomials, yield the same results for all convex bodies. A key role is played by the geometric result that the extremal inscribed ellipses appearing in approximation theory are the maximal area ellipses determining the complex Monge-Ampere solution V K .
Journal of Approximation Theory | 2008
Len Bos; Norman Levenberg; Shayne Waldron
We discuss three natural pseudodistances and pseudometrics on a bounded domain in R^N based on polynomial inequalities.
Arkiv för Matematik | 2001
Len Bos; Jean-Paul Calvi; Norman Levenberg
is the class of plurisubharmonic functions of logarithmic growth (here we have Izl=(L~=1IzjI2)1/2 and log+ Izl=max{O,loglzl}). Then the upper semicontinuous regularization VE(z):=limsuPC-+z VE(() is called the (Siciak) extremal function of E. If K is a compact set in eN, then the extremal function in (1.1) can be gotten via the formula (1.2) VK(Z) :=max{ o,suP{ de~p log Ip(z)l:p holomorphic polynomial, IIpIIK:::; 1} } (Theorem 5.1.7 in [KI]). Here, IlpIlK:=SUPzEKIp(z)1 denotes the uniform norm on K. We say that K is regular if and only if V;=VK. Note that if we let
Arkiv för Matematik | 2015
D. Burns; Norman Levenberg; Sione Ma‘u
We study the smoothness of the Siciak–Zaharjuta extremal function associated to a convex body in
Mathematics of Computation | 2011
Len Bos; Jean-Paul Calvi; Norman Levenberg; Alvise Sommariva; Marco Vianello
\mathbb{R}^{2}
Constructive Approximation | 2002
Thomas Bagby; Len Bos; Norman Levenberg
. We also prove a formula relating the complex equilibrium measure of a convex body in
Annales Polonici Mathematici | 2012
T. Bloom; Len Bos; Jean-Paul Calvi; Norman Levenberg
\mathbb{R}^{n}