美式期权定价中非局部问题的有限元方法

在本文中 ,我们关心的是美式期权的有限元方法 .首先 ,根据 [4 ]我们对所讨论的问题引进一个新奇的实用的方法 ,它涉及到对原问题重新形成准确的数学公式 ,使得数值解的计算可以在非常小的区域上进行 ,从而该算法计算速度快精度高 .进而 ,我们利用超逼近分析技术得到了有限元解关于 L2 -模的最优估计 .     

DISTRIBUTIONS OF LIMIT CYCLES FOR POLYNOMIAL VECTOR FIELDS (P_2, Q_3)

The distributions of limit cycles of cubic vector fields (P2, Q3) are considered in this paper, where P2 and Q3 are polynomials of x and y of order two and three, respectively. It is possibly seven different distributions of limit cycles given in [1]. We now prove that in which three kinds of distributions are impossible and other four kinds all can be realized by concrete vector fields of (P2,Q3). Some related results are also given.     

Laguerre approximation of stable manifolds with application to connecting orbits

We present an algorithm, based on approximation by Laguerre polynomials, for computing a point on the stable manifold of a stationary solution of an autonomous system. A superconvergence phenomenon means that the accuracy of our results is much higher than the usual spectral accuracy. Both the theory and the implementation of the method are considered. Finally, as an application of the algorithm, we describe a fully spectral approximation of homo- and heteroclinic orbits.

     

Stable nonequilibrium probability densities and phase transitions for meanfield models in the thermodynamic limit

A nonlinear Fokker-Planck equation is derived to describe the cooperative behavior of general stochastic systems interacting via mean-field couplings, in the limit of an infinite number of such systems. Disordered systems are also considered. In the weak-noise limit; a general result yields the possibility of having bifurcations from stationary solutions of the nonlinear Fokker-Planck equation into stable time-dependent solutions. The latter are interpreted as non-equilibrium probability distributions (states), and the bifurcations to them as nonequilibrium phase transitions. In the thermodynamic limit, results for three models are given for illustrative purposes. A model of self-synchronization of nonlinear oscillators presents a Hopf bifurcation to a time-periodic probability density, which can be analyzed for any value of the noise. The effects of disorder are illustrated by a simplified version of the Sompolinsky-Zippelius model of spin-glasses. Finally, results for the Fukuyama-Lee-Fisher model of charge-density waves are given. A singular perturbation analysis shows that the depinning transition is a bifurcation problem modified by the disorder noise due to impurities. Far from the bifurcation point, the CDW is either pinned or free, obeying (to leading order) the Grüner-Zawadowki-Chaikin equation. Near the bifurcation, the disorder noise drastically modifies the pattern, giving a quenched average of the CDW current which is constant. Critical exponents are found to depend on the noise, and they are larger than Fisher's values for the two probability distributions considered.     

Continuation of travelling‐wave solutions of the Navier–Stokes equations

An efficient way of obtaining travelling waves in a periodic fluid system is described and tested. We search for steady states in a reference frame travelling at the wave phase velocity using a first‐order pseudospectral semi‐implicit time scheme adapted to carry out the Newton's iterations. The method is compared to a standard Newton–Raphson solver and is shown to be highly efficient in performing this task, even when high‐resolution grids are used. This method is well suited to three‐dimensional calculations in cylindrical or spherical geometries. Copyright © 2006 John Wiley & Sons, Ltd.     

The projective method for solving linear matrix inequalities

Numerous problems in control and systems theory can be formulated in terms of linear matrix inequalities (LMI). Since solving an LMI amounts to a convex optimization problem, such formulations are known to be numerically tractable. However, the interest in LMI-based design techniques has really surged with the introduction of efficient interior-point methods for solving LMIs with a polynomial-time complexity. This paper describes one particular method called the Projective Method. Simple geometrical arguments are used to clarify the strategy and convergence mechanism of the Projective algorithm. A complexity analysis is provided, and applications to two generic LMI problems (feasibility and linear objective minimization) are discussed.     

Parallel Algorithm for Unconstrained Optimization Based on Decomposition Techniques

We present a numerical implementation of the parallel gradient distribution (PGD) method for the solution of large-scale unconstrained optimization problems. The proposed parallel algorithm is characterized by a parallel phase which exploits the portions of the gradient of the objective function assigned to each processor; then, a coordination phase follows which, by a synchronous interaction scheme, optimizes over the partial results obtained by the parallel phase. The parallel and coordination phases are implemented using a quasi-Newton limited-memory BFGS approach. The computational experiments, carried out on a network of UNIX workstations by using the parallel software tool PVM, show that parallelization efficiency was problem dependent and ranged between 0.15 and 8.75. For the 150 problems solved by PGD on more than one processor, 85 cases had parallelization efficiency below 1, while 65 cases had a parallelization efficiency above 1.     

On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.     

Alkenylidenes in Organic Synthesis

Alkenylidenes R₂C?C: (= alkylidene carbenes) undergo regio- and stereoselective intramolecular C? H insertion reactions that are excellently suited for the synthesis of cyclopentenes. The 1, 2-shifts occurring with R?H and R?Ar are useful for the preparation of alkynes. Alkenylidenes are efficiently generated from carbonyl compounds by diazomethylation, from vinyl halides by α-elimination, from alkynyliodonium salts by addition of nucleophiles, and from alkynes by retro-1, 2-shifts. Specific applications of the various methods, particularly in the synthesis of natural products, are discussed.