SPB Git

Repository Public

dist.ts 5.4 KB 123 lines typescript

1/** Probability distributions: densities, distribution functions and quantiles, all analytic. */23const SQRT_2PI = Math.sqrt(2 * Math.PI);45export function normalPdf(x: number, mu = 0, sigma = 1): number {6  const z = (x - mu) / sigma;7  return Math.exp(-0.5 * z * z) / (sigma * SQRT_2PI);8}910/** Standard normal distribution function Φ, double precision (Hart 1968 rational approximations, as in West 2005). */11function phi(x: number): number {12  const a = Math.abs(x);13  let c: number;14  if (a > 37) c = 0;15  else {16    const e = Math.exp(-0.5 * a * a);17    if (a < 7.07106781186547) {18      let n = 3.52624965998911e-2 * a + 0.700383064443688;19      n = n * a + 6.37396220353165; n = n * a + 33.912866078383; n = n * a + 112.079291497871;20      n = n * a + 221.213596169931; n = n * a + 220.206867912376;21      let d = 8.83883476483184e-2 * a + 1.75566716318264;22      d = d * a + 16.064177579207; d = d * a + 86.7807322029461; d = d * a + 296.564248779674;23      d = d * a + 637.333633378831; d = d * a + 793.826512519948; d = d * a + 440.413735824752;24      c = (e * n) / d;25    } else {26      let b = a + 0.65;27      b = a + 4 / b; b = a + 3 / b; b = a + 2 / b; b = a + 1 / b;28      c = e / b / 2.506628274631;29    }30  }31  return x > 0 ? 1 - c : c;32}33export function normalCdf(x: number, mu = 0, sigma = 1): number { return phi((x - mu) / sigma); }3435/** Standard normal quantile Φ⁻¹(p): Acklam's rational approximation followed by one Halley step. */36export function normalInv(p: number): number {37  if (!(p > 0)) return p === 0 ? -Infinity : NaN;38  if (!(p < 1)) return p === 1 ? Infinity : NaN;39  const a = [-3.969683028665376e1, 2.209460984245205e2, -2.759285104469687e2, 1.38357751867269e2, -3.066479806614716e1, 2.506628277459239];40  const b = [-5.447609879822406e1, 1.615858368580409e2, -1.556989798598866e2, 6.680131188771972e1, -1.328068155288572e1];41  const c = [-7.784894002430293e-3, -3.223964580411365e-1, -2.400758277161838, -2.549732539343734, 4.374664141464968, 2.938163982698783];42  const d = [7.784695709041462e-3, 3.224671290700398e-1, 2.445134137142996, 3.754408661907416];43  const lo = 0.02425;44  let x: number;45  if (p < lo) {46    const q = Math.sqrt(-2 * Math.log(p));47    x = (((((c[0] * q + c[1]) * q + c[2]) * q + c[3]) * q + c[4]) * q + c[5]) / ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1);48  } else if (p <= 1 - lo) {49    const q = p - 0.5, r = q * q;50    x = ((((((a[0] * r + a[1]) * r + a[2]) * r + a[3]) * r + a[4]) * r + a[5]) * q) / (((((b[0] * r + b[1]) * r + b[2]) * r + b[3]) * r + b[4]) * r + 1);51  } else {52    const q = Math.sqrt(-2 * Math.log(1 - p));53    x = -(((((c[0] * q + c[1]) * q + c[2]) * q + c[3]) * q + c[4]) * q + c[5]) / ((((d[0] * q + d[1]) * q + d[2]) * q + d[3]) * q + 1);54  }55  const err = phi(x) - p;56  const u = err * SQRT_2PI * Math.exp(0.5 * x * x);57  return x - u / (1 + 0.5 * x * u);58}5960/** log Γ(x) for x > 0 (Lanczos, g = 7). */61export function logGamma(x: number): number {62  const g = [0.99999999999980993, 676.5203681218851, -1259.1392167224028, 771.32342877765313, -176.61502916214059, 12.507343278686905, -0.13857109526572012, 9.9843695780195716e-6, 1.5056327351493116e-7];63  if (x < 0.5) return Math.log(Math.PI / Math.sin(Math.PI * x)) - logGamma(1 - x);64  const z = x - 1;65  let s = g[0];66  for (let i = 1; i < 9; i++) s += g[i] / (z + i);67  const t = z + 7.5;68  return 0.5 * Math.log(2 * Math.PI) + (z + 0.5) * Math.log(t) - t + Math.log(s);69}7071function betaCf(a: number, b: number, x: number): number {72  const tiny = 1e-300;73  const qab = a + b, qap = a + 1, qam = a - 1;74  let c = 1, d = 1 - (qab * x) / qap;75  if (Math.abs(d) < tiny) d = tiny;76  d = 1 / d;77  let h = d;78  for (let m = 1; m <= 400; m++) {79    const m2 = 2 * m;80    let aa = (m * (b - m) * x) / ((qam + m2) * (a + m2));81    d = 1 + aa * d; if (Math.abs(d) < tiny) d = tiny;82    c = 1 + aa / c; if (Math.abs(c) < tiny) c = tiny;83    d = 1 / d; h *= d * c;84    aa = (-(a + m) * (qab + m) * x) / ((a + m2) * (qap + m2));85    d = 1 + aa * d; if (Math.abs(d) < tiny) d = tiny;86    c = 1 + aa / c; if (Math.abs(c) < tiny) c = tiny;87    d = 1 / d;88    const del = d * c;89    h *= del;90    if (Math.abs(del - 1) < 3e-16) break;91  }92  return h;93}9495/** Regularised incomplete beta function I_x(a, b). */96export function incompleteBeta(x: number, a: number, b: number): number {97  if (x <= 0) return 0;98  if (x >= 1) return 1;99  const bt = Math.exp(logGamma(a + b) - logGamma(a) - logGamma(b) + a * Math.log(x) + b * Math.log(1 - x));100  return x < (a + 1) / (a + b + 2) ? (bt * betaCf(a, b, x)) / a : 1 - (bt * betaCf(b, a, 1 - x)) / b;101}102103export function studentTPdf(t: number, df: number): number {104  return Math.exp(logGamma((df + 1) / 2) - logGamma(df / 2) - 0.5 * Math.log(df * Math.PI) - ((df + 1) / 2) * Math.log(1 + (t * t) / df));105}106export function studentTCdf(t: number, df: number): number {107  const tail = 0.5 * incompleteBeta(df / (df + t * t), df / 2, 0.5);108  return t >= 0 ? 1 - tail : tail;109}110/** Student-t quantile by bisection on the distribution function (absolute error below 1e-10). */111export function studentTQuantile(p: number, df: number): number {112  if (!(p > 0 && p < 1)) return p === 0 ? -Infinity : p === 1 ? Infinity : NaN;113  if (p < 0.5) return -studentTQuantile(1 - p, df);114  if (p === 0.5) return 0;115  let lo = 0, hi = 1;116  while (studentTCdf(hi, df) < p && hi < 1e12) { lo = hi; hi *= 2; }117  for (let i = 0; i < 100 && hi - lo > 1e-12 * Math.max(1, hi); i++) {118    const mid = 0.5 * (lo + hi);119    if (studentTCdf(mid, df) < p) lo = mid; else hi = mid;120  }121  return 0.5 * (lo + hi);122}123
Files main
Menu

Theme