Related papers: A formula for inverse matrix
This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic…
A factorization of the inverse of a Hermetian positive definite matrix based on a diagonal by diagonal recurrence formulae permits the inversion of Block Toeplitz matrices, using only matrix-vector products, and with a complexity of…
We construct a binary mutation invariant for skew-symmetric integer matrices. The invariant is not an integer congruence invariant for matrices of odd size: we provide examples of congruent such matrices with different values for the…
Inverse optimization describes a process that is the "reverse" of traditional mathematical optimization. Unlike traditional optimization, which seeks to compute optimal decisions given an objective and constraints, inverse optimization…
Four results are given that address the existence, ambiguities and construction of a classical R-matrix given a Lax pair. They enable the uniform construction of R-matrices in terms of any generalized inverse of $ad L$. For generic $L$ a…
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…
The theory of matrix splitting is a useful tool for finding solution of rectangular linear system of equations, iteratively. The purpose of this paper is two-fold. Firstly, we revisit theory of weak regular splittings for rectangular…
In our article we consider some algebraical methods which may be useful in some inverse spectral problems. The reconstraction of the matrix from its minors is considered.
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.
A matrix approach to continuous iteration is proposed for general formal series. It leads, in particular, to an order{to{order iteration of the exponential function, and consequently to an algorithmic approach to tetration. Lower{order…
In what follows we first set the context for inverse scattering in nuclear physics with a brief account of inverse problems in general. We then turn to inverse scattering which involves the S-matrix, which connects the interaction potential…
A Filbert matrix is a matrix whose (i,j) entry is 1/F_(i+j-1), where F_n is the nth Fibonacci number. The inverse of the n by n Filbert matrix resembles the inverse of the n by n Hilbert matrix, and we prove that it shares the property of…
A simple algorithm for the inverse scattering approach to the Camassa-Holm equation is presented.
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…
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…
We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…
Algorithmic methods for the explicit inversion of the indefinite double covering maps are proposed. These are based on either the Givens decomposition or the polar decomposition of the given matrix in the proper, indefinite orthogonal group…
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…