References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_upper_j_idt152",{id:"formSmash:upper:j_idt152",widgetVar:"widget_formSmash_upper_j_idt152",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:upper:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_upper_j_idt153_j_idt156",{id:"formSmash:upper:j_idt153:j_idt156",widgetVar:"widget_formSmash_upper_j_idt153_j_idt156",target:"formSmash:upper:j_idt153:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});

Sparse Matrices in Self-Consistent Field MethodsPrimeFaces.cw("AccordionPanel","widget_formSmash_some",{id:"formSmash:some",widgetVar:"widget_formSmash_some",multiple:true}); PrimeFaces.cw("AccordionPanel","widget_formSmash_all",{id:"formSmash:all",widgetVar:"widget_formSmash_all",multiple:true});
function selectAll()
{
var panelSome = $(PrimeFaces.escapeClientId("formSmash:some"));
var panelAll = $(PrimeFaces.escapeClientId("formSmash:all"));
panelAll.toggle();
toggleList(panelSome.get(0).childNodes, panelAll);
toggleList(panelAll.get(0).childNodes, panelAll);
}
/*Toggling the list of authorPanel nodes according to the toggling of the closeable second panel */
function toggleList(childList, panel)
{
var panelWasOpen = (panel.get(0).style.display == 'none');
// console.log('panel was open ' + panelWasOpen);
for (var c = 0; c < childList.length; c++) {
if (childList[c].classList.contains('authorPanel')) {
clickNode(panelWasOpen, childList[c]);
}
}
}
/*nodes have styleClass ui-corner-top if they are expanded and ui-corner-all if they are collapsed */
function clickNode(collapse, child)
{
if (collapse && child.classList.contains('ui-corner-top')) {
// console.log('collapse');
child.click();
}
if (!collapse && child.classList.contains('ui-corner-all')) {
// console.log('expand');
child.click();
}
}
PrimeFaces.cw("AccordionPanel","widget_formSmash_responsibleOrgs",{id:"formSmash:responsibleOrgs",widgetVar:"widget_formSmash_responsibleOrgs",multiple:true}); 2006 (English)Licentiate thesis, comprehensive summary (Other scientific)
##### Abstract [en]

##### Place, publisher, year, edition, pages

Stockholm: Bioteknologi , 2006. , x, 38 p.
##### Keyword [en]

sparse matrix, self-consistent field, Hartree-Fock, Density Functional Theory, Density Matrix Purification
##### National Category

Theoretical Chemistry
##### Identifiers

URN: urn:nbn:se:kth:diva-4219ISBN: 978-91-7178-534-3ISBN: 978-91-7178-534-5OAI: oai:DiVA.org:kth-4219DiVA: diva2:11291
##### Presentation

2006-12-15, FD41, AlbaNova, Roslagstullsbacken 21, Stockholm, 10:00
##### Opponent

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt455",{id:"formSmash:j_idt455",widgetVar:"widget_formSmash_j_idt455",multiple:true});
##### Supervisors

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt461",{id:"formSmash:j_idt461",widgetVar:"widget_formSmash_j_idt461",multiple:true});
#####

PrimeFaces.cw("AccordionPanel","widget_formSmash_j_idt467",{id:"formSmash:j_idt467",widgetVar:"widget_formSmash_j_idt467",multiple:true});
##### Note

QC 20101123Available from: 2006-12-11 Created: 2006-12-11 Last updated: 2010-11-23Bibliographically approved
##### List of papers

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 σ(n^{3}). 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.

1. Systematic sparse matrix error control for linear scaling electronic structure calculations$(function(){PrimeFaces.cw("OverlayPanel","overlay11286",{id:"formSmash:j_idt503:0:j_idt507",widgetVar:"overlay11286",target:"formSmash:j_idt503:0:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

2. Determination of the chemical potential and HOMO/LUMO orbitals in density purification methods$(function(){PrimeFaces.cw("OverlayPanel","overlay11287",{id:"formSmash:j_idt503:1:j_idt507",widgetVar:"overlay11287",target:"formSmash:j_idt503:1:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

3. A hierarchic sparse matrix data structure for large-scale Hartree-Fock/Kohn-Sham calculations$(function(){PrimeFaces.cw("OverlayPanel","overlay334330",{id:"formSmash:j_idt503:2:j_idt507",widgetVar:"overlay334330",target:"formSmash:j_idt503:2:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

4. Sparse matrix algebra for quantum modeling of large systems$(function(){PrimeFaces.cw("OverlayPanel","overlay11289",{id:"formSmash:j_idt503:3:j_idt507",widgetVar:"overlay11289",target:"formSmash:j_idt503:3:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

5. Near-Idempotent Matrices$(function(){PrimeFaces.cw("OverlayPanel","overlay11290",{id:"formSmash:j_idt503:4:j_idt507",widgetVar:"overlay11290",target:"formSmash:j_idt503:4:partsLink",showEvent:"mousedown",hideEvent:"mousedown",showEffect:"blind",hideEffect:"fade",appendToBody:true});});

References$(function(){PrimeFaces.cw("TieredMenu","widget_formSmash_lower_j_idt1196",{id:"formSmash:lower:j_idt1196",widgetVar:"widget_formSmash_lower_j_idt1196",autoDisplay:true,overlay:true,my:"left top",at:"left bottom",trigger:"formSmash:lower:referencesLink",triggerEvent:"click"});}); $(function(){PrimeFaces.cw("OverlayPanel","widget_formSmash_lower_j_idt1197_j_idt1199",{id:"formSmash:lower:j_idt1197:j_idt1199",widgetVar:"widget_formSmash_lower_j_idt1197_j_idt1199",target:"formSmash:lower:j_idt1197:permLink",showEffect:"blind",hideEffect:"fade",my:"right top",at:"right bottom",showCloseIcon:true});});