Learning path · Mathematics

Curve Fitting Foundations

Move from fitting a model to diagnosing error and solving nonlinear estimation problems.

11 articles
OrientationFoundationsCore ConceptsMethodsApplications
Begin with Curve Fitting: From Data to Model →
  1. 01
    Orientation

    Curve Fitting: From Data to Model

    A practical map of the curve-fitting process, from choosing a model to checking whether it deserves to be trusted.

  2. 02
    Foundations

    Least Squares Finds the Closest Model

    How squared residuals turn a cloud of observations into an estimated line or linear model.

  3. 03
    Core Concepts

    Residual Plots Reveal How a Model Fails

    How residual patterns expose curvature, unequal variance, dependence, and unusual observations.

    Requires: Least Squares Finds the Closest Model

  4. 04
    Core Concepts

    RMSE Expresses Typical Error in Response Units

    How RMSE and residual standard error summarize squared prediction misses on an interpretable scale.

    Requires: Least Squares Finds the Closest Model

  5. 05
    Core Concepts

    R² Measures Explained Sample Variation

    What the coefficient of determination says, what adjusted R² changes, and what neither can prove.

    Requires: Least Squares Finds the Closest Model

  6. 06
    Core Concepts

    Goodness of Fit Requires More Than R²

    How residual error, R², adjusted R², RMSE, information criteria, and validation reveal different aspects of a model.

    Requires: Least Squares Finds the Closest Model

  7. 07
    Methods

    Nonlinear Curve Fitting Is an Iterative Search

    Why nonlinear models require starting values, repeated approximations, and careful checks for convergence.

    Requires: Least Squares Finds the Closest Model

  8. 08
    Methods

    Gauss–Newton Linearizes Nonlinear Least Squares

    How a local derivative model produces an efficient update for nonlinear curve-fitting parameters.

    Requires: Nonlinear Curve Fitting Is an Iterative Search

  9. 09
    Methods

    Levenberg–Marquardt Balances Caution and Speed

    How damping lets a nonlinear least-squares algorithm move between gradient descent and Gauss–Newton.

    Requires: Gauss–Newton Linearizes Nonlinear Least Squares

  10. 10
    Applications

    ANOVA Tables Partition Variation in Regression

    How sums of squares, degrees of freedom, mean squares, and the F statistic summarize a fitted model.

    Requires: Least Squares Finds the Closest Model

  11. 11
    Applications

    AIC and BIC Balance Fit Against Complexity

    Why information criteria compare models by rewarding likelihood and penalizing extra parameters.