Stable modification of explicit LU factors for simplex updates

From MaRDI portal





This paper presents a method for modifying an LU factorization of a matrix A when a simplex update is performed on A. At each stage of the algorithm, two options are allowed, and in one of these a row permutation of L is made so that the LU structure is always maintained. The expanding file of operators used in other methods is not required. The result of an error analysis is presented in which the error is bounded by the growth in the partial sums of LU. Various pivotal strategies which minimize a growth bound are discussed and an example is given in which the worst case for growth occurs repeatedly. Numerical results from experiments on ill-conditioned problems show no tendency for error growth.











This page was built for publication: Stable modification of explicit LU factors for simplex updates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3692731)