The kernel polynomial method
From MaRDI portal
Abstract: Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of Chebyshev expansion based algorithms and the Kernel Polynomial Method. Characterized by a resource consumption that scales linearly with the problem dimension these methods enjoyed growing popularity over the last decade and found broad application not only in physics. Representative examples from the fields of disordered systems, strongly correlated electrons, electron-phonon interaction, and quantum spin systems we discuss in detail. In addition, we illustrate how the Kernel Polynomial Method is successfully embedded into other numerical techniques, such as Cluster Perturbation Theory or Monte Carlo simulation.
Recommendations
- Kernel polynomial approximations for densities of states and spectral functions
- scientific article; zbMATH DE number 5269406
- An accurate and efficient algorithm for the computation of the characteristic polynomial of a general square matrix
- The forced oscillator method: eigenvalue analysis and computing linear response functions
- Polynomial expansion Monte Carlo study of frustrated itinerant electron systems: application to a spin-ice type Kondo lattice model on a pyrochlore lattice
Cites work
- An algorithm for Gaussian quadrature given modified moments
- Construction of Gauss-Christoffel Quadrature Formulas
- Error Bounds in Equilibrium Statistical Mechanics
- scientific article; zbMATH DE number 3917549 (Why is no real title available?)
- scientific article; zbMATH DE number 43996 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 2159017 (Why is no real title available?)
- scientific article; zbMATH DE number 3260990 (Why is no real title available?)
- Hybrid Monte Carlo algorithm for the double exchange model
- Implicit purification for temperature-dependent density matrices
- Kernel polynomial approximations for densities of states and spectral functions
- On the Construction of Gaussian Quadrature Rules from Modified Moments
- OrderNMonte Carlo Algorithm for Fermion Systems Coupled with Fluctuating Adiabatical Fields
- Studies of polaron motion. I: The molecular-crystal model; II: The 'small' polaron
- The Chebyshev propagator for quantum systems
- The density-matrix renormalization group
Cited in
(82)- Polynomials with bounds and numerical approximation
- High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations
- Gaussian integration formulas for logarithmic weights and application to 2-dimensional solid-state lattices
- Cucheb: a GPU implementation of the filtered Lanczos procedure
- Kernel polynomial approximations for densities of states and spectral functions
- Robust zero modes in disordered two-dimensional honeycomb lattice with Kekulé bond ordering
- Rare regions and avoided quantum criticality in disordered Weyl semimetals and superconductors
- Linear scaling quantum transport methodologies
- Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials
- Time-evolution methods for matrix-product states
- Numerical approaches to time evolution of complex quantum systems
- Kernel method and linear recurrence system
- A Riemann-Stein kernel method
- Intertwined charge and spin orders through the exchange-interaction on a square lattice
- \texttt{TBPLaS}: a tight-binding package for large-scale simulation
- An effective version of Schmüdgen's Positivstellensatz for the hypercube
- Approximating spectral densities of large matrices
- Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
- scientific article; zbMATH DE number 5991637 (Why is no real title available?)
- Efficient linear-scaling quantum transport calculations on graphics processing units and applications on electron transport in graphene
- Polynomial expansion Monte Carlo study of frustrated itinerant electron systems: application to a spin-ice type Kondo lattice model on a pyrochlore lattice
- Uncertainty propagation; intrusive kinetic formulations of scalar conservation laws
- A Polyhedral Description of Kernels
- O(N) algorithms for disordered systems
- Quantum percolation in disordered structures
- scientific article; zbMATH DE number 1943115 (Why is no real title available?)
- Fast computation of spectral densities for generalized eigenvalue problems
- An entropic Fourier method for the Boltzmann equation
- Computing Spectral Measures of Self-Adjoint Operators
- Sum-of-Squares Hierarchies for Polynomial Optimization and the Christoffel--Darboux Kernel
- Topological weaire-thorpe models of amorphous matter
- An Entropic Method for Discrete Systems with Gibbs Entropy
- Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian
- Modeling and computation of Kubo conductivity for two-dimensional incommensurate bilayers
- Randomized estimation of spectral densities of large matrices made accurate
- Generalized Kubo formulas for the transport properties of incommensurate 2D atomic heterostructures
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- High-order commutator-free exponential time-propagation of driven quantum systems
- Electronic density of states for incommensurate layers
- A new stability and convergence proof of the Fourier-Galerkin spectral method for the spatially homogeneous Boltzmann equation
- Dedicated hardware for linearly-scaling algorithms in condensed-matter physics
- Chebyshev kernel polynomial method for efficient calculation of the quasiparticle random phase approximation response function
- Towards a comprehensive theory of metal-insulator transitions in doped semiconductors
- Krylov-Aware Stochastic Trace Estimation
- Memory efficient Fock-space recursion scheme for computing many-fermion resolvents
- Interaction effects in a microscopic quantum wire model with strong spin–orbit interaction
- A modified version of the Methfessel-Paxton method
- Identification of the Majorana edge modes in tight-binding systems based on the Krylov method
- Optimised Trotter decompositions for classical and quantum computing
- Electron-hole asymmetry in electrical conductivity of low-fluorinated graphene: numerical study
- \textsf{MagneticKP}: a package for quickly constructing \(\boldsymbol{k}\cdot\boldsymbol{p}\) models of magnetic and non-magnetic crystals
- Effective Heisenberg exchange integrals of diluted magnetic semiconductors determined within realistic multi-band tight-binding models
- Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
- On the delta function broadening in the Kubo-Greenwood equation
- Multifractality and the distribution of the Kondo temperature at the Anderson transition
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Spectral function distributions in the correlated Anderson model
- Many body density of states of a system of non interacting spinless fermions
- Matrix-product state approach to the generalized nuclear pairing Hamiltonian
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Skyrmion crystals in the triangular Kondo lattice model
- Faster randomized partial trace estimation
- Non-unitary quantum many-body dynamics using the Faber polynomial method
- Kernel polynomial method for linear spin wave theory
- Convergence rates for sums-of-squares hierarchies with correlative sparsity
- The link between 1-norm approximation and effective Positivstellensätze for the hypercube
- Isotropic 3D topological phases with broken time reversal symmetry
- Learning the local density of states of a bilayer moiré material
- Universal matrix sparsifiers and fast deterministic algorithms for linear algebra
- Exactly solvable models for universal operator growth
- Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
- The kernel polynomial method based on Jacobi polynomials
- Convergence of the planewave approximations for quantum incommensurate systems
- ContHutch++: stochastic trace estimation for implicit integral operators
- Fixed-sparsity matrix approximation from matrix-vector products
- Polynomial argmin for recovery and approximation of multivariate discontinuous functions
- A structure-preserving Chebyshev-filtered subspace iteration for the Bethe-Salpeter eigenvalue problem
- Numerical methods for the simulation of quantum walks and quantum annealing
- Stochastic trace estimation for parameter-dependent matrices applied to spectral density approximation
- Third Chern topology in hexeract circuits
- Accurate Density of States Estimation: A Comparative Study
- Positivity of certain sums over Jacobi kernel polynomials
This page was built for publication: The kernel polynomial method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077076)
