Related papers: Fast algorithms for Jacobi expansions via nonoscil…
In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its…
We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
We present a methodology for numerically integrating ordinary differential equations containing rapidly oscillatory terms. This challenge is distinct from that for differential equations which have rapidly oscillatory solutions: here the…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton-Jacobi-Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used…
We look for differential equations satisfied by the generalized Jacobi polynomials which are orthogonal on the interval [-1,1] with respect to a weight function consisting of the classical Jacobi weight function together with point masses…
We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the…
This paper presents a novel Jacobi-style iteration algorithm for solving the problem of distributed submodular maximization, in which each agent determines its own strategy from a finite set so that the global submodular objective function…
We study the orthogonal polynomials associated with the equilibrium measure, in logarithmic potential theory, living on the attractor of an Iterated Function System. We construct sequences of discrete measures, that converge weakly to the…
Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems. Our algorithm performs…
In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…
Sturm-Liouville oscillation theory is studied for Jacobi operators with block entries given by covariant operators on an infinite dimensional Hilbert space. It is shown that the integrated density of states of the Jacobi operator is…
We show how all the quantal systems related to the exceptional Laguerre and Jacobi polynomials can be constructed in a direct and systematic way, without the need of shape invariance and Darboux-Crum transformation. Furthermore, the…
Simple asymptotic expansions for the Jacobi functions $P_\nu^{(\alpha, \beta)}(z)$ and $Q_\nu^{(\alpha, \beta)}(z)$ for large degree $\nu$, with fixed parameters $\alpha$ and $\beta$, are surprisingly rare in the literature, with only a few…
We perform the spectral analysis of a family of Jacobi operators $J(\alpha)$ depending on a complex parameter $\alpha$. If $|\alpha|\neq1$ the spectrum of $J(\alpha)$ is discrete and formulas for eigenvalues and eigenvectors are established…
We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an…
We give an algorithm to compute $N$ steps of a convolution quadrature approximation to a continuous temporal convolution using only $O(N \log N)$ multiplications and $O(\log N)$ active memory. The method does not require evaluations of the…
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…