共查询到20条相似文献,搜索用时 93 毫秒
1.
本文考虑多参数非线性问题中音叉式分岔的分类,并提出了计算带有不同奇异性的音叉式分岔点的正则扩张系统,给出了求解正则扩张系统的一个有效算法,最后通过数值例子说明我们算法的有效性。 相似文献
2.
分析了二维问题边界元法3节点二次单元的几何特征,区分和定义了源点相对高阶单元的Ⅰ型和Ⅱ型接近度.针对二维位势问题高阶边界元中奇异积分核,构造出具有相同Ⅱ型几乎奇异性的近似核函数,在几乎奇异积分单元上分离出积分核中主导的奇异函数部分.原积分核扣除其近似核函数后消除几乎奇异性,成为正则积分核函数,并采用常规Gauss数值方法计算该正则积分;对奇异核函数的积分推导出解析公式,从而建立了一种新的边界元法高阶单元几乎奇异积分半解析算法.应用该算法计算了二维薄体结构温度场算例,计算结果表明高阶单元半解析算法能充分发挥边界元法优势,显著提高计算精度. 相似文献
3.
该文所讨论的是在Hadamard主值意义下,高阶奇异积分(犛犳)(狋)=∫ 犳(狓)(狓-狋)狀+1d狓, 狀≥1的小波逼近及数值计算.特别是当小波函数未知时,借助于方程(3.1),对高阶奇异积分作数值计算,建立了收敛性定理. 相似文献
4.
5.
本文对于矩形区域上某一内点为奇点的奇异积分的近似计算给出了优化中心数值算法,它在迭代计算过程中避免了函数值的重复计算.采用外推法减少迭代次数. 相似文献
6.
本文对于矩形区域上某一内点为奇点的奇异积分的近似计算给出了优化中心数值算法,它在迭代计算过程中避免了函数值的重复计算.采用外推法减少迭代次数. 相似文献
7.
本文研究了一类高阶多点边值问题的数值解法问题.利用第二类Chebyhsev小波及其积分算子矩阵,将线性与非线性高阶常微分方程多点边值问题转化为代数方程组进行求解.通过与现有文献算法结果的比较,说明了该算法求解高阶多点边值问题的准确性与有效性.扩展了高阶多点边值问题的数值求解方法. 相似文献
8.
本文构造分裂迭代算法用于计算Takens-Bogdanov分岐点,该方法将减少计算的工作量和占用的内存,可以调节的速度线性收敛,并且可以求得Takens-Bogdanov分岐点处fx^及fx^0的广义零特征向量,数值计算说明了算法的有效性。 相似文献
9.
叶瑞松 《应用数学与计算数学学报》1996,10(1):12-17
本文构造分裂迭代算法用于计算二重对称破缺转向点,该方法将明显(?)少计算的工作量和占用的内存,并且以可调节的速度线性收敛。数值计算成功地说明了分裂迭代算法的有效性。 相似文献
10.
Zhang Tiande Wang Wei 《大学数学》1998,(3)
对于热传导方程构造了两个高阶精度的差分格式,一个是三层七点显格式,另一个是三层九点隐格式.证明了差分格式的收敛性和稳定性,最后给出数值计算结果. 相似文献
11.
针对恒模算法(CMA)收敛速度较慢、收敛后均方误差较大的缺点,提出一种新的双模式盲均衡算法.在算法初期,利用能快速收敛的归一化恒模算法(NCMA)进行冷启动,在算法收敛后切换到判决引导(DD-LMS)算法,减少误码率.计算机仿真表明,提出的新算法有较快的收敛速度和较低的误码率. 相似文献
12.
We describe a fraction free version of the Matrix Berlekamp/Massey algorithm. The algorithm computes a minimal matrix generator of linearly generated square matrix sequences in an integral domain. The algorithm performs all operations in the integral domain, so all divisions performed are exact. For scalar sequences, the matrix algorithm specializes to a different algorithm than the algorithm currently in the literature. This new scalar algorithm has smaller intermediate values than the known fraction free Berlekamp/Massey algorithm. 相似文献
13.
14.
针对模糊C均值算法用于图像分割时对初始值敏感、容易陷入局部极值的问题,提出基于混合单纯形算法的模糊均值图像分割算法.算法利用Nelder-Mead单纯形算法计算量小、搜索速度快和粒子群算法自适应能力强、具有较好的全局搜索能力的特点,将混合单纯形算法的结果作为模糊C均值算法的输入,并将其用于图像分割.实验结果表明:基于混合单纯形算法的模糊均值图像分割算法在改善图像分割质量的同时,提高了算法的运行速度. 相似文献
15.
A descent algorithm for nonsmooth convex optimization 总被引:1,自引:0,他引:1
Masao Fukushima 《Mathematical Programming》1984,30(2):163-175
This paper presents a new descent algorithm for minimizing a convex function which is not necessarily differentiable. The
algorithm can be implemented and may be considered a modification of the ε-subgradient algorithm and Lemarechal's descent
algorithm. Also our algorithm is seen to be closely related to the proximal point algorithm applied to convex minimization
problems. A convergence theorem for the algorithm is established under the assumption that the objective function is bounded
from below. Limited computational experience with the algorithm is also reported. 相似文献
16.
提出了一种凸组合共轭梯度算法,并将其算法应用到ARIMA模型参数估计中.新算法由改进的谱共轭梯度算法与共轭梯度算法作凸组合构造而成,具有下述特性:1)具备共轭性条件;2)自动满足充分下降性.证明了在标准Wolfe线搜索下新算法具备完全收敛性,最后数值实验表明通过调节凸组合参数,新算法更加快速有效,通过具体实例证实了模型的显著拟合效果. 相似文献
17.
18.
Neculai Andrei 《Numerical Functional Analysis & Optimization》2019,40(13):1467-1488
A new diagonal quasi-Newton updating algorithm for unconstrained optimization is presented. The elements of the diagonal matrix approximating the Hessian are determined as scaled forward finite differences directional derivatives of the components of the gradient. Under mild classical assumptions, the convergence of the algorithm is proved to be linear. Numerical experiments with 80 unconstrained optimization test problems, of different structures and complexities, as well as five applications from MINPACK-2 collection, prove that the suggested algorithm is more efficient and more robust than the quasi-Newton diagonal algorithm retaining only the diagonal elements of the BFGS update, than the weak quasi-Newton diagonal algorithm, than the quasi-Cauchy diagonal algorithm, than the diagonal approximation of the Hessian by the least-change secant updating strategy and minimizing the trace of the matrix, than the Cauchy with Oren and Luenberger scaling algorithm in its complementary form (i.e. the Barzilai-Borwein algorithm), than the steepest descent algorithm, and than the classical BFGS algorithm. However, our algorithm is inferior to the limited memory BFGS algorithm (L-BFGS). 相似文献
19.
Yaguang Yang 《Numerical Algorithms》2017,74(4):967-996
Mehrotra’s algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear programming are based on Mehrotra’s algorithm. This paper describes a proposal and implementation of an alternative algorithm, an arc-search infeasible interior-point algorithm. We will demonstrate, by testing Netlib problems and comparing the test results obtained by the arc-search infeasible interior-point algorithm and Mehrotra’s algorithm, that the proposed arc-search infeasible interior-point algorithm is a more reliable and efficient algorithm than Mehrotra’s algorithm. 相似文献
20.
介绍了一种求解TSP问题的算法—改进的蚁群算法,算法通过模拟蚁群搜索食物的过程,可用于求解TSP问题,算法的主要特点是:正反馈、分布式计算、与某种启发式算法相结合.通过对传统蚁群算法的改进可以得到较好的结果.计算机仿真结果表明了该算法的有效性. 相似文献