传统隐式Runge-Kutta方法的转换方法

多级隐式Runge-Kutta(RK)方法簇中,除Gauss类方法是s级2s阶的辛方法以外,Radau类方法和Lobatto类方法既不是s级2s阶的方法也不是辛方法.基于隐式RK方法是一类转换RK方法这一特征,利用V-变换和Pade对角逼近,提出了构造高阶RK方法的转换定理.依据转换定理,导出了s级2s阶的Radau方法和s级2s阶的Lobatto方法.利用V-变换和待定系数法,导出了辛Radau方法和辛Lobatto方法.在此基础上,发现并证明了辛Radau方法是s级2s阶的方法.     

几类改进的新的两步六阶Chebyshev-Halley方法

利用权函数法,给出非线性方程求根的Chebyshev-Halley方法的几类改进方法,证明方法六阶收敛到单根.Chebyshev-Halley方法的效率指数为1.442,改进后的两步方法的效率指数为1.565.最后给出数值试验,且与牛顿法,Chebyshev-Halley 方法及其它已知的方程求根方法做了比较.结果表明方法具有一定的优越性.     

一类新的求解非线性方程的七阶方法

利用权函数法给出了一类求解非线性方程单根的七阶收敛的方法.每步迭代需要计算三个函数值和一个导数值,因此方法的效率指数为1.627.数值试验给出了该方法与牛顿法及同类方法的比较,显示了该方法的优越性.最后指出Kou等人给出的七阶方法是方法的特例.     

求解初值问题的RKNd方法

本文基于一阶常微分方程所导出的二阶微分方程提出RKNd方法,其内级阶比传统RK方法高一阶.RKNd方法的阶条件由特殊Nystr(o)m树给出.在相同级数下,RKNd方法可达到的最高代数阶比传统的RK方法高.数值实验结果表明RKNd方法比同阶RK方法在计算效率上具有一定的优越性.     

关于线性互补问题的模系矩阵分裂迭代方法

模系矩阵分裂迭代方法是求解大型稀疏线性互补问题的有效方法之一.本文的目标是归纳总结模系矩阵分裂迭代方法的最新发展和已有成果,主要内容包括相应的多分裂迭代方法, 二级多分裂迭代方法和两步多分裂迭代方法, 以及这些方法的收敛理论.     

威布尔分市场合无失效数据的可靠性分析

拿文综合了近几年来对威布尔分布和指数分布的无失效数据处理的几种方法这些方法是经典方法、贝叶斯方法、最小x~2方法、等效失效敷方法,并对这些方法作了适当的分析,提出进一步需研究的问题。     

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

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

改进的基于特征向量集的距离判别及在企业信用评价中的应用

在基于特征向量集的距离判别的基础上,提出新的判别分析方法,试图解决现有判别分析方法中计算量大及对复杂数据判别效果差的缺点.同时,将方法用于企业信用评价中,并与传统的判别方法及一些改进的判别方法作比较,实验结果表明,方法提高了企业信用评价的准确率.     

对西蒙斯模型的改进及其估计量

针对属性特征的敏感性问题的西蒙斯模型提出了改进方法 ,包括随机方法和确定方法 .讨论了其估计量相应的统计性质及两种方法的适用范围 ,结论表明改进方法的统计性质优于西蒙斯模型 .     

基于模糊不确定性理论的Bernardo方法

Bernardo方法是一种多属性群决策方法。针对Bernardo方法，本文结合模糊不确定性理论，提出“模糊Bernardo”方法；利用模糊变量表示决策者对多方案排序的模糊目标值，给出其Bernardo方法的模糊混合0-1规划模型和模糊机会约束混合0-1规划模型。该方法为群决策提供了一种多方案排序问题的实用且有效的理论依据和计算方法。最后通过实例对此方法予以验证。     

Optimization of Approximate Solution of Integral Equations of Several Variables

In this paper, we consider the problem of optimization of adaptive direct methods of operator equations. Adaptivity of a direct method is understood in the sense that the subspace on the basis of which it is constructed is chosen depending on the operator of the concrete equation (otherwise, nonadaptive direct method is then concerned), which would essentially let us increase the precision. For some classes of the second kind of Fredhlom integral equations with anisotropic smooth kernels we determine the exact order of the error of adaptive direct methods, and we also give an optimal algorithm. Received April 13, 2001, Accepted September 13, 2001     

多元Fredholm积分方程自适应直接方法的优化

考虑了以各向异性光滑函数为核及自由项的多元Fredholm积分方程类的自适应直接方法的优化,得到误差阶的精确估计及相应的最优算法。     

多元积分方程自适应解法的优化

给出了核属于Besov空间的第二类Fredholm积分方程自适应的最优算法,并得到相关的误差阶的精确估计。     

Optimization of adaptive direct algorithms for approximate solution of integral equation

The concern of this paper is to study the optimization of adaptive direct algorithms for approximate solution of the second kind Fredholm integral equations. We derive the exact order of the problem with integral kernels belonging to the Besov classes. Furthermore, we also present an almost optimal adaptive direct algorithm for above equation class.     

核属于H函数类的多维积分方程近似解直接方法的优化

本文我们确定了核属于 H函数类的多维第二类 Fredholm积分方程类在自适直接方法意义下的最优近似解的精确阶估计 ,并给出了最优算法 .     

OPTIMIZATION OF ADAPTIVE DIRECT METHOD FOR APPROXIMATE SOLUTION OF INTEGRAL EQUATIONS OF SEVERAL VARIABLES

This paper determines the exact error order on optimization of adaptive directmethods of approximate solution of the class of Fredholm integral equations of the secondkind with kernel belonging to the anisotropic Sobolev classes, and also gives an optimalalgorithm.     

Optimization of adaptive direct methods for the solution of operator equations in Hilbert space

Some general theorems on estimates of error of optimal adaptive direct methods of solution of operator equations of type II in Hilbert space are obtained.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 1, pp. 95–102, January, 1990.     

On direct methods for solution of regularized equations

We prove that the application of so-called adaptive direct methods to approximation of Fredholm equations of the first kind leads to a more economical way of finite-dimensional approximation as compared with traditional approaches.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 47, No. 9, pp. 1231–1242, September, 1995.     

An efficient algorithm for the parallel solution of high-dimensional differential equations

The study of high-dimensional differential equations is challenging and difficult due to the analytical and computational intractability. Here, we improve the speed of waveform relaxation (WR), a method to simulate high-dimensional differential-algebraic equations. This new method termed adaptive waveform relaxation (AWR) is tested on a communication network example. Further, we propose different heuristics for computing graph partitions tailored to adaptive waveform relaxation. We find that AWR coupled with appropriate graph partitioning methods provides a speedup by a factor between 3 and 16.     

多元积分方程自适应解法的最优化

In this paper it was considered that problem of optimization of adaptive direct algorithm of approximate solution of integral equations. For the Fredholm integral equations of second kind with kernels belonging to Besov classes there is determined the exact order of the error of an optimal adaptive direct algorithm and a algorithm for realizing it is indicated.