Skip to content

Numerov's method

Solve a smooth scalar second-order equation without an unreduced first-derivative term on a uniform grid using the fixed three-point 1:10:1 rule and a suitable closure.

Version
v1 · 2026-10-17 · History
Domain-specific #
14233
Domain group
Formal Sciences
Origin domain
Mathematics
Subdomain
Numerical Ordinary Differential Equations → Mathematics
Aliases
Numerov method, Noumerov method

Core Idea

Numerov's method approximates a smooth scalar solution of a second-order equation without an unreduced first-derivative term, using a uniform grid. Its fixed three-point rule weights right-hand-side values \(1:10:1\); starting or boundary closure makes the relation usable.[ref-d11e8291e51b][ref-3cbf35ee92dd]

Scope of Application

Two documented mathematical settings retain that rule with different closures.

  • Quantum oscillator: two-sided propagation and energy matching produce eigenvalue/wavefunction estimates, compared with analytic values.[^ref-d11e8291e51b]
  • Poisson potential: Gaussian source and two endpoint values close a direct solve, checked against an analytic potential.[^ref-3cbf35ee92dd]

Clarity

The general nonlinear relation is implicit; the linear specialization needs a nonzero next-value coefficient. A local \(O(h^6)\) equation residual does not establish global accuracy, stability or convergence.

Manages Complexity

One repeated relation replaces local differential structure with algebra. Keep reusable weights separate from problem-specific closure and subsequent quality assessment.

Abstract Reasoning

Separate equation, grid, weighted rule and closure. Then distinguish computed output from validation; an analytic benchmark is not required in every execution.

Knowledge Transfer

Numerical Method is the broader genus; other weights can retain it while leaving Numerov. Shooting and Bernardes's accuracy/cost results are not universal; first-derivative variants need separate justification. Noumerov treats orbital perturbations[^ref-975a3513b50d]; Jackson supplies Cowell history.[^ref-a33fced0bf9f] That does not prove synonymy, and resemblance beyond this numerical carrier alone is insufficient.

Relationships to Other Abstractions

Local relationship map for Numerov's methodParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Numerov's methodDOMAINDomain-specific abstraction: Numerical Method — is a kind ofNumerical MethodDOMAIN

Current abstraction Numerov's method Domain-specific

Parents (1) — more general patterns this builds on

  • Numerov's method is a kind of Numerical Method Domain-specific

    A completed classical Numerov computation is a numerical method distinguished by its smooth scalar second-order target, uniform grid, and fixed three-point 1:10:1 rule.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Numerov's method sits in a sparse region of the domain-specific corpus (81st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2721 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-17

References

[^ref-d11e8291e51b]: Francisco Caruso and Vitor Oguri (2014). “Numerov numerical method applied to the Schrödinger equation”. arXiv:1403.7092v1, 17 March 2014; Portuguese original with an English title and abstract. Zero-based PDF pp. 2–3, §2 equations (1), (2), (7); pp. 4–6, matching procedure; p. 7, §3 and Table 1; pp. 7–10, §4 normal-form discussion and hydrogen generalization through equation (19). Full original author paper inspected. Its broad Euler/Runge–Kutta comparison is not adopted as a universal impossibility. [^ref-3cbf35ee92dd]: Esmerindo Bernardes (2007). “A direct Numerov sixth order numerical scheme to accurately solve the unidimensional Poisson equation with Dirichlet boundary conditions”. arXiv:0712.1706v1. Zero-based PDF p. 0, equations (1)–(2); p. 1, equations (3)–(7), (11); p. 2, equations (12)–(16); pp. 3–4, equations (17)–(20) and Figure 1. Full original author paper inspected. The header dates the version 11 December 2007; the title page separately displays 4 September 2021. The discrepancy is retained, not resolved. Displayed equation (7) is the weighted recurrence; equation (11) is a first-derivative formula despite later cross-references calling it a recurrence. [^ref-975a3513b50d]: B. V. Noumerov (1924). “A Method of Extrapolation of Perturbations”. Monthly Notices of the Royal Astronomical Society 84, pp. 592–601. NASA ADS combined facsimile, zero-based PDF pp. 0–9; historical coordinate/perturbation discussion especially printed pp. 592–595. Full original article text inspected with noisy OCR; not used as a symbol-level proof of the modern scalar formula. [^ref-a33fced0bf9f]: J. Jackson (1924). “Note on the Numerical Integration of d²x/dt² = f(x,t)”. Monthly Notices of the Royal Astronomical Society 84, opening printed p. 602 / combined PDF zero-based p. 10. Only the separately headed opening page and its Cowell context are cited; this is not full-work access or a proof of method equivalence.