Options
All
  • Public
  • Public/Protected
  • All
Menu

Class BinomialVanillaEngine

Pricing engine for vanilla options using binomial trees

test the correctness of the returned values is tested by checking it against analytic results.

todo

Greeks are not overly accurate. They could be improved by building a tree so that it has three points at the current time. The value would be fetched from the middle one, while the two side points would be used for estimating partial derivatives.

Hierarchy

  • engine
    • BinomialVanillaEngine

Implements

Index

Constructors

Properties

Methods

Constructors

constructor

Properties

T

T: any

_arguments

_arguments: Arguments

_isDisposed

_isDisposed: boolean = false

_observables

_observables: Set<Observable> = new Set()

_observers

_observers: Set<Observer> = new Set()

Private _process

_process: GeneralizedBlackScholesProcess

_results

_results: Results

Private _timeSteps

_timeSteps: Size

deepUpdate

deepUpdate: () => void

Type declaration

    • (): void

    • Returns void

dispose

dispose: () => void

Type declaration

    • (): void

    • Returns void

isDisposed

isDisposed: boolean

notifyObservers

notifyObservers: () => void

Type declaration

    • (): void

    • Returns void

registerObserver

registerObserver: (o: Observer) => void

Type declaration

registerWith

registerWith: (h: Observable) => void

Type declaration

registerWithObservables

registerWithObservables: (o: Observer) => void

Type declaration

unregisterObserver

unregisterObserver: (o: Observer) => void

Type declaration

unregisterWith

unregisterWith: (h: Observable) => Size

Type declaration

unregisterWithAll

unregisterWithAll: () => void

Type declaration

    • (): void

    • Returns void

Methods

bveInit

calculate

  • calculate(): void

getArguments

getResults

reset

  • reset(): void

update

  • update(): void