Skip to contentScholarGate
LibraryBookshelfDeskReview StudioAssistant
Sign in
On this page
IntuitionHow it worksWhen to use itStrengths & limitationsCommon pitfallsApplicationsFrequently asked🔒 Read the full methodSourcesRelated methods
Cite this pageSpotted an issue on this page? Report or suggest a fix →
Home›Quantitative Finance›Crank-Nicolson Pricing
Machine learningNumerical Methods

Crank-Nicolson Pricing

Crank-Nicolson Finite Difference Method · Also known as: CN Method, Implicit Finite Difference

The Crank-Nicolson method is a widely-used implicit finite difference scheme for solving PDEs in option pricing. It provides second-order accuracy in both space and time, unconditional stability, and can efficiently price derivatives with early exercise features (American options) or complex boundary conditions.

ScholarGate
  1. Machine learning
  2. v1
  3. 2 Sources
  4. PUBLISHED
Cite this page →
Tools & resources
Download slides
Learn & explore

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Method map

The neighbourhood of related methods — select a node to explore.

Crank-Nicolson Pricing
Hull-White ModelLocal Volatility (Dupire)SABR Model

When to use it

Use Crank-Nicolson for American and European option pricing when you need high accuracy and stability. Ideal for single-factor PDEs (spot price or interest rate). For multi-dimensional PDEs (two factors), use alternating direction implicit (ADI) methods. Crank-Nicolson is slow for high-dimensional problems; use Monte Carlo instead.

Strengths & limitations

Strengths
  • Unconditional stability: large time steps do not cause oscillations or divergence
  • Second-order accuracy: O(Delta_t^2 + Delta_x^2) is better than explicit or simple implicit
  • Fast solver: tridiagonal matrix solves in O(N) time via Thomas algorithm
  • Flexible boundaries: easily incorporates American option early exercise and exotic boundary conditions
Limitations
  • One-dimensional: extending to 2+ dimensions requires ADI or splitting methods (slower)
  • Grid construction: choosing appropriate spatial/temporal grids requires domain knowledge
  • Boundary condition sensitivity: errors in boundary placement or shape propagate backward and degrade interior accuracy
  • Not naturally parallel: implicit nature makes parallelization harder than explicit methods

Frequently asked

How do I choose spatial and temporal grids?

Spatial grid: typically 101-501 points. Start with 101, double until price converges. Temporal grid: match the number of decision points (reset dates, dividends). Stability ratio r = sigma^2 * Delta_t / (2 * Delta_x^2) should be ~0.5 for Crank-Nicolson (not critical for stability, but affects accuracy).

What boundary conditions should I use?

Far OTM: option value ≈ 0. Far ITM: option value ≈ spot - strike (American), or discounted payoff (European). At spot = 0: option value = 0 (stock cannot recover). At spot = infinity: option value ≈ spot - strike for calls (ITM premium dominates).

How do I handle dividends?

Continuous dividend yield q: modify drift term in PDE. Discrete dividends: requires jump condition (option value drops by dividend amount). Alternatively, use an implicit dividend method that updates the solution at dividend dates.

Can I use Crank-Nicolson for two-factor models?

In principle yes, but computational cost is O(M^3) where M is grid size per dimension. ADI methods split the 2D PDE into two 1D problems and reduce cost to O(M^2). Alternating Direction Implicit (ADI) is the standard for 2-factor problems.

Sources

  1. Crank, J., & Nicolson, P. (1947). A practical method for numerical evaluation of solutions of partial differential equations of the heat-conduction type. Mathematical Proceedings of the Cambridge Philosophical Society, 43(1), 50-67. DOI: 10.1017/S0305004100023197 ↗
  2. Fornberg, B. (1996). A Practical Guide to Pseudospectral Methods. Cambridge University Press. DOI: 10.1017/CBO9780511626357 ↗

How to cite this page

ScholarGate. (2026, June 3). Crank-Nicolson Finite Difference Method. ScholarGate. https://scholargate.app/en/quantitative-finance/crank-nicolson-pricing

Related methods

Hull-White ModelLocal Volatility (Dupire)SABR Model

Which method?

Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.

  • Hull-White ModelQuantitative Finance↔ compare
  • Local Volatility (Dupire)Quantitative Finance↔ compare
  • SABR ModelQuantitative Finance↔ compare
Compare side by side →

Referenced by

Local Volatility (Dupire)

Similar methods

Longstaff-Schwartz MethodCarr-Madan FFTBinomial Option PricingLocal Volatility (Dupire)Greeks via Automatic DifferentiationChange of NumeraireBlack-Scholes ModelRisk-Neutral Valuation

Related reference concepts

Finite Difference MethodsPDE Methods in Computational PhysicsTime-Dependent Quantum DynamicsNumerical Solution of Partial Differential EquationsRunge-Kutta MethodsStiff ODEs and Stability

Spotted an issue on this page? Report or suggest a fix →

ScholarGate — Crank-Nicolson Pricing (Crank-Nicolson Finite Difference Method). Retrieved 2026-07-21 from https://scholargate.app/en/quantitative-finance/crank-nicolson-pricing · Dataset: https://doi.org/10.5281/zenodo.20539026
Quick facts
Originator
John Crank and Phyllis Nicolson
Subfamily
Numerical Methods
Year
1947
Type
PDE Solver
Related methods
Hull-White ModelLocal Volatility (Dupire)SABR Model
ScholarGate

A content-first reference library for research methods — what each one is, how it works, and where it comes from.

Open data (CC-BY)

Explore

  • Library
  • Search the library…
  • Browse by field
  • Fields
  • Journey
  • Compare
  • Which method?

Reference

  • Subjects
  • Atlas
  • Glossary
  • Methodology
  • Philosophy

Your tools

  • Bookshelf
  • Desk
  • Chat

Company

  • About
  • Pricing
  • Contact
  • Suggest a method

Entries are compiled from published sources for reference. Verifying the accuracy and suitability of any information for your own use remains your responsibility.

© 2026 ScholarGate · A research-method reference library
  • Privacy
  • Cookies
  • Terms
  • Delete account