4 citations found. Retrieving documents...
T. F. Coleman, Li. Yuying, and V. Arun. A Newton method for American option pricing. Journal of Computational Finance, 5(3), 2002.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Quadratic Convergence For Valuing American Options Using A.. - Forsyth, Vetzal (2002)   (4 citations)  (Correct)

....are more amenable to analysis. However, we have successfully used penalty methods for two factor (two dimensional) problems [37, 38] In this work, the nonlinear discrete penalized equations are solved using Newton iteration. Another approach which also uses a Newton method has been suggested in [6]. Note that relaxation methods are frequently used to solve the discrete penalized nonlinear equations [8] The advantage of the penalty method is that a single technique can be used for one dimensional or multi dimensional problems, and standard sparse matrix software can be used to solve the ....

....appear similar for both cases, there are clearly large oscillations in the gamma near the early exercise boundary for the explicit method. The implicit method does show some small oscillations near the exercise boundary. However, this is due to the use of Crank Nicolson timestepping, as noted in [6]. These oscillations disappear if fully implicit timestepping is used, as shown in Figure 11.2. 12. Comparison With Binomial Lattice Methods. It is interesting to compare the results here with those obtained using the binomial lattice method, which is commonly used in finance [33] In Appendix C, ....

T.F. Coleman, Y.Li, and A. Verma. A Newton method for American option pricing. Cornell Theory Center Technical Report CTC9907, 1999.


Quadratic Convergence Of A Penalty Method For Valuing.. - Forsyth, Vetzal (2002)   (Correct)

....to one dimensional problems, which are more amenable to analysis. However, we have successfully used penalty methods for two dimensional problems [22] In this work, the nonlinear discrete penalized equations are solved using Newton iteration. This is closely related to the Newton methods in [5]. Note that relaxation methods are frequently used to solve the discrete penalized nonlinear equations [6] The advantage of the penalty method is that a single technique can be used for one dimensional or multi dimensional problems, and standard sparse matrix software can be used to solve the ....

....appear similar for both cases, there are clearly large oscillations in the gamma near the early exercise boundary for the explicit method. The implicit method does show some small oscillations near the exercise boundary. However, this is due to the use of Crank Nicolson timestepping, as noted in [5]. These oscillations disappear if fully implicit timestepping is used, as shown in Figure 11.2. 12. Comparison With Binomial Lattice Methods. It is interesting to compare the results here with those obtained using the binomial lattice method, which is commonly used in finance [20] In Appendix C, ....

T.F. Coleman, Y.Li, and A. Verma. A Newton method for American option pricing. Cornell Theory Center Technical Report CTC9907, 1999.


Operator Splitting Methods for Pricing American Options with .. - Ikonen, Toivanen (2004)   (Correct)

No context found.

T. F. Coleman, Li. Yuying, and V. Arun. A Newton method for American option pricing. Journal of Computational Finance, 5(3), 2002.


Parallel Solution Of High Order Finite Difference Schemes.. - Options By Matthew   (Correct)

No context found.

Y. Li T.F. Coleman and A. Verma, A newton method for american option pricing, (1999).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC