Estimation of integrated volatility in stochastic volatility models

In the framework of stochastic volatility models we examine estimators for the integrated volatility based on the pth power variation (i.e. the sum of pth absolute powers of the log‐returns). We derive consistency and distributional results for the estimators given high‐frequency data, especially taking into account what kind of process we may add to our model without affecting the estimate of the integrated volatility. This may on the one hand be interpreted as a possible flexibility in modelling, for example adding jumps or even leaving the framework of semimartingales by adding a fractional Brownian motion, or on the other hand as robustness against model misspecification. We will discuss possible choices of p under different model assumptions and irregularly spaced data. Copyright © 2005 John Wiley & Sons, Ltd.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Three-Step Predictor-Corrector of Exponential Fitting Method for Nonlinear Schroedinger Equations

We develop the three-step explicit and implicit schemes of exponential fitting methods. We use the three- step explicit exponential fitting scheme to predict an approximation, then use the three-step implicit exponential fitting scheme to correct this prediction. This combination is called the three-step predictor-corrector of exponential fitting method. The three-step predictor-corrector of exponential fitting method is applied to numerically compute the coupled nonlinear Schroedinger equation and the nonlinear Schroedinger equation with varying coefficients. The numerical results show that the scheme is highly accurate.     

Slutsky定理的一个推广

本文应用紧集上的连续函数是一致连续的性质，推广并证明了著名的Slutsky定理。     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

A posteriori error estimates for a time discrete scheme for a phase-field system of Penrose-Fife type

A time discrete scheme is used to approximate the solution toa phase field system of Penrose–Fife type with a non-conservedorder parameter. An a posteriori error estimate is presentedthat allows the estimation of the difference between continuousand semidiscrete solutions by quantities that can be calculatedfrom the approximation and given data.     

ITERATIVE APPROXIMATION OF FIXED POINTS OF NON-LIPSCHITZIAN ASYMPTOTICALLY PSEUDOCONTRACTIVE MAPPINGS

The purpose of this paper is to investigate the problem of approximating fixed points of non-Lipschitizian asymptotically pseudocontractive mappings in an arbitrary real Banach space by the modified Ishikawa iterative sequences with errors.     

Numerical approximation of generalized Newtonian fluids using Powell–Sabin–Heindl elements: I. theoretical estimates

In this paper we consider the numerical approximation of steady and unsteady generalized Newtonian fluid flows using divergence free finite elements generated by the Powell–Sabin–Heindl elements. We derive a priori and a posteriori finite element error estimates and prove convergence of the method of successive approximations for the steady flow case. A priori error estimates of unsteady flows are also considered. These results provide a theoretical foundation and supporting numerical studies are to be provided in Part II. Copyright © 2003 John Wiley & Sons, Ltd.     

数字全息图变频采样研究

根据Whittaker-Shannon抽样定理,对菲涅耳全息图进行变频率采样,保证整个全息图各部分采样频率为该处相应空间频率的两倍,从而完全消除数字全息图由于采样冗余而带来全息图的信息冗余.并且,对变频采样后的全息图进行线性插值恢复即可获得良好的再现像质.实验和理论均证明了该方法的有效性和可行性,为全息图的信息存贮与传输提出一条新的思路.     

On the degree of convergence of lemniscates in finite connected domains

For an arbitrary bounded closed set E in the complex plane with complement Ω of finite connectivity, we study the degree of convergence of the lemniscates in Ω.