Related papers: Short note on the mass matrix for Gauss-Lobatto gr…
A question going back to Halmos asks when two approximately commuting matrices of a certain kind are close to exactly commuting matrices of the same kind. It has long been known that there is a winding number obstruction for approximately…
We show that the central finite difference formula for the first and the second derivative of a function can be derived, in the context of quantum mechanics, as matrix elements of the momentum and kinetic energy operators using, as a basis…
The Gauss-Jordan elimination algorithm is extended to reduce a row-finite $\omega\times\omega$ matrix to lower row-reduced form, founded on a strategy of rightmost pivot elements. Such reduced matrix form preserves row equivalence, unlike…
We study a matrix analog of the Erd\H{o}s-Falconer distance problems in vector spaces over finite fields. There arises an interesting analysis of certain quadratic matrix Gauss sums.
We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
We use Matrix Analysis to prove a general decoupling inequality for finite Gaussian vectors, in identifying a new region of the inherent $p$ exponent, for the validity of this one.
We define the generalized logarithmic Gauss map for algebraic varieties of the complex algebraic torus of any codimension. Moreover, we describe the set of critical points of the logarithmic mapping restricted to our variety, and we show an…
We introduce a fast algorithm for entry-wise evaluation of the Gauss-Newton Hessian (GNH) matrix for the fully-connected feed-forward neural network. The algorithm has a precomputation step and a sampling step. While it generally requires…
Starting from a total Lagrangian describing an oscillator-bath system, a novel derivation of exact quantum propagator is presented. Having the quantum propagator, the exact density matrix, reduced density matrix of the main oscillator and…
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast…
Highly oscillatory integrals of composite type arise in electronic engineering and their calculations is a challenging problem. In this paper, we propose two Gaussian quadrature rules for computing such integrals. The first one is…
A formula is given for the propagation of errors during matrix inversion. An explicit calculation for a 2 by 2 matrix using both the formula and a Monte Carlo calculation are compared. A prescription is given to determine when a matrix with…
We present a fast Gauss transform in one dimension using nearly optimal sum-of-exponentials approximations of the Gaussian kernel. For up to about ten-digit accuracy, the approximations are obtained via best rational approximations of the…
In order to precondition Toeplitz systems, we present a new class of simultaneously diagonalizable real matrices, the Gamma-matrices, which include both symmetric circulant matrices and a subclass of the set of all reverse circulant…
It is shown that gravitational lensing by point masses arranged in an infinitely extended regular lattice can be studied analytically using the Weierstrass functions. In particular, we draw the critical curves and the caustic networks for…
We present a new approach to gravitational lens massmap reconstruction. Our massmap solutions perfectly reproduce the positions, fluxes, and shears of all multiple images. And each massmap accurately recovers the underlying mass…
This paper addresses the numerical solution of the matrix square root problem. Two fixed point iterations are proposed by rearranging the nonlinear matrix equation $A - X^2 = 0$ and incorporating a positive scaling parameter. The proposals…
A general class of Newton algorithms on Gra{\ss}mann and Lagrange-Gra{\ss}mann manifolds is introduced, that depends on an arbitrary pair of local coordinates. Local quadratic convergence of the algorithm is shown under a suitable condition…