共查询到18条相似文献,搜索用时 551 毫秒
1.
对于一般情形,给出焦点量和鞍点量计算与约化的Maple算法,从而统一了焦点量和鞍点量的计算,并给出细焦点与细鞍点的变换,利用变换推导了焦点量和鞍点量的关系. 相似文献
2.
对于一般情形,给出焦点量和鞍点量计算与约化的Maple算法,从而统一了焦点量和鞍点量的计算,并给出细焦点与细鞍点的变换,利用变换推导了焦点量和鞍点量的关系. 相似文献
3.
4.
作者曾给出时间可逆微分系统代数条件推导的算法,并给出了一类时间可逆三次微分系统的系数条件,但其中含有一个实参数.为了消去这个参数,这里使用具有投影性质的三角序列和标准基等消元手段,得到了不含参数的完整代数条件. 相似文献
5.
6.
7.
8.
9.
《数学的实践与认识》2015,(9)
以可逆加法器设计为例,论述如何利用RevKit进行可逆电路研究.首先概述RevKit的软件构架、核心功能以及所支持的输入文件格式;其次分别用Python命令行形式和图形界面形式,以及基于二元判决图(Binary Decision Diagram,BDD)方法和基于真值表转换方法进行可逆加法器设计;最后给出两种方法所生成电路的性能比对.实验验证,RevKit作为开源工具,集成了现有可逆电路综合、优化及验证方法,有利于提高可逆电路的设计效能. 相似文献
10.
11.
12.
We propose a time domain decomposition method that breaks the sequentiality of the integration scheme for systems of ODE. Under the condition of differentiability of the flow, we transform the initial value problem into a well-posed boundary values problem using the symmetrization of the interval of time integration and time-reversible integration scheme. For systems of linear ODE, we explicitly construct the block tridiagonal system satisfied by the solutions at the time sub-intervals extremities. We then propose an iterative algorithm of Schwarz type for updating the interfaces conditions which can extend the method to systems of nonlinear ODE. 相似文献
13.
1IntroductiollInthispapersweconsiderthenumberofthelimitcycleforthefollowingcubicpolynomialdifferentialsystemwiththeEdstyleFOrthepurposeofanalysingthenumberoflimitcycles,itisnecessarytocalculatethefocalquantities.FOrsystem(1))weperformfirstthefollowinghomeomorphictransformationThen,system(l)iscarriedintothefollowingsystemwhereIn[1],usingPoincaremethodandWuelimination,wedesignaspecialal-gorithmtocomputingthefocalvaluesforplanardynamicsystems.Byouralgorithm,weobtainthefollowingformularofcalcul… 相似文献
14.
We investigated an interpolation algorithm for computing outer inverses of a given polynomial matrix, based on the Leverrier–Faddeev method. This algorithm is a continuation of the finite algorithm for computing generalized inverses of a given polynomial matrix, introduced in [11]. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Based on similar idea, we introduced methods for computing rank and index of polynomial matrix. All algorithms are implemented in the symbolic programming language MATHEMATICA , and tested on several different classes of test examples. 相似文献
15.
A novel method of computing the nonlinear differential equations relating to the transient behaviour of an induction motor using a polynomial series, is presented. The stator and rotor currents and the angle of rotation are expressed as polynomial series dependent on time. These are then substituted into the differential equations of the induction motor to compute the polynomial coefficients and, consequently, the transient quantities. Since the equations are nonlinear, the computations are carried out using the step-by-step method. The stator and rotor currents, speed and torque are calculated for acceleration and braking conditions. The results are compared both analytically and experimentally. 相似文献
16.
For symmetric tensors,computing generalized eigenvalues is equivalent to a homogenous polynomial optimization over the unit sphere.In this paper,we present an adaptive trustregion method for generalized eigenvalues of symmetric tensors.One of the features is that the trust-region radius is automatically updated by the adaptive technique to improve the algorithm performance.The other one is that a projection scheme is used to ensure the feasibility of all iteratives.Global convergence and local quadratic convergence of our algorithm are established,respectively.The preliminary numerical results show the efficiency of the proposed algorithm. 相似文献
17.
Xingwu Chen Wentao Huang Valery G. Romanovski Weinian Zhang 《Journal of Mathematical Analysis and Applications》2011,383(1):179-189
In this paper we study the linearizability problem of polynomial-like complex differential systems. We give a reduction of linearizability problem of such non-polynomial systems to the problem of polynomial systems. Applying this reduction, we find some linearizability conditions for a time-reversible quartic-like complex system and derive from them conditions of isochronous center for the corresponding real system. 相似文献
18.
通过捕获所谓的严格临界点, 本文提出了一个计算实多项式函数的全局下确界和全局最小值的有效方法. 对于实数域R 上一个n 元多项式f, 该方法可用来判定f 在Rn 上是否具有有限的全局下确界. 在f 具有有限的全局下确界的情况下, f 的下确界可严格地表示为码(h; a, b), 其中h 是一个实单元多项式, a 和b 是使得a < b 的两个有理数, 而(h; a, b) 代表h(z) 在开区间]a, b[ 中仅有的实根.此外, 当f 具有有限下确界时, 本文的方法可进一步判定f 的下确界能否达到. 在我们的算法设计中,著名的吴方法起着重要作用. 相似文献