From 734c3a6ce7440c030c6de7251d4939804989a520 Mon Sep 17 00:00:00 2001 From: JP Appel Date: Tue, 30 Apr 2024 11:32:25 -0400 Subject: removed massive html files --- presentation/presentation.html | 411 ----------------------------------------- 1 file changed, 411 deletions(-) delete mode 100644 presentation/presentation.html (limited to 'presentation/presentation.html') diff --git a/presentation/presentation.html b/presentation/presentation.html deleted file mode 100644 index 31c1443..0000000 --- a/presentation/presentation.html +++ /dev/null @@ -1,411 +0,0 @@ - - - - - - - - HPC Complex Fractal Generation - - - - - - - - - -

-

- -

-

HPC Complex Fractal Generation

-

JP Appel

-

David Marrero

-

- -

-

-

Prerequisite Knowledge

- -

-

-

Complex Numbers

-

i² = − 1 z = x + iy

- -

-

Addition

-

z₁ + z₂ = (x₁+x₂) + i(y₁+y₂)

- -

Multiplication

-

z₁z₂ = (x₁x₂−y₁y₂) + i(x₁y₂+x₂y₁)

-

-

-

-

What is the Mandelbrot Set

-

-

z_n = z_n − 1² + z₀

- -

-

-

-

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

-

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

-

- -

-

-

-

Implementation

- -

-

-

Program Structure

-

- -

-

-

Mandelbrot

-

- -

-

-

Tricorn

-

-

-

-

Burning Ship

-

-

-

-

Multibrot

-

-

-

-

Multicorn

-

-

-

-

Julia

-

-

-

-

-

Analysis

- -

-

-

-

Interactive Plots

-

-

-

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