Skip to content

Beam Propagation Method

Approximate predominantly forward optical-wave evolution by factoring out a carrier, reducing the Helmholtz or Maxwell problem to a one-way propagation equation, and marching its transverse field through longitudinal steps.

Version
v3 · 2026-09-19 · History
Domain-specific #
1363
Domain group
Natural Sciences
Origin domain
Physics
Subdomain
Computational Optics → Physics
Aliases
BPM, Optical beam propagation method, Split-step beam propagation method

Core Idea

The beam propagation method (BPM) is a family of numerical approximations for computing how an optical field evolves mainly along a chosen longitudinal axis through a waveguide or inhomogeneous medium. Instead of solving a full multidimensional boundary-value problem everywhere at once, BPM represents the field as a rapidly varying carrier times a more slowly varying envelope, derives a first-order one-way evolution equation in the propagation coordinate, and advances the transverse envelope plane by plane. This converts a difficult Helmholtz or Maxwell problem into a spatial initial-value march.

How would you explain it like I'm…

Flipbook Light Tracking

Imagine light zooming mostly straight ahead through a long glass tube. Instead of working out the whole tube at once, a computer figures out what the light looks like at one thin slice, then the next slice, then the next, like flipping through a flipbook. That shortcut is the Beam Propagation Method. It works best when the light doesn't bounce backward much.

Marching the Light Beam

The Beam Propagation Method is a family of computer methods for working out how light moves through things like optical fibers and tiny light circuits. Solving for the light everywhere at once is very hard, so instead the computer marches along the direction the light travels, updating a slice of the beam at each small step. It treats the light as a fast wave with a slowly changing shape riding on it, and tracks only the slow shape. This works well when light mostly travels forward in a narrow cone, but it can miss light that reflects backward or bends sharply.

One-Way Optical Field Marching

The Beam Propagation Method (BPM) is a family of numerical approximations for how an optical field evolves along a chosen axis through a waveguide or a medium whose refractive index varies. It writes the field as a rapidly oscillating carrier wave multiplied by a slowly varying envelope, then derives a one-way equation that is first order in the propagation direction. That turns a hard boundary-value problem, solving the wave equation everywhere at once, into a step-by-step march: each cross-section of the envelope is computed from the previous one. Versions include split-step Fourier methods, which alternate a diffraction step in frequency space with a phase step from the local medium, and finite-difference methods. Basic BPM assumes light travels at small angles and that the structure changes slowly, so it can miss strong reflections, abrupt changes, and wide-angle light; results should be checked for convergence rather than trusted because a plot looks smooth.

 

BPM is a method family, not a single algorithm, for computing optical field evolution predominantly along a longitudinal axis z. In the scalar paraxial form, a monochromatic field is factored into a slowly varying envelope times a reference carrier with a chosen reference index; substituting into the Helmholtz equation and neglecting or approximating the second z-derivative yields a first-order one-way evolution equation. The problem becomes a spatial initial-value march in which the transverse envelope is advanced plane by plane. Split-step Fourier solvers alternate a diffraction operator (applied in transverse Fourier space) with a local phase/medium operator (applied in real space), while finite-difference BPM discretizes the transverse operator and solves a linear update, often in Crank-Nicolson form; both implement the same march with different error behavior. Feit and Fleck's treatment of graded-index fibers is a canonical early formulation, and extensions include wide-angle, semivectorial, full-vectorial, bidirectional, nonlinear, gain/loss and anisotropic variants. The approximation contract is explicit: reference index, polarization model, transverse domain and boundary treatment, step sizes, and validity regime. Paraxial BPM can miss backward reflection, abrupt discontinuities, wide-angle and evanescent components, and vector coupling, so credible use reports convergence, power behavior, benchmarks, and excluded physics.

Scope of Application

BPM is literal when a wave problem is recast as predominantly forward spatial evolution and a transverse field is advanced through a declared approximate propagator.

  • Optical fibers. Tracking field confinement, coupling, leakage, and modal evolution in graded or perturbed guides.
  • Integrated photonics. Modeling bends, tapers, couplers, crossings, splitters, and index-engineered devices.
  • Nonlinear optics. Adding intensity-dependent refractive index or gain/loss under a stated envelope model.
  • Anisotropic media. Evolving coupled polarization components with semivectorial or vectorial variants.
  • Waveguide design. Comparing geometry variants through the same mesh, boundary, and convergence protocol.
  • Parabolic-equation analogues. Transferring one-way marching ideas to acoustics or other wave domains with different governing details.
  • Mode estimation. Using long propagation, filtering, or imaginary-distance variants to isolate guided modes.
  • Method validation. Benchmarking against analytic solutions, mode matching, finite elements, FDTD, or measured observables.

Clarity

A clear BPM result names the governing scalar or vector equation, time or frequency convention, propagation axis, reference index or carrier, envelope definition, paraxial or wide-angle approximation, polarization treatment, dimensionality, grid or basis, transverse boundary/absorber, longitudinal step, material interpolation, and output normalization. State whether nonlinear, dispersive, anisotropic, lossy, radiating, backward, or evanescent components are included. Report convergence under both transverse refinement and step reduction.

Manages Complexity

BPM trades generality for an ordered computation. By exploiting a preferred axis and a slowly changing envelope, it avoids solving the entire longitudinal domain simultaneously and can reuse transverse transforms or sparse operators at each step. Split operators isolate diffraction from local index or nonlinear phase, making implementations modular. That economy can conceal accumulated phase error, numerical anisotropy, wraparound, boundary reflection, artificial loss, and one-way bias.

Abstract Reasoning

  1. Choose a propagation axis and determine whether the field is predominantly forward over the modeled region.
  2. Select the scalar, semivectorial, or full-vectorial governing equation and material model.
  3. Factor a reference carrier and define the slowly varying transverse envelope.
  4. Derive or select the paraxial, wide-angle, rational, or bidirectional propagation operator.
  5. Represent each transverse plane on a grid, basis, or mesh with declared boundary treatment.

Knowledge Transfer

BPM teaches a portable reduction: identify a dominant evolution coordinate, factor out predictable rapid variation, approximate the remaining generator, and march a lower-dimensional state. The transfer is legitimate only when the target domain has a comparable one-way structure and a meaningful error contract. Parabolic-equation acoustics is close; a general scattering problem with strong counterpropagation is not. The method also transfers a validation lesson: efficiency obtained from directionality must be audited exactly where backward, wide-angle, or abrupt effects can re-enter.

Relationships to Other Abstractions

Local relationship map for Beam Propagation 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.Beam PropagationMethodDOMAINPrime abstraction: Approximation — is a kind ofApproximationPRIME

Current abstraction Beam Propagation Method Domain-specific

Parents (1) — outgoing typed relations

  • Beam Propagation Method is a kind of Approximation Prime

    Approximation is the strict parent by specialization.

Hierarchy path (1) — routes to 1 parentless root

Neighborhood in Abstraction Space

Beam Propagation Method sits in a sparse region of the domain-specific corpus (89th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Unclustered & Miscellaneous (2769 abstractions)

Nearest neighbors

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