Related papers: Representation of conformal maps by rational funct…
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…
Conformal harmonic maps from a 4-dimensional conformal manifold to a Riemannian manifold are maps satisfying a certain conformally invariant fourth order equation. We prove a general existence result for conformal harmonic maps, analogous…
Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…
Let $S$ be a rational projective surface given by means of a projective rational parametrization whose base locus satisfies a mild assumption. In this paper we present an algorithm that provides three rational maps $f,g,h:\mathbb{A}^2 --\to…
Consider a rational map from a projective space to a product of projective spaces, induced by a collection of linear projections. Motivated by the the theory of limit linear series and Abel-Jacobi maps, we study the basic properties of the…
We show that, given a non-degenerate, finitely connected domain $D$, its boundary, and the number of its boundary components, it is possible to compute a conformal mapping of $D$ onto a circular domain \emph{without} prior knowledge of the…
Functions of one or more variables are usually approximated with a basis: a complete, linearly-independent system of functions that spans a suitable function space. The topic of this paper is the numerical approximation of functions using…
We give a complete characterization of degree two rational maps with potential good reduction over local fields. We show this happens exactly when the map corresponds to an integral point in the moduli space. We detail an algorithm by which…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
Feynman diagrams are calculated by means of their Taylor series expansion in terms of external momenta squared. It is demonstrated in various examples that by the application of conformal mapping and Pad\'{e} approximants, it is possible to…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
We give an algorithm for finding conformal mappings onto the upper half-plane and conformal modules of some types of polygons. The polygons are obtained by stretching along the real axis polyominoes i.e., polygons which are connected unions…
We study the convergence of a family of numerical integration methods where the numerical integral is formulated as a finite matrix approximation to a multiplication operator. For bounded functions, the convergence has already been…
We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…
Aligning partially overlapping point sets where there is no prior information about the value of the transformation is a challenging problem in computer vision. To achieve this goal, we first reduce the objective of the robust point…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
We present effective numerical algorithms for locally recovering unknown governing differential equations from measurement data. We employ a set of standard basis functions, e.g., polynomials, to approximate the governing equation with high…
We prove new upper bounds on the number of representations of rational numbers $\frac{m}{n}$ as a sum of $4$ unit fractions, giving five different regions, depending on the size of $m$ in terms of $n$. In particular, we improve the most…
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…