Commit 8092df65 authored by Victor Yu's avatar Victor Yu

Fix a typo in the manual

parent 5449420d
No preview for this file type
......@@ -273,7 +273,7 @@ The process of density matrix purification can be written in the general form
where $\boldsymbol{P}_\text{n}$ is the density matrix in the n$^\text{th}$ purification iteration, $\boldsymbol{P}_\text{n+1}$ is the density matrix in the (n+1)$^\text{th}$ iteration, and $\text{f}(\boldsymbol{P})$ is usually a matrix polynomial, which can be calculated by matrix-matrix multiplications.\\
Various algorithms have been developed to carry out the density matrix purification efficiently, such as the methods to purify the density matrix have been developed, such as the canonical purification \cite{purification_palser_1998}, the trace resetting purification methods \cite{purification_niklasson_2002}, and the generalized canonical purification \cite{purification_truflandier_2016}. These methods are implemented in the NTPoly library \cite{ntpoly_dawson_2018} using its sparse matrix-matrix multiplication kernel. Given sufficiently sparse matrices, the computational complexity of density matrix purification with NTPoly is O(N) for insulating systems.\\
Various algorithms have been developed to carry out the density matrix purification efficiently, such as the canonical purification \cite{purification_palser_1998}, the trace resetting purification methods \cite{purification_niklasson_2002}, and the generalized canonical purification \cite{purification_truflandier_2016}. These methods are implemented in the NTPoly library \cite{ntpoly_dawson_2018} using its sparse matrix-matrix multiplication kernel. Given sufficiently sparse matrices, the computational complexity of density matrix purification with NTPoly is O(N) for insulating systems.\\
\section{Citing ELSI}
\label{sec:cite}
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment