메뉴 건너뛰기




Volumn 343, Issue , 2002, Pages 119-146

Efficient matrix preconditioners for black box linear algebra

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; LINEAR ALGEBRA; NUMBER THEORY; PROBLEM SOLVING;

EID: 31244437321     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(01)00472-4     Document Type: Article
Times cited : (45)

References (26)
  • 1
    • 0040517363 scopus 로고    scopus 로고
    • The rank of sparse random matrices over finite fields
    • J. Blömer, R. Karp, and E. Welzl The rank of sparse random matrices over finite fields Random Struct. Algorithms 10 1997 407 419
    • (1997) Random Struct. Algorithms , vol.10 , pp. 407-419
    • Blömer, J.1    Karp, R.2    Welzl, E.3
  • 2
    • 84968521645 scopus 로고
    • Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
    • D. Coppersmith Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm Math. Comp. 62 205 1994 333 350
    • (1994) Math. Comp. , vol.62 , Issue.205 , pp. 333-350
    • Coppersmith, D.1
  • 3
    • 0000006297 scopus 로고
    • A probabilistic remark on algebraic program testing
    • R.A. DeMillo, and R.J. Lipton A probabilistic remark on algebraic program testing Inform. Process. Lett. 7 4 1978 193 195
    • (1978) Inform. Process. Lett. , vol.7 , Issue.4 , pp. 193-195
    • Demillo, R.A.1    Lipton, R.J.2
  • 10
    • 84968492714 scopus 로고
    • Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
    • E. Kaltofen Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems Math. Comp. 64 210 1995 777 806
    • (1995) Math. Comp. , vol.64 , Issue.210 , pp. 777-806
    • Kaltofen, E.1
  • 11
    • 0003043247 scopus 로고    scopus 로고
    • Challenges of symbolic computation my favorite open problems
    • with an additional open problem by R.M. Corless and D.J. Jeffrey
    • E. Kaltofen Challenges of symbolic computation my favorite open problems J. Symbolic Comput. 29 6 2000 891 919 with an additional open problem by R.M. Corless and D.J. Jeffrey
    • (2000) J. Symbolic Comput. , vol.29 , Issue.6 , pp. 891-919
    • Kaltofen, E.1
  • 13
    • 85027598825 scopus 로고
    • Processor-efficient parallel solution of linear systems II: The positive characteristic and singular cases
    • IEEE Computer Society Press Silver Spring, MD
    • E. Kaltofen, and V. Pan Processor-efficient parallel solution of linear systems II: the positive characteristic and singular cases in: Proc. 33rd Annual Symposium on Foundations of Computer Science, Los Alamitos, CA 1992 IEEE Computer Society Press Silver Spring, MD 714 723
    • (1992) Proc. 33rd Annual Symposium on Foundations of Computer Science, Los Alamitos, CA , pp. 714-723
    • Kaltofen, E.1    Pan, V.2
  • 15
    • 84992074342 scopus 로고
    • Computing with polynomials given by black boxes for their evaluations: Greatest common divisors factorization separation of numerators and denominators
    • E. Kaltofen, and B. Trager Computing with polynomials given by black boxes for their evaluations: greatest common divisors factorization separation of numerators and denominators J. Symbolic Comput. 9 3 1990 301 320
    • (1990) J. Symbolic Comput. , vol.9 , Issue.3 , pp. 301-320
    • Kaltofen, E.1    Trager, B.2
  • 19
    • 84966229708 scopus 로고
    • On computations with dense structured matrices
    • V. Pan On computations with dense structured matrices Math. Comp. 55 1990 179 190
    • (1990) Math. Comp. , vol.55 , pp. 179-190
    • Pan, V.1
  • 22
    • 84976779342 scopus 로고
    • Fast probabilistic algorithms for verification of polynomical identities
    • J. Schwartz Fast probabilistic algorithms for verification of polynomical identities J. ACM 27 1980 701 717
    • (1980) J. ACM , vol.27 , pp. 701-717
    • Schwartz, J.1
  • 24
    • 84924373805 scopus 로고    scopus 로고
    • Block solution of sparse linear systems over GF(q): The singular case
    • G. Villard Block solution of sparse linear systems over GF(q): the singular case SIGSAM Bull. 32 4 1998 10 12
    • (1998) SIGSAM Bull. , vol.32 , Issue.4 , pp. 10-12
    • Villard, G.1
  • 25
    • 0022583143 scopus 로고
    • Solving sparse linear equations over finite fields
    • D. Wiedemann Solving sparse linear equations over finite fields IEEE Trans. Inform. Theory IT-32 1986 54 62
    • (1986) IEEE Trans. Inform. Theory , vol.32 IT- , pp. 54-62
    • Wiedemann, D.1


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