메뉴 건너뛰기




Volumn 2367, Issue , 2002, Pages 297-306

Parallel two-sided sylvester-type matrix equation solvers for SMP systems using recursive blocking

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 1842843484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48051-x_30     Document Type: Conference Paper
Times cited : (1)

References (18)
  • 2
    • 84976855597 scopus 로고
    • Algorithm 432: Solution of the Equation AX + XB = C
    • R. H. Bartels and G. W. Stewart. Algorithm 432: Solution of the Equation AX + XB = C, Comm. ACM, 15(9): 820-826, 1972.
    • (1972) Comm. ACM , vol.15 , Issue.9 , pp. 820-826
    • Bartels, R.H.1    Stewart, G.W.2
  • 3
    • 0010976738 scopus 로고    scopus 로고
    • Blocked Algorithms and Software for Reduction of a Regular Matrix Pair to Generalized Schur Form
    • K. Dackland and B. Kågström. Blocked Algorithms and Software for Reduction of a Regular Matrix Pair to Generalized Schur Form. ACM Trans. Math. Software, Vol. 25, No. 4, 425-454, 1999.
    • (1999) ACM Trans. Math. Software , vol.25 , Issue.4 , pp. 425-454
    • Dackland, K.1    Kågström, B.2
  • 6
    • 0018721357 scopus 로고
    • A Hessenberg-Schur Method for the Matrix Problem AX + XB = C
    • G. Golub, S. Nash, and C. Van Loan. A Hessenberg-Schur Method for the Matrix Problem AX + XB = C. IEEE Trans. Autom. Contr., AC-24(6): 909-913, 1979.
    • (1979) IEEE Trans. Autom. Contr , vol.AC-24 , Issue.6 , pp. 909-913
    • Golub, G.1    Nash, S.2    Van Loan, C.3
  • 7
    • 0031273280 scopus 로고    scopus 로고
    • Recursion leads to automatic variable blocking for dense linear algebra
    • November
    • F. Gustavson. Recursion leads to automatic variable blocking for dense linear algebra. IBM J. Res. Develop, 41(6): 737-755, November 1997.
    • (1997) IBM J. Res. Develop , vol.41 , Issue.6 , pp. 737-755
    • Gustavson, F.1
  • 8
    • 84947926251 scopus 로고    scopus 로고
    • Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms
    • Kågström et al. (eds), Lecture Notes in Computer Science, Springer-Verlag
    • F. Gustavson, A. Henriksson, I. Jonsson, B. Kågström and P. Ling. Recursive Blocked Data Formats and BLAS's for Dense Linear Algebra Algorithms. In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 195-206, Springer-Verlag, 1998.
    • (1998) Applied Parallel Computing, PARA'98 , vol.1541 , pp. 195-206
    • Gustavson, F.1    Henriksson, A.2    Jonsson, I.3    Kågström, B.4    Ling, P.5
  • 9
    • 1842832563 scopus 로고    scopus 로고
    • Parallel Triangular Sylvester-type Matrix Equation Solvers for SMP Systems using Recursive Blocking, in
    • Lecture Notes in Computer Science, Springer Verlag
    • I. Jonsson and B. Kågström. Parallel Triangular Sylvester-type Matrix Equation Solvers for SMP Systems using Recursive Blocking, in Applied Parallel Computing: New Paradigms for HPC Industry and Academia, Lecture Notes in Computer Science, vol. 1947, pp 64-74, Springer Verlag, 2001.
    • (2001) Applied Parallel Computing: New Paradigms for HPC Industry and Academia , vol.1947 , pp. 64-74
    • Jonsson, I.1    Kågström, B.2
  • 13
    • 0030092417 scopus 로고    scopus 로고
    • LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation between Regular Matrix Pairs
    • March
    • B. Kågström and P. Poromaa. LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation between Regular Matrix Pairs. ACM Trans. Math. Software, 22(1): 78-103, March 1996.
    • (1996) ACM Trans. Math. Software , vol.22 , Issue.1 , pp. 78-103
    • Kågström, B.1    Poromaa, P.2
  • 14
    • 0041103179 scopus 로고    scopus 로고
    • Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair (A, B) and Condition Estimation: Theory, Algorithms and Software
    • B. Kågström and P. Poromaa. Computing Eigenspaces with Specified Eigenvalues of a Regular Matrix Pair (A, B) and Condition Estimation: Theory, Algorithms and Software. Numerical Algorithms, 12: 369-407, 1996.
    • (1996) Numerical Algorithms , vol.12 , pp. 369-407
    • Kågström, B.1    Poromaa, P.2
  • 15
    • 0024700168 scopus 로고
    • Generalized Schur methods with condition estimators for solving the generalized Sylvester equation
    • B. Kågström and L. Westin. Generalized Schur methods with condition estimators for solving the generalized Sylvester equation. IEEE Trans. Autom. Contr., 34(4): 745-751, 1989.
    • (1989) IEEE Trans. Autom. Contr , vol.34 , Issue.4 , pp. 745-751
    • Kågström, B.1    Westin, L.2
  • 16
    • 84947916433 scopus 로고    scopus 로고
    • Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Scalability Issues
    • Kågström et al. (eds), Lecture Notes in Computer Science, Springer-Verlag
    • P. Poromaa. Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Scalability Issues. In Kågström et al. (eds), Applied Parallel Computing, PARA'98, Lecture Notes in Computer Science, Vol. 1541, pp 438-446, Springer-Verlag, 1998.
    • (1998) Applied Parallel Computing, PARA'98 , vol.1541 , pp. 438-446
    • Poromaa, P.1


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