Semismooth Newton methods with domain decomposition for American options (Q1747290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2017.12.046 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793304423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Methods for Option Pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models of financial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for computational finance. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Convergence for Valuing American Options Using a Penalty Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operator splitting methods for American option pricing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact semismooth Newton methods for large-scale complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semismooth equation approach to the solution of nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Newton--Krylov--Schwarz Algorithms for the Transonic Full Potential Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel two-grid semismooth Newton-Krylov-Schwarz method for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearly preconditioned semismooth Newton methods for variational inequality solution of two-phase flow in porous media / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4716273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4794126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally Convergent Inexact Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nonmonotone line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using FGMRES to obtain backward stability in mixed precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel domain decomposition methods with mixed order discretization for fully implicit solution of tracer transport problems on the cubed-sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully implicit Lagrange–Newton–Krylov–Schwarz algorithms for boundary control of unsteady incompressible flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel nonlinear additive Schwarz preconditioned inexact Newton algorithm for incompressible Navier-Stokes equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of parallel two-level nonlinear Schwarz preconditioned inexact Newton algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel adaptive nonlinear elimination preconditioned inexact Newton method for transonic full potential equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Preconditioning Techniques for Full-Space Lagrange--Newton Solution of PDE-Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Active-Set Reduced-Space Methods with Nonlinear Elimination for Two-Phase Flow Problems in Porous Media / rank
 
Normal rank

Latest revision as of 15:14, 15 July 2024

scientific article
Language Label Description Also known as
English
Semismooth Newton methods with domain decomposition for American options
scientific article

    Statements

    Semismooth Newton methods with domain decomposition for American options (English)
    0 references
    0 references
    0 references
    4 May 2018
    0 references
    The authors consider a class of parallel semismooth Newton algorithms for the numerical solution of the American option under the Black-Scholes-Merton pricing framework. A nonlinear function is used to transform the complementarity problem, which arises from the discretization of the pricing model, into a nonlinear system. More precisely, the authors consider a more general class of semismooth Newton methods and some highly parallel domain decomposition methods for the American option. In addition, an adaptive time stepping technique, which adjusts the time step size according to the initial residual of Newton iterations is applied to improve the performance of the proposed numerical method. The effectiveness and scalability of the proposed algorithm depend heavily on the design of the preconditioner. It is shown that the class of additive Schwarz method works well, and is more attractive than the traditional preconditioners. Numerical results for several test cases showed that the proposed algorithm is robust and superior to the classical methods.
    0 references
    American put option
    0 references
    semismooth Newton method
    0 references
    domain decomposition
    0 references
    additive Schwarz preconditioner
    0 references
    parallel computing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references