Case study

MATH*2130 Root-Finding Methods

This MATH*2130 assignment contains MATLAB implementations of bisection, false position, Newton, secant, and fixed-point root-finding methods. Each method is paired with a terminal driver that lets the user pick a function, tolerance, and initial guesses, with PDFs of the writeups and earlier checkpoints kept in-repo.

RoleNumerical methods implementation

TimelineMATH*2130 assignment

FocusNumerical Methods

Numerical root-findingTerminal-driven workflowsConvergence reportingDocumentation packaging

MATLABPlatform

5 root-findersMethods

github.com/MaxwellM34/math2130_root_finding_methodsRepository

The brief

Challenge

Build the classic root-finding methods cleanly enough that they can be compared against each other on the same problem.

Approach

What we made

Implemented each method in MATLAB with a shared terminal driver and consistent convergence reporting.

Five root-finding methods implemented from scratch in MATLAB.
Terminal drivers expose function, tolerance, and initial-guess controls.
Repository keeps writeup PDFs and earlier checkpoints for reference.

Outcome

Results

A working numerical-methods toolkit ready to use as a reference for future coursework.

MATLABNumerical methods

Gallery

Visual snapshots

Click any image to expand.

Next project

Goniometer Calibration Refresher

MATLAB refresher that loads eight goniometer calibration CSVs, averages voltages per angle, and fits slope, intercept, and R-squared.

View next project