Related papers: Fast and Simple Methods For Computing Control Poin…
In this paper we obtain an explicit formula for the number of curves in a compact complex surface $X$ (passing through the right number of generic points), that has up to one node and one singularity of codimension $k$, provided the total…
We revisit certain problems of pose estimation based on 3D--2D correspondences between features which may be points or lines. Specifically, we address the two previously-studied minimal problems of estimating camera extrinsics from $p \in…
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
A fast algorithm (linear in the degrees of freedom) for the solution of linear variable-coefficient rational-order fractional integral and differential equations is described. The approach is related to the ultraspherical method for…
A polynomial time algorithm which detects all paths and cycles of all lengths in form of vertex pairs (start, finish).
In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…
In a previous paper [11] we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D, and converge to limit…
In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use 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…
Quantum control is an important logical primitive of quantum computing programs, and an important concept for equational reasoning in quantum graphical calculi. We show that controlled diagrams in the ZXW-calculus admit rich algebraic…
We consider the problem of uncertainty quantification in change point regressions, where the signal can be piecewise polynomial of arbitrary but fixed degree. That is we seek disjoint intervals which, uniformly at a given confidence level,…
Our work presents a new iterative scheme to approximate the fixed points of nonexpansive mapping. The proposed algorithm is constructed to enhance convergence efficiency while preserving theoretical robustness. Under appropriate assumptions…
In this article, we introduce and investigate polynomial curvelets on spheres, which form a class of Parseval frames for $L^2(\mathbb{S}^{d-1})$, $d \geq 3$. The proposed construction offers a directionally sensitive multiscale…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
We discuss some research problems on affine monomial curves, from the perspective of computation.
This document is a companion for the Maple program \textbf{Summing a polynomial function over integral points of a polygon}. It contains two parts. First, we see what this programs does. In the second part, we briefly recall the…
This study presents the derivation of a recursive formula for integrals of products of $N$ Hermite polynomials, establishing a numerically stable scheme for their accurate evaluation in computer codes. The derivation is notably simple and…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…