Related papers: Algebraic Curve Interpolation for Intervals via Sy…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…
We revisit the problem of solving the one-dimensional wave equation on a domain with moving boundary. In J. Math. Phys. 11, 2679 (1970), Moore introduced an interesting method to do so. As only in rare cases, a closed analytical solution is…
We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
Given a smooth complex variety $X$, an algebraically skew embedding of $X$ is an embedding of $X$ into a complex projective space $\mathbb{P}^N$ such that for any two points $x,y\in X$, their embedded tangent spaces in $\mathbb{P}^N$ do not…
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
It is often of interest to infer lower-dimensional structure underlying complex data. As a flexible class of non-linear structures, it is common to focus on Riemannian manifolds. Most existing manifold learning algorithms replace the…
We describe a strategy for solving nonlinear eigenproblems numerically. Our approach is based on the approximation of a vector-valued function, defined as solution of a non-homogeneous version of the eigenproblem. This approximation step is…
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the blue set, red points…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the…
The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…
Any ultrafast optical spectroscopy experiment is usually accompanied by the necessary routine of ultrashort-pulse characterisation. The majority of pulse characterisation approaches solve either a one-dimensional (e.g. via interferometry)…
We prove new bounds on the number of incidences between points and higher degree algebraic curves. The key ingredient is an improved initial bound, which is valid for all fields. Then we apply the polynomial method to obtain global bounds…
This paper presents a novel set-based computing method, called interval superposition arithmetic, for enclosing the image set of multivariate factorable functions on a given domain. In order to construct such enclosures, the proposed…
Converting a parametric curve into the implicit form, which is called implicitization, has always been a popular but challenging problem in geometric modeling and related applications. However, the existing methods mostly suffer from the…
We construct cubature methods on scattered data via resampling on the support of known algebraic cubature formulas, by different kinds of adaptive interpolation (polynomial, RBF, PUM). This approach gives a promising alternative to other…
In this paper, we give improved bounds for the computational complexity of computing with planar algebraic curves. More specifically, for arbitrary coprime polynomials $f$, $g \in \mathbb{Z}[x,y]$ and an arbitrary polynomial $h \in…