Related papers: Matrix Inversion Is As Easy As Exponentiation
In this paper, we give a proof of a conjecture made by Zagier about the inverse of some matrix related to double zeta values of parity $(\mathrm{even},\mathrm{odd})$. As a result, we obtain a family of Bernoulli number identities. We…
Deep neural networks have achieved substantial success across various scientific computing tasks. A pivotal challenge within this domain is the rapid and parallel approximation of matrix inverses, critical for numerous applications. Despite…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
A common optimization problem is the minimization of a symmetric positive definite quadratic form $< x,Tx >$ under linear constrains. The solution to this problem may be given using the Moore-Penrose inverse matrix. In this work we extend…
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a…
Several invariants of polarized metrized graphs and their applications in Arithmetic Geometry are studied recently. In this paper, we give fast algorithms to compute these invariants by expressing them in terms of the discrete Laplacian…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
Obtaining the inverse of a large symmetric positive definite matrix $\mathcal{A}\in\mathbb{R}^{p\times p}$ is a continual challenge across many mathematical disciplines. The computational complexity associated with direct methods can be…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
In this paper we present a method for matrix inversion based on Cholesky decomposition with reduced number of operations by avoiding computation of intermediate results; further, we use fixed point simulations to compare the numerical…
Starting with the recursive extended Euclid's algorithm, we apply a systematic approach using matrix notation to transform it into an iterative algorithm. The partial correctness proof derived from the transformation turns out to be very…
We propose a hyperpower iteration for numerical computation of the outer generalized inverse of a matrix which achieves the 18th order of convergence by using only seven matrix multiplication per iteration loop. This is the record high…
Many real-world problems rely on finding eigenvalues and eigenvectors of a matrix. The power iteration algorithm is a simple method for determining the largest eigenvalue and associated eigenvector of a general matrix. This algorithm relies…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Toeplitz Block Toeplitz matrices using minimized matrix-vector products, with a complexity…
The integral version of the fractional Laplacian on a bounded domain is discretized by a Galerkin approximation based on piecewise linear functions on a quasi-uniform mesh. We show that the inverse of the associated stiffness matrix can be…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…
We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…