Related papers: Second Order Spiral Splines
The paper is devoted to problem of spline approximation. A new method of nodes location for curves and surfaces computer construction by means of B-splines and results of simulink-modeling is presented. The advantages of this paper is that…
Numerically obtaining the inverse of a function is a common task for many scientific problems, often solved using a Newton iteration method. Here we describe an alternative scheme, based on switching variables followed by spline…
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a long-standing open problem to establish a tight upper bound…
We study the relation between the type of a double point of a plane curve and the curvilinear 0-dimensional subschemes of the curve at the point. An Algorithm related to a classical procedure for the study of double points via osculating…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
A new O(nlog(n)) algorithm is presented for performing Delaunay triangulation of sets of 2D points. The novel component of the algorithm is a radially propagating \emph{sweep-hull} (sequentially created from the radially sorted set of 2D…
We present a unified theory of linear spiral structure in stellar disks. We begin by identifying the characteristic scales involved in the spiral structure problem and listing some quantitative requirements of a successful theory. We then…
We introduce a novel analysis technique for pulsar secondary spectra. The power spectrum of pulsar scintillation (referred to as the "secondary spectrum") shows differential delays and Doppler shifts due to interference from multi-path…
There are two standard ways of peeling an orange: either cut the skin along meridians, or cut it along a spiral. We consider here the second method, and study the shape of the spiral strip, when unfolded on a table. We derive a formula that…
We investigate fractal aspects of elliptical polynomial spirals; that is, planar spirals with differing polynomial rates of decay in the two axis directions. We give a full dimensional analysis of these spirals, computing explicitly their…
We use stable maps, and their stable lifts to the Semple bundle variety of second-order curvilinear data, to calculate certain characteristic numbers for rational plane curves. These characteristic numbers involve first-order (tangency) and…
We develop a mapping between the factorial moments of the second order $F_2$ and the correlation integral $C$. We formulate a fast computation technique for the evaluation of both, which is more efficient, compared to conventional methods,…
Second-order methods, which utilize gradients as well as Hessians to optimize a given function, are of major importance in mathematical optimization. In this work, we prove tight bounds on the oracle complexity of such methods for smooth…
This paper introduces an efficient second-order method for solving the elastic net problem. Its key innovation is a computationally efficient technique for injecting curvature information in the optimization process which admits a strong…
The total generalized variation extends the total variation by incorporating higher-order smoothness. Thus, it can also suffer from similar discretization issues related to isotropy. Inspired by the success of novel discretization schemes…
This paper reviews a class of univariate piecewise polynomial functions known as discrete splines, which share properties analogous to the better-known class of spline functions, but where continuity in derivatives is replaced by (a…
We introduce Spiral, a third-order integration algorithm for the rotational motion of extended bodies. It requires only one force calculation per time step, does not require quaternion normalization at each time step, and can be formulated…
This paper proposes an image interpolation algorithm exploiting sparse representation for natural images. It involves three main steps: (a) obtaining an initial estimate of the high resolution image using linear methods like FIR filtering,…
We present a generalization of the notoriously unwieldy second-order scattering fading model, which is helpful to alleviate its mathematical complexity while providing an additional degree of freedom. This is accomplished by allowing its…
Higher order cumulants of point processes, such as skew and kurtosis, require significant computational effort to calculate. The traditional counts-in-cells method implicitly requires a large amount of computation since, for each sampling…