A NEW PIVOTING STRATEGY FOR GAUSSIAN ELIMINATION
暂无分享，去创建一个
[1] H. Kuhn. The Hungarian method for the assignment problem , 1955 .
[2] James Hardy Wilkinson,et al. Rounding errors in algebraic processes , 1964, IFIP Congress.
[3] James Hardy Wilkinson,et al. Error Analysis of Direct Methods of Matrix Inversion , 1961, JACM.
[4] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
[5] T. J. Dekker,et al. Algol 60 procedures in numerical algebra , 1968 .
[6] C. Tompkins,et al. Elementary numerical analysis , 1971 .
[7] J. Reid,et al. On the Automatic Scaling of Matrices for Gaussian Elimination , 1972 .
[8] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .
[9] Samuel D. Conte,et al. Elementary Numerical Analysis , 1980 .
[10] Paolo Toth,et al. Algorithm 548: Solution of the Assignment Problem [H] , 1980, TOMS.
[11] B. Parlett,et al. Methods for Scaling to Doubly Stochastic Form , 1982 .
[12] John R. Rice. Matrix Computations and Mathematical Software , 1983 .
[13] R. C. Bose,et al. Introduction to Combinatorial Theory , 1984 .
[14] R. Freund,et al. QMR: a quasi-minimal residual method for non-Hermitian linear systems , 1991 .