From 3efffb9ca98303487cf091447c7ba3fba3c71df8 Mon Sep 17 00:00:00 2001 From: JP Appel Date: Tue, 30 Apr 2024 06:46:31 -0400 Subject: finishing changes to presentation --- presentation/presentation.html | 411 +++++++++++++++++++++++++++++++++++++++++ 1 file changed, 411 insertions(+) create mode 100644 presentation/presentation.html (limited to 'presentation/presentation.html') diff --git a/presentation/presentation.html b/presentation/presentation.html new file mode 100644 index 0000000..31c1443 --- /dev/null +++ b/presentation/presentation.html @@ -0,0 +1,411 @@ + + + + + + + + HPC Complex Fractal Generation + + + + + + + + + +
+
+ +
+

HPC Complex Fractal Generation

+

JP Appel

+

David Marrero

+
+ +
+
+

Prerequisite Knowledge

+ +
+
+

Complex Numbers

+

i2 =  − 1 z = x + iy

+ +
+

Addition

+

z1 + z2 = (x1+x2) + i(y1+y2)

+ +

Multiplication

+

z1z2 = (x1x2−y1y2) + i(x1y2+x2y1)

+
+
+
+

What is the Mandelbrot Set

+
+

zn = zn − 12 + z0

+ +
+
+
+

Fractals

+
+
+
    +
  • infinite self-similar geometric shape
    • +
  • have “fractional dimension”
    • +
+
+
+Sripenski Triangle + +
+
+
+
+

The Mandelbrot set is a fractal in the complex plane

+ +
+
+
+

Fractal in Nature

+
+Romanesco Cauliflower + +
+ +
+
+

Escape Time Algorithm

+
+
    +
  • Inputs +
      +
    • Maximum Number of iterations
      • +
    • Upper bound
      • +
    • +
+
    +
  1. Create a grid of points to sample
    2. +
  2. For each point in the sample space +
      +
    1. Compute the next term in the sequence
      2. +
    2. if greater than the upper bound return the number +of iterations
      3. +
    3. else repeat until the maximum number of iterations +and return
      4. +
    3. +
+
+ +
+
+
+

Implementation

+ +
+
+

Program Structure

+

+ +
+
+

Mandelbrot

+

Image

+ +
+
+

Tricorn

+

Image

+
+
+

Burning Ship

+

Image

+
+
+

Multibrot

+

Image

+
+
+

Multicorn

+

GIF

+
+
+

Julia

+

Image

+
+
+
+

Analysis

+ +
+
+

+

Interactive Plots

+
+
+
+ + + + + + + + + + + -- cgit v1.2.3