半线性椭圆问题Petrov-Galerkin逼近及亏量迭代

本文考虑了二阶半线性椭圆问题的Petrov-Galerkin逼近格式,用双二次多项式空间作为形函数空间,用双线性多项式空间作为试探函数空间,证明了此逼近格式与标准的二次有限元逼近格式有同样的收敛阶.并且根据插值算子的逼近性质,进一步证明了半线性有限元解的亏量迭代序列收敛到Petrov-Galerkin解.     

APPROXIMATION BY COMPLEX SZASZ-DURRMEYER OPERATORS IN COMPACT DISKS

In the present paper, we deal with the complex Szasz-Durrmeyer operators and study Voronovskaja type results with quantitative estimates for these operators attached to analytic functions of exponential growth on compact disks. Also, the exact order of approximation is found.     

分层变分包含问题中经由分层不动点途径的黏性方法

基于一原创技术—指标选取法,以黏性法分层逼近可数族非线性映射之公共不动点.并于适当条件下得一强收敛定理,用以解决Hilbert空间背景下之分层变分包含问题.     

Approximation of Multiple Stratonovich Fractional Integrals

Abstract

We study multiple Riemann-Stieltjes integral approximations to multiple Stratonovich fractional integrals. Two standard approximations (Wong-Zakai and Mollifier approximations) are considered and we show the convergence in the mean square sense and uniformly on compact time intervals of these approximations to the multiple Stratonovich fractional integral.     

Optimal Approximation of the Second Iterated Integral of Brownian Motion

Abstract

In this article, a theorem is proved that describes the optimal approximation (in the L ²(?)-sense) of the second iterated integral of a standard two-dimensional Wiener process, W, by a function of finitely many elements of the Gaussian Hilbert space generated by W. This theorem has some interesting corollaries: First of all, it implies that Euler's method has the optimal rate of strong convergence among all algorithms that depend solely on linear functionals of the Wiener process, W; second, it shows that the approximation of the second iterated integral based on Karhunen–Loève expansion of the Brownian bridge is asymptotically optimal.     

How Fast Is the Bandit?

Abstract

In this article we investigate the rate of convergence of the so-called two-armed bandit algorithm. The behavior of the algorithm turns out to be highly non standard: no central limit theorem, possible occurrence of two different rates of convergence with positive probability.     

Best Local Approximation in Orlicz Spaces

We get results in Orlicz spaces L ^φ about best local approximation on non-balanced neighborhoods when φ satisfies a certain asymptotic condition. This fact generalizes known previous results in L ^p spaces.     

Uniformly Conditioned Bases of Spectral Subspaces

A condition number of an ordered basis of a finite-dimensional normed space is defined in an intrinsic manner. This concept is extended to a sequence of bases of finite-dimensional normed spaces, and is used to determine uniform conditioning of such a sequence. We address the problem of finding a sequence of uniformly conditioned bases of spectral subspaces of operators of the form T _n  = S _n  + U _n , where S _n is a finite-rank operator on a Banach space and U _n is an operator which satisfies an invariance condition with respect to S _n . This problem is reduced to constructing a sequence of uniformly conditioned bases of spectral subspaces of operators on ? ^n×1. The applicability of these considerations in practical as well as theoretical aspects of spectral approximation is pointed out.     

Error Bounds for Low-Rank Approximations of the First Exponential Integral Kernel

A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented.