首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 140 毫秒
1.
应用各种符号计算系统可以很方便地求解各种线性代数问题,利用初等变换即可得到问题的精确解而不必预先编写程序,本文通过例子,根据单纯形算法原理,详细介绍了使用muMATH系统直接求解线性规划问题精确解的运算方法,人工变量所对应的列向量始终不参加运算,从而可大量节省存储量和计算量。  相似文献   

2.
对于含自由变量的LP问题,为了得到比单纯形法[1]更有效的算法,通过研究在单纯形法迭代过程中,将自由变量化为非负变量再实施运算的规律,提出一种能节省存贮空间和提高运算速度的改进单纯形法。数值实验表明新算法是有效的。  相似文献   

3.
线性规划两阶段法的改进算法   总被引:4,自引:2,他引:2  
将单纯形法与对偶单纯形法及其思想结合运用,对两阶段法引进人工变量的方式进行了改进,探索出一种最多引入一个人工变量,即可求得线性规划初始可行基的新算法,能有效地节约计算机的存储量和计算量。  相似文献   

4.
讨论了线性规划的单纯形解法,给出了不须加人工变量就可得到一个可行基的算法.通过大量的算例表明此法比传统的单纯形方法具有算法结构简单,计算量小的优点.  相似文献   

5.
本在指献[2]缺点的基础上参考该法优点,对大M法引进人工变量的方式进行了改进,给出了至多引进一个人工变量的求线性规划问题的一种新算法,本方法容易操作,计算量相对较小。  相似文献   

6.
从解决大学生网络成瘾和抑郁相互影响关系的研究出发,构建了有调节的中介潜变量的循环效应模型.为对模型变量进行效应大小的分析和比较,推导出模型参数的标准化估计.运用我们提出的基于配方约束的潜变量回归的确定性线性算法来计算潜变量的值,避免了交互潜变量计算时观测变量的配对问题.对模型参数的OLS估计可能不具有一致性和无偏性进行了证明,并给出了解决问题的相应算法.总结出模型的算法步骤和变量的效应检验步骤.最后进行了数值模拟,验证了模型的合理性.  相似文献   

7.
Lasso是机器学习中比较常用的一种变量选择方法,适用于具有稀疏性的回归问题.当样本量巨大或者海量的数据存储在不同的机器上时,分布式计算是减少计算时间提高效率的重要方式之一.本文在给出Lasso模型等价优化模型的基础上,将ADMM算法应用到此优化变量可分离的模型中,构造了一种适用于Lasso变量选择的分布式算法,证明了该算法的收敛性;同时,我们通过数值实验,将本文构造的分布式算法与循环坐标下降法和ADMM算法进行了比较分析,结果显示在处理样本集大的稀疏性回归问题时,本文提出的算法的计算时间和误差都小于其他两种算法.  相似文献   

8.
急动度(jerk)在工程实践中具有重要的意义.将径向基函数逼近与配点法相结合,发展了一种能够有效求解动力响应的数值算法.该方法使用径向基函数插值来逼近真实的运动规律,能够用于急动度和急动度(三阶)方程的计算,弥补了传统的数值方法无法计算急动度的不足.并针对微分方程的特点,提出了改进的多变量联合插值函数,同时添加与微分方程同阶的初值条件,可显著减小数值震荡.算例表明,该方法具有计算过程简单、精度高的特点,同时对急动度方程也有很好的适用性.  相似文献   

9.
周康  陈金  邱江  解智 《运筹学学报》2012,16(2):121-126
基于部分基变量提出了LP问题的矩阵算法. 该算法以最优基矩阵的一个充分必要条件为基础,首先将一个初始矩阵转化为右端项和检验数均满足要求的矩阵,再转为检验数满足要求的基矩阵,最后转化为最优基矩阵.该算法具有使用范围广、计算规模小、计算过程简化、计算机易于实现的优势.矩阵算法的核心运算是求逆矩阵的运算,提出了矩阵算法的求逆问题,讨论并给出了求逆快速算法,该算法充分利用了矩阵算法迭代过程中提供的原来的逆矩阵的信息经过简单的变换得到新的逆矩阵,该算法比直接求逆法计算效率更高.  相似文献   

10.
将非线性系统的最优控制问题导向Hamilton系统,提出了求解非线性最优控制问题的保辛多层次方法.首先,以时间区段两端状态为独立变量并在区段内采用Lagrange插值近似状态和协态变量,通过对偶变量变分原理将非线性最优控制问题转化为非线性方程组的求解.然后,在保辛算法的具体实施过程中提出了多层次求解思想,以2N类算法为基础由低层次到高层次加密离散时间区段,利用Lagrange插值得到网格加密后的初始状态与协态变量作为求解非线性方程组的初值,可提高计算效率.数值算例验证了算法在求解效率与求解精度上的有效性.  相似文献   

11.
The distribution function of the present value of a cash flow can be approximated by means of a distribution function of a random variable, which is also the present value of a sequence of payments, but with a simpler structure. The corresponding random variable has the same expectation as the random variable corresponding to the original distribution function and is a stochastic upper bound of convex order. A sharper upper bound can be obtained if more information about the risk is available. In this paper, it will be shown that such an approach can be adopted for disability annuities (also known as income protection policies) in a three state model under Markov assumptions. Benefits are payable during any spell of disability whilst premiums are only due whenever the insured is healthy. The quality of the two approximations is investigated by comparing the distributions obtained with the one derived from the algorithm presented in the paper by Hesselager and Norberg [Insurance Math. Econom. 18 (1996) 35–42].  相似文献   

12.
Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18  相似文献   

13.
Pivoting in Extended Rings for Computing Approximate Gr?bner Bases   总被引:1,自引:0,他引:1  
It is well known that in the computation of Gr?bner bases arbitrarily small perturbations in the coefficients of polynomials may lead to a completely different staircase, even if the solutions of the polynomial system change continuously. This phenomenon is called artificial discontinuity in Kondratyev’s Ph.D. thesis. We show how such phenomenon may be detected and even “repaired” by using a new variable to rename the leading term each time we detect a “problem”. We call such strategy the TSV (Term Substitutions with Variables) strategy. For a zero-dimensional polynomial ideal, any monomial basis (containing 1) of the quotient ring can be found with the TSV strategy. Hence we can use TSV strategy to relax term order while keeping the framework of Gr?bner basis method so that we can use existing efficient algorithms (for instance the F 5 algorithm) to compute an approximate Gr?bner basis. Our main algorithms, named TSVn and TSVh, can be used to repair artificial e{\epsilon}-discontinuities. Experiments show that these algorithms are effective for some nontrivial problems.  相似文献   

14.
许永华 《数学学报》1978,21(4):289-301
本文继上文(Ⅰ)的理论,共分二节,第一节继续上文的理想理论,引进两非环的半素理想及半准素理想概念,并对它们作基本性质的研究.第二节引进根及半单纯概念建立分解成单纯子环直和的有关诸定理.  相似文献   

15.
Recursive partitioning is embedded into the general and well-established class of parametric models that can be fitted using M-type estimators (including maximum likelihood). An algorithm for model-based recursive partitioning is suggested for which the basic steps are: (1) fit a parametric model to a dataset; (2) test for parameter instability over a set of partitioning variables; (3) if there is some overall parameter instability, split the model with respect to the variable associated with the highest instability; (4) repeat the procedure in each of the daughter nodes. The algorithm yields a partitioned (or segmented) parametric model that can be effectively visualized and that subject-matter scientists are used to analyzing and interpreting.  相似文献   

16.
我们研究-个具有全局性公平满意度的最大多物资网络流问题(MMFP-GFMR).该项工作不仅丰富了最大多物资网络流问题的内容,而且可用于研究某些实际优化决策问题,例如运输过程中的一些资源分配问题.文中主要内容如下:(A)定义问题MMFP-GFMR并证明其解的存在性.(B)设计-个求解MMFP-GFMR的拟多项式逼近算法.(C)研究算法的复杂性与逼近程度.(D)最后通过模拟计算验证了我们的工作.  相似文献   

17.
Schwarz波形松弛(Schwarz waveform relaxation,SWR)是一种新型区域分解算法,是当今并行计算研究领域的焦点之一,但针对该算法的收敛性分析基本上都停留在时空连续层面.从实际计算角度看,分析离散SWR算法的收敛性更重要.本文考虑SWR研究领域中非常流行的Robin型人工边界条件,分析时空离散参数t和x、模型参数等因素对算法收敛速度的影响.Robin型人工边界条件中含有一个自由参数p,可以用来优化算法的收敛速度,但最优参数的选取却需要求解一个非常复杂的极小-极大问题.本文对该极小-极大问题进行深入分析,给出最优参数的计算方法.本文给出的数值实验结果表明所获最优参数具有以下优点:(1)相比连续情形下所获最优参数,利用离散情形下获得的参数可以进一步提高Robin型SWR算法在实际计算中的收敛速度,当固定t或x而令另一个趋于零时,利用离散情形下所获参数可以使算法的收敛速度具有鲁棒性(即收敛速度不随离散参数的减小而持续变慢).(2)相比连续情形下所获收敛速度估计,离散情形下获得的收敛速度估计可以更加准确地预测算法的实际收敛速度.  相似文献   

18.
We consider a reformulation of mathematical programs with complementarity constraints, where by introducing an artificial variable the constraints are converted into equalities which are once but not twice differentiable. We show that the Lagrange optimality system of such a reformulation is semismooth and BD-regular at the solution under reasonable assumptions. Thus, fast local convergence can be obtained by applying the semismooth Newton method. Moreover, it turns out that the squared residual of the Lagrange system is continuously differentiable (even though the system itself is not), which opens the way for a natural globalization of the local algorithm. Preliminary numerical results are also reported.  相似文献   

19.
宋威 《运筹与管理》1999,8(2):48-54
文章提出求二次规划的最优解的一种算法——旋转迭代算法。该方法仅用到最小比原则及行初等变换,无须引入人工变量,在同一张表格下可求出最优解。比文[1]中的若干算法有可能较简单,推广了文[2]中的算法。该方法易于操作。在风险管理的应用中,较容易确定投资组合的比例系数。  相似文献   

20.
线性规划问题的规范型算法   总被引:3,自引:1,他引:2  
提出了线性规划问题的两种规范标准形式;证明了任意一个线性规划问题都可化为这两种形式之一;给出了不需引入人工变量的线性规划问题的求解算法。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号