代数数的有理逼近及其在求解丢番图方程中的应用

在本文中,我们利用Ｔｈｕｅ－Ｓｉｅｐｅｌ方法研究一类代数数的有理逼近,证明了对此代数数的有效有一逼近,最后我们利用此结果研究了ｄｉｏｐｈａｎｔｉｎｅ方程。ａｘ＾２－ｂｙ＾４＝－１得出关于此方程完整的结论。     

P—adic超越连分数

本文借助于Ｔｈｕｅ－Ｓｉｅｇｅｌ－Ｒｏｔｈ定理的Ｐ－ａｄｉｃ类似，Ｐ－ａｄｉｃ代数数的有理逼近定理以及Ｐ－ａｄｉｃ简单连分数的一些性质给出了Ｐ－ａｄｉｃ数是超越数的两个充分条件。     

Navier—Stokes方程稳定性研究（Ⅱ）

本对Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程与热传导方程的性质进行了比较。法国数学家、偏微分方程权威Ｊ．Ｌｅｒａｙ教授在其对Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程的研究中，曾由热传导方程出发而求得Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程某种初（边）值问题的适定性结果。巴黎十一大学的Ｒ．Ｔｅｍａｍ等专家、教授也曾多次提出过将两类方程类比的疑问。本试将其中根本不同点做了叙述和例证。     

Navier－Stokes方程稳定性研究（Ⅱ）

本文对Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程与热传导方程的性质进行了比较。法国数学家、偏微分方程权威Ｊ．Ｌｅｒａｙ教授在其对Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程的研究中，曾由热传导方程出发而求得Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程某种初（边）值问题的适定性结果￣［２］．巴黎十一大学的Ｒ．Ｔｅｍａｍ等专家、教授也曾多次提出过将两类方程类比的疑问。本文试将其中根本不同点做了叙述和例证。     

在GTM循环质量链的振动中谱的递增性

将广义Ｔｈｕｅ－Ｍｏｒｓｅ列引入等强度弹簧连结起来的质量链的振动问题，证明了该振动模型对应的线性算子的谱　具有递增性。     

一类非线性波动方程的显式精确解

本文用直接方法和假设的一种结合求出了一类较广泛的非线性波动方程ｕｔｔ－ａ１ｕｘｘ＋ａ２ｕｔ＋ａ３ｕ＋ａ４ｕＳ＾２＋ａ５ｕ＾３＝０的一些显式精确行波解,贱个有重要的非线性数学物理方程,如φ＾４方程,Ｋｌｅｉｎ－Ｇｏｒｄｏｎ方程,Ｓｉｎｅ－Ｇｏｒｄｏｎ方程,及Ｓｉｎｈ－Ｇｏｒｄｏｎ方程的近似,Ｌａｎｄａｕ－Ｇｉｎｚｂｕｒｇ－Ｈｉｇｇｓ方程,Ｄｕｆｆｉｎｇ方程,非线性电报方程等都可作为该方程的特殊情形得     

三维超音进气道内外流场的数值模拟

用区域分裂有限体积法求解了三维Ｅｕｌｅｒ方程和Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程。空间方向采用Ｒｏｅ平均算法，时间方向采用Ｒｕｎｇｅ－Ｋｕｔｔａ方法。对某飞航导弹的全弹身－进气道流场和某型号战斗机进气道内外流场进行了计算，得出了满意的结果。     

一类反应扩散方程的分歧分析

文章讨论了一类反应扩散方程的分歧（分岔）现象。运用所谓基于Ｌ－Ｓ（李雅普诺夫－施密特）约化的奇异理论方法,得到了满意的结果。     

粘流—无粘干扰流动理论变分问题迭代序列的收敛性和算子方程…

本文证明了粘流－无粘干扰流动理论基本控制方程－简化的Ｎａｖｉｅｒ－Ｓｔｏｋｅｓ方程变分问题几种迭代序列的收敛性，并探讨了其算子方程的性质。本文的结论对于简化Ｎ－Ｓ方程的数值计算具有指导意义。     

一般非线性发展方程解的长时间行为

本文研究了一般形式的非线性发展方程Ｃａｕｃｈｙ问题的解关于时间的渐近性质．其结果覆盖并部分推广了导数非线性Ｓｃｈｒｏｄｉｎｇｅｒ方程，Ｋｏｒｔｅｗｅｇ－ｄｅＶｒｉｅｓ方程和Ｂｅｎｊａｍｉｎ－Ｏｎｏ等方程的有关结果．     

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方法.     

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.     

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

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

Stabilization of algebraic multilevel iteration methods; additive methods

There exist two main versions of preconditioners of algebraic multilevel type, the additive and the multiplicative methods. They correspond to preconditioners in block diagonal and block matrix factorized form, respectively. Both can be defined and analysed as recursive two-by-two block methods. Although the analytical framework for such methods is simple, for many finite element approximations it still permits the derivation of the strongest results, such as optimal, or nearly optimal, rate of convergence and optimal, or nearly optimal order of computational complexity, when proper recursive global orderings of node points have been used or when they are applied for hierarchical basis function finite element methods for elliptic self-adjoint equations and stabilized in a certain way. This holds for general elliptic problems of second order, independent of the regularity of the problem, including independence of discontinuities of coefficients between elements and of anisotropy. Important ingredients in the methods are a proper balance of the size of the coarse mesh to the finest mesh and a proper solver on the coarse mesh. This paper presents in a survey form the basic results of such methods and considers in particular additive methods. This method has excellent parallelization properties. This revised version was published online in June 2006 with corrections to the Cover Date.     

The Tikhonov regularization method in elastoplasticity

The numerical simulation of the mechanical behavior of industrial materials is widely used for viability verification, improvement and optimization of designs. Elastoplastic models have been used to forecast the mechanical behavior of different materials. The numerical solution of most elastoplastic models comes across problems of ill-condition matrices. A complete representation of the nonlinear behavior of such structures involves the nonlinear equilibrium path of the body and handling of singular (limit) points and/or bifurcation points. Several techniques to solve numerical problems associated to these points have been disposed in the specialized literature. Two examples are the load-controlled Newton–Raphson method and displacement controlled techniques. However, most of these methods fail due to convergence problems (ill-conditioning) in the neighborhood of limit points, specially when the structure presents snap-through or snap-back equilibrium paths. This study presents the main ideas and formalities of the Tikhonov regularization method and shows how this method can be used in the analysis of dynamic elastoplasticity problems. The study presents a rigorous mathematical demonstration of existence and uniqueness of the solution of well-posed dynamic elastoplasticity problems. The numerical solution of dynamic elastoplasticity problems using Tikhonov regularization is presented in this paper. The Galerkin method is used in this formulation. Effectiveness of Tikhonov’s approach in the regularization of the solution of elastoplasticity problems is demonstrated by means of some simple numerical examples.     

一种求解鞍点问题的广义对称超松弛迭代法

本文研究了鞍点问题的迭代算法.利用新的待定参数加速迭代格式并结合SSOR分裂的方法,获得了有两个参数的广义对称超松弛迭代法及其收敛性条件.数值例子表明选择适当的参数值可以提高算法的收敛效率,推广和改进了SOR-like迭代法.     

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.