Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Systematic sparse matrix error control for linear scaling electronic structure calculations
KTH, Skolan för bioteknologi (BIO), Teoretisk kemi.
KTH, Skolan för bioteknologi (BIO), Teoretisk kemi.
2005 (Engelska)Ingår i: Journal of Computational Chemistry, ISSN 0192-8651, E-ISSN 1096-987X, Vol. 26, nr 15, s. 1628-1637Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

 Efficient truncation criteria used in multiatom blocked sparse matrix operations for ab initio calculations are proposed. As system size increases, so does the need to stay on top of errors and still achieve high performance. A variant of a blocked sparse matrix algebra to achieve strict error control with good performance is proposed. The presented idea is that the condition to drop a certain submatrix should depend not only on the magnitude of that particular submatrix, but also on which other submatrices that are dropped. The decision to remove a certain submatrix is based on the contribution the removal would cause to the error in the chosen norm. We study the effect of an accumulated truncation error in iterative algorithms like trace correcting density matrix purification. One way to reduce the initial exponential growth of this error is presented. The presented error control for a sparse blocked matrix toolbox allows for achieving optimal performance by performing only necessary operations needed to maintain the requested level of accuracy.

Ort, förlag, år, upplaga, sidor
2005. Vol. 26, nr 15, s. 1628-1637
Nyckelord [en]
matrix error control, linear scaling, density purification
Nationell ämneskategori
Teoretisk kemi
Identifikatorer
URN: urn:nbn:se:kth:diva-6544DOI: 10.1002/jcc.20315ISI: 000232570300008Scopus ID: 2-s2.0-27844477884OAI: oai:DiVA.org:kth-6544DiVA, id: diva2:11286
Anmärkning
QC 20101123Tillgänglig från: 2006-12-11 Skapad: 2006-12-11 Senast uppdaterad: 2017-12-14Bibliografiskt granskad
Ingår i avhandling
1. Sparse Matrices in Self-Consistent Field Methods
Öppna denna publikation i ny flik eller fönster >>Sparse Matrices in Self-Consistent Field Methods
2006 (Engelska)Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

This thesis is part of an effort to enable large-scale Hartree-Fock/Kohn-Sham (HF/KS) calculations. The objective is to model molecules and materials containing thousands of atoms at the quantum mechanical level. HF/KS calculations are usually performed with the Self-Consistent Field (SCF) method. This method involves two computationally intensive steps. These steps are the construction of the Fock/Kohn-Sham potential matrix from a given electron density and the subsequent update of the electron density usually represented by the so-called density matrix. In this thesis the focus lies on the representation of potentials and electron density and on the density matrix construction step in the SCF method. Traditionally a diagonalization has been used for the construction of the density matrix. This diagonalization method is, however, not appropriate for large systems since the time complexity for this operation is σ(n3). Three types of alternative methods are described in this thesis; energy minimization, Chebyshev expansion, and density matrix purification. The efficiency of these methods relies on fast matrix-matrix multiplication. Since the occurring matrices become sparse when the separation between atoms exceeds some value, the matrix-matrix multiplication can be performed with complexity σ(n).

A hierarchic sparse matrix data structure is proposed for the storage and manipulation of matrices. This data structure allows for easy development and implementation of algebraic matrix operations, particularly needed for the density matrix construction, but also for other parts of the SCF calculation. The thesis addresses also truncation of small elements to enforce sparsity, permutation and blocking of matrices, and furthermore calculation of the HOMO-LUMO gap and a few surrounding eigenpairs when density matrix purification is used instead of the traditional diagonalization method.

Ort, förlag, år, upplaga, sidor
Stockholm: Bioteknologi, 2006. s. x, 38
Nyckelord
sparse matrix, self-consistent field, Hartree-Fock, Density Functional Theory, Density Matrix Purification
Nationell ämneskategori
Teoretisk kemi
Identifikatorer
urn:nbn:se:kth:diva-4219 (URN)978-91-7178-534-3 (ISBN)91-7178-534-5 (ISBN)
Presentation
2006-12-15, FD41, AlbaNova, Roslagstullsbacken 21, Stockholm, 10:00
Opponent
Handledare
Anmärkning

QC 20101123

Tillgänglig från: 2006-12-11 Skapad: 2006-12-11 Senast uppdaterad: 2020-01-02Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Sök vidare i DiVA

Av författaren/redaktören
Rubensson, EmanuelSalek, Pawel
Av organisationen
Teoretisk kemi
I samma tidskrift
Journal of Computational Chemistry
Teoretisk kemi

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 64 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf