Related papers: Optimal one-sided approximants of circular arc
When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given…
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
The paper deals with two fundamental types of trigonometric polynomials and splines on uniform grids, which allow us to construct interpolation approximations that depend linearly on the values of the interpolated function. Fundamental on…
The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…
The method for approximation of planar curve by circular arcs with length preservation, proposed by I.Kh. Sabitov and A.V. Slovesnov, is analyzed. We extend the applicability of the method, and consider some corollaries, not related to the…
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…
Consider an arrangement of $k$ lines intersecting the unit square. There is some minimum scaling factor so that any placement of a rectangle with aspect ratio $1 \times p$ with $p\geq 1$ must non-transversely intersect some portion of the…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
To approximate solutions of a linear differential equation, we project, via trigonometric interpolation, its solution space onto a finite-dimensional space of trigonometric polynomials and construct a matrix representation of the…
For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
How good is a triangulation as an approximation of a smooth curved surface or manifold? We provide bounds on the {\em interpolation error}, the error in the position of the surface, and the {\em normal error}, the error in the normal…
We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…
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…
Integration over curved manifolds with higher codimension and, separately, discrete variants of continuous operators, have been two important, yet separate themes in harmonic analysis, discrete geometry and analytic number theory research.…
The analysis of complex nonlinear systems is often carried out using simpler piecewise linear representations of them. A principled and practical technique is proposed to linearize and evaluate arbitrary continuous nonlinear functions using…
This paper applies a complete parametric set for approximating the geometry of a quadrilateral element. The approximation basis used is a complete Pascal polynomial of second order with six free parameters. The interpolation procedure is a…
In undergraduate classes, the potential flow that goes around a circular cylinder is designed for complemental understanding of mathematical technique to handle the Laplace equation with Neumann boundary conditions and the physical concept…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…