Related papers: Fast polynomial transforms based on Toeplitz and H…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…
Computational chemistry at the atomic level has largely branched into two major fields, one based on quantum mechanics and the other on molecular mechanics using classical force fields. Because of high computational costs, quantum…
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
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…
Recovering a signal (function) from finitely many binary or Fourier samples is one of the core problems in modern medical imaging, and by now there exist a plethora of methods for recovering a signal from such samples. Examples of methods,…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We discuss a fast approximate solution to the associated classical -- classical orthogonal polynomial connection problem. We first show that associated classical orthogonal polynomials are solutions to a fourth-order quadratic eigenvalue…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
The computational complexity of different steps of the basic SSA is discussed. It is shown that the use of the general-purpose "blackbox" routines (e.g. found in packages like LAPACK) leads to huge waste of time resources since the special…
Computing nonlinear functions over multilinear forms is a general problem with applications in risk analysis. For instance in the domain of energy economics, accurate and timely risk management demands for efficient simulation of millions…
It is known that Goertzel's algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. \cite{gen:69}). In order to improve accuracy we propose modifications of both Goertzel's and Horner's algorithms based on the…
We make a new attempt at the recently suggested program to express knot polynomials through topological vertices, which can be considered as a possible approach to the tangle calculus: we discuss the Macdonald deformation of the relation…
This paper studies the effects on Zernike coefficients of aperture scaling, translation and rotation, when a given aberrated wavefront is described on the Zernike polynomial basis. It proposes a new analytical method for computing the…
We show that the time evolution operator of kicked quantum systems, although a full matrix of size NxN, can be diagonalized with the help of a new method based on a suitable combination of fast Fourier transform and Lanczos algorithm in…
We revisit the Fourier transform of a Hankel function, of considerable importance in the theory of knife edge diffraction. Our approach is based directly upon the underlying Bessel equation, which admits manipulation into an alternate…
We study matrix integration over the classical Lie groups $U(N),Sp(2N),O(2N)$ and $O(2N+1)$, using symmetric function theory and the equivalent formulation in terms of determinants and minors of Toeplitz$\pm$Hankel matrices. We establish a…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
We obtain an extension of the Christoffel--Darboux formula for matrix orthogonal polynomials with a generalized Hankel symmetry, including the Adler-van Moerbeke generalized orthogonal polynomials.
In the article we develop Euler-Lagrange method and calculate all the roots of an arbitrary complex polynomial $P(z)$ on the base of calculation (similar to the Bernoulli-Aitken-Nikiporets methods) of the limits of ratios of Hadamard…