基于L~1度量分析的图象分解与重构算法

Mallat‘s decompositon and reconstruction algorithms are very important in the the field of wavelet theory and its applications to signal processing.Wavelet Anal-ysis,which is based on L^2(R) space,can eliminate redundancy of signals with the help of orthogonality and characterize the processing precision with the meansquare error.In the recent years,it is understood that the mean square measuredoes not match human visual sensitivity well.From the point of view,R.DeVore studied L^1 measure instead.Similarly,considering the principles of image com-pression,Yang introduced and dealt with orthogonality in L^1 space based on thebest approximation theory,and consequently established the corresponding decom-position and reconstruction algorithms for signals.In this paper,error analyses for the algorithms above are taken and the selection of the best parameters in the algorithms are discussed in detail.Finally,the algorithms are compared with the classical Haar and Daubechies‘‘s orthogonal wavelets based on the singal-to-noiseratio data computed.     

WEIGHTED APPROXIMATION ON SZASZ—TYPE OPERATORS

In this paper, we use weighted modules ω(?)(f,t)w to study the pointwise approximation on Szasz-type operators, and obtain the direct and converse theorem, as well as characterizations of the pointwise approximation of Jacobi-weighted Szasz-type operators.     

An approximation problem of the finite rank operator in Banach spaces

By the method of geometry of Banach spaces, we have proven that a bounded linear operator in Banach space is a compact linear one iff it can be uniformly approximated by a sequence of the finite rank bounded homogeneous operators, which reveals the essence of the counter example given by Enflo.     

Weighted exponential polynomial approximation

A necessary and sufficient condition for completeness of systems of exponentials with a weight in Lp is established and a quantitative relation between the weight and the system of exponential in Lp is obtained by using a generalization of Malliavin's uniqueness theorem about Watson's problem.     

THE INVERSE PROBLEM FOR PART SYMMETRIC MATRICES ON A SUBSPACE

In this paper, the following two problems are considered:Problem Ⅰ. Given S∈E Rn×p,X,B 6 Rn×m, find A ∈ SRs,n such that AX = B, where SR8,n = {A∈ Rn×n|xT(A - AT) = 0, for all x ∈ R(S)}.Problem Ⅱ. Given A* ∈ Rn×n, find A ∈ SE such that ||A-A*|| = minA∈sE||A-A*||, where SE is the solution set of Problem Ⅰ.The necessary and sufficient conditions for the solvability of and the general form of the solutions of problem Ⅰ are given. For problem Ⅱ, the expression for the solution, a numerical algorithm and a numerical example are provided.     

等距算子的延拓、逼近及相关问题

本文介绍了等距算子从单位球面、从区域及从保距离1等条件下的各种等距廷拓问题；并介绍了(线性与非线性算子)等距算子的弱扰动、强扰动及渐近等距算子等问题．文中从历史到现状，概括了重要的研究结果，并指出了一些尚未解决的遗留问题．     

Szász型算子线性组合的同时逼近

本文利用ω^2r_φλ(f,t)代替ω^r_φλ(f,t)给出了Szász-Kantorovich算子线性组合同时逼近的估计。     

正系数多项式倒数逼近的点态和整体估计

利用Ditzian-Totik光滑模对于[0,1]上定义的非角连续函数f(x)，且f(x)≠0，文中证明存在正系数多项式Pn(x)及常数C，使得|f9x)-1/Pn(x)|≤Cωψ^λ（f,n^-1/2(ψ(x) 1/√n)^1-λ)。当λ＝1时，上述结果导出已有的整体估计，而当0≤λ＜1时，得到倒数逼近一个新的点态局部估计。     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．     

Theoretical and numerical analysis for the quasi-continuum approximation of a material particle model

In many applications materials are modeled by a large number of particles (or atoms) where any one of particles interacts with all others. Near or nearest neighbor interaction is expected to be a good simplification of the full interaction in the engineering community. In this paper we shall analyze the approximate error between the solution of the simplified problem and that of the full-interaction problem so as to answer the question mathematically for a one-dimensional model. A few numerical methods have been designed in the engineering literature for the simplified model. Recently much attention has been paid to a finite-element-like quasicontinuum (QC) method which utilizes a mixed atomistic/continuum approximation model. No numerical analysis has been done yet. In the paper we shall estimate the error of the QC method for this one-dimensional model. Possible ill-posedness of the method and its modification are discussed as well.