메뉴 건너뛰기




Volumn 1520, Issue , 1998, Pages 55-71

Optimized Q-pivot for exact linear solvers

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; LINEAR SYSTEMS;

EID: 84957637912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49481-2_6     Document Type: Conference Paper
Times cited : (6)

References (16)
  • 3
    • 84968497774 scopus 로고
    • Sylvester's identity and multistep integer-preserving gaussian elimination
    • Erwin H. Bareiss. Sylvester's identity and multistep integer-preserving gaussian elimination. Mathematics and Computation, 22:565-578, 1968.
    • (1968) Mathematics and Computation , vol.22 , pp. 565-578
    • Bareiss, E.H.1
  • 4
    • 0005173718 scopus 로고
    • Bareiss. Computational solutions of matrix problems over an integral domain
    • Erwin H. Bareiss. Computational solutions of matrix problems over an integral domain. J. Inst. Maths Applics, 10:68-104, 1972.
    • (1972) J. Inst. Maths Applics , vol.10 , pp. 68-104
    • Erwin, H.1
  • 5
    • 0001444814 scopus 로고
    • A new version of the euclidian algorithm
    • W. A. Blankinship. A new version of the euclidian algorithm. American Math Monthly, 70:742-745, 1963.
    • (1963) American Math Monthly , vol.70 , pp. 742-745
    • Blankinship, W.A.1
  • 6
    • 0014813460 scopus 로고
    • Bradley. Algorithm and bound for the greatest common divisor of n integers
    • July
    • Gordon H. Bradley. Algorithm and bound for the greatest common divisor of n integers. Communication of the ACM, 13(7):433-436, July 1970.
    • (1970) Communication of the ACM , vol.13 , Issue.7 , pp. 433-436
    • Gordon, H.1
  • 10
    • 0041304796 scopus 로고    scopus 로고
    • Notes sur les Q-matrices d'Edmonds
    • Jack Edmonds and Jean-François Maurras. Notes sur les Q-matrices d'Edmonds. RAIRO, 31(2):203-209, 1997.
    • (1997) RAIRO , vol.31 , Issue.2 , pp. 203-209
    • Edmonds, J.1    Maurras, J.-F.2
  • 12
    • 0000726097 scopus 로고
    • A practicable steepest-edge simplex algorithm
    • D. Goldfarb and J.K. Reid. A practicable steepest-edge simplex algorithm. Math- ematical Programming, 12:361-371, 1977.
    • (1977) Math- Ematical Programming , vol.12 , pp. 361-371
    • Goldfarb, D.1    Reid, J.K.2
  • 14
    • 0016929661 scopus 로고
    • The algebraic solution of sparse linear systems via minor expansion
    • Martin L. Griss. The algebraic solution of sparse linear systems via minor expansion. ACM Transactions on Mathematical Software, 2(1):31-49, 1976.
    • (1976) ACM Transactions on Mathematical Software , vol.2 , Issue.1 , pp. 31-49
    • Griss, M.L.1
  • 15
    • 38249007087 scopus 로고
    • An algorithm for exact division
    • Tudor Jebelean. An algorithm for exact division. Journal of symbolic computation, 15(2):169-180, 1993.
    • (1993) Journal of Symbolic Computation , vol.15 , Issue.2 , pp. 169-180
    • Jebelean, T.1
  • 16
    • 0347448611 scopus 로고
    • Un algorithme efficace pour l'implantation de contraintes arithmètiques en prècision infinie
    • In J.C. Bajard, D. Michelucci, J.M. Moreau, and J.M. Muller, editors, Saint-Ètienne, France, Avril
    • Jean-François Pique. Un algorithme efficace pour l'implantation de contraintes arithmètiques en prècision infinie. In J.C. Bajard, D. Michelucci, J.M. Moreau, and J.M. Muller, editors, Real Numbers and Computers Conferences, pages 289-293, Saint-Ètienne, France, Avril 1995.
    • (1995) Real Numbers and Computers Conferences , pp. 289-293
    • Pique, J.F.1


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