# Nonmonotonic Recursive Polynomial Expansions for Linear Scaling Calculation of the Density Matrix.

@article{Rubensson2011NonmonotonicRP, title={Nonmonotonic Recursive Polynomial Expansions for Linear Scaling Calculation of the Density Matrix.}, author={Emanuel H. Rubensson}, journal={Journal of chemical theory and computation}, year={2011}, volume={7 5}, pages={ 1233-6 } }

As it stands, density matrix purification is a powerful tool for linear scaling electronic structure calculations. The convergence is rapid and depends only weakly on the band gap. However, as will be shown in this letter, there is room for improvements. The key is to allow for nonmonotonicity in the recursive polynomial expansion. On the basis of this idea, new purification schemes are proposed that require only half the number of matrix-matrix multiplications compared to previous schemes. The…

## 30 Citations

### A perspective on the density matrix purification for linear scaling electronic structure calculations

- Computer Science
- 2016

It is shown that a carefully chosen objective function can lead to significantly improved algorithms and numerical results in the developments of purification polynomials.

### Linear Scaling Pseudo Fermi-Operator Expansion for Fractional Occupation.

- PhysicsJournal of chemical theory and computation
- 2019

The proposed methodology for recursive Fermi-operator expansion methods for the calculation of the idempotent density matrix is demonstrated and evaluated for different electronic structure methods, including density functional tight-binding theory, Kohn-Sham density functional theory using numerical orbitals, and quantum chemistry Hartree-Fock theory using Gaussian basis functions.

### Sparse Projected-Gradient Method As a Linear-Scaling Low-Memory Alternative to Diagonalization in Self-Consistent Field Electronic Structure Calculations.

- Computer ScienceJournal of chemical theory and computation
- 2013

The new method reproduces the sequence of semiempirical SCF iterations obtained by standard eigenvalue decomposition algorithms to good precision and is faster than standard implementations of modern eigen value decomposition methods for sparse matrices containing more than 50 000 non-null elements.

### On-the-Fly Computation of Frontal Orbitals in Density Matrix Expansions.

- Computer ScienceJournal of chemical theory and computation
- 2018

A transparent way to select recursive expansion iteration and shift for the eigenvector computation that results in a sharp eigenvalue filter that can be used to compute homo and lumo orbitals with sufficient accuracy in a small fraction of the total recursive expansion time.

### A STABLE SCALING OF NEWTON-SCHULZ FOR IMPROVING THE SIGN FUNCTION COMPUTATION OF A HERMITIAN MATRIX

- Computer Science, Mathematics
- 2014

This paper proposes a variant for Hermitian matrices that improves the initially slow convergence of the iteration of the Newton-Schulz iteration to have steeper derivatives of the mapping function at the origin such that the converge of the eigenvalues with small magnitudes is accelerated.

### Efficient parallel linear scaling construction of the density matrix for Born-Oppenheimer molecular dynamics.

- Computer ScienceJournal of chemical theory and computation
- 2015

We present an algorithm for the calculation of the density matrix that for insulators scales linearly with system size and parallelizes efficiently on multicore, shared memory platforms with small…

### Parameterless Stopping Criteria for Recursive Density Matrix Expansions.

- Computer ScienceJournal of chemical theory and computation
- 2016

Parameterless stopping criteria for recursive polynomial expansions to construct the density matrix in electronic structure calculations are proposed. Based on convergence-order estimation the new…

### Accelerated density matrix expansions for Born-Oppenheimer molecular dynamics

- Physics
- 2013

An accelerated polynomial expansion scheme to construct the density matrix in quantum mechanical molecular dynamics simulations is proposed. The scheme is based on recursive density matrix…

## References

SHOWING 1-10 OF 32 REFERENCES

### Transforms for idempotency purification of density matrices in linear-scaling electronic-structure calculations

- Mathematics
- 2001

### Linear scaling density matrix search based on sign matrices

- Computer Science
- 2000

It is shown that a special damping technique greatly improves the stability of self-consistent field (SCF) calculations when using density matrix purification and sign methods.

### Expansion algorithm for the density matrix

- Computer Science
- 2002

It is shown that the computational complexity, measured as the number of matrix multiplications, essentially is independent of system size even for metallic materials with a vanishing band gap.

### Chebyshev expansion methods for electronic structure calculations on large molecular systems

- Computer Science
- 1997

A flexible tree code for the sparse numerical algebra, an efficient method to locate the chemical potential, and the use of Chebyshev expansions as analytical tools to estimate the range and sparsity of the DM and the overlap matrix are discussed.

### Assessment of density matrix methods for linear scaling electronic structure calculations

- PhysicsJournal of physics. Condensed matter : an Institute of Physics journal
- 2011

Purification and minimization methods for linear scaling computation of the one-particle density matrix for a fixed Hamiltonian matrix are compared and it is investigated how the convergence speed for the different methods depends on the eigenvalue distribution in theHamiltonian matrix.

### Density matrix purification with rigorous error control.

- EngineeringThe Journal of chemical physics
- 2008

A strategy for the removal of small matrix elements in density matrix purification is proposed with which the forward error can be rigorously controlled, and the concept of canonical angles is used to measure and control differences between exact and approximate occupied subspaces.

### Fast Spectral Projection Algorithms for Density-Matrix Computations

- Computer Science
- 1999

A fast algorithm for the construction of a spectral projector that allows us to compute the density matrix, as used in, e.g., the Kohn?Sham iteration, and so obtain the electron density.

### Improved Fermi operator expansion methods for fast electronic structure calculations

- Mathematics
- 2003

Linear scaling algorithms based on Fermi operator expansions (FOE) have been considered significantly slower than other alternative approaches in evaluating the density matrix in Kohn–Sham density…

### Density-matrix electronic-structure method with linear system-size scaling.

- PhysicsPhysical review. B, Condensed matter
- 1993

We introduce a method for the solution of the electronic-structure problem in the independent-electron approximation. The method is based upon a variational solution for the density matrix, which is…

### Linear scaling electronic structure methods

- Physics
- 1999

Methods exhibiting linear scaling with respect to the size of the system, the so-called O(N) methods, are an essential tool for the calculation of the electronic structure of large systems containing…