求解混沌映射不变分布的符号计算法

根据Frobenius-Perron方程,可以对混沌映射的不变分布从理论上加以分析,从而对混沌映射不变分布作出大致的估计.由此可以利用符号计算的方法求解得到迭代函数系统不变分布的密度近似函数,从而逼近理论解.用几个计算实例和常见数值解法作了比较,试验结果表明符号计算方法具有一定的优势.     

关于吴方法在双层规划中的一个应用

双层规划及多层规划这一数学规划研究中的较新领域因其坚实的经济背景及丰富的数学内涵在二十年来的发展过程中变得越来越吸引人们的关注. 在通常解双层规划问题时往往采用数值计算的方法, 得到的解并不一定是全局最优解. 该文介绍了一个全新的解双层规划问题的方法,它与数值计算法不同, 采用的是符号计算, 依据了计算机代数与代数几何的理论. 作者通过对文献[1]中的几个双层规划问题的上机计算, 得出了与之不同的全面彻底的解答, 在比较过程中, 发现不仅所得的结果要比文献[1]中答案更进一步, 而且也证明了文章的新方法在解这一类问题时,是简明和行之有效的.     

通过纯有理运算确定矩阵的Jordan块结构

本文讨论如何通过有限步有理运算求得给定矩阵的Jordan块结构(JBS),因为有理运算可以通过符号计算精确实现.与此对照,迄今为止用数值计算求矩阵的JBS与理论结果相距甚远.证明是构造性的,分两大部分:1)确定矩阵A的不变因子,2)根据A的不变因子确定初等因子结构.为求得A的不变因子,我们提出一种新的Las Vegas算法.它是一种概率型算法,这种算法允许失败,但是当且仅当求得正确答案时才停止运算;     

SDPTools:基于Maple的高精度求解SDP软件包

半定规划(SDP)是一类重要的凸优化问题,它可以由Matlab中的SDP软件包有效地求解,比如SeDuMi,SDPT3,DSDP等等.然而由于Matlab只能进行有限精度计算,所得结果往往带有很大误差.在某些需要高精度计算的问题中,Matlab中的SDP软件包难以得到满意的结果.SDPTools是基于符号计算软件Maple的求解SDP的软件包.利用Maple可以进行任意精度计算的特性,SDPTools可以进行高精度的求解.将SDPTools应用于有理函数全局最优值的求解和验证问题中,对于Rump's Model Problem得到了目前最好的数值结果.     

线性规划问题的符号计算

应用各种符号计算系统可以很方便地求解各种线性代数问题,利用初等变换即可得到问题的精确解而不必预先编写程序,本文通过例子,根据单纯形算法原理,详细介绍了使用muMATH系统直接求解线性规划问题精确解的运算方法,人工变量所对应的列向量始终不参加运算,从而可大量节省存储量和计算量。     

求解交替迭代正则化方程的多尺度配置法

<正>1引言第一类Fredholm积分方程应用于科学与工程领域,用来塑造某些具体问题的数学模型.例如,图像处理,信号识别,遥感技术等.因为病态积分方程的数值计算对舍入误差特别敏感,直接求得的数值解往往与精确解相差甚远.想要得到近似效果好且稳定的数值解,需要采用正则化方法.理论上,正则化方法已经很成熟了,有Richardson迭代正则化方法~([10,11]),交替迭代正则化方法~([10,11]),Tikhonov正则化方法~([1,4,6])和迭代Lavrentiev正则化方法~([12])等.常见的停止准则有偏差原理~([11,14]),平衡原理~([15]),Lepskii原则~([13])等.但是,求解病态积分方程的数值计算方法还有很多问题有待研究,如快速计算方法.     

m个对角元有正增量的对称正定方程组的解

1　引　　言某些问题的数值求解要作迭代计算 ,每次迭代需求解一个系数矩阵仅有少量变化的线性方程组 .如何减少求解该方程组的计算量 ,便成为提高总体计算效率的关键之一 .这类问题往往在一些优化问题的求解过程中遇到[1] ,因此值得研究 .为此考虑如下的问题Ⅰ .问题Ⅰ　设某问题的数值求解过程要作迭代计算 ,每次迭代需求解一个线性方程组(Ａ+Ｄ)Ｘ =ｂ ( 1 .1 )其中Ａ为ｎ阶对称正定矩阵 ,ｂ为已知向量 ,Ｄ =ｄｉａｇ(ｄ1,ｄ2 ,… ,ｄｎ) ,( 1 .2 )且Ｄ的对角元ｄｉｋ>0 ,ｋ =1 ,2 ,… ,ｍ ,1≤ｉ1<ｉ2 <… <ｉｍ ≤ｎ ,ｄｉｋ及其位置和…     

二维广义Burgers方程大时间问题的谱逼近

1．引言近几年来，随着无穷维动力系统理论的发展，非线性发展方程大时间问题的数值计算越来越引起人们的重视，例如人们对混沌和分歧等问题的研究在很大程度上依赖于数值计算的结果．对于这类问题的数值计算，则需要建立t→∞时的大范围的计算方法和误差估计．因此，数值计算是否可靠、有效，计算格式是否选得合适等都是值得研究的问题．我们知道，在以往有限时间段上得到的近似解的误差估计都与时间段的长度有关，一般可写成Ch”eT，其中C为与精确解有关的常数，h为离散化参数，T为所考虑的时间段的长度．若将它应用到大时间问题的估计…     

具有输入饱和因子的滞后关联大系统的分散控制

研究了一类具有饱和因子的滞后关联大系统的分散控制问题.首先对饱和因子进行了巧妙地处理,再通过构造Lyapunov泛函,利用(LMI)方法给出了分散控制状态反馈控制器的设计方法.控制器通过解线性矩阵不等式即可得到,计算简便.最后,数值例子和仿真说明了该设计方法的有效性.     

二阶和四阶椭圆型偏微分方程的镜像基本解方法及应用

将基本解方法推广到二阶和四阶椭圆型偏微分方程的对称问题,在边界上不需要处理奇异积分.通过坐标变换,将一般二阶和四阶椭圆型偏微分方程化为目前研究较为成熟的调和或双调和方程.再根据镜像法构造出适合对称条件的基本解函数,简化了计算,且不影响计算的精度.通过数值计算结果可以看出,利用镜像技术构造出的基本解,前期准备数据少,可保持精度,是一种有效的数值方法.     

Computing solutions to algebraic problems using a symbolic versus a schematic strategy

To improve access to algebraic word problems, primary aged students in Singapore are taught to utilise schematic models. Symbolic algebra is not taught until the secondary school years. To examine whether the two methods drew on different cognitive processes and imposed different cognitive demands, we used functional magnetic resonance imaging to examine patterns of brain activation whilst problem solvers were using the two methods. To improve our ability to detect differences attributable to the two methods, rather than participant’s abilities to use the two methods, we used adult problem solvers who had high levels of competency in both methods. In a previous study, we focused on the initial stages of problem solving: translating word problems into either schematic or symbolic representations (Lee et al. in Brain Res 1155:163–171, 2007). In this study, we focused on the later stages of problem solving: in computing numeric solutions from presented schematic or symbolic representations. Participants were asked to solve simple algebraic questions presented in either format. Greater activation in the symbolic method was found in the middle and medial frontal gyri, anterior cingulate, caudate, precuneus, and intraparietal sulcus. Greater activation in the model condition was found largely in the occipital areas. These findings suggest that generating and computing solutions from symbolic representations require greater general cognitive and numeric processing resources than do processes involving model representations. Differences between the two methods appear to be of both a quantitative and qualitative nature.     

PLK方法与符号运算

阐述将PLK方法与符号运算相结合的途径和有效性.首先简述PLK方法的思路和发展简史:其次,概述运行符号运算时经常遇到的“中间表达式爆炸”困难,为克服这一困难,作者提出一种半逆序算法:通过以符号形式“冻结”中间表达式中冗长的部分,到最后阶段再予“解冻”;并且通过综述作者在一系列非线性波动和非线性振动方面的工作,讨论PLK-符号运算方法的具体应用,其中,Duffing方程的摄动解的计算机延伸表明,用PLK方法导得的渐近级数解的收敛半径为1,从而大大拓广了解的适用范围;分层流体中内孤立波和超弹性杆中孤立波对撞的研究表明,用所提出的方法可以进行手工计算难以进行的复杂运算,借此可得出高阶演化方程和高阶渐近解,正确地解释实验结果;并说明采用半逆序算法后,可在微机上实现繁复的符号运算.最后得出结论:借助于符号运算,可大大增强PLK方法的生命力,至少对保守系统的振动和波动问题的求解,它是一个非常有效的工具.     

A hybrid approach for the integration of a rational function

A hybrid integration algorithm obtaining an indefinite integral of a rational function (say q/r, q and r are polynomials) with floating-point but real coefficients is proposed. The algorithm consists of four steps and is based on combinations of symbolic and numeric computations (hybrid computation). The first step is a hybrid preprocessing stage. An integrand is decomposed into rational and logarithmic parts by using an approximate Horowitz' method which allows floating-point coefficients. Here, we replace the Euclidean GCD algorithm with an approximate-GCD algorithm which was proposed by Sasaki and Noda recently. It is easy to integrate the rational part. The logarithmic part is integrated numerically in the second step. Zeros of a denominator of it are computed by the numerical Durand-Kerner method which computes all zeros of a polynomial equation simultaneously. The integrand is then decomposed into partial fractions in the third step. Coefficients of partial fractions are determined by residue theory. Finally, in the fourth step, partial fractions are transformed into the resulting indefinite integral by using well-known rules of integrals. The hybrid algorithm proposed here gives both indefinite integrals and accurate values of definite integrals. Numerical errors in the hybrid algorithm depend only on errors in the second step. The algorithm evaluates some problems where numerical methods are inefficient or incapable, or a pure symbolic method is theoretically insufficient.     

Extending the generalized tanh method to the generalized Hamiltonian equations: New soliton-like solutions

To certain nonlinear evolution equations, the tanh method has been generalized for constructing not only solitary-wave but also soliton-like solutions. In this paper, no loss of conciseness, we further extend the generalized tanh method with computerized symbolic computation to a pair of generalized Hamiltonian equations. A new family of soliton-like analytical solutions is obtained, of which the solitary waves and previously-claimed soliton-like solutions are shown to be the special cases.     

New exact solutions to some variable coefficients problems

With the aid of computer symbolic computation system such as Maple, an extended tanh method is applied to determine the exact solutions for some nonlinear problems with variable coefficients. Several new soliton solutions and periodic solutions can be obtained if we taking paraments properly in these solutions. The employed methods are straightforward and concise, and it can also be applied to other nonlinear evolution equations in mathematical physics.     

计算机代数应用中的一个半逆序算法*

为了克服计算机代数应用中出现的"中间表达式爆炸"的困难,本文提出一种半逆序算法,将中间表达式在运算过程中以符号形式冻结起来,到求解的最后阶段予以解冻,从而避免了因存贮空间不足而导致的溢出.文中简述了该算法在非线性振动、冷却塔动力优化和非线性水波问题中的应用,证实了算法的有效性.     

Investigating Algebraic and Logical Algorithms to Solve Hopf Bifurcation Problems in Algebraic Biology

Symbolic methods to investigate Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. However, the symbolic investigations have not been fully algorithmic but required a sequence of symbolic computations intervened with ad hoc insights and decisions made by a human. In this paper we discuss the use of algebraic and logical methods to reduce questions on the existence of Hopf bifurcations in parameterized polynomial vector fields to quantifier elimination problems over the reals combined with the use of the quantifier elimination over the reals and simplification techniques available in REDLOG. We can reconstruct most of the results given in the literature within a few seconds of computation time and extend the investigations on these systems to previously not analyzed related systems. Especially we discuss cases in which one suspects that no Hopf bifurcation fixed point exists for biologically relevant values of parameters and system variables. Here we focus on logical and algebraic techniques of finding subconditions being inconsistent with the hypothesis of the existence of Hopf bifurcation fixed points.      

一类变系数KdV方程的Painlevé分析和自Bcklund变换

利用符号计算对一类系数函数是x和t的函数的变系数K dV方程进行了Pa in levé分析,得到了该方程具有Pa in levé性质时系数函数必须满足的约束条件.利用Pa in levé截断法给出了该方程的一个自B ck lund变换,作为例子根据得到的自B ck lund变换给出了两组精确解.     

Lump solutions to the generalized (2+1)-dimensional B-type Kadomtsev-Petviashvili equation

Through symbolic computation with Maple, the (2+1)-dimensional B-type Kadomtsev-Petviashvili(BKP) equation is considered. The generalized bilinear form not the Hirota bilinear method is the starting point in the computation process in this paper. The resulting lump solutions contain six free parameters, four of which satisfy two determinant conditions to guarantee the analyticity and rational localization of the solutions, while the others are arbitrary. Finally, the dynamic properties of these solutions are shown in figures by choosing the values of the parameters.