Perturbed matrix inversion with application to LP simplex method

作者:

Highlights:

摘要

Computation of the inverse of a perturbed matrix (A + D)−1 appears within various areas of research and applications. Of particular importance is the sparse simplex, where A is the basis matrix. In this paper a procedure for the computing of the inverse matrix (A + D)−1 is presented and discussed, where A∈Rn×n is a given non-singular matrix, A−1 is already calculated, and A + D is a perturbed matrix of A by D, where D is sparse. The non-singularity requirement for D is removed.

论文关键词:Linear programming,Sparse simplex,Perturbed matrix inversion

论文评审过程:Available online 17 November 2006.

论文官网地址:https://doi.org/10.1016/j.amc.2006.10.038