Related papers: Computing planar and spherical choreographies
In this article, we present a space-frequency theory for spherical harmonics based on the spectral decomposition of a particular space-frequency operator. The presented theory is closely linked to the theory of ultraspherical polynomials on…
This paper aims to design quadrotor swarm performances, where the swarm acts as an integrated, coordinated unit embodying moving and deforming objects. We divide the task of creating a choreography into three basic steps: designing swarm…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
We give a description of numerical Newton algorithm on a constraint manifold using only the ambient coordinates (usually Euclidean coordinates) and the geometry of the constraint manifold. We apply the numerical Newton algorithm on a sphere…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
A numerical method is developed for solving a system of partial differential equations modeling the flow of a nematic liquid crystal fluid with stretching effect, which takes into account the geometrical shape of its molecules. This system…
We introduce an extended Kepler-Coulomb quantum model in spherical coordinates. The Schr\"{o}dinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…
Many real life problems can be reduced to the solution of a complex exponentials approximation problem which is usually ill posed. Recently a new transform for solving this problem, formulated as a specific moments problem in the plane, has…
We revisit two NP-hard geometric partitioning problems - convex decomposition and surface approximation. Building on recent developments in geometric separators, we present quasi-polynomial time algorithms for these problems with improved…
In this paper, we use Proximal Cubic regularized Newton Methods (PCNM) to optimize the sum of a smooth convex function and a non-smooth convex function, where we use inexact gradient and Hessian, and an inexact subsolver for the cubic…
We consider the homogenized linear feasibility problem, to find an $x$ on the unit sphere, satisfying $n$ line ar inequalities $a_i^Tx\ge 0$. To solve this problem we consider the centers of the insphere of spherical simpl ices, whose…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
In this paper, we first summarize the existing algorithms for computing all the generalized asymptotes of a plane algebraic curve implicitly or parametrically defined. From these previous results, we derive a method that allows to easily…
We examine the relative performance of algorithms for the calculation of curvature in spacetime. The classical coordinate component method is compared to two distinct versions of the Newman-Penrose tetrad approach for a variety of…
The aim of this paper is to introduce our idea of Holonomic Quantum Computation (Computer). Our model is based on both harmonic oscillators and non-linear quantum optics, not on spins of usual quantum computation and our method is moreover…
In this paper, we discuss the problem of minimizing the sum of two convex functions: a smooth function plus a non-smooth function. Further, the smooth part can be expressed by the average of a large number of smooth component functions, and…
This paper proposes a sketching strategy based on spherical designs, which is applied to the classical spherical basis function approach for massive spherical data fitting. We conduct theoretical analysis and numerical verifications to…
It is shown that all spherical symmetric potentials are capable of producing dynamical symmetries in classical one-body motions, thanks to the inevitable existence of symmetry axes associated with turning points for corresponding…