Related papers: Algorithms and Identities for B$\acute{e}$zier cur…
We consider the problem of B\'{e}zier curves/surfaces subdivision using blossoms. We propose closed-form formulae for blossoms evaluation, as needed for the calculation of control points. This approach leads to direct and efficient way to…
In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index $\alpha \in {\left(-\infty \, , \, 0 \right)}\cup {\left(1 \, , \,…
A new differential-recurrence relation for the B-spline functions of the same degree is proved. From this relation, a recursive method of computing the coefficients of B-spline functions of degree $m$ in the Bernstein-B\'{e}zier form is…
This study aims on proposing a new structure for constructing Bernstein-like bases. The structure uses an auxiliary function and a shape parameter to construct a new family of bases from any family of blending functions. The new family of…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
In this paper, we use the blending functions of Bernstein polynomials with shifted knots for construction of Bezier curves and surfaces. We study the nature of degree elevation and degree reduction for Bezier Bernstein functions with…
We show that the generalized Bernstein bases in Muntz spaces defined by Hirschman and Widder [7] and extended by Gelfond [6] can be obtained as limits of the Chebyshev-Bernstein bases in Muntz spaces with respect to an interval [a,1] as the…
New differential-recurrence relations for B-spline basis functions are given. Using these relations, a recursive method for finding the Bernstein-B\'{e}zier coefficients of B-spline basis functions over a single knot span is proposed. The…
We introduce a novel quantum algorithm for the lattice Boltzmann method (LBM) based on the one-step simplified LBM. The structure of the algorithm allows for more flexibility in modelling different physics in contrast to earlier quantum…
In order to construct quantum trigonometric B\'ezier curves with shape parameter, one parameter family of trigonometric Bernstein basis functions are introduced. We study the total positivity of the basis functions to analyze the shape…
This is a set of lecture notes used in a graduate topic class in applied mathematics called ``Quantum Algorithms for Scientific Computation'' at the Department of Mathematics, UC Berkeley during the fall semester of 2021. These lecture…
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…
Hybrid quantum-classical computing in the noisy intermediate-scale quantum (NISQ) era with variational algorithms can exhibit barren plateau issues, causing difficult convergence of gradient-based optimization techniques. In this paper, we…
In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier curves based on (p,q)-integers is introduced. We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new curves have…
Bernstein polynomials and B\'ezier curves play an important role in computer-aided geometric design and numerical analysis, and their study relates to mathematical fields such as abstract algebra, algebraic geometry and probability theory.…
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer,…
New geometric methods for fast evaluation of derivatives of polynomial and rational B\'{e}zier curves are proposed. They apply an algorithm for evaluating polynomial or rational B\'{e}zier curves, which was recently given by the authors.…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
In the paper, we show that the transformations between modified Jacobi and Bernstein bases of the constrained space of polynomials of degree at most $n$ can be performed with the complexity $O(n^2)$. As a result, the algorithm of degree…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…