共查询到20条相似文献,搜索用时 358 毫秒
1.
2.
3.
§0.引言 区域分裂是与微分方程数值解的并行计算的数学基础密切相关的,预处理共轭梯度法是区域分裂的一个主要途径,寻找好的预处理子是关键问题,本文给出一个较一般性的方法,预处理过程包括一个整体小规模问题和若干个独立的局部子问题,整体问题和局部问题的选取均有极大的任意性,预处理条件数的估计是由整体问题和局部问题的一些特 相似文献
4.
一类空间分数阶扩散方程经过有限差分离散后所得到的离散线性方程组的系数矩阵是两个对角矩阵与Toeplitz型矩阵的乘积之和.在本文中,对于几乎各向同性的二维或三维空间分数阶扩散方程的离散线性方程组,采用预处理Krylov子空间迭代方法,我们利用其系数矩阵的特殊结构和具体性质构造了一类分块快速正则Hermite分裂预处理子.通过理论分析,我们证明了所对应的预处理矩阵的特征值大部分都聚集于1的附近.数值实验也表明,这类分块快速正则Hermite分裂预处理子可以明显地加快广义极小残量(GMRES)方法和稳定化的双共轭梯度(BiCGSTAB)方法等Krylov子空间迭代方法的收敛速度. 相似文献
5.
有限元离散一类速度追踪问题后得到具有鞍点结构的线性系统,针对该鞍点系统,本文提出了一种新的分裂迭代技术.证明了新的分裂迭代方法的无条件收敛性,详细分析了新的分裂预条件子对应的预处理矩阵的谱性质.数值结果验证了对于大范围的网格参数和正则参数,新的分裂预条件子在求解有限元离散速度追踪问题得到的鞍点系统时的可行性和有效性. 相似文献
6.
7.
8.
9.
广义鞍点问题的松弛维数分解预条件子 总被引:1,自引:0,他引:1
本文将Benzi等提出的松弛维数分解(Relaxed dimensionalfactorization, RDF)预条件子进一步推广到广义鞍点问题上,并称为GRDF(Generalized RDF)预条件子.该预条件子可看做是用维数分裂迭代法求解广义鞍点问题而导出的改进维数分裂(Modified dimensional split, MDS)预条件子的松弛形式, 它相比MDS预条件子更接近于系数矩阵, 因而结合Krylov子空间方法(如GMRES)有更快的收敛速度.文中分析了GRDF预处理矩阵特征值的一些性质,并用数值算例验证了新预条件子的有效性. 相似文献
10.
11.
12.
《Applied Mathematics Letters》2002,15(2):217-225
A new approach for constructing efficient Runge-Kutta-Nyström methods is introduced in this paper. Based on this new approach a new exponentially-fitted Runge-Kutta-Nyström fourth-algebraic-order method is obtained for the numerical solution of initial-value problems with oscillating solutions. The new method has an extended interval of periodicity. Numerical illustrations on well-known initial-value problems with oscillating solutions indicate that the new method is more efficient than other ones. 相似文献
13.
主要得到了一类由概率分布生成的新度量.以信息理论中的重要概念-相对熵为基础,对前人文章中的重要结论进行推广,通过利用改进的初等方法在离散的可测空间中得到了这类新度量,并且证明了得到的新度量成立的充要条件.由此再将这类新度量推广到连续的可测空间中,得到了同样的结果.最后讨论了新度量的最值问题. 相似文献
14.
Muammer Ozer 《European Journal of Operational Research》2011,211(2):359-369
New product development involves several critical decisions. A key decision making area in new product development is the evaluation of the viability and the market potentials of a new product. In the absence of any relevant historical data, companies ask the potential buyers of their products about their intentions to buy those products when assessing their viability. Despite the popularity of the use of behavioral intentions in predicting the market acceptance of new product ideas, both survey and empirical studies suggest that the accuracy of such predictions is usually very low. Although earlier case-based studies suggest that a number of factors can affect the quality of new product decisions, it is still empirically unclear how product knowledge and the type of new products might impact the predictive accuracy of intentions-based new product forecasting. This study utilized a longitudinal research design and empirically tested the hypotheses across two new products. The study first collected purchase intentions data about the new products. Second, it collected subsequent actual purchase data about the new products. The results of series of hierarchical regression analyses comparing the initial purchase intentions and subsequent actual behaviors showed that while product knowledge is positively related to the predictive accuracy and consistency of intentions-based new product forecasting, product type is negatively related to them. 相似文献
15.
16.
In this paper, a new gradient-related algorithm for solving large-scale unconstrained optimization problems is proposed. The new algorithm is a kind of line search method. The basic idea is to choose a combination of the current gradient and some previous search directions as a new search direction and to find a step-size by using various inexact line searches. Using more information at the current iterative step may improve the performance of the algorithm. This motivates us to find some new gradient algorithms which may be more effective than standard conjugate gradient methods. Uniformly gradient-related conception is useful and it can be used to analyze global convergence of the new algorithm. The global convergence and linear convergence rate of the new algorithm are investigated under diverse weak conditions. Numerical experiments show that the new algorithm seems to converge more stably and is superior to other similar methods in many situations. 相似文献
17.
GLOBAL CONVERGENCE RESULTS OF A THREE TERM MEMORY GRADIENT METHOD WITH A NON-MONOTONE LINE SEARCH TECHNIQUE 总被引:4,自引:0,他引:4
孙清滢 《数学物理学报(B辑英文版)》2005,25(1):170-178
In this paper, a new class of three term memory gradient method with nonmonotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient. 相似文献
18.
We present a new parallel algorithm for time-periodic problems by combining the waveform relaxation method and the parareal algorithm, which performs the parallelism both in sub-systems and in time. In the new algorithm, the waveform relaxation propagator is chosen as a new fine propagator instead of the classical fine propagator. And because of the characteristic of time-periodic problems, the new parareal waveform relaxation algorithm needs to solve a periodic coarse problem at the coarse level in each iteration. The new algorithm is proved to converge linearly at most. Then the theoretic parallel efficiency of the new algorithm is also considered. Numerical experiments confirm our analysis finally. 相似文献
19.
This paper aims at determining the optimal locations for the leader’s new facilities under the condition that the number of the follower’s new facilities is unknown for the leader. The leader and the follower have some facilities in advance. The first competitor, the leader, opens p new facilities in order to increase her own market share. On the other hand, she knows that her competitor, the follower, will react to her action and locate his new facilities as well. The number of the follower’s new facilities is unknown for the leader but it is assumed that the leader knows the probability of opening different numbers of the follower’s new facilities. The leader aims at maximizing her own market share after the follower’s new facilities entry. The follower’s objective is also to maximize his own market share. Since the number of the follower’s new facilities is unknown for leader, “Robust Optimization” is used for maximizing the leader’s market share and making the obtained results “robust” in various scenarios in terms of different numbers of the follower’s new facilities. The optimal locations for new facilities of both the leader and the follower are chosen among pre-determined potential locations. It is assumed that the demand is inelastic. The customers probabilistically meet their demands from all different facilities and the demand level which is met by each facility is computed by Huff rule. The computational experiments have been applied to evaluate the efficiency of the proposed model. 相似文献
20.
A new technique of integral representations in Cn, which is different from the well-known Henkin technique, is given. By means of this new technique, a new integral formula for smooth functions and a new integral representation of solutions of the -equations on strictly pseudoconvex domains in Cn are obtained. These new formulas are simpler than the classical ones, especially the solutions of the -equations admit simple uniform estimates. Moreover, this new technique can be further applied to arbitrary bounded domains in Cn so that all corresponding formulas are simplified. 相似文献