1,489 research outputs found
B\'ezier curves that are close to elastica
We study the problem of identifying those cubic B\'ezier curves that are
close in the L2 norm to planar elastic curves. The problem arises in design
situations where the manufacturing process produces elastic curves; these are
difficult to work with in a digital environment. We seek a sub-class of special
B\'ezier curves as a proxy. We identify an easily computable quantity, which we
call the lambda-residual, that accurately predicts a small L2 distance. We then
identify geometric criteria on the control polygon that guarantee that a
B\'ezier curve has lambda-residual below 0.4, which effectively implies that
the curve is within 1 percent of its arc-length to an elastic curve in the L2
norm. Finally we give two projection algorithms that take an input B\'ezier
curve and adjust its length and shape, whilst keeping the end-points and
end-tangent angles fixed, until it is close to an elastic curve.Comment: 13 pages, 15 figure
Ellipse-preserving Hermite interpolation and subdivision
We introduce a family of piecewise-exponential functions that have the
Hermite interpolation property. Our design is motivated by the search for an
effective scheme for the joint interpolation of points and associated tangents
on a curve with the ability to perfectly reproduce ellipses. We prove that the
proposed Hermite functions form a Riesz basis and that they reproduce
prescribed exponential polynomials. We present a method based on Green's
functions to unravel their multi-resolution and approximation-theoretic
properties. Finally, we derive the corresponding vector and scalar subdivision
schemes, which lend themselves to a fast implementation. The proposed vector
scheme is interpolatory and level-dependent, but its asymptotic behaviour is
the same as the classical cubic Hermite spline algorithm. The same convergence
properties---i.e., fourth order of approximation---are hence ensured
Scattered data fitting on surfaces using projected Powell-Sabin splines
We present C1 methods for either interpolating data or for fitting scattered data associated with a smooth function on a two-dimensional smooth manifold Ī© embedded into R3. The methods are based on a local bivariate Powell-Sabin interpolation scheme, and make use of local projections on the tangent planes. The data fitting method is a two-stage method. We illustrate the performance of the algorithms with some numerical examples, which, in particular, confirm the O(h3) order of convergence as the data becomes dens
Classical and Quantum Complexity of the Sturm-Liouville Eigenvalue Problem
We study the approximation of the smallest eigenvalue of a Sturm-Liouville
problem in the classical and quantum settings. We consider a univariate
Sturm-Liouville eigenvalue problem with a nonnegative function from the
class and study the minimal number n(\e) of function evaluations
or queries that are necessary to compute an \e-approximation of the smallest
eigenvalue. We prove that n(\e)=\Theta(\e^{-1/2}) in the (deterministic)
worst case setting, and n(\e)=\Theta(\e^{-2/5}) in the randomized setting.
The quantum setting offers a polynomial speedup with {\it bit} queries and an
exponential speedup with {\it power} queries. Bit queries are similar to the
oracle calls used in Grover's algorithm appropriately extended to real valued
functions. Power queries are used for a number of problems including phase
estimation. They are obtained by considering the propagator of the discretized
system at a number of different time moments. They allow us to use powers of
the unitary matrix , where is an
matrix obtained from the standard discretization of the Sturm-Liouville
differential operator. The quantum implementation of power queries by a number
of elementary quantum gates that is polylog in is an open issue.Comment: 33 page
The linear algebra of interpolation with finite applications giving computational methods for multivariate polynomials
Thesis (Ph.D.) University of Alaska Fairbanks, 1988Linear representation and the duality of the biorthonormality relationship express the linear algebra of interpolation by way of the evaluation mapping. In the finite case the standard bases relate the maps to Gramian matrices. Five equivalent conditions on these objects are found which characterize the solution of the interpolation problem. This algebra succinctly describes the solution space of ordinary linear initial value problems. Multivariate polynomial spaces and multidimensional node sets are described by multi-index sets. Geometric considerations of normalization and dimensionality lead to cardinal bases for Lagrange interpolation on regular node sets. More general Hermite functional sets can also be solved by generalized Newton methods using geometry and multi-indices. Extended to countably infinite spaces, the method calls upon theorems of modern analysis
- ā¦