An Efficient, and Fast Convergent Algorithm for Barrier Options
From MaRDI portal
Recommendations
- An efficient algorithm for Bermudan barrier option pricing
- Very fast algorithms for implied barriers and moving-barrier options pricing
- EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
- Fast and accurate pricing of barrier options under Lévy processes
- Fast numerical pricing of barrier options under stochastic volatility and jumps
- An efficient computational algorithm for pricing European, barrier and American options
- An explicit finite difference approach to the pricing of barrier options
- Fast and accurate pricing of discretely monitored barrier options by numerical path integration
- An efficient algorithm for pricing barrier options in arbitrage-free binomial models with calibrated drift terms
- Efficiently pricing barrier options in a Markov-switching framework
Cited in
(10)- Pricing discrete knock-out options with tree methods
- Very fast algorithms for implied barriers and moving-barrier options pricing
- Efficient and high accuracy pricing of barrier options under the CEV diffusion
- Spectral binomial tree: new algorithms for pricing barrier options
- Pricing double barrier options
- The binomial interpolated lattice method for step double barrier options
- An efficient algorithm for pricing barrier options in arbitrage-free binomial models with calibrated drift terms
- Efficient willow tree method for European-style and American-style moving average barrier options pricing
- Cross a barrier to reach barrier options
- A lattice algorithm for pricing moving average barrier options
This page was built for publication: An Efficient, and Fast Convergent Algorithm for Barrier Options
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434444)
