Relationship between the Inverses of a Matrix and a Submatrix

  title={Relationship between the Inverses of a Matrix and a Submatrix},
  author={E. Ju{\'a}rez Ruiz and R. Cortes Maldonado and F. P{\'e}rez Rodr{\'i}guez},
  journal={Computaci{\'o}n y Sistemas},
A simple and straightforward formula for computing the inverse of a submatrix in terms of the inverse of the original matrix is derived. General formulas for the inverse of submatrices of order 𝑛 − 𝑘 as well as block submatrices are derived. The number of additions (or subtractions) and multiplications (or divisions) on the formula is calculated. A variety of numerical results are shown. 

Figures from this paper

On prescribing the convergence behavior of the conjugate gradient algorithm
  • G. Meurant
  • Mathematics, Computer Science
    Numerical Algorithms
  • 2019
This paper completely characterize the tridiagonal matrices constructed by the Lanczos algorithm and their inverses in terms of the CG residual norms and A -norms of the error.
High‐dimensional Precision Matrix Estimation with a Known Graphical Structure
This paper proposes a simple estimator of the precision matrix based on the connection between the known graphical structure and the precision Matrix and obtains the rates of convergence and derive the asymptotic normality of the proposed estimator in the high-dimensional setting when the data dimension grows with the sample size.
Reduced Complexity Ordering in Subspace MIMO Detection Algorithms
A near-optimal error performance can be achieved while the computational complexity is shifted from the detection stage to the preprocessing stage which is desirable for quasi-static channels where the channel is constant over a large block of symbols.
Approximating the Convex Hull via Metric Space Magnitude
This paper restricts the sets to finite subsets of Euclidean space and investigates its individual components, and gives an explicit formula for the corrected inclusion-exclusion principle, and defines a quantity associated with each point, called the moment, which gives an intrinsic ordering to the points.
Matrix Completion via Non-Convex Relaxation and Adaptive Correlation Learning
A novel non-convex surrogate that can be optimized by closed-form solutions, such that it empirically converges within dozens of iterations, and which theoretically validate that it is equivalent to the existing matrix completion models.
Near-Optimal MIMO Detectors Based on MMSE-GDFE and Conditional Detection
The combination of minimum mean square error generalized decision feedback equalization (MMSE-GDFE) and conditional optimization is considered and the list of candidates can be utilized for efficient implementation of the soft-output detector for MIMO systems with error correcting codes.
Bridging the Gap Between MMSE-DFE and Optimal Detection of MIMO Systems
It is shown that the error performance of the soft-output system is comparable to that of the list sphere decoder (LSD) but with much smaller list size, and hence smaller complexity than the latter.
Bootstrapping for HElib
This report reports on an implementation of recryption of fully packed ciphertexts using the HElib library for somewhat homomorphic encryption, and includes a much more robust method for deriving the parameters, ensuring that recryption errors only occur with negligible probability.
A novel recursive approach for online identification of continuous‐time switched nonlinear systems
This article proposes a novel online approach to address the identification problem of switched nonlinear systems, which is capable to handle the measured state‐input vectors in sequence and is extended to identify the dynamics of each subsystem recursively.
Channel Estimation based on Gaussian Mixture Models with Structured Covariances
This work proposes variations of a Gaussian mixture model (GMM) based channel estimator that was recently proven to be asymptotically optimal in the minimum mean square error (MMSE) sense and argues that these practical baselines are outperformed by far with equal estimation complexity.


Explicit inverse of a generalized Vandermonde matrix
Updating the Inverse of a Matrix
The history of these fomulas is presented and various applications to statistics, networks, structural analysis, asymptotic analysis, optimization, and partial differential equations are discussed.
can be readily verified, and provides a method of finding the inverse of a matrix which differs from a matrix of known inverse by a matrix of raiik unity. Equation (1) was originally derived by
Matrix Inverse as by-Product of Determinant
The determinant of a given square matrix is obtained as the pr oduct of pivot elements evaluated via the iterative matrix order condensation. It follows as the by-product that the inverse of this
Perturbed matrix inversion with application to LP simplex method
Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman-Morrison Formula
It is shown how the matrix A0-1 - A-1, where A0 is a nonsingular matrix whose inverse is known or easy to compute, can be factorized in the form $U\Omega V^T$ using the Sherman--Morrison formula.
The solution of linear systems by using the Sherman–Morrison formula
Matrix inversion by rank annihilation
This paper outlines a method which allows one to bring the matrix into memory one column at a time and overlap input time with computing time and the number of computations is as small as any known to the writer.
On Deriving the Inverse of a Sum of Matrices
Available expressions are reviewed and new ones derived for the inverse of the sum of two matrices, one of them being nonsingular. Particular attention is given to $({\text{{\bf A}}} + {\text{{\bf
A survey of modern algebra
This classic, written by two young instructors who became giants in their field, has shaped the understanding of modern algebra for generations of mathematicians and remains a valuable reference and