.png){kind=icon}
.png){kind=icon}
Return
Perturbed matrix inversion with application to LP simplex method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2006.10.038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 is an element of R-nxn 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. (C) 2006 Elsevier Inc. All rights reserved.
Keywords:
linear programming
sparse simplex
perturbed matrix inversion
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W
Organization
No organization information available