메뉴 건너뛰기




Volumn 240, Issue , 1996, Pages 131-151

A new pivoting strategy for Gaussian elimination

Author keywords

[No Author keywords available]

Indexed keywords


EID: 21344440575     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/0024-3795(94)00192-8     Document Type: Article
Times cited : (79)

References (14)
  • 2
    • 0003787205 scopus 로고
    • Assignment and matching problems: Solution methods with FORTRAN-programs
    • Springer-Verlag, Berlin
    • R. E. Burkard and U. Derigs, Assignment and Matching Problems: Solution Methods with FORTRAN-Programs, Lecture Notes in Econom. and Math. Systems, Springer-Verlag, Berlin 1980.
    • (1980) Lecture Notes in Econom. and Math. Systems
    • Burkard, R.E.1    Derigs, U.2
  • 3
    • 84976683733 scopus 로고
    • Solution of the assignment problem (Algorithm 548)
    • G. Carpaneto and P. Toth, Solution of the assignment problem (Algorithm 548), ACM Trans. Math. Software, 1980, pp. 104-111.
    • (1980) ACM Trans. Math. Software , pp. 104-111
    • Carpaneto, G.1    Toth, P.2
  • 5
    • 0001087780 scopus 로고
    • On the automatic scaling of matrices for Gaussian elimination
    • A. R. Curtis and J. K. Reid. On the automatic scaling of matrices for Gaussian elimination, J. Inst. Math. Appl. 10:118-124 (1972).
    • (1972) J. Inst. Math. Appl. , vol.10 , pp. 118-124
    • Curtis, A.R.1    Reid, J.K.2
  • 6
    • 84947671476 scopus 로고
    • ALGOL 60 procedures in numerical algebra
    • T. J. Dekker, ALGOL 60 Procedures in Numerical Algebra, Math. Center Tracts 22, 1968, pp. 20-21.
    • (1968) Math. Center Tracts , vol.22 , pp. 20-21
    • Dekker, T.J.1
  • 7
    • 0022579095 scopus 로고
    • An efficient labeling technique for solving sparse assignment problems
    • U. Derigs and A. Metz, An efficient labeling technique for solving sparse assignment problems, Computing 36:301-311 (1986).
    • (1986) Computing , vol.36 , pp. 301-311
    • Derigs, U.1    Metz, A.2
  • 8
    • 0001214263 scopus 로고
    • Maximum matching and a polyhedron with 0-1 vertices
    • J. Edmonds, Maximum matching and a polyhedron with 0-1 vertices, J. Res. Nat. Bur. Standards B69:125-130 (1965).
    • (1965) J. Res. Nat. Bur. Standards , vol.B69 , pp. 125-130
    • Edmonds, J.1
  • 9
    • 25444452938 scopus 로고
    • QMR: A quasi-minimal residual method for non-Hermitean linear systems
    • R. W. Freund and N. M. Nachtigal, QMR: A quasi-minimal residual method for non-Hermitean linear systems, Numer. Math. 60:315-339 (1991).
    • (1991) Numer. Math. , vol.60 , pp. 315-339
    • Freund, R.W.1    Nachtigal, N.M.2
  • 10
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • H. W. Kuhn, The Hungarian method for the assignment problem, Naval Res. Logist. Quart. 2:83 (1955).
    • (1955) Naval Res. Logist. Quart. , vol.2 , pp. 83
    • Kuhn, H.W.1
  • 11
    • 0002067726 scopus 로고
    • Methods for scaling to double stochastic form
    • B. N. Parlett and T. L. Landis, Methods for scaling to double stochastic form, Linear Algebra Appl. 48:53-79 (1982).
    • (1982) Linear Algebra Appl. , vol.48 , pp. 53-79
    • Parlett, B.N.1    Landis, T.L.2
  • 13
    • 84945709312 scopus 로고
    • Error analysis of direct methods of matrix inversion
    • J. H. Wilkinson, Error analysis of direct methods of matrix inversion, J. Assoc. Comput. Mach. 8:281-330 (1961).
    • (1961) J. Assoc. Comput. Mach. , vol.8 , pp. 281-330
    • Wilkinson, J.H.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.