Related papers: Inverting the sum of two singular matrices

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

We establish inversion formulas of the so called filtered back-projection type to recover a function supported in the ball in even dimensions from its spherical means over spheres centered on the boundary of the ball. We also find several…

In some matrix formations, factorizations and transformations, we need special matrices with some properties and we wish that such matrices should be easily and simply generated and of integers. In this paper, we propose a zero-sum rule for…

Inverse scattering theory is extended to one-dimensional Schr\"odinger problems with near-boundary singularities of the form $v(z\to 0)\simeq -z^{-2}/4+v_{-1}z^{-1}$. Trace formulae relating the boundary value $v_0$ of the nonsingular part…

The principal objective in this paper is a new inverse approach to general Dirac-type systems modeled after B. Simon's 1999 inverse approach to half-line Schr\"odinger operators. In particular, we derive the so-called A-equation associated…

In this paper we derive and analyze an algorithm for inverting quaternion matrices. The algorithm is an analogue of the Frobenius algorithm for the complex matrix inversion. On the theory side, we prove that our algorithm is more efficient…

A new generalized matrix inverse is derived which is consistent with respect to arbitrary nonsingular diagonal transformations, e.g., it preserves units associated with variables under state space transformations, thus providing a general…

We take matrix decompositions that are usually applied to matrices over the real numbers or complex numbers, and extend them to matrices over an algebra called the double numbers. In doing so, we unify some matrix decompositions: For…

We present two generalisations of Singular Value Decomposition from real-numbered matrices to dual-numbered matrices. We prove that every dual-numbered matrix has both types of SVD. Both of our generalisations are motivated by applications,…

The study of solving inverse singular value problems for nonnegative matrices has been around for decades. It is clear that an inverse singular problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…

The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…

We extend the concept of the m-weak group MP inverse of a square matrix to a rectangular matrix, called the W-weighted m-weak group MP inverse, which also unifies the W-weighted weak core inverse and W-weighted DMP inverse. Some properties,…

A quasi-Toeplitz $M$-matrix $A$ is an infinite $M$-matrix that can be written as the sum of a semi-infinite Toeplitz matrix and a correction matrix. This paper is concerned with computing the square root of invertible quasi-Toeplitz…

Let $\mathscr{C}$ be an additive category with an involution $\ast$. Suppose that $\varphi : X \rightarrow X$ is a morphism of $\mathscr{C}$ with core inverse $\varphi^{\co} : X \rightarrow X$ and $\eta : X \rightarrow X$ is a morphism of…

The evaluation of the interaction between objects arranged on a lattice requires the computation of lattice sums. A scenario frequently encountered are systems governed by the Helmholtz equation in the context of electromagnetic scattering…

We present new additive results for the core inverse in a Banach algebra with involution. We obtain necessary and sufficient conditions under which the sum of two core invertible elements in a Banach algebra with involution is core…

We give an algorithm to compute the series expansion for the inverse of a given function. The algorithm is extremely easy to implement and gives the first $N$ terms of the series. We show several examples of its application in calculating…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

We suggest three applications for the inverses: For the inverse Motzkin matrix we look at Hankel determinants, and counting the paths inside a horizontal band, and for the inverse Schr\"oder matrix we look at the paths inside the same band,…

We introduce two equations expressing the inverse determinant of a full rank matrix $\mathbf{A} \in \mathbb{R}^{n \times n}$ in terms of expectations over matrix-vector products. The first relationship is $|\mathrm{det} (\mathbf{A})|^{-1} =…