Related papers: Fast algorithms for Jacobi expansions via nonoscil…
Algorithms which compute locally optimal continuous designs often rely on a finite design space or on repeatedly solving a complex non-linear program. Both methods require extensive evaluations of the Jacobian Df of the underlying model.…
This paper studies sparse nonlinear least squares problems, where the Jacobian matrices are unavailable or expensive to compute, yet have some underlying sparse structures. We construct the Jacobian models by the $ \ell_1 $ minimization…
We develop direct and inverse scattering theory for Jacobi operators with steplike coefficients which are asymptotically close to different finite-gap quasi-periodic coefficients on different sides. We give a complete characterization of…
In this paper, we introduce a novel theoretical framework for Gaussian process regression error analysis, leveraging a function-space decomposition. Based on this framework, we develop a weighted Jacobi iterative method that utilizes…
The classical orthogonal polynomials (Hermite, Laguerre and Jacobi) are involved in a vast number of applications in physics and engineering. When large degrees $n$ are needed, the use of recursion to compute the polynomials is not a good…
Gaussian quadrature rules are a classical tool for the numerical approximation of integrals with smooth integrands and positive weight functions. We derive and expicitly list asymptotic expressions for the points and weights of Gaussian…
In this paper we review and derive hyperbolic and trigonometric double summation addition theorems for Jacobi functions of the first and second kind. In connection with these addition theorems, we perform a full analysis of the relation…
For a general third-order tensor $\mathcal{A}\in\mathbb{R}^{n\times n\times n}$ the paper studies two closely related problems, an SVD-like tensor decomposition and an (approximate) tensor diagonalization. We develop a Jacobi-type algorithm…
In this work, an efficient approximation scheme has been proposed for getting accurate approximate solution of nonlinear partial differential equations with constant or variable coefficients satisfying initial conditions in a series of…
Based upon the fast computation of the coefficients of the interpolation polynomials at Chebyshev-type points by FFT, DCT and IDST, respectively, together with the efficient evaluation of the modified moments by forwards recursions or by…
The main goal of this paper is to generalize Jacobi and Gauss-Seidel methods for solving non-square linear system. Towards this goal, we present iterative procedures to obtain an approximate solution for non-square linear system. We derive…
Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order methods for variational inequalities require precise…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We study spaces of reflectionless Jacobi matrices. The main theme is the following type of question: Given a reflectionless Jacobi matrix, is it possible to approximate it by other reflectionless and, typically, simpler Jacobi matrices of a…
We present a novel quantum algorithm for estimating Gibbs partition functions in sublinear time with respect to the logarithm of the size of the state space. This is the first speed-up of this type to be obtained over the seminal…
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
We show that for a Jacobi operator with coefficients whose (j+1)'th moments are summable the j'th derivative of the scattering matrix is in the Wiener algebra of functions with summable Fourier coefficients. We use this result to improve…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…