DC Field | Value | Language |
---|---|---|
dc.contributor.author | RYU, U | ko |
dc.contributor.author | Lee, Yoon Sup | ko |
dc.contributor.author | LINDH, R | ko |
dc.date.accessioned | 2013-02-25T22:49:47Z | - |
dc.date.available | 2013-02-25T22:49:47Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1991-10 | - |
dc.identifier.citation | CHEMICAL PHYSICS LETTERS, v.185, no.5-6, pp.562 - 568 | - |
dc.identifier.issn | 0009-2614 | - |
dc.identifier.uri | http://hdl.handle.net/10203/65842 | - |
dc.description.abstract | The tree search problem is considered for optimizing the horizontal recurrence relation step, which is a three-dimensional recurrence relation used in generating two-electron integrals. By eliminating redundant work, it is possible to achieve 13%, 25%, 38% and 44% savings in floating point operations and 21%, 34%, 46% and 53% reductions in memory requirements for the (ff\ff), (gg\gg), (hh\hh) and (ii\ii) cases, respectively. These savings and reductions will lead to quite efficient two-electron integral and derivative programs when high angular momentum functions are included. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | COMPUTATION | - |
dc.title | AN EFFICIENT METHOD OF IMPLEMENTING THE HORIZONTAL RECURRENCE RELATION IN THE EVALUATION OF ELECTRON REPULSION INTEGRALS USING CARTESIAN GAUSSIAN FUNCTIONS | - |
dc.type | Article | - |
dc.identifier.wosid | A1991GP33400027 | - |
dc.identifier.scopusid | 2-s2.0-0000264012 | - |
dc.type.rims | ART | - |
dc.citation.volume | 185 | - |
dc.citation.issue | 5-6 | - |
dc.citation.beginningpage | 562 | - |
dc.citation.endingpage | 568 | - |
dc.citation.publicationname | CHEMICAL PHYSICS LETTERS | - |
dc.identifier.doi | 10.1016/0009-2614(91)80260-5 | - |
dc.contributor.localauthor | Lee, Yoon Sup | - |
dc.contributor.nonIdAuthor | RYU, U | - |
dc.contributor.nonIdAuthor | LINDH, R | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordPlus | COMPUTATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.