Related papers: Moore-Penrose Inverse of some Linear Maps on Infin…
Low-rank regularization-based deep unrolling networks have achieved remarkable success in various inverse imaging problems (IIPs). However, the singular value decomposition (SVD) is non-differentiable when duplicated singular values occur,…
Consider the generalized linear least squares (GLS) problem $\min\|Lx\|_2 \ \mathrm{s.t.} \ \|M(Ax-b)\|_2=\min$. The weighted pseudoinverse $A_{ML}^{\dag}$ is the matrix that maps $b$ to the minimum 2-norm solution of this GLS problem. By…
This paper discusses the explicit inverse of a class of seven-diagonal (near) Toeplitz matrices, which arises in the numerical solutions of nonlinear fourth-order differential equation with a finite difference method. A non-recurrence…
On the set of mappings of the given set, we define the product of mappings. If A is associative algebra, then we consider the set of matrices, whose elements are linear mappings of algebra A. In algebra of matrices of linear mappings we…
Penrose limits are considered in space-times admitting two abelian, space-like Killing vectors in vacuum as well as in the presence of an electromagnetic field. This type of space-times describe inhomogeneous cosmologies as well as…
Although the vectorization operation is known and well-defined, it is only defined for 2-D matrices, and its inverse isn't as well-popularized. This work proposes to generalize the vectorization to higher dimensions, and define…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We study generalized inverses for matrices associated with double star digraphs. Explicit block formulas and existence criteria are obtained for core, dual core, core EP, and dual core EP inverses, expressed in terms of explicit algebraic…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
Using an inverse system of metric graphs as in: J. Cheeger and B. Kleiner, "Inverse limit spaces satisfying a Poincar\'e inequality", we provide a simple example of a metric space $X$ that admits Poincar\'e inequalities for a continuum of…
The main objective of this paper is to introduce unique representations and characterizations for the weighted core inverse of matrices. We also investigate various properties of these inverses and their relationships with other generalized…
The ability to readily design novel materials with chosen functional properties on-demand represents a next frontier in materials discovery. However, thoroughly and efficiently sampling the entire design space in a computationally tractable…
We consider the inverse problem of finding a magnitude-symmetric matrix (matrix with opposing off-diagonal entries equal in magnitude) with a prescribed set of principal minors. This problem is closely related to the theory of recognizing…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
We show that all off-diagonal entries in the Moore-Penrose inverse of the distance Laplacian matrix of a tree are non-positive.
Various theoretical and algorithmic aspects of inverse problems in discrete tomography of planar Penrose model sets are discussed. These are motivated by the demand of materials science for the reconstruction of quasicrystalline structures…
In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…
The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…
Interior point methods (IPMs) are a common approach for solving linear programs (LPs) with strong theoretical guarantees and solid empirical performance. The time complexity of these methods is dominated by the cost of solving a linear…