Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Biochemistry  (1)
  • Key words: Parallel  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Theoretica chimica acta 93 (1996), S. 317-331 
    ISSN: 0040-5744
    Keywords: Key words: Parallel ; Four-index transformation ; Møller ; Plesset
    Source: Springer Online Journal Archives 1860-2000
    Topics: Chemistry and Pharmacology
    Notes: Summary.  Two parallel direct integral transformation algorithms are presented. Specific attention is directed to producing transformed integrals containing at least two “active orbital” indices. The number of active orbitals is typically much less than the total number of molecular orbitals reflecting the requirements of a wide range of correlated electronic structure methods. Sample direct second-order Møller–Plesset theory calculations are reported. For situations where multipassing of the integrals is required, superlinear speedup is obtained by exploiting the increase in global memory. As a consequence, for morphine in a 6-31G basis, a speedup of over 25 is observed in scaling from 32 to 512 processors.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Journal of Computational Chemistry 16 (1995), S. 1291-1300 
    ISSN: 0192-8651
    Keywords: Computational Chemistry and Molecular Modeling ; Biochemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Computer Science
    Notes: The availability of massively parallel computers with high computation rates but limited memory and input/output bandwidth prompts the reevaluation of appropriate solution schemes for the self-consistent field (SCF) equations. Several algorithms are considered which exhibit between linear and quadratic convergence using various approximations to the orbital Hessian. A prototype is developed to understand the computational expense of each approach. The optimal choice is found to be a conjugate-gradient method preconditioned with a level-shifted approximation to the orbital Hessian. This is a compromise between efficiency, stability, and low memory usage. Sample benchmarks on two parallel supercomputers are also reported. © 1995 John Wiley & Sons, Inc.
    Additional Material: 5 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...