巧证线面垂直的判定定理

线面垂直的判定定理，是立体几何中的重点与难点．教材利用镜面对称的方法，给出了该定理的一个几何证明．本文将从代数角度给出该定理的一个巧证．     

解整数线性规划中选择割平面的一个方法

本指出了[4]的一个错误。用最速下降规则，给出了选择割平面的一个新方法。一个复杂的例子说明，该方法有一定的实用价值。     

一维粘弹性波动方程弹性系数的识别方法

本文就一维粘弹性波动方程弹性系数的求解问题，给出了一个新的求解方法．通过对算法进行分析可知，该方法具有较小的计算量，并且具较好的数值稳定性．数值模拟表明了该方法的可行性及有效性．     

准-Groebner基的计算

本文通过定义S－多项式，给出了系数环是整环的多项式中理想的准－Groebner基的一个算法，并据此给出了计算该理想极大无关变元组和维数的一种方法。     

判定常微分方程组具有一维李对称群的新方法

给出了判定常微分方程组接受一维李对称群的一种新方法，利用该方法证明了无穷小生成元的一个性质，所给方法比传统方法形式简单。     

解线性约束优化问题的新锥模型信赖域3法

本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法．论文采用零空间技术消除了新锥模型子问题中的线性等式约束，用折线法求解转换后的子问题，并给出了解线性等式约束优化问题的信赖域方法．论文提出并证明了该方法的全局收敛性，并给出了该方法解线性等式约束优化问题的数值实验．理论和数值实验结果表明新锥模型信赖域方法是有效的，这给出了用新锥模型进一步研究非线性优化的基础．     

关于DHMM转化为齐次马尔可夫链的一个定理及其证明

本给出一个将DHMM转化为齐次马尔可夫链的定理，该定理提供了利用在理论上比较完善的齐次马尔可夫链来研究DHMM的一个方法．     

固体燃料抗拉强度的可靠性评估

抗拉强度是固体燃料的重要力学性能指标，该指标的退化是导致固体燃料失效的一个重要的故障模式．本文利用相应的贮存试验数据给出模型参数的估计，运用信仰推断方法(fiducial)和二阶正态逼近方法(WCF)给出可靠度置信下限，并对这两种方法进行了模拟比较。     

Ramsey数N（3，3，3；2）＝17的一种证法

本文给出了Ｒａｍｓｅｙ数Ｎ（３，３，３；２）＝１７的一种证明方法。尽管这一结果已早为人知，但在国内的许多有关书籍中很难找出该结论的证明方法，为此笔者给出了一个完整的证法以供参考。     

C~2有限元与插值（I）

本文首先在ＣＴ细分三角形剖分上，建立起六次二阶光滑样条函数空间的维数结论。利用我们的构造性证明方法，给出了该空间中的一个Ｃ￣２有限元插值格式，并给出有限元的计算方法。     

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

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.     

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次方程。     

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

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

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.