Related papers: Error and symmetry analysis of Misner's algorithm …
Hermite polynomials and functions have extensive applications in scientific and engineering problems. Although it is recognized that employing the scaled Hermite functions rather than the standard ones can remarkably enhance the…
Symmetry problems in harmonic analysis are formulated and solved. One of these problems is equivalent to the refined Schiffer's conjecture which was recently proved by the author. Let $k=const>0$ be fixed, $S^2$ be the unit sphere in…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
In this pedagogically structured article, we describe a generalized harmonic formulation of the Einstein equations in spherical symmetry which is regular at the origin. The generalized harmonic approach has attracted significant attention…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
We present a quantum algorithm for calculating the vibronic spectrum of a molecule, a useful but classically hard problem in chemistry. We show several advantages over previous quantum approaches: vibrational anharmonicity is naturally…
In this article we introduce a numerical algorithm for finding harmonic mappings by using the shear construction introduced by Clunie and Sheil-Small in 1984. The MATLAB implementation of the algorithm is based on the numerical conformal…
The derivation of spherical harmonics is the same in nearly every quantum mechanics textbook and classroom. It is found to be difficult to follow, hard to understand, and challenging to reproduce by most students. In this work, we show how…
The spherical harmonic transform is a powerful tool in the analysis of spherical data sets, such as the cosmic microwave background data. In this work, we present a new scheme for the spherical harmonic transforms that supports both CPU and…
The natural approach to a spectral analysis of data distributed on the sky employs spherical harmonic decomposition. A common problem encountered in practical astronomy is the lack of full sky coverage in the available data. For example,…
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
By the collective name of {\it lattice counting} we refer to a setup introduced in Duke-Rudnick-Sarnak that aim to establish a relationship between arithmetic and randomness in the context of affine symmetric spaces. In this paper we extend…
Quantum computing is emerging as a new computing resource that could be superior to conventional computing for certain classes of optimization problems. However, in principle, most existing approaches to quantum optimization are intended to…
We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…
There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M). For instance, by truncating all the vertices of a map…
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
The solution in sense of Prager&Synge is the alternative to the commonly used notion of the numerical solution, which is considered as a limit of grid functions at mesh refinement. Prager&Synge solution is defined as a hypersphere…
We investigate numerical methods for wave equations in $n+2$ spacetime dimensions, written in spherical coordinates, decomposed in spherical harmonics on $S^n$, and finite-differenced in the remaining coordinates $r$ and $t$. Such an…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…