Munich Personal RePEc Archive
metadata only
An Adaptive Succesive Over-relaxation Method for Computing the Black-Scholes Implied Volatility
A new successive over-relaxation method to compute the Black-Scholes implied volatility is introduced. Properties of the new method are fully analyzed, including global well-definedness, local convergence, as well as global convergence. Quadratic order of convergence is achieved by either a dynamic
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Adaptive Algorithms for Robust Phase Retrieval#1216129
- An Inexact Riemannian Proximal Momentum Variance-Reduced Method: Complexity Bounds and KL Sequential Convergence#620755
- An Inexact Riemannian Proximal Momentum Variance-Reduced Method: Complexity Bounds and KL Sequential Convergence#619076
- Adaptive Patching Is Harder Than It Looks For Time-Series Forecasting#1343596
- Order jumps in Spectral Deferred Corrections#1131499
Record · ID 1277215
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive