Related papers: A Stieltjes algorithm for generating multivariate …
A randomized Gram-Schmidt algorithm is developed for orthonormalization of high-dimensional vectors or QR factorization. The proposed process can be less computationally expensive than the classical Gram-Schmidt process while being at least…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
First, we show that Sturm algorithm and Sylvester algorithm, which compute the number of real roots of a given univariate polynomial, lead to two dual tridiagonal determinantal representations of the polynomial. Next, we show that the…
This paper analyzes inverse scattering for the one-dimensional Helmholtz equation in the case where the wave speed is piecewise constant. Scattering data recorded for an arbitrarily small interval of frequencies is shown to determine the…
We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…
An extended range of energy stable flux reconstruction schemes, developed using a summation-by-parts approach, is presented on quadrilateral elements for various sets of polynomial bases. For the maximal order bases, a new set of correction…
We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…
Rational Krylov subspaces have become a reference tool in dimension reduction procedures for several application problems. When data matrices are symmetric, a short-term recurrence can be used to generate an associated orthonormal basis. In…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…
We provide necessary and sufficient conditions for the Hessenberg recurrence matrix associated with a system of multiple orthogonal polynomials to admit a factorisation as a product of bidiagonal matrices. Using the Gauss-Borel…
Solving (Stampacchia) variational inequalities (SVIs) is a foundational problem at the heart of optimization. However, this expressivity comes at the cost of computational hardness. As a result, most research has focused on carving out…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
We investigate the fluctuations around the mean of the Stieltjes transform of the empirical spectral distribution of any selfadjoint noncommutative polynomial in a Wigner matrix and a deterministic diagonal matrix. We obtain the convergence…
The efficient solution of large-scale multiterm linear matrix equations is a challenging task in numerical linear algebra, and it is a largely open problem. We propose a new iterative scheme for symmetric and positive definite operators,…
The theory of bi-orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to…
In this paper we present some applications of the Stieltjes constants including, for example, new derivations of Binet's formulae for the log gamma function and the evaluation of some integrals related to the Barnes multiple gamma…
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
We investigate polynomials that satisfy simultaneous orthogonality conditions with respect to several measures on the unit circle. We generalize the direct and inverse Szeg\H{o} recurrence relations, identify the analogues of the Verblunsky…