Editing Numerical Methods

<div style="background-color: #4B0082; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
{{BloomIntro}}
Numerical Methods are mathematical algorithms used to find "Close Enough" numerical solutions to problems that are too complex to be solved exactly. While "Analytical Math" gives you a perfect formula (like $x = \pi$), numerical methods give you a number (like $x \approx 3.14159$). Because most real-world problems—like weather prediction, rocket trajectories, and bridge stability—cannot be solved with a simple formula, numerical methods are the bridge between '''Theoretical Math''' and '''Computers'''. They allow us to simulate reality with incredible precision, one tiny step at a time.
</div>

__TOC__

<div style="background-color: #000080; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Numerical Analysis''' — The study of algorithms that use numerical approximation for the problems of mathematical analysis.
* '''Algorithm''' — A step-by-step procedure for solving a problem.
* '''Approximation''' — A value that is nearly but not exactly correct.
* '''Error''' — The difference between the exact solution and the numerical approximation.
* '''Iteration''' — The repetition of a process to get closer and closer to a solution.
* '''Convergence''' — When a numerical method gets closer to the "True" answer as you run more steps.
* '''Divergence''' — When a numerical method fails and the numbers fly away to infinity.
* '''Floating Point Arithmetic''' — How computers handle numbers with decimals (and the errors it causes).
* '''Interpolation''' — Estimating a value "between" known data points.
* '''Extrapolation''' — Estimating a value "outside" the range of known data points.
* '''Newton's Method''' — A famous iterative way to find where a function equals zero.
* '''Euler's Method''' — A basic way to solve differential equations by taking tiny steps in the direction of the slope.
* '''Rounding Error''' — Errors caused by a computer's limited memory (e.g., trying to store $\pi$ with only 10 digits).
* '''Truncation Error''' — Errors caused by stopping an infinite process early (e.g., using only the first 3 terms of an infinite series).
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Understanding</span> ==
Numerical methods are about the '''Trade-off between Speed and Accuracy'''.

'''1. The Why''':
Many equations in the real world are "Impossible" to solve with a pen and paper. For example, the 3-Body Problem (how three planets move together) has no exact formula. To find the answer, we have a computer calculate the position for the next 1 second, then the next, and the next.

'''2. The How (Tiny Steps)''':
Imagine you are walking in the dark. You can't see the destination, but you can feel the slope of the ground.
* '''Euler's Method''': You take a 1-meter step in the direction of the slope.
* '''Runge-Kutta (RK4)''': You "check" the slope four times before you take the step to be much more accurate.

'''3. Error Control''':
Numerical math is the only math that studies its own "Failure."
* '''Discretization Error''': If your "Step" is 1 meter, you might skip over a small hole. If your step is 0.001 meters, you are more accurate, but it takes 1000x longer to compute.
* '''Numerical Stability''': Sometimes a tiny error in Step 1 grows into a massive error in Step 100. A "Stable" method ensures errors stay small.

'''Floating Point Limits''': Computers don't know what "0.1" is. They store it as a binary fraction that is slightly off. If you add "0.1" to itself 10,000 times, you won't get 1,000. This is why banks and rocket scientists use specific "Arbitrary Precision" libraries.
</div>

<div style="background-color: #8B0000; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Applying</span> ==
'''Modeling 'Root Finding' (Newton's Method):'''
<syntaxhighlight lang="python">
def find_root_newton(func, deriv, start_x):
    """
    Finds where func(x) == 0.
    """
    x = start_x
    for i in range(10): # 10 Iterations
        # Newton's Formula: x_next = x - f(x)/f'(x)
        x = x - (func(x) / deriv(x))
        print(f"Iteration {i+1}: x = {x:.6f}")
    return x

# Find the square root of 2 (i.e. solve x^2 - 2 = 0)
f = lambda x: x**2 - 2
df = lambda x: 2*x
print(f"Final Approximation: {find_root_newton(f, df, 1.5)}")
# Note how it hits the 'Exact' answer incredibly fast.
</syntaxhighlight>

; Numerical Toolkits
: '''Finite Element Analysis (FEA)''' → Breaking a car or bridge into millions of tiny "Elements" to see where it will break.
: '''Monte Carlo Simulation''' → Solving a problem by running 1,000,000 random "What if" scenarios (used in finance and physics).
: '''Fast Fourier Transform (FFT)''' → The algorithm that converts sound waves into digital data (mp3s/phone calls).
: '''PageRank''' → The numerical method Google uses to solve the "Web Importance" matrix.
</div>

<div style="background-color: #8B4500; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Analyzing</span> ==
{| class="wikitable"
|+ Analytical vs. Numerical
! Feature !! Analytical (Paper) !! Numerical (Computer)
|-
| Goal || A perfect formula || A useful number
|-
| Scope || Limited to simple problems || Can solve almost anything
|-
| Error || Zero (Exact) || Always present (Approximation)
|-
| Speed || Instant (once solved) || Depends on desired accuracy
|}

'''The Concept of "Stiffness"''': A "Stiff" equation is one where some parts change very slowly and other parts change very fast. Standard numerical methods "explode" when they hit these. Analyzing these equations requires "Implicit" methods, which are harder to program but incredibly robust.
</div>

<div style="background-color: #483D8B; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Evaluating</span> ==
Evaluating a numerical result:
# '''Convergence Check''': If you cut your "Step Size" in half, does the answer stay the same?
# '''Conservation''': Does the total energy or mass stay the same in the simulation?
# '''Conditioning''': Does a tiny change in the starting numbers change the answer by 1,000%?
# '''Visual Plausibility''': Does the simulated water "Look" like water, or does it jitter and fly apart?
</div>

<div style="background-color: #2F4F4F; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
== <span style="color: #FFFFFF;">Creating</span> ==
Future Frontiers:
# '''AI-Accelerated Solvers''': Using neural networks to "Guess" the answer to a PDE so the numerical method can finish it 100x faster.
# '''Quantum Numerical Analysis''': Algorithms that use quantum superposition to search massive "Feasible Regions" instantly.
# '''Auto-Differentiable Physics''': Simulations that can "Teach themselves" to be more accurate by analyzing their own errors.
# '''Real-time Digital Twins''': Numerical simulations of a factory or a human heart that run in perfect sync with the real thing.

[[Category:Mathematics]]
[[Category:Computer Science]]
[[Category:Physics]]
</div>