-
Notifications
You must be signed in to change notification settings - Fork 21
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Stabilize KPM #318
Merged
Stabilize KPM #318
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
The new interface automatically selects the polynomial order according to the specified error tolerance. If
tol
is too high, some ringing will become visible. This is a sign thattol
must be lowered.In spite of the name "kernel polynomial method" (KPM), this implementation does not employ a Jackson kernel. Instead, we use simple truncation of the Chebyshev series (i.e., the "Dirichlet kernel"). For purposes of approximating relatively smooth functions, this simple truncation provides accuracy that improves exponentially with the number of polynomials,
M ~ -log(tol)
.The finite temperature Bose occupation factor has been removed for now because I haven't been able to find a good regularization strategy. At$T=0$ , the Bose occupation factor becomes a step function at $\omega = 0$ , and this is straightforward to regularize as a sigmoid (tanh) function. There is special logic to select a broadening width $\sigma$ that balances between (a) Capturing the large intensity near an ordering wavevector (see the new tutorial 09), but (b) not sacrificing too much accuracy in the truncated Chebyshev approximation to a step function (see the bottom of $\sigma$ can decrease like
test_kpm.jl
). A reasonable heuristic seems to be that1 / sqrt(-log(tol))
whereas the true KPM resolution for decreases like1/M ~ -1 / log(tol)
. In this way, decreasingtol
improves all types of accuracy, including "ringing" artifacts from the step function, while still allowing the step function to be very sharp.Also in this PR: Broadening kernels now keep track of additional information: the FWHM, the integral function, and a human-readable name. The line broadening integral is now used in
intensities_static
for SWT calculations.