HomeCalculatorsMathNumerical CalculusGolden Section Search Calculator
Math calculator

Golden Section Search Calculator

Golden-section search for a minimum of a polynomial, sin, or exp on [a, b]. Same engine as One-Dimensional Optimization. Not Brent, not multivariate. Runs locally.

Instant result
Result

Enter values to calculate.

Inputs
Mode
Formula
Trust summary Engine tested · Specification checked · 11/11 tests · Production surface contract 2/2 · v1.0.0
Input interpretation
Enter values to calculate.
Result
Model
xmin and fmin of poly, sin, or exp on [a, b] by golden-section search.
Scope
Minimize only
Verification
Engine tested · 11/11 tests · Production surface contract 2/2 · Specification checked · v1.0.0
Named expert review
Optional · Not performed
Specification basis
  • ISO 80000-2:2019 Quantities and units — Mathematics
Specification basis
Evidence
3 golden · 2 boundary · 6 property · Production surface contract 2/2 · Artifact integrity PASS
Production
Embedded snapshot: unpublished · Build schema 1.0.0 ready · Semantic contract ✓ · Attestation report not published on origin · Live production status STALE (1 capability; 163 remain CURRENT) @ 2026-09-19T00:00:17.039Z
Semantic contract
PASS

Formulas

Core equations used by this calculator.

Interior pointsc = b − φ̂(b−a), d = a + φ̂(b−a)
Conjugateφ̂ = (√5−1)/2
iMinimize only. Polynomial coefficients are constant-first. Brent lives on the sibling discovery URL. Default tol = 10⁻⁸.

How to use

1

Enter integrand and [a, b]

Poly needs coeffs. a must be strictly less than b.

2

Read xmin and fmin

An exact minimizer is shown when f is poly of degree ≤ 3, sin, or exp.

Example calculations

Common configurations with formula and result.

ϟ

min x² on [−1, 2]

coeffs 0,0,1

xmin = 0
0
ϟ

min eˣ on [0, 1]

monotonic, left endpoint

xmin = 0
0

Golden Section Search calculator specification

Version 1.0.0 · Engine tested

Calculation status

Review policy · Evidence

Definition
Golden-section search shrinks [a, b] with ratio φ̂=(√5−1)/2 until the remaining interval is within tol. This page is method=golden on math.numerical.optimize_1d. Not a second optimizer. Not Brent.
What it calculates
xmin and fmin of poly, sin, or exp on [a, b] by golden-section search.
Inputs
  • integrand
  • a
  • b
  • tol?
  • coeffs?
Outputs
  • xmin
  • fmin
  • exact_xmin
  • exact_fmin
  • n_eval
Formula
golden-section search, φ̂=(√5−1)/2
Assumptions
  • Minimize only
  • Not Brent / Nelder–Mead / CAS
Units
  • dimensionless
Boundary conditions
  • a ≥ b → INVALID_INPUT
  • unknown method (including nelder) → INVALID_MODE
Example
golden poly 0,0,1 on [-1,2] → xmin=0
Validation cases

2 published on this page · 11/11 tests · Production surface contract 2/2 · View evidence

  • integrand=poly coeffs=0,0,1 a=-1 b=2 → exact_xmin=0
  • method=nelder integrand=sin a=0 b=1 → INVALID_MODE
Specification basis
  • ISO 80000-2:2019 Quantities and units — Mathematics
Calculation version
1.0.0
}

Frequently asked questions

Key distinctions behind the calculation.

Is this a second optimization engine?

No. It is method=golden on math.numerical.optimize_1d, the same engine as /calc/math/one-dimensional-optimization.

Is this Brent or Nelder–Mead?

No. Brent is the sibling discovery URL. Nelder–Mead, gradients, and maximization stay INVALID_MODE.