论文信息 - Matrix augmentation and partitioning in the updating of the basis inverse

Matrix augmentation and partitioning in the updating of the basis inverse

A compact and flexible updating procedure using matrix augmentation is developed. It is shown that the representation of the updated inverse does not grow monotonically in size, and may actually decrease during certain simplex iterations. Angular structures, such as GUB, are handled naturally within the partitioning framework, and require no modifications of the simplex method.

Alexander Meeraus | Johannes Bisschop | Alexander Meeraus | J. Bisschop | A. Meeraus

[1] Eli Hellerman,et al. Reinversion with the preassigned pivot procedure , 1971, Math. Program..

[2] J. Tomlin. Modifying Triangular Factors of the Basis in the Simplex Method , 1972 .

[3] G. Forsythe,et al. Computer solution of linear algebraic systems , 1969 .

[4] George B. Dantzig,et al. Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

[5] James R. Bunch,et al. The Role of Partitioning in the Numerical Solution of Sparse Systems , 1972 .

[6] Richard P. Brent,et al. The Complexity of computational problem solving , 1976 .

[7] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.

[8] Donald Goldfarb,et al. On the Bartels—Golub decomposition for linear programming bases , 1977, Math. Program..

[9] J. A. Tomlin. An accuracy test for updating triangular factors , 1975 .

[10] J. Uhlig. C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .

[11] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .

[12] R. Willoughby. Sparse matrices and their applications , 1972 .