拟线性热方程的函数分离变量解

用群状结构法研究拟线性热方程的分离变量解,对于允许和型分离变量解的二阶拟线性热方程给出了一个完整的分类.说明了一些带有函数类型反应项的方程具有函数分离变量解,推广了前人的结论.     

(2+1)维modified Zakharov-Kuznetsov方程的复合型新解

给出函数变换,变量分离形式解与第一种椭圆方程相结合的方法,构造了(2+1)维modified Zakharov-Kuznetsov(m ZK)方程的多种复合型新解.步骤一,给出两种函数变换,将(2+1)维m ZK方程转化为能够获得变量分离解的非线性发展方程.步骤二,给出非线性发展方程的变量分离形式解,通过第一种椭圆方程及其相关结论,构造了(2+1)维m ZK方程的双孤子解和双周期解等复合型新解.     

间接控制系统部分变元的绝对稳定性

ｉ）对变量分离型间接控制系统，本文给出其平凡解关于部分变元绝对稳定的充要条件。ｉｉ）对非变量分离型间接控制系统，给出其平凡解关于部分变元绝对稳定的充分条件。     

Tu方程族的高阶双约束流的分离变量

本文给出了Tu方程族的高阶双约束流,其自由度为2N＋l。根据通常的办法,利用Lax矩阵仅能引入N＋l对标准分离变量和N＋l个分离变量方程。本文构造出另外N对分离变量及N个分离变量方程。此外,还建立了双约束流和Tu方程族的Jacobi反演问题。     

间接控制系统部分变元对稳定性

ｉ）对变量分离型间接控制系统，本文给出其平凡解关于部分变元绝对稳定的充要条件。ｉｉ）对非变量分离型间接控制系统，给出其平凡解关于部分变元绝对稳定的充分条件。     

非线性反应扩散方程组的符号不变量和变量分离解

主要利用Galaktionov提出的符号不变量的方法来研究非线性反应扩散方程组的精确解,首先引入Hamilton-Jacobi算子作为方程组的符号不变量,通过对称约化找到方程组容许的超定方程组系统并对其求解,进而得到了允许符号不变量的方程组的具体形式、约束条件和其变量分离解,最后给出某些例子.     

一类二阶常微分方程初值问题的无穷多解性

应用分离变量法,得到了一类二阶微分方程初值问题存在无穷多个非负解的充分必要条件,并给出了所有的无穷多个非负解．。     

具任意次非线性项的Camassa-Holm方程的双孤子新解

给出辅助方程、函数变换与变量分离解相结合的方法,构造了具任意次非线性项的Camassa-Holm方程的双孤子和双周期新解.首先,通过两个辅助方程、函数变换与变量分离解,将具任意次非线性项的Camassa-Holm方程的求解问题转化为非线性代数方程的求解问题.然后,借助符号计算系统Mathematica求出该方程组的解,并用辅助方程的相关结论,构造了双周期解和双孤子新解.     

三类conformable型分数阶偏微分方程的精确解

对于conformable型分数阶的Airy方程和Telegraph方程,利用泛函分离变量法和广义分离变量法求解了它们的精确解.对于无黏的conformable型分数阶Burgers方程,利用广义分离变量法求解了它的精确解.事实证明,分离变量法是一种简洁直接的求解方法.此外,还借助Maple软件绘制了一些解的三维图像.     

非饱和土壤水一维水平运动方程的拟解析解及其验证

本文讨论了土壤一维不饱和水平流方程的解析解问题，文中首先根据土壤水扩散率Ｄ与土壤含水量θ之间的经验关系，对原土壤水一维不饱和流方程作变量代换，将方程变为易于求解的形式，然后采用变量分离的方法并结合Ｂｏｌｔｚｍａｎｎ变换法进行求解，从而得出了解析表达式。     

Long-step primal-dual target-following algorithms for linear programming

In this paper we propose a long-step target-following methodology for linear programming. This is a general framework, that enables us to analyze various long-step primal-dual algorithms in the literature in a short and uniform way. Among these are long-step central and weighted path-following methods and algorithms to compute a central point or a weighted center. Moreover, we use it to analyze a method with the property that starting from an initial noncentral point, generates iterates that simultaneously get closer to optimality and closer to centrality.This work is completed with the support of a research grant from SHELL.The first author is supported by the Dutch Organization for Scientific Research (NWO), grant 611-304-028.The fourth author is supported by the Swiss National Foundation for Scientific Research, grant 12-34002.92.     

Trefftz,collocation, and other boundary methods—A comparison

In this article we survey the Trefftz method (TM), the collocation method (CM), and the collocation Trefftz method (CTM). We also review the coupling techniques for the interzonal conditions, which include the indirect Trefftz method, the original Trefftz method, the penalty plus hybrid Trefftz method, and the direct Trefftz method. Other boundary methods are also briefly described. Key issues in these algorithms, including the error analysis, are addressed. New numerical results are reported. Comparisons among TMs and other numerical methods are made. It is concluded that the CTM is the simplest algorithm and provides the most accurate solution with the best numerical stability. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Volume preserving RK methods for linear systems

1. IntroductionIn recent yearss there has been a great interest in constructing numerical integrationschemes for ODEs in such a way that some qualitative geometrical properties of the solutionof the ODEs are exactly preserved. R.th[ll and Feng Kang[2'31 has proposed symplectic algorithms for Hamiltollian systems, and since then st ruct ure s- preserving me t ho ds fordynamical systems have been systematically developed[4--7]. The symplectic algorithms forHamiltonian systems, the volume-pre…     

求解离散不适定问题的正则化GMERR方法

迭代极小残差方法是求解大型线性方程组的常用方法, 通常用残差范数控制迭代过程.但对于不适定问题, 即使残差范数下降, 误差范数未必下降. 对大型离散不适定问题,组合广义最小误差(GMERR)方法和截断奇异值分解(TSVD)正则化方法, 并利用广义交叉校验准则(GCV)确定正则化参数,提出了求解大型不适定问题的正则化GMERR方法.数值结果表明, 正则化GMERR方法优于正则化GMRES方法.     

s个几乎相等的素数的k次方和(Ⅰ)

假定pθ‖k,当p=2,2|k时，γ=θ 2；其它情况时，γ=θ 1。而R＝П(p-1)|kp^γ。本文在GRH（广义Riemann假设下），证明了当s=2^k 1,1≤k≤11时，任何足够大的整N≡s(modR)都可以表示为s个几乎相等的素数的k次方程。     

A note on the biasing of Newton's direction

This note deals with the geometric interpretation of the Levenberg-Marquardt search direction when the augmented Hessian is not positive definite.     

投入产出技术在计划平衡中的理论与应用

在用投入产出技术作计划平衡时，目前一般采用最终产品法、总产品法及国民收入法等．本文从理论上研究了这些方法的可行性问题，并在此基础上提出一个较理想的综合法．最后附有实例并说明综合法的现实意义．     

Diagonalized multiplier methods and quasi-Newton methods for constrained optimization

Two approaches to quasi-Newton methods for constrained optimization problems inR ⁿ are presented. These approaches are based on a class of Lagrange multiplier approximation formulas used by the author in his previous work on Newton's method for constrained problems. The first approach is set in the framework of a diagonalized multiplier method. From this point of view, a new update rule for the Lagrange multipliers which depends on the particular quasi-Newton method employed is given. This update rule, in contrast to most other update rules, does not require exact minimization of the intermediate unconstrained problem. In fact, the optimal convergence rate is attained in the extreme case when only one step of a quasi-Newton method is taken on this intermediate problem. The second approach transforms the constrained optimization problem into an unconstrained problem of the same dimension.The author would like to thank J. Moré and M. J. D. Powell for comments related to the material in Section 13. He also thanks J. Nocedal for the computer results in Tables 1–3 and M. Wright for the results in Table 4, which were obtained via one of her general programs. Discussions with M. R. Hestenes and A. Miele regarding their contributions to this area were very helpful. Many individuals, including J. E. Dennis, made useful general comments at various stages of this paper. Finally, the author is particularly thankful to R. Byrd, M. Heath, and R. McCord for reading the paper in detail and suggesting many improvements.This work was supported by the Energy Research and Development Administration, Contract No. E-(40-1)-5046, and was performed in part while the author was visiting the Department of Operations Research, Stanford University, Stanford, California.     

A comparison of some ODE solvers which require Jacobian evaluations

A variety of third-order ODE solvers which have a minimum configuration (i.e. minimum work per step) have been numerically tested and the results compared. They include implicit and explicit processes, and share the property that a Jacobian matrix must be evaluated at least once during the integration. Some of these processes have not been previously described in the literature.     

On the Convergence of Descent Algorithms

It is proved that any cluster point of a sequence defined by a steepest descent algorithm in a general normed vector space is a critical point. The function is just assumed to be continuously differentiable. The class of algorithms we consider encompasses several choices such as the Cauchy steplength and the Curry steplength.