Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
documentation:language_reference:functions:blockbanddiagonalize [2025/08/08 16:08] – Micheangelo Tagliavinidocumentation:language_reference:functions:blockbanddiagonalize [2026/11/12 17:23] (current) – Maurits W. Haverkort
Line 1: Line 1:
 ====== BlockBandDiagonalize ====== ====== BlockBandDiagonalize ======
 ### ###
-The function //BlockBandDiagonalize()// can be used to reduce the number of basis (spin-)orbitals by making linear combinations of (spin-)orbitals, according to the tight-binding structure (hopping matrix elements) within the (spin-)orbitals. As a simple example to make the idea clear, consider the following 3-by-3 matrix:+The function //BlockBandDiagonalize()// can be used to reduce the number of basis (spin-) orbitals by making linear combinations of (spin-) orbitals, according to the tight-binding structure (hopping matrix elements) within the (spin-) orbitals. As a simple example to make the idea clear, consider the following 3-by-3 matrix:
 $$ M = \begin{pmatrix} 0 & 1 & 1 \\  1 & 1 & 0 \\ 1 & 0 & 1 \end{pmatrix} $$ $$ M = \begin{pmatrix} 0 & 1 & 1 \\  1 & 1 & 0 \\ 1 & 0 & 1 \end{pmatrix} $$
 Now, assuming that $M$ corresponds to a tight-binding Hamiltonian defined on some basis, we can linearly combine the second and third basis orbitals, such that we get a single orbital which mix with the first orbital via the matrix M. Consider the following unitary rotation matrix: Now, assuming that $M$ corresponds to a tight-binding Hamiltonian defined on some basis, we can linearly combine the second and third basis orbitals, such that we get a single orbital which mix with the first orbital via the matrix M. Consider the following unitary rotation matrix:
Line 30: Line 30:
    *NTri : (//integer//) maximum number of blocks included (//default: $\infty$//)    *NTri : (//integer//) maximum number of blocks included (//default: $\infty$//)
  
-   *NOrtho : (//integer//) maximum number of reorthogonalizations (//default: $\infty$//)+   *SingularValue : (//real//) smallest singular value of a block that is considered different from zero. A direction whose singular value is smaller is removed, which reduces the size of the blocks (//default: $10^{-6}$//)
  
-  *ReOrthogonalize: (//boolean//) use additional Gran-Schmidt orthogonalization after the Löwdin orthogonalization (//default: true//)+   *Epsilon : (//real//) smallest absolute prefactor of a determinant that is kept in a wave-function. Case 2 only; case 1 and case 3 work on dense matrices and have no determinants to truncate (//default: $1.49 \cdot 10^{-10}$//) 
 + 
 +   *NOrtho : (//integer//) maximum number of reorthogonalizations. Case 1 and case 3 only (//default: $\infty$//) 
 + 
 +  *ReOrthogonalize: (//boolean//) use additional Gran-Schmidt orthogonalization after the Löwdin orthogonalization. Case 1 and case 3 only (//default: true//) 
 + 
 +### 
 +//SingularValue// and //Epsilon// answer different questions and are set independently. //Epsilon// controls the wave-functions of case 2: a determinant whose prefactor is smaller than //Epsilon// is dropped. //SingularValue// controls the blocks in all three cases: a direction whose singular value is smaller is removed from the basis, so the blocks get smaller as the recursion proceeds. 
 +###
  
 ====== Output ====== ====== Output ======
Print/export