메뉴 건너뛰기




Volumn 3514, Issue I, 2005, Pages 155-164

Automated operation minimization of tensor contraction expressions in electronic structure calculations

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; QUANTUM THEORY; CLUSTER ANALYSIS; ELECTRONIC STRUCTURE; NUMERICAL METHODS; QUANTUM CHEMISTRY;

EID: 25144460585     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428831_20     Document Type: Conference Paper
Times cited : (25)

References (13)
  • 5
    • 25144518965 scopus 로고    scopus 로고
    • Automated operation minimization of tensor contraction expressions in electronic structure calculations
    • Computer Science and Engineering Department, The Ohio State University
    • A. Hartono, A. Sibiryakov, M. Nooijen, G. Baumgartner, D. Bernholdt, S. Hirata, C. Lam, R. Pitzer, J. Ramanujam, and P. Sadayappan. Automated operation minimization of tensor contraction expressions in electronic structure calculations. Technical Report OSU-CISRC-2/05-TR10, Computer Science and Engineering Department, The Ohio State University, 2005.
    • (2005) Technical Report , vol.OSU-CISRC-2-05-TR10
    • Hartono, A.1    Sibiryakov, A.2    Nooijen, M.3    Baumgartner, G.4    Bernholdt, D.5    Hirata, S.6    Lam, C.7    Pitzer, R.8    Ramanujam, J.9    Sadayappan, P.10
  • 8
    • 0000523695 scopus 로고    scopus 로고
    • On optimizing a class of multi-dimensional loops with reductions for parallel execution
    • C. Lam, P. Sadayappan, and R. Wenger. On optimizing a class of multi-dimensional loops with reductions for parallel execution. Parallel Processing Letters, 7(2):157-168, 1997.
    • (1997) Parallel Processing Letters , vol.7 , Issue.2 , pp. 157-168
    • Lam, C.1    Sadayappan, P.2    Wenger, R.3
  • 9
    • 0026242044 scopus 로고
    • Solving bigger problems by decreasing the operation count and increasing computation bandwidth
    • October
    • E.K. Miller. Solving bigger problems by decreasing the operation count and increasing computation bandwidth. Proceedings of the IEEE, 79(10): 1493-1504, October 1991.
    • (1991) Proceedings of the IEEE , vol.79 , Issue.10 , pp. 1493-1504
    • Miller, E.K.1
  • 10
    • 36549098398 scopus 로고
    • An efficient reformulation of the closed-shell coupled cluster single and double excitation (CCSD) equations
    • G.E. Scuseria, C.L. Janssen, and H.F. Schaefer III. An efficient reformulation of the closed-shell coupled cluster single and double excitation (CCSD) equations. The Journal of Chemical Physics, 89(12):7382-7387, 1988.
    • (1988) The Journal of Chemical Physics , vol.89 , Issue.12 , pp. 7382-7387
    • Scuseria, G.E.1    Janssen, C.L.2    Schaefer III, H.F.3
  • 12
    • 36449002017 scopus 로고
    • A direct product decomposition approach for symmetry exploitation in many-body methods. I. Energy calculations
    • J.F. Stanton, J. Gauss, J.D. Watts, and R.J. Bartlett. A direct product decomposition approach for symmetry exploitation in many-body methods. I. Energy calculations. The Journal of Chemical Physics, 94(6):43 34-4345, 1991.
    • (1991) The Journal of Chemical Physics , vol.94 , Issue.6 , pp. 4334-4345
    • Stanton, J.F.1    Gauss, J.2    Watts, J.D.3    Bartlett, R.J.4
  • 13
    • 0004073167 scopus 로고
    • Society for Industrial and Applied Mathematics, Philadelphia, PA
    • S. Winograd. Arithmetic Complexity of Computations. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1980.
    • (1980) Arithmetic Complexity of Computations
    • Winograd, S.1


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