Related papers: Efficient modified Jacobi-Bernstein basis transfor…
In this article, we design fast algorithms for the computation of approximant bases in shifted Popov normal form. We first recall the algorithm known as PM-Basis, which will be our second fundamental engine after polynomial matrix…
It is shown in "SIAM J. Sci. Comput. 39 (2017):B424-B441" that free-form curves used in computer aided geometric design can usually be represented as the solutions of linear differential systems and points and derivatives on the curves can…
Bayesian Optimization (BO) has shown great promise for the global optimization of functions that are expensive to evaluate, but despite many successes, standard approaches can struggle in high dimensions. To improve the performance of BO,…
By studying the existing higher order derivation formulas of rational B\'{e}zier curves, we find that they fail when the order of the derivative exceeds the degree of the curves. In this paper, we present a new derivation formula for…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
An extension to triangular domains of the univariate q-Bernstein basis functions is introduced and analyzed. Some recurrence relations and properties such as partition of unity and degree elevation are proved for them. It is also proved…
We extend the formulae of classical invariant theory for the Jacobian of a genus one curve of degree $n \le 4$ to curves of arbitrary degree. To do this, we associate to each genus one normal curve of degree $n$, an $n \times n$ alternating…
Iterated Bernstein polynomial approximations of degree n for continuous function which also use the values of the function at i/n, i=0,1,...,n, are proposed. The rate of convergence of the classic Bernstein polynomial approximations is…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
In this work, we study the iteration complexity of gradient methods for minimizing convex quadratic functions regularized by powers of Euclidean norms. We show that, due to the uniform convexity of the objective, gradient methods have…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…
We prove a weak converse estimate for the simultaneous approximation by several forms of the Bernstein polynomials with integer coefficients. It is stated in terms of moduli of smoothness. In particular, it yields a big $O$-characterization…
A Bernstein type inequality is obtained for the Jacobi polynomials $P_n^{\alpha,\beta}(x)$, which is uniform for all degrees $n\ge0$, all real $\alpha,\beta\ge0$, and all values $x\in [-1,1]$. It provides uniform bounds on a complete set of…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
A novel and highly efficient computational framework for reconstructing binary-type images suitable for models of various complexity seen in diverse biomedical applications is developed and validated. Efficiency in computational speed and…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
We generalize univariate multipoint evaluation of polynomials of degree n at sublinear amortized cost per point. More precisely, it is shown how to evaluate a bivariate polynomial p of maximum degree less than n, specified by its n^2…
Given a graph $G=(V, E)$ and and a proper labeling $f$ from $V$ to $\{1, ..., n\}$, we define $B(f)$ as the maximum absolute difference between $f(u)$ and $f(v)$ where $(u,v)\in E$. The bandwidth of $G$ is the minimum $B(f)$ for all $f$.…
This paper is concerned with the complexity and stability of arithmetic operations in the jacobian variety of curves over the field of complex numbers, as the genus grows to infinity. We focus on modular curves. Efficient and stable…
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…