解函数方程举例

未知函数之函数值所满足的某种关系式称为一个函数方程.根据未知函数所满足的函数方程,有时也可求出未知函数来.下面给出一些例子,这些例子中证明唯一性部份实际上就是解函数方程,它们所采用的一些技巧还是很有趣的.     

Heisenberg群上抛物型方程解的平均值公式

证明了Heisenberg群上一类含次p-Laplace抛物型方程粘性解的等价定理,在这个等价定理的基础上证明一个函数为该方程的解当且仅当该函数在粘性意义下满足渐近平均值公式.     

平均值函数列

本文用公理方法定义了平均值函数列.从公理定义出发,推证了平均值函数列的一系列共同性质,从而概括并推广了一些常见的平均值函数列.定理1指出了两个不同的平均值函数列的大小不会因变元的增加而改变,定理2揭示了平均值函数列与凸函数之间的内在联系,定理3则给出了多种平均值函数列的构作方法.     

一个定理及其在解方程组中的应用

设f(二)是定义在实数集R上的实函数,从这个函数出发,我们构造新函数 F(二)~f(f(‘));显然这个函数也定义在R上.函数F通常称为函数f的迭代,从下图容易看出,借助于函数f(x)的图形,对于自变量的具体的值劣气能哆求出迭代值f(f(x釜))。 我们考虑方程 f(f(二))二二 首先注意到,x。是方程 f(x)=二 (1)如果(2)┌────┐├主──┐││}一蔺 ││└───┴┘的根,那么二。也是方程(1)的根.但方程(1)也可能有另外的根,这个根不是(2)的根(从图形可看出这个事实来)。 下面我们指出,在什么情况下方程(1)与方程(2)是等价的. 定理如果对某个数a,函数…     

满足同一个Riemann型函数方程的L-函数的唯一性

利用L-函数的性质证明了满足同一个Riemann型函数方程的扩充的Selberg类中的次数大于零的L-函数分担一个有限值的定理,并应用该定理证明了满足同一个Riemann型函数方程的涉及公共值的唯一性定理,所得结果改进了J.Steuding和李宝勤的有关结果,也是S.M.Gonek,J.Haan和H.Ki主要结果的补充.     

三次样条插值及其在第一类积分方程求解中的应用

从三次样条插值的定义出发,通过研究第一类积分方程中未知函数的三次样条函数逼近,给出了第一类积分方程的三次样条插值离散化.利用该离散化形式,将第一类积分方程转化成线性方程组的形式.由于第一类积分方程的求解通常是不适定的,进而引起线性方程组的病态性.最后,为克服线性方程组的病态性,通过引入未知函数的多重光滑化约束,得到第一...     

什么时候和是一个有限值离散分布的参数的最小充分统计量?（英文）

利用示性函数技术,我们证明了独立同分布离散随机变量取两个值、三个值和k个值(3≤k∞)的三个定理.在一定的概率条件下,我们证明了当离散随机变量取两个值、三个值和k个值(3≤k∞)时,和是未知参数的最小充分统计量.对于骰子的例子,一个图显示六个概率均在0到1之间且它们的和为1,并且一个公平的骰子是可能的.     

Stieltjes积分边值条件下四阶问题的多重正解

应用五泛函不动点定理,当非线性函数在几个闭区域上满足一些不等式约束条件时,证明了具有Stieltjes积分边值条件的四阶问题存在多重正解,其非线性项含有未知函数的导数.通过一个多点型和积分型混合边值条件的例子,说明结论的可应用性,例子中的多点边值条件含有变号的系数,积分边值条件中积分核是变号的超越函数.     

高阶线性泛函方程的振动性

1 引言考虑高阶线性泛函方程其中 是给定的函数,x是未知实值函数. 表示函数g的m次迭代,即     

一个Gauss型函数方程

给出了任意两个正实数的几何-调和平均值的一个积分表示式,并由此去探讨了函数方程f(ab,2ab/a+b)=f(a,b),a,b＞0其中f:R+×R+→R是此方程的一个未知函数.     

研究伪随机数序列独立性的均匀偏度法

§1 引言 由具有在[0,1]上均匀分布的总体中产生的简单子样称为随机数序列,其中的每一样本称为随机数。所谓伪随机数序列,一般是指用数学递推公式所产生的随机数序列。如最常见的乘同余方法,它所产生的伪随机数序列就是对给定的正整数M和小于M的任意正整数初值β_1,用如下递推公式确定的:     

Linearized ridge-path method for function minimization

A modification based on a linearization of a ridge-path optimization method is presented. The linearized ridge-path method is a nongradient, conjugate direction method which converges quadratically in half the number of search directions required for Powell's method of conjugate directions. The ridge-path method and its modification are compared with some basic algorithms, namely, univariate method, steepest descent method, Powell's conjugate direction method, conjugate gradient method, and variable-metric method. The assessment indicates that the ridge-path method, with modifications, could present a promising technique for optimization.This work was in partial fulfillment of the requirements for the MS degree of the first author at Cairo University, Cairo, Egypt. The authors would like to acknowledge the helpful and constructive suggestions of the reviewer.     

自适应多重网格法与超松弛法的比较

多重网格法(Multiple Grid Method,简称M-G方法)是近年来出现的快速方法之一,本文在M-G方法中采用自适应控制层间转换的技术,并将自适应M-G方法与G-S迭代方法及SOR迭代方,法进行了比较。其计算结果表明,自适应M-G方法的计算量比G-S迭代及SOR迭代少得多,当M-G方法所用层数为4-6层,这种优越性就更加明显,且自适应M-G方法中选取控制参数有很大的灵活性。     

Simultaneous estimation of thin film thickness and optical properties using two-stage optimization

In this work, we proposed the new method for estimation of the thickness and the optical properties of the thin metal oxide film deposited on a transparent substrate. The developed method uses only transmittance spectra measured. Our method is based on the two stage optimization where the thickness is determined in the outer stage and the optical properties are determined in the inner stage. The differential evolutionary algorithm is used in solving the formulated problem. The proposed method was illustrated in the case study of Titanium dioxide film deposited on a glass substrate. The results indicate that the thickness and the optical properties estimated agree well with the experiment. Moreover, we investigated robustness of the proposed method in the case of transmittance spectra containing noises. The data were modelled by adding random noises ranging between 0 and 30% to the transmittance spectra measured. It is seen that the proposed method has better robustness and performance than the existing method based on pointwise unconstrained minimization approach. In solving the estimation problem, the performance of the proposed method was also compared with the well-known Levenberg?CMarquardt method and single stage differential evolutionary method. The results indicate that the proposed method has better performance than Levenberg?CMarquardt method and single stage differential evolutionary method. Moreover, the proposed method is more robust to random noise than Levenberg?CMarquardt method and single stage differential evolutionary method.     

Iterative Methods of Richardson-Lucy-Type for Image Deblurring

Image deconvolution problems with a symmetric point-spread function arise in many areas of science and engineering. These problems often are solved by the Richardson-Lucy method, a nonlinear iterative method. We first show a convergence result for the Richardson-Lucy method. The proof sheds light on why the method may converge slowly. Subsequently, we describe an iterative active set method that imposes the same constraints on the computed solution as the Richardson-Lucy method. Computed examples show the latter method to yield better restorations than the Richardson-Lucy method and typically require less computational effort.     

A COLUMN-SECANT UPDATE TECHNIQUE FOR SOLVING SYSTEM OF NONLINEAR EQUATIONS

In this paper,we present a column-secant modification of the SCC method,which is called the CSSCC method.The CSSCC method uses function values more efficiently than the SCC method,and it is shown that the CSSCC method has better local q-convergence and r-convergence rates than the SCC method.The numerical results show that the CSSCC method is competitive with some well known methods for some standard test problems.     

一种基于矩阵初等变换的Schmidt正交化方法

对向量组的Schmidt正交化法和合同变换法的关系进行了分析,指出Schmidt正交化法就是合同变换法中利用规范化初等变换后的一种特殊情况,由此给出一种基于矩阵初等变换的Schmidt正交化方法——Schmidt初等变换正交化法,以及这一方法在软件Matlab上实现的程序.     

Finding roots of a real polynomial simultaneously by means of Bairstow's method

Aberth's method for finding the roots of a polynomial was shown to be robust. However, complex arithmetic is needed in this method even if the polynomial is real, because it starts with complex initial approximations. A novel method is proposed for real polynomials that does not require any complex arithmetic within iterations. It is based on the observation that Aberth's method is a systematic use of Newton's method. The analogous technique is then applied to Bairstow's procedure in the proposed method. As a result, the method needs half the computations per iteration than Aberth's method. Numerical experiments showed that the new method exhibited a competitive overall performance for the test polynomials.     

牛顿迭代法与几种改进格式的效率指数

研究牛顿迭代、牛顿弦截法以及它们的六种改进格式的计算效率,计算了它们的效率指数,得到牛顿迭代、改进牛顿法、弦截法和改进弦截法(即所谓牛顿迭代的P.C格式)、二次插值迭代格式、推广的牛顿迭代法、调和平均牛顿法和中点牛顿法的效率指数分别为0.347/n、0.3662/n、0.4812/n、0.4812/n、0.347/n、0.3662/n、0.3662/n、0.3662/n.我们的结果显示,利用抛物插值多项式推出的迭代格式和改进弦截法并没有真正提高迭代的计算效率.此外,我们还证明了改进弦截法与牛顿弦截法等价,并利用这一结论给出了改进弦截法收敛阶为2.618的一个简化证明.     

大密度比和大压力比可压缩流的数值计算

将WENO方法、RKDG方法、RKDG方法结合原来的Ghost Fluid方法以及RKDG方法结合改进的Ghost Fluid方法,应用到大密度比和大压力比的单相流以及气-气、气-液两相流的数值计算,并对计算结果进行了比较分析．结果表明,与其它的方法相比,RKDG方法结合改进的Ghost Fluid方法得到了高分辨率的计算结果,可以捕捉到正确的激波位置,随着网格的加密,计算解收敛到物理解．