Related papers: Accurate complex Jacobi rotations
Classical Jacobi polynomials $P_{n}^{(\alpha,\beta)}$, with $\alpha, \beta>-1$, have a number of well-known properties, in particular the location of their zeros in the open interval $(-1,1)$. This property is no longer valid for other…
We present a simulation code which can solve broad ranges of partial differential equations in a full sphere. The code expands tensorial variables in a spectral series of spin-weighted spherical harmonics in the angular directions and a…
The error function of real argument can be uniformly approximated to a given accuracy by a single closed-form expression for the whole variable range either in terms of addition, multiplication, division, and square root operations only, or…
A complete characterization is provided of Hankel matrices commuting with Jacobi matrices which correspond to hypergeometric orthogonal polynomials from the Askey scheme. It follows, as the main result of the paper, that the generalized…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…
We derive the loop equations for the d-dimensional n-Hermitian matrix model. These are a consequence of the Schwinger-Dyson equations of the model. Moreover we show that in leading order of large $N$ the loop equations form a closed set. In…
Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we…
This paper presents a posteriori error estimates for conforming numerical approximations of eigenvalue clusters of second-order self-adjoint elliptic linear operators with compact resolvent. Given a cluster of eigenvalues, we estimate the…
When $k$ is a field, the classical Jacobian criterion computes the singular locus of an equidimensional, finitely generated $k$-algebra as the closed subset of an ideal generated by appropriate minors of the so-called Jacobian matrix.…
We analyse the complexity of computing class polynomials, that are an important ingredient for CM constructions of elliptic curves, via complex floating point approximations of their roots. The heart of the algorithm is the evaluation of…
$k$-diagonal circulant matrices and cyclic banded matrices are widely used in numerical simulations and signal processing of circular linear systems. Algorithms that directly involve or specify linear or quadratic complexity for the…
Diagonalization of a large matrix is the computational bottleneck in many applications such as electronic structure calculations. We show that a speedup of over 30% can be achieved by exploiting 32-bit floating point operations, while…
In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic…
We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals with the issues of numerical errors and degenerate cases in…
In this paper, we compute the expectation of traces of powers of the hermitian matrix Jacobi process for a large enough but fixed size. To proceed, we first derive the semi-group density of its eigenvalues process as a bilinear series of…
This paper revisits the topic of rotation estimation through the lens of special unitary matrices. We begin by reformulating Wahba's problem using $SU(2)$ to derive multiple solutions that yield linear constraints on corresponding…
This article studies the application of the Jacobi-Eisenhart lift, Jacobi metric and Maupertius transformation to the Kepler system. We start by reviewing fundamentals and the Jacobi metric. Then we study various ways to apply the lift to…
The goals of this paper are to obtain theoretical models of what happens when a computer calculates the rotation set of a homeomorphism, and to find a good algorithm to perform simulations of this rotation set. To do that we introduce the…
We show that quantum search can be used to compute the hardness to round an elementary function, that is, to determine the minimum working precision required to compute the values of an elementary function correctly rounded to a target…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…