共查询到20条相似文献,搜索用时 109 毫秒
1.
边值方法(BVMS)是用于解常微分方程初值问题的一类方法,迄今为止,边值方法还没有被广泛地推广。主要有两个原因:一是人们不甚了解它们的稳定性;二是具有较高的计算代价。本给出了建立两步边值方法稳定性的一个有效的方法,并证明了其结果。 相似文献
2.
在无约束优化中,共轭方向法是一类重要而有效的方法,其中Powell方法及其改进方法不使用目标函数导数,在实用中受到重视。文[2]指出Powell方法及其改进方法也有某些缺点,因此提出了随伴子空间方法。本文吸取上述几种方法的优点,力求克服其缺点, 相似文献
3.
1 引 言 在数值模拟流动问题的有限元逼近中,为了克服通常Galerkin方法出现的稳定性差的缺陷。80年代初,Hughes、Johnson等人提出了用于对流占优流动问题求解的流线迎风Petrov-Galerkin方法(或流线扩散法),简称SUPG(或SD)方法。SUPG(SD)方法本质上既不同于经典的迎风方法,又不同于通常的Galerkin方法。它是一种具有相容性(达到最佳逼近精度)和附加稳定性特点的稳定化有限元法。 受SUPG方法的影响,流动问题的稳定化有限元法成了近年来一个重要的研究课 相似文献
4.
本文研究了一类具有非线性边界条件的反应一扩散一对流方程组的周期解的数值解法,利用上下解作为初始迭代,把求方程组的Jacobi方法和Gauss—Seidel方法和上下解方法结合起来,得到了迭代序列的单调收敛性和方法的收敛性,对方法的稳定性也作了论述。 相似文献
5.
6.
本文介绍了一个有效的处理高维变点问题的方法。我们先将数据矩阵使用主成分分析的方法投影到低维空间,然后再利用传统变点的方法来进行估计。在变点个数未知时,我们使用交叉核实的方法来估计变点个数。在数值模拟研究中,我们将新方法同一些已有的方法进行了比较,在估计的准确度和计算时间等方面都要优于其他方法。 相似文献
7.
本文考虑的问题是二维粘性渠流.对0到2000之间的雷诺数,计算了平稳扰动的Couette-Poiseuille流的下游特征值,其特征方程类似于Orr-Sommerfeld方程。所用的方法是谱方法和初值方法(复合矩阵方法).就几种有趣的流量,给出了相应的特征值的计算结果。这些特征值确定了扰动的衰减率. 相似文献
8.
基于有理函数模型的一维最优化方法 总被引:1,自引:0,他引:1
在本文中提出了基于有理函数模型的一维最优化方法。这些方法比二次模型方法有较好的数值性态和适应性。我们给出了有理反差商方法和Nevile型方法,并将其与二次插值方法进行了数值比较。 相似文献
9.
权的最小平方法是层次分析法中一种有效的排序方法,但由于作者未能从理论上证明该方法的合理准,因而,在实际工作中未能得到推广和应用。本文拟给出该方法严格的理论证明。 相似文献
10.
Bernardo方法是一种多属性群决策方法。针对Bernardo方法,本文结合模糊不确定性理论,提出“模糊Bernardo”方法;利用模糊变量表示决策者对多方案排序的模糊目标值,给出其Bernardo方法的模糊混合0-1规划模型和模糊机会约束混合0-1规划模型。该方法为群决策提供了一种多方案排序问题的实用且有效的理论依据和计算方法。最后通过实例对此方法予以验证。 相似文献
11.
A. A. TElzoughby S. M. Metwalli G. S. A. Shawki 《Journal of Optimization Theory and Applications》1980,30(2):161-179
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. 相似文献
12.
我们提出和分析了一种求解Stokes方程的数值方法.新方法基于空间上的Legendre谱离散,时间上则采用投影/方向分裂格式.更确切地说,时间离散的出发点是旋度形式的压力校正投影法,在此基础上进一步应用方向分裂法,把速度和压力方程分裂为一系列一维的椭圆型子问题.然后生成的这些一维子问题用Legendre谱方法进行空间离散.另外,我们证明了全离散格式的稳定性.一些数值实验验证了收敛性和方法的有效性. 相似文献
13.
14.
In this paper, we propose a high order Fourier spectral-discontinuous Galerkin method for time-dependent Schrödinger–Poisson equations in 3-D spaces. The Fourier spectral Galerkin method is used for the two periodic transverse directions and a high order discontinuous Galerkin method for the longitudinal propagation direction. Such a combination results in a diagonal form for the differential operators along the transverse directions and a flexible method to handle the discontinuous potentials present in quantum heterojunction and supperlattice structures. As the derivative matrices are required for various time integration schemes such as the exponential time differencing and Crank Nicholson methods, explicit derivative matrices of the discontinuous Galerkin method of various orders are derived. Numerical results, using the proposed method with various time integration schemes, are provided to validate the method. 相似文献
15.
Daowu Pei 《International Journal of Approximate Reasoning》2012,53(5):837-846
Fuzzy reasoning includes a number of important inference methods for addressing uncertainty. This line of fuzzy reasoning forms a common logical foundation in various fields, such as fuzzy logic control and artificial intelligence. The full implication triple I method (a method only based on implication, TI method for short) for fuzzy reasoning is proposed in 1999 to improve the popular CRI method (a hybrid method based on implication and composition). The current paper delves further into the TI method, and a sound logical foundation is set for the TI method based on the monoidal t-norm based logical system MTL. 相似文献
16.
17.
Ya Xu Bingsheng He Xiaoming Yuan 《Journal of Mathematical Analysis and Applications》2006,322(1):276-287
Inspired by the Logarithmic-Quadratic Proximal method [A. Auslender, M. Teboulle, S. Ben-Tiba, A logarithmic-quadratic proximal method for variational inequalities, Comput. Optim. Appl. 12 (1999) 31-40], we present a new prediction-correction method for solving the nonlinear complementarity problems. In our method, an intermediate point is produced by approximately solving a nonlinear equation system based on the Logarithmic-Quadratic Proximal method; and the new iterate is obtained by convex combination of the previous point and the one generated by the improved extragradient method at each iteration. The proposed method allows for constant relative errors and this yields a more practical Logarithmic-Quadratic Proximal type method. The global convergence is established under mild conditions. Preliminary numerical results indicate that the method is effective for large-scale nonlinear complementarity problems. 相似文献
18.
Xiaojun Chen 《Journal of Computational and Applied Mathematics》1998,100(2):369-224
This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inexact Uzawa method for linear saddle-point problems. The relaxed condition is used to determine the relaxation parameters in the SOR-Newton method and the SOR-BFGS method. Furthermore, we study global convergence of the multistep inexact Uzawa method for nondifferentiable saddle-point problems. 相似文献
19.
W. S. Luk 《BIT Numerical Mathematics》1996,36(2):302-308
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. 相似文献
20.
一个解凸二次规划的预测-校正光滑化方法 总被引:1,自引:0,他引:1
本文为凸二次规划问题提出一个光滑型方法,它是Engelke和Kanzow提出的解线性规划的光滑化算法的推广。其主要思想是将二次规划的最优性K-T条件写成一个非线性非光滑方程组,并利用Newton型方法来解其光滑近似。本文的方法是预测-校正方法。在较弱的条件下,证明了算法的全局收敛性和超线性收敛性。 相似文献