Fast spectral projection algorithms for density-matrix computations
DOI10.1006/jcph.1999.6215zbMath0945.65049OpenAlexW2009747790MaRDI QIDQ1306101
Martin J. Mohlenkamp, Gregory Beylkin, Nicholas Coult
Publication date: 5 October 2000
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/431945893d0ebdc586597f2af7cdfefc33a01482
waveletsnumerical examplesign functiondensity-matrix computationsfast spectral projection algorithmsinteracting system of electronsKohn-Sham schemelocal cosine function
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Cites Work
- On parallelizable eigensolvers
- LU factorization of non-standard forms and direct multiresolution solvers
- A generalized one-dimensional fast multipole method with application to filtering of spherical harmonics
- Multiscale computation with interpolating wavelets
- A fast transform for spherical harmonics
- A fast direct algorithm for the solution of the Laplace equation on regions with fractal boundaries
- A fast spherical filter with uniform resolution
- Adaptive solution of partial differential equations in multiwavelet bases
- Fast wavelet transforms and numerical algorithms I
- Some Recent Advances in Density Matrix Theory
- A Class of Bases in $L^2$ for the Sparse Representation of Integral Operators
- The matrix sign function
- Wavelet-Like Bases for the Fast Solution of Second-Kind Integral Equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fast spectral projection algorithms for density-matrix computations