v0.10.0
This release adds the BLA (bivariate linear approximation) algorithm for the Mandelbrot set. As of this release, BLA is still considered experimental and is not active for the default auto
algorithm.
- Add arbitrary precision square root (used for period-finding)
- Implement ball arithmetic and Newton's method for period- and root-finding
- Implement BLA, with binary tree BLA merging
- Re-use BLA ref. orbit if on-screen
- Use test points to auto-find a good BLA epsilon
- Add "automatic with BLA" algorithm option
- Allow BLA epsilon to be set with the "algo" string parameter
- Improve the speed of
infNumTruncateToLen()
with a new function- this mainly makes reference orbit and period-finding computation faster, which are the main places arbitrary precision math is used
- Refactor unit tests in several files
A blog post discussing the implementation of BLA, and showing performance at example locations, is here: https://philthompson.me/2023/Faster-Mandelbrot-Set-Rendering-with-BLA-Bivariate-Linear-Approximation.html
This release is live at https://philthompson.me/very-plotter/