Related papers: Fast and accurate evaluation of dual Bernstein pol…
The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…
Solving dual quaternion equations is an important issue in many fields such as scientific computing and engineering applications. In this paper, we first introduce a new metric function for dual quaternion matrices. Then, we reformulate…
A two-variable generalization of the Big $-1$ Jacobi polynomials is introduced and characterized. These bivariate polynomials are constructed as a coupled product of two univariate Big $-1$ Jacobi polynomials. Their orthogonality measure is…
We study the inverse problem in the theory of (standard) orthogonal polynomials involving two polynomials families $(P_n)_n$ and $(Q_n)_n$ which are connected by a linear algebraic structure such as $$P_n(x)+\sum_{i=1}^N…
The approximation of solutions to second order Hamilton--Jacobi--Bellman (HJB) equations by deep neural networks is investigated. It is shown that for HJB equations that arise in the context of the optimal control of certain Markov…
A new set of multiple orthogonal polynomials of both type I and type II with respect to two weight functions involving Gauss' hypergeometric function on the interval $(0,1)$ is studied. This type of polynomials have direct applications in…
Orthogonal polynomials for a family of weight functions on $[-1,1]^2$, $$ \CW_{\a,\b,\g}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} (1-x^2)^\g(1-y^2)^{\g}, $$ are studied and shown to be related to the Koornwinder polynomials defined on the region…
We introduce polynomial couplings, a generalization of probabilistic couplings, to develop an algorithm for the computation of equivalence relations which can be interpreted as a lifting of probabilistic bisimulation to polynomial…
We investigate the differential equation for the Jacobi-type polynomials which are orthogonal on the interval $[-1,1]$ with respect to the classical Jacobi measure and an additional point mass at one endpoint. This scale of higher-order…
We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that…
We study approximation of functions by algebraic polynomials in the H\"older spaces corresponding to the generalized Jacobi translation and the Ditzian-Totik moduli of smoothness. By using modifications of the classical moduli of…
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…
In this short communication we introduce a rather simple autonomous system of 2 nonlinearly-coupled first-order Ordinary Differential Equations (ODEs), whose initial-values problem is explicitly solvable by algebraic operations. Its ODEs…
We revisit the ladder operators for orthogonal polynomials and re-interpret two supplementary conditions as compatibility conditions of two linear over-determined systems; one involves the variation of the polynomials with respect to the…
We review properties of q-orthogonal polynomials, related to their orthogonality, duality and connection with the theory of symmetric (self-adjoint) operators, represented by a Jacobi matrix. In particular, we show how one can naturally…
Dual first-order methods are powerful techniques for large-scale convex optimization. Although an extensive research effort has been devoted to studying their convergence properties, explicit convergence rates for the primal iterates have…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
An additive fast Fourier transform over a finite field of characteristic two efficiently evaluates polynomials at every element of an $\mathbb{F}_2$-linear subspace of the field. We view these transforms as performing a change of basis from…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…