Update wiki/stem/engineering-and-modeling.md
9940661852cf harrisonqian 2026-04-13 1 file
index a94220e..de02306 100644
@@ -14,7 +14,7 @@ i've competed in HiMCM and MCM/ICM (the high school and college math modeling co
the process teaches you something textbooks don't: choosing what to model and what to ignore. a model that includes everything is just reality, and you can't solve reality. the skill is identifying the 3-4 variables that matter most and writing down the simplest equations that capture their relationships.
-[estimation](/wiki/immediate/patterns-and-estimation) is the first step — sanity-checking that your model gives reasonable outputs before you trust it with anything important. and every model output needs to be evaluated against [[immediate/counting-and-measurement|measurement]] — precision vs accuracy, units, and whether the numbers even make physical sense.
+[[patterns-and-estimation|estimation]] is the first step — sanity-checking that your model gives reasonable outputs before you trust it with anything important. and every model output needs to be evaluated against [[counting-and-measurement|measurement]] — precision vs accuracy, units, and whether the numbers even make physical sense.
## monte carlo simulation
@@ -22,7 +22,7 @@ some problems are too complex for exact solutions. monte carlo methods handle th
want to estimate π? throw random darts at a unit square. count how many land inside the inscribed circle. the ratio approaches π/4. want to price a financial option? simulate thousands of possible stock price paths and average the payoffs. want to assess flood risk? generate thousands of possible weather scenarios and see how often the levee fails.
-monte carlo is powerful because it converts analytical difficulty into computational cost. you don't need to solve the equation — you just need to simulate it enough times. this connects to [probability](/wiki/immediate/probability-in-daily-life): monte carlo is basically "run the experiment a million times in silico."
+monte carlo is powerful because it converts analytical difficulty into computational cost. you don't need to solve the equation — you just need to simulate it enough times. this connects to [[probability-in-daily-life|probability]]: monte carlo is basically "run the experiment a million times in silico."
## optimization
@@ -30,7 +30,7 @@ most engineering problems are optimization problems: minimize cost, maximize eff
linear programming alone (optimizing a linear function subject to linear constraints) underlies scheduling, supply chain management, and resource allocation across every major industry. the simplex method, which solves these, is one of the most practically important algorithms ever invented.
-nonlinear optimization is harder — you might get stuck in local minima. [gradient descent](/wiki/structural/multivariable-calculus-as-thinking) is the workhorse method: follow the slope downhill. it's how neural networks are trained, how engineers design aircraft wings, and how economists find market equilibria.
+nonlinear optimization is harder — you might get stuck in local minima. [[multivariable-calculus-as-thinking|gradient descent]] is the workhorse method: follow the slope downhill. it's how neural networks are trained, how engineers design aircraft wings, and how economists find market equilibria.
## spectral methods
@@ -48,8 +48,8 @@ heat transfer, fluid dynamics, structural mechanics, circuit analysis, chemical
engineers rarely solve these equations analytically. they discretize them — break continuous space into a mesh of points — and solve the resulting system numerically. finite element analysis, finite difference methods, and computational fluid dynamics are all "convert a continuous math problem into a very large but solvable discrete math problem."
-this is where [calculus](/wiki/structural/calculus-as-thinking) meets [linear algebra](/wiki/structural/linear-algebra-as-thinking): discretizing a differential equation turns it into a matrix equation. the continuous meets the discrete, and the computer handles the rest.
+this is where [[calculus-as-thinking|calculus]] meets [[linear-algebra-as-thinking|linear algebra]]: discretizing a differential equation turns it into a matrix equation. the continuous meets the discrete, and the computer handles the rest.
## the deep point
-engineering is where mathematical abstraction crashes back into physical reality. the model has to work. the bridge has to stand. the prediction has to be close enough. this creates a productive tension between mathematical elegance and practical necessity — and it's why the modeling mindset ("what can I ignore? what matters most? how wrong is acceptable?") is one of the most transferable skills math teaches. modeling is [[structural/abstraction-as-power|abstraction]] applied under constraints — you need the right level of simplification, and the penalty for getting it wrong is measured in collapsed bridges, not lost marks.
\ No newline at end of file
+engineering is where mathematical abstraction crashes back into physical reality. the model has to work. the bridge has to stand. the prediction has to be close enough. this creates a productive tension between mathematical elegance and practical necessity — and it's why the modeling mindset ("what can I ignore? what matters most? how wrong is acceptable?") is one of the most transferable skills math teaches. modeling is [[abstraction-as-power|abstraction]] applied under constraints — you need the right level of simplification, and the penalty for getting it wrong is measured in collapsed bridges, not lost marks.
\ No newline at end of file