共查询到20条相似文献,搜索用时 671 毫秒
1.
本文给出了一个修改的路径跟踪预测校正非内点算法 ,同时给出了一个新的中心路邻域的表示 .并在此基础上给出了全局和局部收敛性 ,最后给出的数值结果验证了其有效性 相似文献
2.
3.
4.
对于一般情形, 基于后继函数法给出焦点量计算的递推公式;基于形式级数法给出焦点量计算和化简的Maple算法;给出了时间可逆条件的推导算法,给出了一类五次系统时间可逆的充要条件. 相似文献
5.
文[1]对2008年新知杯上海市初中数学竞赛第四题的参考答案给出了较为简捷的方法并给出了精确值,本文再给出一个更为简捷的方法.为方便起见,现给出2008年新知杯上海市初中数学竞 相似文献
6.
Pascal分布的参数估计 总被引:2,自引:0,他引:2
韩明 《纯粹数学与应用数学》2006,22(4):510-515
对Pascal分布,提出了参数估计的一种新方法——E-Bayes估计法.给出了可靠度的E-Bayes估计的定义,在此基础上给出了可靠度的E-Bayes估计公式,并给出了可靠度的E-Bayes估计的性质——E-Bayes估计和多层Bayes估计的关系.最后,给出了模拟算例,结果表明本文提出的E-Bayes估计法可行且便于应用. 相似文献
7.
提出一类对称张量绝对值方程问题,给出了求解此类问题的一类非光滑牛顿法,并且在一般的假设条件下,给出了算法的局部收敛性.最后给出相关的数值实验表明了算法的有效性. 相似文献
8.
9.
首先给出了区间数空间子集的有界性及确界等概念,并给出了确界的存在性定理;然后讨论了区间值映射的半连续性问题,给出了区间值映射的半连续性概念及相关性质;最后讨论了半连续区间值映射的凸性问题,给出了半连续区间值映射为凸区间值映射的两个充分条件. 相似文献
10.
11.
本文给出了适于在MIMD机上解非线性方程组的同步化并行Broyden方法和换列修正拟Newton法的迭代格式,以及它们的局部收敛性定理.数值试验结果也验证了收敛性. 相似文献
12.
Overall comparisons are made for six efficient combinations of the Ritz-Galerkin and finite element methods for solving elliptic boundary value problems with singularities or interfaces. The comparisons are done by using theoretical analysis and numerical experiments. Significant relations among the six combinations are also found. A survey of the six combinations and their coupling strategies are given. These combinations are important not only for matching the Ritz-Galerkin method and the finite element method but also for matching other numerical methods such as the Ritz-Galerkin method and the finite difference method. 相似文献
13.
Livinus U. Uko 《Mathematical Programming》1996,73(3):251-268
We give some convergence results on the generalized Newton method (referred to by some authors as Newton's method) and the
chord method when applied to generalized equations. The main results of the paper extend the classical Kantorovich results
on Newton's method to (nonsmooth) generalized equations. Our results also extend earlier results on nonsmooth equations due
to Eaves, Robinson, Josephy, Pang and Chan.
We also propose inner-iterative schemes for the computation of the generalized Newton iterates. These schemes generalize popular
iterative methods (Richardson's method, Jacobi's method and the Gauss-Seidel method) for the solution of linear equations
and linear complementarity problems and are shown to be convergent under natural generalizations of classical convergence
criteria.
Our results are applicable to equations involving single-valued functions and also to a class of generalized equations which
includes variational inequalities, nonlinear complementarity problems and some nonsmooth convex minimization problems. 相似文献
14.
Zi‐Cai Li Tzon‐Tzer Lu Hung‐Tsai Huang Alexander H.‐D. Cheng 《Numerical Methods for Partial Differential Equations》2007,23(1):93-144
In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007 相似文献
15.
本文提出复合最小化平均分位数损失估计方法 (composite minimizing average check loss estimation,CMACLE)用于实现部分线性单指标模型(partial linear single-index models,PLSIM)的复合分位数回归(composite quantile regression,CQR).首先基于高维核函数构造参数部分的复合分位数回归意义下的相合估计,在此相合估计的基础上,通过采用指标核函数进一步得到参数和非参数函数的可达最优收敛速度的估计,并建立所得估计的渐近正态性,比较PLSIM的CQR估计和最小平均方差估计(MAVE)的相对渐近效率.进一步地,本文提出CQR框架下PLSIM的变量选择方法,证明所提变量选择方法的oracle性质.随机模拟和实例分析验证了所提方法在有限样本时的表现,证实了所提方法的优良性. 相似文献
16.
We analyze the convergence rate of an asynchronous space decomposition method for constrained convex minimization in a reflexive Banach space. This method includes as special cases parallel domain decomposition methods and multigrid methods for solving elliptic partial differential equations. In particular, the method generalizes the additive Schwarz domain decomposition methods to allow for asynchronous updates. It also generalizes the BPX multigrid method to allow for use as solvers instead of as preconditioners, possibly with asynchronous updates, and is applicable to nonlinear problems. Applications to an overlapping domain decomposition for obstacle problems are also studied. The method of this work is also closely related to relaxation methods for nonlinear network flow. Accordingly, we specialize our convergence rate results to the above methods. The asynchronous method is implementable in a multiprocessor system, allowing for communication and computation delays among the processors.
17.
On the convergence of a new trust region algorithm 总被引:12,自引:0,他引:12
Ya-xiang Yuan 《Numerische Mathematik》1995,70(4):515-539
Summary.
In this paper we
present a new trust region algorithm for general nonlinear constrained
optimization problems. The algorithm is based on the
exact penalty
function. Under very mild conditions, global convergence results
for the algorithm are given.
Local convergence properties are also studied.
It is shown that
the penalty parameter generated by the algorithm will be eventually
not less than the norm of the Lagrange multipliers at
the accumulation point. It is proved that the method is
equivalent to the sequential quadratic programming method for all
large , hence superlinearly convergent results of the
SQP method can be applied.
Numerical results are also reported.
Received March 21, 1993 相似文献
18.
Buchanan JT 《The Journal of the Operational Research Society》1980,31(7):615-620
Two solution methods are offered for the no-shortage stock control problem under linearly increasing demand. The heuristic of the first "myopic" method is also exploited in the second method, which is based on a dynamic programming formulation. The DP formulation is not only trivial to solve computationally, but also offers ready-made sensitivity analyses. Unlike the other method, it also readily extends to more complicated models. 相似文献
19.
In this paper, a new kind of alternating direction implicit (ADI) Crank-Nicolson-type orthogonal spline collocation (OSC) method is formulated for the two-dimensional fractional evolution equation with a weakly singular kernel arising in the theory of linear viscoelasticity. The novel OSC method is used for the spatial discretization, and ADI Crank-Nicolson-type method combined with the second order fractional quadrature rule are considered for the temporal component. The stability of proposed scheme is rigourously established, and nearly optimal order error estimate is also derived. Numerical experiments are conducted to support the predicted convergence rates and also exhibit expected super-convergence phenomena. 相似文献
20.
This paper proposes Generalized Stationary Iterative, called GSI, method. It is shown that the existing stationary iterative methods are special cases of GSI method. Convergence properties of this method are provided, and their numerical experiments for linear systems with symmetric positive definite matrix are also provided. 相似文献