Stable Summation and Mean Calculation

/**
 * Fintech Math Bootcamp · Lesson 112 of 120
 * Stable Summation and Mean Calculation
 * Module 12: Statistical Computing and Reproducibility
 *
 * Scenario: Recovering low-order contributions during accumulation
 * Rule:     compensated sum tracks information lost by rounding
 *
 * Try it:   Can compensated summation restore precision already absent from the input values?
 *
 * Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
 * Free course:    https://courses.thefintechbuilder.com
 * Synthetic teaching example, not financial advice or a production library.
 */

export function lesson112() {
  const values=[1e16,1,-1e16,3];
  let sum=0,correction=0;
  // Neumaier (improved Kahan) compensation: also handles |x| > |sum|
  for(const x of values){const next=sum+x;
    correction+=Math.abs(sum)>=Math.abs(x)?(sum-next)+x:(x-next)+sum;
    sum=next;}
  const result={naive:values.reduce((s,x)=>s+x,0),
    compensated:sum+correction};
  return result;
}

export const checkedResult = {"naive":3,"compensated":4};

// Run this file directly: npx tsx lessons/12-statistical-computing-and-reproducibility/112-stable-summation-and-mean-calculation.ts
if (process.argv[1] && import.meta.url.endsWith(process.argv[1].replace(/\\/g, "/").split("/").pop()!)) {
  console.log(JSON.stringify(lesson112(), null, 2));
}

# Fintech Math Bootcamp · Lesson 112 of 120
# Stable Summation and Mean Calculation
# Module 12: Statistical Computing and Reproducibility
#
# Scenario: Recovering low-order contributions during accumulation
# Rule:     compensated sum tracks information lost by rounding
#
# Try it:   Can compensated summation restore precision already absent from the input values?
#
# Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
# Free course:    https://courses.thefintechbuilder.com
# Synthetic teaching example, not financial advice or a production library.
#
# Run: python main.py

import json


def lesson_112():
    values = [1e16, 1.0, -1e16, 3.0]
    total = correction = 0.0
    # Neumaier (improved Kahan) compensation: also handles |x| > |sum|
    for x in values:
        nxt = total + x
        correction += (total - nxt) + x if abs(total) >= abs(x) else (x - nxt) + total
        total = nxt
    naive = 0.0
    for x in values:  # a plain loop: Python 3.12+ sum() compensates floats by itself
        naive += x
    return {"naive": naive, "compensated": total + correction}


if __name__ == "__main__":
    print(json.dumps(lesson_112(), indent=2))

/*
 * Fintech Math Bootcamp - Lesson 112 of 120
 * Stable Summation and Mean Calculation
 * Module 12: Statistical Computing and Reproducibility
 *
 * Scenario: Recovering low-order contributions during accumulation
 * Rule:     compensated sum tracks information lost by rounding
 *
 * Try it:   Can compensated summation restore precision already absent from the input values?
 *
 * Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
 * Free course:    https://courses.thefintechbuilder.com
 * Synthetic teaching example, not financial advice or a production library.
 *
 * Run: javac Main.java && java Main
 */

import java.util.*;

public class Main {
    static Map<String, Object> lesson112() {
        double[] values = {1e16, 1, -1e16, 3};
        double sum = 0, correction = 0;
        // Neumaier (improved Kahan) compensation: also handles |x| > |sum|
        for (double x : values) {
            double next = sum + x;
            correction += Math.abs(sum) >= Math.abs(x) ? (sum - next) + x : (x - next) + sum;
            sum = next;
        }
        double naive = 0;
        for (double x : values) naive += x;
        return obj("naive", naive, "compensated", sum + correction);
    }

    public static void main(String[] args) {
        System.out.println(toJson(lesson112(), ""));
    }

    // Minimal JSON writer: insertion-ordered Map, List, Number, Boolean, String and null.
    static String toJson(Object value, String indent) {
        if (value == null) return "null";
        if (value instanceof String) return quote((String) value);
        if (value instanceof Boolean) return value.toString();
        if (value instanceof Double) return formatNumber((Double) value);
        if (value instanceof Number) return value.toString();
        String inner = indent + "  ";
        StringBuilder sb = new StringBuilder();
        if (value instanceof Map) {
            Map<?, ?> map = (Map<?, ?>) value;
            if (map.isEmpty()) return "{}";
            sb.append("{\n");
            int i = 0;
            for (Map.Entry<?, ?> e : map.entrySet()) {
                sb.append(inner).append(quote(e.getKey().toString())).append(": ").append(toJson(e.getValue(), inner));
                sb.append(++i < map.size() ? ",\n" : "\n");
            }
            return sb.append(indent).append("}").toString();
        }
        List<?> list = (List<?>) value;
        if (list.isEmpty()) return "[]";
        sb.append("[\n");
        for (int i = 0; i < list.size(); i++) {
            sb.append(inner).append(toJson(list.get(i), inner)).append(i + 1 < list.size() ? ",\n" : "\n");
        }
        return sb.append(indent).append("]").toString();
    }

    // Integral doubles print without ".0", as JavaScript does; others use Java's round-trip form.
    static String formatNumber(double x) {
        if (x == Math.rint(x) && Math.abs(x) < 1e15) return Long.toString((long) x);
        return Double.toString(x);
    }

    static String quote(String s) {
        StringBuilder sb = new StringBuilder("\"");
        for (char c : s.toCharArray()) {
            if (c == '"' || c == '\\') sb.append('\\').append(c);
            else if (c < 0x20) sb.append(String.format("\\u%04x", (int) c));
            else sb.append(c);
        }
        return sb.append('"').toString();
    }

    // Builds an insertion-ordered object from alternating keys and values.
    static Map<String, Object> obj(Object... keysAndValues) {
        Map<String, Object> map = new LinkedHashMap<String, Object>();
        for (int i = 0; i < keysAndValues.length; i += 2) map.put((String) keysAndValues[i], keysAndValues[i + 1]);
        return map;
    }

    static List<Object> list(double... values) {
        List<Object> out = new ArrayList<Object>();
        for (double v : values) out.add(v);
        return out;
    }
}

// Fintech Math Bootcamp · Lesson 112 of 120
// Stable Summation and Mean Calculation
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Recovering low-order contributions during accumulation
// Rule:     compensated sum tracks information lost by rounding
//
// Try it:   Can compensated summation restore precision already absent from the input values?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: go run main.go

package main

import (
	"encoding/json"
	"fmt"
	"math"
)

type Result struct {
	Naive       float64 `json:"naive"`
	Compensated float64 `json:"compensated"`
}

func lesson112() Result {
	values := []float64{1e16, 1, -1e16, 3}
	sum, correction := 0.0, 0.0
	// Neumaier (improved Kahan) compensation: also handles |x| > |sum|
	for _, x := range values {
		next := sum + x
		if math.Abs(sum) >= math.Abs(x) {
			correction += (sum - next) + x
		} else {
			correction += (x - next) + sum
		}
		sum = next
	}
	naive := 0.0
	for _, x := range values {
		naive += x
	}
	return Result{Naive: naive, Compensated: sum + correction}
}

func main() {
	out, err := json.MarshalIndent(lesson112(), "", "  ")
	if err != nil {
		panic(err)
	}
	fmt.Println(string(out))
}

// Fintech Math Bootcamp · Lesson 112 of 120
// Stable Summation and Mean Calculation
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Recovering low-order contributions during accumulation
// Rule:     compensated sum tracks information lost by rounding
//
// Try it:   Can compensated summation restore precision already absent from the input values?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: g++ -std=c++17 -O1 -o lesson main.cpp && ./lesson

#include <algorithm>
#include <charconv>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <optional>
#include <stdexcept>
#include <string>
#include <utility>
#include <variant>
#include <vector>

// Minimal JSON value: objects keep insertion order; numbers print in shortest round-trip form.
struct Json {
    enum class Kind { Null, Bool, Number, String, Array, Object };
    Kind kind = Kind::Null;
    bool flag = false;
    double number = 0.0;
    std::string text;
    std::vector<std::string> keys;  // object keys, parallel to items
    std::vector<Json> items;        // array items, or object values
};

Json jnull() { return Json{}; }
Json jbool(bool value) { Json j; j.kind = Json::Kind::Bool; j.flag = value; return j; }
Json jnum(double value) { Json j; j.kind = Json::Kind::Number; j.number = value; return j; }
Json jstr(const std::string& value) { Json j; j.kind = Json::Kind::String; j.text = value; return j; }
Json jarr(std::vector<Json> items) { Json j; j.kind = Json::Kind::Array; j.items = std::move(items); return j; }

Json jobj(std::vector<std::pair<std::string, Json>> fields) {
    Json j;
    j.kind = Json::Kind::Object;
    for (auto& field : fields) {
        j.keys.push_back(field.first);
        j.items.push_back(std::move(field.second));
    }
    return j;
}

Json jnums(const std::vector<double>& values) {
    std::vector<Json> items;
    for (double v : values) items.push_back(jnum(v));
    return jarr(std::move(items));
}

Json jnums(const std::vector<std::optional<double>>& values) {
    std::vector<Json> items;
    for (const auto& v : values) items.push_back(v ? jnum(*v) : jnull());
    return jarr(std::move(items));
}

std::string formatNumber(double value) {
    char buffer[64];
    auto result = std::to_chars(buffer, buffer + sizeof buffer, value);  // shortest round-trip form
    return std::string(buffer, result.ptr);
}

std::string quote(const std::string& text) {
    std::string out = "\"";
    for (char c : text) {
        if (c == '"' || c == '\\') {
            out += '\\';
            out += c;
        } else if (static_cast<unsigned char>(c) < 0x20) {
            char buffer[8];
            std::snprintf(buffer, sizeof buffer, "\\u%04x", static_cast<unsigned>(c));
            out += buffer;
        } else {
            out += c;
        }
    }
    return out + "\"";
}

void writeJson(std::ostream& out, const Json& value, const std::string& indent = "") {
    const std::string inner = indent + "  ";
    switch (value.kind) {
        case Json::Kind::Null: out << "null"; return;
        case Json::Kind::Bool: out << (value.flag ? "true" : "false"); return;
        case Json::Kind::Number: out << formatNumber(value.number); return;
        case Json::Kind::String: out << quote(value.text); return;
        case Json::Kind::Array:
        case Json::Kind::Object: {
            const bool isObject = value.kind == Json::Kind::Object;
            if (value.items.empty()) {
                out << (isObject ? "{}" : "[]");
                return;
            }
            out << (isObject ? "{\n" : "[\n");
            for (std::size_t i = 0; i < value.items.size(); ++i) {
                out << inner;
                if (isObject) out << quote(value.keys[i]) << ": ";
                writeJson(out, value.items[i], inner);
                out << (i + 1 < value.items.size() ? ",\n" : "\n");
            }
            out << indent << (isObject ? "}" : "]");
        }
    }
}

Json lesson112() {
    const std::vector<double> values{1e16, 1, -1e16, 3};
    double sum = 0, correction = 0;
    // Neumaier (improved Kahan) compensation: also handles |x| > |sum|
    for (double x : values) {
        const double next = sum + x;
        correction += std::abs(sum) >= std::abs(x) ? (sum - next) + x : (x - next) + sum;
        sum = next;
    }
    double naive = 0;
    for (double x : values) naive += x;
    return jobj({{"naive", jnum(naive)}, {"compensated", jnum(sum + correction)}});
}

int main() {
    writeJson(std::cout, lesson112());
    std::cout << "\n";
    return 0;
}

// Fintech Math Bootcamp · Lesson 112 of 120
// Stable Summation and Mean Calculation
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Recovering low-order contributions during accumulation
// Rule:     compensated sum tracks information lost by rounding
//
// Try it:   Can compensated summation restore precision already absent from the input values?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: rustc -O main.rs && ./main

#![allow(dead_code)]

/// Minimal JSON value; objects keep insertion order.
enum Json {
    Null,
    Bool(bool),
    Num(f64),
    Str(String),
    Arr(Vec<Json>),
    Obj(Vec<(String, Json)>),
}

fn obj(fields: Vec<(&str, Json)>) -> Json {
    Json::Obj(fields.into_iter().map(|(k, v)| (k.to_string(), v)).collect())
}

fn nums(values: &[f64]) -> Json {
    Json::Arr(values.iter().map(|&v| Json::Num(v)).collect())
}

fn optional_nums(values: &[Option<f64>]) -> Json {
    Json::Arr(values.iter().map(|v| v.map_or(Json::Null, Json::Num)).collect())
}

fn quote(text: &str) -> String {
    let mut out = String::from("\"");
    for c in text.chars() {
        match c {
            '"' => out.push_str("\\\""),
            '\\' => out.push_str("\\\\"),
            c if (c as u32) < 0x20 => out.push_str(&format!("\\u{:04x}", c as u32)),
            c => out.push(c),
        }
    }
    out.push('"');
    out
}

// Display for f64 prints the shortest string that round-trips, as JavaScript does.
fn write_json(value: &Json, indent: &str, out: &mut String) {
    let inner = format!("{}  ", indent);
    match value {
        Json::Null => out.push_str("null"),
        Json::Bool(b) => out.push_str(if *b { "true" } else { "false" }),
        Json::Num(n) => out.push_str(&format!("{}", n)),
        Json::Str(s) => out.push_str(&quote(s)),
        Json::Arr(items) if items.is_empty() => out.push_str("[]"),
        Json::Obj(fields) if fields.is_empty() => out.push_str("{}"),
        Json::Arr(items) => {
            out.push_str("[\n");
            for (i, item) in items.iter().enumerate() {
                out.push_str(&inner);
                write_json(item, &inner, out);
                out.push_str(if i + 1 < items.len() { ",\n" } else { "\n" });
            }
            out.push_str(indent);
            out.push(']');
        }
        Json::Obj(fields) => {
            out.push_str("{\n");
            for (i, (key, item)) in fields.iter().enumerate() {
                out.push_str(&inner);
                out.push_str(&quote(key));
                out.push_str(": ");
                write_json(item, &inner, out);
                out.push_str(if i + 1 < fields.len() { ",\n" } else { "\n" });
            }
            out.push_str(indent);
            out.push('}');
        }
    }
}

fn lesson_112() -> Json {
    let values: [f64; 4] = [1e16, 1.0, -1e16, 3.0];
    let (mut sum, mut correction) = (0.0_f64, 0.0_f64);
    // Neumaier (improved Kahan) compensation: also handles |x| > |sum|
    for &x in &values {
        let next = sum + x;
        correction += if sum.abs() >= x.abs() { (sum - next) + x } else { (x - next) + sum };
        sum = next;
    }
    let naive = values.iter().fold(0.0, |s, x| s + x);
    obj(vec![("naive", Json::Num(naive)), ("compensated", Json::Num(sum + correction))])
}

fn main() {
    let mut out = String::new();
    write_json(&lesson_112(), "", &mut out);
    println!("{}", out);
}

// Fintech Math Bootcamp · Lesson 112 of 120
// Stable Summation and Mean Calculation
// Module 12: Statistical Computing and Reproducibility
//
// Scenario: Recovering low-order contributions during accumulation
// Rule:     compensated sum tracks information lost by rounding
//
// Try it:   Can compensated summation restore precision already absent from the input values?
//
// Lesson article: https://thefintechbuilder.com/financial-mathematics-statistics-and-data-foundations/statistical-computing-and-reproducibility/stable-summation-and-mean-calculation/
// Free course:    https://courses.thefintechbuilder.com
// Synthetic teaching example, not financial advice or a production library.
//
// Run: dotnet run

using System;
using System.Collections.Generic;
using System.Globalization;
using System.Linq;
using System.Text.Encodings.Web;
using System.Text.Json;

var options = new JsonSerializerOptions { WriteIndented = true, Encoder = JavaScriptEncoder.UnsafeRelaxedJsonEscaping };
Console.WriteLine(JsonSerializer.Serialize(Lesson112(), options));

static object Lesson112()
{
    double[] values = { 1e16, 1, -1e16, 3 };
    double sum = 0, correction = 0;
    // Neumaier (improved Kahan) compensation: also handles |x| > |sum|
    foreach (double x in values)
    {
        double next = sum + x;
        correction += Math.Abs(sum) >= Math.Abs(x) ? (sum - next) + x : (x - next) + sum;
        sum = next;
    }
    return new { naive = values.Aggregate(0.0, (s, x) => s + x), compensated = sum + correction };
}