Related papers: Fast associated classical orthogonal polynomial tr…
We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and…
Block tridiagonal matrices arise in applied mathematics, physics, and signal processing. Many applications require knowledge of eigenvalues and eigenvectors of block tridiagonal matrices, which can be prohibitively expensive for large…
The theory of polynomials orthogonal with respect to one inner product is classical. We discuss the extension of this theory to multiple inner products. Examples include the Lam\'e and Heine-Stieltjes polynomials.
We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…
We revisit the problem of large-scale bundle adjustment and propose a technique called Multidirectional Conjugate Gradients that accelerates the solution of the normal equation by up to 61%. The key idea is that we enlarge the search space…
We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…
In this paper, we propose an efficient numerical approach for solving a specific type of quartic inhomogeneous polynomial optimization problem inspired by practical applications. The primary contribution of this work lies in establishing an…
Solving large-scale eigenvalue problems poses a significant challenge due to the computational complexity and limitations on the parallel scalability of the orthogonalization operation, when many eigenpairs are required. In this paper, we…
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists…
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…
In the classical theory of cubic interpolation splines there exists an algorithm which works with only $O\left( n\right)$ arithmetic operations. Also, the smoothing cubic splines may be computed via the algorithm of Reinsch which reduces…
The generating function of Stieltjes-Carlitz polynomials is a solution of Heun's differential equation and using this relation Carlitz was the first to get exact closed forms for some Heun functions. Similarly the associated…
Over the last decade it has become clear that discrete Painlev\'e equations appear in a wide range of important mathematical and physical problems. Thus, the question of recognizing a given non-autonomous recurrence as a discrete Painlev\'e…
This paper discusses operators lowering or raising the degree but preserving the parameters of special orthogonal polynomials. Results for one-variable classical (q-)orthogonal polynomials are surveyed. For Jacobi polynomials associated…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
This paper presents a universal numerical scheme tailored for tackling linear integral, integro-differential, and both initial and boundary value problems of ordinary differential equations. The numerical scheme is readily adapted for…
In this paper we solve a function field analogue of classical problems in analytic number theory, concerning the auto-correlations of divisor functions, in the limit of a large finite field.
Recurrence coefficients of semi-classical orthogonal polynomials (orthogonal polynomials related to a weight function $w$ such that $w'/w$ is a rational function) are shown to be solutions of non linear differential equations with respect…
We address the problem of constructing approximations based on orthogonal polynomials that preserve an arbitrary set of moments of a given function without loosing the spectral convergence property. To this aim, we compute the constrained…
We initiate the study of a natural generalisation of the classical Bochner-Krall problem asking which linear ordinary differential operators possess sequences of eigenpolynomials satisfying linear recurrence relations of finite length; the…