Related papers: $L$-approximation of $B$-splines by trigonometric …

Bernstein polynomial approximation to a continuous function has a slower rate of convergence as compared to other approximation methods. "The fact seems to have precluded any numerical application of Bernstein polynomials from having been…

This paper deals with the approximation of discrete real-valued functions by first-degree splines (broken lines) with free knots for arbitrary $L_p$-norms ($1 \leq p \leq \infty)$. We prove the existence of best approximations und derive…

We consider in this paper the Hahn polynomials and their application in numerical methods. The Hahn polynomials are classical discrete orthogonal polynomials. We analyse the behaviour of these polynomials in the context of spectral…

We prove a sharp quantitative version for the stability of the Sobolev inequality with explicit constants. Moreover, the constants have the correct behavior in the limit of large dimensions, which allows us to deduce an optimal quantitative…

We find the best possible constant $C$ in the inequality $$\|\varphi\|_{L^r}^{\phantom{\frac{p}{r}}}\leq C\|\varphi\|_{L^p}^{\frac{p}{r}}\|\varphi\|_{\mathrm{BMO}}^{1-\frac{p}{r}}$$ for all possible values of parameters $p$ and $r$ such…

We explain how to use smooth bivariate splines of arbitrary degree to solve the exterior Helmholtz equation based on a Perfectly Matched Layer (PML) technique. In a previous study (cf. [26]), it was shown that bivariate spline functions of…

We propose a polynomial preserving recovery method for PHT-splines within isogeometric analysis to obtain more accurate gradient approximations. The method fully exploits the local interpolation properties of PHT-splines and avoids the need…

In our recent work \cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a…

We study the local approximation properties in hierarchical spline spaces through multiscale quasi-interpolation operators. This construction suggests the analysis of a subspace of the classical hierarchical spline space (Vuong et al.,…

In this paper we explore the connections between minimizers of the discrete logarithmic energy on the 2-dimensional sphere, univariate polynomials with optimal condition number in the Shub-Smale sense and a quotient involving norms of…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

The aim of this paper is to apply an original computation method due to Malesevic and Makragic [5] to the problem of approximating some trigonometric functions. Inequalities of Wilker-Cusa-Huygens are discussed, but the method can be…

We explore the optimality of the constants making valid the recently established Little Grothendieck inequality for JB$^*$-triples and JB$^*$-algebras. In our main result we prove that for each bounded linear operator $T$ from a…

Let F be a holomorphic map whose components satisfy some polynomial relations. We present an algorithm for constructing Nash maps locally approximating F, whose components satisfy the same relations.

The work examines norms in of fundamental trigonometric splines of odd and even degrees, which in some cases coincide with polynomial ones. Fundamental trigonometric splines for the case where the con-vergence factors depend on the…

In this paper, we give a causal solution to the problem of spline interpolation using H-infinity optimal approximation. Generally speaking, spline interpolation requires filtering the whole sampled data, the past and the future, to…

We introduce appropriate computable moduli of smoothness to characterize the rate of best approximation by multivariate polynomials on a connected and compact $C^2$-domain $\Omega\subset \mathbb{R}^d$. This new modulus of smoothness is…

We construct rigorously suitable approximate solutions to the Stokes/Cahn-Hilliard system by using the method of matched asymptotics expansions. This is a main step in the proof of convergence given in the first part of this contribution,…

We analyze finite element discretizations of scalar curvature in dimension $N \ge 2$. Our analysis focuses on piecewise polynomial interpolants of a smooth Riemannian metric $g$ on a simplicial triangulation of a polyhedral domain $\Omega…

Let $A_{p,r}^m(n)$ be the best constant that fulfills the following inequality: for every $m$-homogeneous polynomial $P(z) = \sum_{|\alpha|=m} a_{\alpha} z^{\alpha}$ in $n$ complex variables, $$\big( \sum_{|\alpha|=m} |a_{\alpha}|^{r}…