Related papers: Computing generalized inverses using LU factorizat…
In this paper, we introduce a ring isomorphism between the Clifford algebra $C\ell_{1,2}$ and a ring of matrices. By such a ring isomorphism, we introduce the concept of the Moore-Penrose inverse in Clifford algebra $C\ell_{1,2}$. Using the…
A Moore--Penrose inverse of an arbitrary complex matrix A is defined as a unique matrix A' such that AA'A=A, A'AA'=A', and AA', A'A are Hermite matrices. We show that this definition has a natural generalization in the context of shortly…
The well-known M-P (Moore-Penrose) pseudoinverse is used in several linear-algebra applications; for example, to compute least-squares solutions of inconsistent systems of linear equations. Irrespective of whether a given matrix is sparse,…
We consider generalized inverses of linear operators on arbitrary vector spaces and study the question when their product in reverse order is again a generalized inverse. This problem is equivalent to the question when the product of two…
We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where…
In calculating integral or discrete transforms, use has been made of fast algorithms for multiplying vectors by matrices whose elements are specified as values of special (Chebyshev, Legendre, Laguerre, etc.) functions. The currently…
Greville's method has been utilized in (Broad Learn-ing System) BLS to propose an effective and efficient incremental learning system without retraining the whole network from the beginning. For a column-partitioned matrix where the second…
We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…
Let $R$ be a ring with involution. The recently introduced notions of the core and dual core inverse are extended from matrix to an arbitrary $*$-ring case. It is shown that the group, Moore-Penrose, core and dual core inverse are closely…
We establish some relationships between an m-accretive operator and its Moore-Penorse inverse. We derive some perturbation result of the Moore-Penorse inverse of a maximal accretive operator. As an application we give a factorization…
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
This paper highlights a formal connection between two families of widely used matrix factorization algorithms in numerical linear algebra. One family consists of the Jacobi eigenvalue algorithm and its variants for computing the Hermitian…
A generalization with singular weights of Moore-Penrose generalized inverses of closed range operators in Hilbert spaces is studied using the notion of compatibility of subspaces and positive operators.
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…
Hierarchical matrices (usually abbreviated ${\mathcal H}$-matrices) are frequently used to construct preconditioners for systems of linear equations. Since it is possible to compute approximate inverses or $LU$ factorizations in ${\mathcal…
In this paper, we first present an explicit expression for the inverse\emph{} of a type of matrices. As special applications, the inverse of some matrices arising from implicit time integration techniques, such as the well-known implicit…
This paper presents a new algorithm for generating random inverse-Wishart matrices that directly generates the Cholesky factor of the matrix without computing the factorization. Whenever parameterized in terms of a precision matrix…
We propose a generalized CUR (GCUR) decomposition for matrix pairs $(A, B)$. Given matrices $A$ and $B$ with the same number of columns, such a decomposition provides low-rank approximations of both matrices simultaneously, in terms of some…