This repository was archived by the owner on Jun 18, 2025. It is now read-only.
Richardson fold, faster Lagrange-interpolation-function #456
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.
From the CHANGELOG:
sicmutils.mechanics.lagrange/{Γ,Γ-bar}
are removed in favor of theexisting
Gamma
andGamma-bar
functions. Thesicmutils.env
aliases aregone as well.
sicmutils.mechanics.lagrange/Lagrange-interpolation-function
now returnsan actual polynomial instance. Because polynomials support
IFn
and respondto the derivative operator
D
, this makes thefind-path
example on pages22/23 of SICM run about 5x faster.
Richardson extrapolation is now implemented as a functional fold. The
exposition in
sicmutils.polynomial.richardson
discusses this; thenamespaces gains
richardson-fold
,richardson-sum
andrichardson-scan
.