Category: Blog
-
How to Learn Wilson’s Algorithm: Loop-Erased Random Walks, Uniform Spanning Trees, Cycle Erasure and Exact Graph Sampling
A Learning Hall guide to Wilson’s algorithm, from random walks and loop erasure through uniform spanning trees, correctness, weighted variants, runtime, testing and professional graph sampling.
-
How to Learn the Savitzky–Golay Algorithm: Local Polynomial Smoothing, Derivatives, Convolution Coefficients and Signal-Preservation Trade-Offs
A Learning Hall guide to Savitzky–Golay, from local polynomial least squares through FIR coefficients, smoothing, derivatives, edge handling, frequency response and professional signal-validation practice.
-
How to Learn Weiszfeld’s Algorithm: Geometric Medians, Inverse-Distance Reweighting, Robust Location and Fermat–Weber Optimization
A Learning Hall guide to Weiszfeld’s algorithm, from the geometric median and Fermat–Weber problem through inverse-distance reweighting, singularity handling, convergence, robustness and professional implementation.
-
How to Learn the Pool-Adjacent-Violators Algorithm (PAVA): Isotonic Regression, Monotone Constraints, Block Pooling and Linear-Time Fitting
A Learning Hall guide to PAVA, from monotone least-squares constraints and adjacent violations through weighted block pooling, linear-time stack implementation, optimality and professional isotonic-regression practice.
-
How to Learn the Bareiss Algorithm: Fraction-Free Gaussian Elimination, Exact Division, Determinants and Symbolic Linear Algebra
A Learning Hall guide to the Bareiss algorithm, from exact determinants and coefficient growth through fraction-free elimination, exact division, pivoting, symbolic domains and professional testing.
-
How to Learn Levenberg–Marquardt: Nonlinear Least Squares, Gauss–Newton, Damping, Trust Regions and Robust Curve Fitting
A Learning Hall guide to Levenberg–Marquardt, from nonlinear residuals and Gauss–Newton through damping, trust regions, Jacobians, scaling, identifiability and professional curve fitting.
