(source: ctqwMPI.F90)
export a PETSc vector to a file
| Parameters: |
|
|---|
import a PETSc vector from a file
| Parameters: |
|
|---|
export a PETSc matrix to a file
| Parameters: |
|
|---|
import a PETSc matrix from a file
| Parameters: |
|
|---|
creates a \(n\times n\) identity matrix
| Parameters: |
|
|---|
compute the Kronecker product of two arrays
| Parameters: |
|
|---|
Import an adjacency matrix from a file, and create a PETSc Hamiltonian matrix.
| Parameters: |
|
|---|---|
| Call to: |
convert an adjacency array to a PETSc Hamiltonian matrix
| Parameters: |
|
|---|---|
| Called from: |
| Parameters: |
|
|---|
| Parameters: |
|
|---|
convert from a 2D to 1D statespace for 2 particles, using \(coord = n(x + n/2 - 1) + y + n/2 - 1\)
| Parameters: |
|
|---|---|
| Return: | coord [integer] :: output 2P statepace coordinate |
| Called from: |
convert from a 2D to 1D statespace for 2 particles, using \(coord2P = xn^2 + ny + z\)
| Parameters: |
|
|---|---|
| Return: | coord3p [integer] |
| Called from: |
Calculates the marginal probability of 1 particle state psi; i.e. \(|\psi|^2\)
| Parameters: |
|
|---|
Calculates the marginal probability of particle number p
| Parameters: |
|
|---|
| Parameters: |
|
|---|
| Parameters: |
|
|---|
| Parameters: |
|
|---|---|
| Called from: | |
| Call to: |
| Parameters: |
|
|---|---|
| Called from: | |
| Call to: |
| Parameters: |
|
|---|---|
| Called from: |
| Parameters: |
|
|---|---|
| Called from: |
| Parameters: |
|
|---|---|
| Called from: |
| Parameters: |
|
|---|
| Parameters: |
|
|---|---|
| Called from: |
| Parameters: |
|
|---|---|
| Call to: |
| Parameters: |
|
|---|---|
| Return: | number_of_edges [integer] |
| Called from: |
| Parameters: |
|
|---|---|
| Return: | getedgestate [real] |
| Called from: | |
| Call to: |
| Parameters: |
|
|---|---|
| Called from: | |
| Call to: |
| Parameters: |
|
|---|---|
| Called from: | |
| Call to: |
| Parameters: |
|
|---|---|
| Call to: | adjtoh(), getalledgestates3p(), getalledgestates(), min_max_eigs(), p3_init(), p2_init(), qw_cheby(), qw_krylov(), d_refsor() |
:p real xdont(:) [inout]:
| Called from: | graphiscert(), buildfrequencytable() |
|---|
Note
d_refsor(), a highly optimised Fortran sorting implementation written by Michel Olagnon and part of the ORDERPACK 2.0 suite of ranking and sorting algorithms for Fortran 90.