基于拟Shannon小波浅水长波近似方程组的数值解

本文研究了浅水长波近似方程组初边值问题的数值解.利用小波多尺度分析和区间拟Shannon小波,对浅水长波近似方程组空间导数实施空间离散,用时间步长自适应精细积分法对其变换所的非线性常微分方程组进行求解,得到了浅水长波近似方程组的数值解,并将此方法计算的结果与其解析解进行比较和验证.     

Approximating Rough Stochastic PDEs

We study approximations to a class of vector‐valued equations of Burgers type driven by a multiplicative space‐time white noise. A solution theory for this class of equations has been developed recently in Probability Theory Related Fields by Hairer and Weber. The key idea was to use the theory of controlled rough paths to give definitions of weak/mild solutions and to set up a Picard iteration argument. In this article the limiting behavior of a rather large class of (spatial) approximations to these equations is studied. These approximations are shown to converge and convergence rates are given, but the limit may depend on the particular choice of approximation. This effect is a spatial analogue to the Itô‐Stratonovich correction in the theory of stochastic ordinary differential equations, where it is well known that different approximation schemes may converge to different solutions.© 2014 Wiley Periodicals, Inc.     

On Markovian Multi-Class,Multi-Server Queueing

Multi-class multi-server queueing problems are a generalisation of the well-known M/M/k queue to arrival processes with clients of N types that require exponentially distributed service with different average service times. In this paper, we give a procedure to construct exact solutions of the stationary state equations using the special structure of these equations. Essential in this procedure is the reduction of a part of the problem to a backward second order difference equation with constant coefficients. It follows that the exact solution can be found by eigenmode decomposition. In general eigenmodes do not have a simple product structure as one might expect intuitively. Further, using the exact solution, all kinds of interesting performance measures can be computed and compared with heuristic approximations (insofar available in the literature). We provide some new approximations based on special multiplicative eigenmodes, including the dominant mode in the heavy traffic limit. We illustrate our methods with numerical results. It turns out that our approximation method is better for higher moments than some other approximations known in the literature. Moreover, we demonstrate that our theory is useful to applications where correlation between items plays a role, such as spare parts management.     

Fast evaluation of nonlinear functionals of tensor product wavelet expansions

For a nonlinear functional f, and a function u from the span of a set of tensor product interpolets, it is shown how to compute the interpolant of f (u) from the span of this set of tensor product interpolets in linear complexity, assuming that the index set has a certain multiple tree structure. Applications are found in the field of (adaptive) tensor product solution methods for semilinear operator equations by collocation methods, or after transformations between the interpolet and (bi-) orthogonal wavelet bases, by Galerkin methods.     

Tree wavelet approximations with applications

We construct a tree wavelet approximation by using a constructive greedy scheme (CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.     

Approximation of solutions to operator equations in spaces of smooth functions and in spaces of distributions

The Galerkin method, in particular, the Galerkin method with finite elements (called finite element method) is widely used for numerical solution of differential equations. The Galerkin method allows us to obtain approximations of weak solutions only. However, there arises in applications a rich variety of problems where approximations of smooth solutions and solutions in the sense of distributions have to be found. This article is devoted to the employment of the Petrov–Galerkin method for solving such problems. The article contains general results on the Petrov–Galerkin approximations of solutions to linear and nonlinear operator equations. The problem on construction of the subspaces, which ensure the convergence of the approximations, is investigated. We apply the general results to two‐dimensional (2D) and 3D problems of the elasticity, to a parabolic problem, and to a nonlinear problem of the plasticity. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 406–450, 2014     

Adaptive Wavelet BEM for Boundary Integral Equations: Theory and Numerical Experiments

We are concerned with the numerical treatment of boundary integral equations by the adaptive wavelet boundary element method. In particular, we consider the second kind Fredholm integral equation for the double layer potential operator on patchwise smooth manifolds contained in ?³. The corresponding operator equations are treated by adaptive implementations that are in complete accordance with the underlying theory. The numerical experiments demonstrate that adaptive methods really pay off in this setting. The observed convergence rates fit together very well with the theoretical predictions based on the Besov regularity of the exact solution.     

The C 1 wavelet method for numerical solutions of the Neumann problem

In this article we use the C ¹ wavelet bases on Powell-Sabin triangulations to approximate the solution of the Neumann problem for partial differential equations. The C ¹ wavelet bases are stable and have explicit expressions on a three-direction mesh. Consequently, we can approximate the solution of the Neumann problem accurately and stably. The convergence and error estimates of the numerical solutions are given. The computational results of a numerical example show that our wavelet method is well suitable to the Neumann boundary problem.     

An adaptive numerical method to handle blow-up in a parabolic system

We study numerical approximations to solutions of a system of two nonlinear diffusion equations in a bounded interval, coupled at the boundary in a nonlinear way. In certain cases the system develops a blow-up singularity in finite time. Fixed mesh methods are not well suited to approximate the problem near the singularity. As an alternative to reproduce the behaviour of the continuous solution, we present an adaptive in space procedure. The scheme recovers the conditions for blow-up and non-simultaneous blow-up. It also gives the correct non-simultaneous blow-up rate and set. Moreover, the numerical simultaneous blow-up rates coincide with the continuous ones in the cases when the latter are known. Finally, we present numerical experiments that illustrate the behaviour of the adaptive method.     

Solvability of systems of volterra integral equations of the first kind with piecewise continuous kernels

We construct an asymptotic approximation for solutions of systems of Volterra integral equations of the first kind with piecewise continuous kernels. We use the asymptotics as an initial approximation in the proposed method of successive approximations to the desired solutions. We prove the existence of a continuous solution depending on free parameters and establish sufficient conditions for the existence of a unique continuous solution. We illustrate the proved existence theorems with examples.