All Projects → chakravala → Fatou.jl

chakravala / Fatou.jl

Licence: MIT license
Fatou sets in Julia (Fractals, Newton basins, Mandelbrot)

Programming Languages

julia
2034 projects

Projects that are alternatives of or similar to Fatou.jl

recursion-and-dynamic-programming
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibo…
Stars: ✭ 37 (-59.78%)
Mutual labels:  recursion, fractal-images, fractal-algorithms, fractals
bbmandelbrotGo
generate images of a mandelbrot fractal
Stars: ✭ 19 (-79.35%)
Mutual labels:  mandelbrot, fractal-images, fractal-algorithms
numerical-veliz
Numerical Analysis code from the Oscar Veliz YouTube Channel
Stars: ✭ 83 (-9.78%)
Mutual labels:  root-finding, numerical-analysis, newtons-method
Fractal-Inferno
An Online Fractal Flame Generator.
Stars: ✭ 41 (-55.43%)
Mutual labels:  fractal-algorithms, fractals
DelayEmbeddings.jl
Delay coordinates embedding and Dataset definitions
Stars: ✭ 21 (-77.17%)
Mutual labels:  chaos, nonlinear
mandelbrot
No description or website provided.
Stars: ✭ 36 (-60.87%)
Mutual labels:  mandelbrot, fractals
Nonlinear-Optimization-Algorithms
MATLAB implementations of a variety of nonlinear programming algorithms.
Stars: ✭ 86 (-6.52%)
Mutual labels:  nonlinear, newtons-method
numerics
library of numerical methods using Armadillo
Stars: ✭ 17 (-81.52%)
Mutual labels:  root-finding, numerical-analysis
topologic
Visualiser for basic geometric primitives and fractals in arbitrary-dimensional spaces
Stars: ✭ 39 (-57.61%)
Mutual labels:  fractal-images, fractals
cmna-pkg
Computational Methods for Numerical Analysis
Stars: ✭ 13 (-85.87%)
Mutual labels:  root-finding, numerical-analysis
microlibs-scala
No description or website provided.
Stars: ✭ 24 (-73.91%)
Mutual labels:  recursion
RecursiveExtractor
RecursiveExtractor is a .NET Standard 2.0 archive extraction Library, and Command Line Tool which can process 7zip, ar, bzip2, deb, gzip, iso, rar, tar, vhd, vhdx, vmdk, wim, xzip, and zip archives and any nested combination of the supported formats.
Stars: ✭ 109 (+18.48%)
Mutual labels:  recursion
vim-rzip
Extends zip.vim to browse and write nested zip files
Stars: ✭ 22 (-76.09%)
Mutual labels:  recursion
SGDLibrary
MATLAB/Octave library for stochastic optimization algorithms: Version 1.0.20
Stars: ✭ 165 (+79.35%)
Mutual labels:  newtons-method
generalized-additive-models-workshop-2019
A workshop on using generalized additive models and the mgcv package.
Stars: ✭ 23 (-75%)
Mutual labels:  nonlinear
react-folder-tree
A versatile react treeview library that supports custom icons and event handlers
Stars: ✭ 56 (-39.13%)
Mutual labels:  recursion
algorithms
The All ▲lgorithms documentation website.
Stars: ✭ 114 (+23.91%)
Mutual labels:  numerical-analysis
react-binary-tree
Binary Tree Traversal Visualisation
Stars: ✭ 25 (-72.83%)
Mutual labels:  recursion
language-benchmarks
A simple benchmark system for compiled and interpreted languages.
Stars: ✭ 21 (-77.17%)
Mutual labels:  recursion
mandelbrot-threaded-webassembly
A simple demonstration of WebAssembly threads
Stars: ✭ 41 (-55.43%)
Mutual labels:  mandelbrot

Fatou.jl

Build Status Build status Coverage Status codecov.io

Julia package for Fatou sets. Install using Pkg.add("Fatou") in Julia. See Explore Fatou sets & Fractals in Wiki for detailed examples. This package provides: fatou, juliafill, mandelbrot, newton, basin, plot, and orbit; along with various internal functionality using Reduce and Julia expressions to help compute Fatou.FilledSet efficiently. Full documentation is included. The fatou function can be applied to a Fatou.Define object to produce a Fatou.FilledSet, which can then be passed as an argument to plot functions of Makie, PyPlot, ImageInTerminal. Creation of Fatou.Define objects is done via passing a parse-able function expression string (in variables z, c) and optional keyword arguments to juliafill, mandelbrot, and newton.

Background

This package enables users of Julia lang to easily generate, explore, and share fractals of Julia, Mandelbrot, and Newton type. The name Fatou comes from the mathematician after whom the Fatou sets are named. Note that the Julia language is not named after the mathematician Julia after whom the Julia sets are named. This is a mere coincidence.

Definition (Julia set): For any holomorphic function on a complex plane, the boundary of the set of points whose result diverges when the function is iteratively evaluated at each point.

Definition (Fatou set): The Julia set’s complement is the set of fixed limit points from holomorphic recursion.

Definition (Mandelbrot set): The set of points on a complex parameter space for which the holomorphic recursion does not go to infinity from a common starting point z0.

Definition (Newton fractal): The Julia/Fatou set obtained from the recursion of the Newton method z↦z−m⋅f(z)/f′(z) applied to a holomorphic function.

The package has essentially two different plotting modes controlled by the iter boolean keyword, which toggles whether to color the image by iteration count or whether to use a default (or custom) limit-value coloring function.

The number of Julia threads available is detected at the startup and is reported it back. When a specified Fatou set is computed, multi-threading is used to compute the pixels. Since each pixel is independent of any other pixel, it doesn’t matter in what order or on how many threads it is computed, the more you use the faster it is. The environment variable JULIA_NUM_THREADS can be used to enable the multi-threading for more than 1 thread.

Please share with us your favorite fractals as Fatou code snippets!

Examples

Fatou.Define provides the following optional keyword arguments:

Q::Expr 	= :(abs2(z)),           # escape criterion, (z, c) -> Q
C::Expr 	= :((angle(z)/(2π))*n^p)# coloring, (z, n=iter., p=exp.) -> C= π/2, # Array{Float64,1}      # Bounds, [x(a),x(b),y(a),y(b)]
n::Integer  = 176,                  # vertical grid points
N::Integer  = 35,                   # max. iterations
ϵ::Number   = 4,                    # basin ϵ-Limit criterion
iter::Bool  = false,                # toggle iteration mode
p::Number   = 0,                    # iteration color exponent
newt::Bool  = false,                # toggle Newton mode
m::Number   = 0,                    # Newton multiplicity factor
mandel::Bool= false,                # toggle Mandelbrot mode
seed::Number= 0.0+0.0im,            # Mandelbrot seed value
x0          = nothing,              # orbit starting point
orbit::Int  = 0,                    # orbit cobweb depth
depth::Int  = 1,                    # depth of function composition
cmap::String= ""                    # imshow color map

A Fatou set is a collection of complex valued orbits of an iterated function. To help illustrate this, an additional feature is a plot function designed to visualize real-valued-orbits. The program can be initialized with using Fatou, PyPlot or Makie or ImageInTerminal. For PyPlot the imshow and plot methods can be used, while for Makie the heatmap, contour, surface, and arrows methods can be used.

When using ImageInTerminal, the display of a Fatou.FilledSet will be plotted automatically in the terminal. The orbit method also has optional UnicodePlots compatibility. Additional plotting support can be added via Pull-Request by adding another Requires script to the __init__() function definition.

The following is a cobweb orbit plot of a function:

juliafill(:(z^2-0.67),∂=[-1.25,1.5],x0=1.25,orbit=17,depth=3,n=147) |> orbit

img/orbit.png

With fatou and plot it is simple to display a filled in Julia set:

c = -0.06 + 0.67im
nf = juliafill(:(z^2+$c),∂=[-1.5,1.5,-1,1],N=80,n=1501,cmap="gnuplot",iter=true)
plot(fatou(nf), bare=true)

img/filled-julia.png

It is also possible to switch to mandelbrot mode:

mandelbrot(:(z^2+c),n=800,N=20,∂=[-1.91,0.51,-1.21,1.21],cmap="gist_earth") |> fatou |> plot

img/mandelbrot.png

Fatou also provides basin to display the the Newton / Fatou basins using set notation in LaTeX in IJulia.

map(display,[basin(newton(:(z^3-1)),i) for i  1:3])

D1(ϵ)

D2(ϵ)

D3(ϵ)

Compute the Newton fractal Julia set for a function with annotated plot of iteration count:

nf = newton(:(z^3-1),n=800=0.1,N=25,iter=true,cmap="jet")
nf |> fatou |> plot
basin(nf,3)

img/newton.png

Generalized Newton fractal example:

nf = newton(:(sin(z)-1),m=1-1im,∂=[-2π/3,-π/3,-π/6/6],n=500,N=33,iter=true=0.05,cmap="cubehelix")
nf |> fatou |> plot
basin(nf,2)

img/generalized-newton.png

D2(ϵ)

View Explore Fatou sets & Fractals in Wiki for detailed examples.

Troubleshooting on Julia 1.0.1+

Note that Fatou is not compatible with Julia 1.0 but works on Julia 1.0.1 alright. Note that a stackoverflow error occurs on Julia 1.0.1+ when the Reduce package is precompiled with ENV["REDPRE"] flag set, therefore it is recommended to not set it. If you encounter an unsatisfiable requirement in the package manager, an easy workaround is to use dev Fatou instead of add Fatou.

Note that the project description data, including the texts, logos, images, and/or trademarks, for each open source project belongs to its rightful owner. If you wish to add or remove any projects, please contact us at [email protected].