Skip to content
#

approximation-theory

Here are 28 public repositories matching this topic...

A numerical methods project exploring different approaches to computing trigonometric functions. Combining modern C++, Python, and LaTeX to investigate approximation algorithms through reproducible numerical experiments.

  • Updated Jul 17, 2026
  • C++

Rigorous analysis of the Amundson sequence G(n) = n^(n+1)/(n+1)^n and the constant A_G: Hausdorff moment representation, compound-Poisson/Levy form, fibre lattices, and endpoint Christoffel asymptotics (Theorem C0).

  • Updated Aug 24, 2026

Bernstein's constant to ten rigorously certified digits: beta = 0.2801694990, proved in interval arithmetic (Arb) where the 1985 Varga-Carpenter rigorous enclosure gives five. OEIS A073001. Every number re-derivable from the shipped data in exact arithmetic.

  • Updated Sep 3, 2026
  • Python

Add this topic to your repo

To associate your repository with the approximation-theory topic, visit your repo's landing page and select "manage topics."

Learn more