Multilevel preconditioners for a quadrature Galerkin solution of a biharmonic problem

Efficient multilevel preconditioners are developed and analyzed for the quadrature finite element Galerkin approximation of the biharmonic Dirichlet problem. The quadrature scheme is formulated using the Bogner–Fox–Schmit rectangular element and the product two‐point Gaussian quadrature. The proposed additive and multiplicative preconditioners are uniformly spectrally equivalent to the operator of the quadrature scheme. The preconditioners are implemented by optimal algorithms, and they are used to accelerate convergence of the preconditioned conjugate gradient method. Numerical results are presented demonstrating efficiency of the preconditioners. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Adaptive Algorithm for Constrained Least-Squares Problems

This paper is concerned with the implementation and testing of an algorithm for solving constrained least-squares problems. The algorithm is an adaptation to the least-squares case of sequential quadratic programming (SQP) trust-region methods for solving general constrained optimization problems. At each iteration, our local quadratic subproblem includes the use of the Gauss–Newton approximation but also encompasses a structured secant approximation along with tests of when to use this approximation. This method has been tested on a selection of standard problems. The results indicate that, for least-squares problems, the approach taken here is a viable alternative to standard general optimization methods such as the Byrd–Omojokun trust-region method and the Powell damped BFGS line search method.     

Global Phase Time and Wave Function for the Kantowski-Sachs Anisotropic Universe

A consistent quantization with a clear notion of time and evolution is given for the anisotropic Kantowski–Sachs cosmological model. It is shown that a suitable coordinate choice allows to obtain a solution of the Wheeler–DeWitt equation in the form of definite energy states, and that the results can be associated to two disjoint equivalent theories, one for each sheet of the constraint surface.     

拆边法求最短路径

本文利用局部比较法 ,在图中定义子图、无效路径、以及可去边 .利用推导的有关定理 ,拆去可去边 ,利用最短路径相同的等价性 ,达到化简图 ,从而求出最短路径     

最速下降规则不失为一可用规则

本从统计意义上平均迭代次数的观点出发，指出求解线性规划的最速下降规则是可取的，好用的。     

关于AOR迭代法的研究

本文论证了严格对角占优矩阵之AOR法的误差估计式中的误差估计常数hγ,ω（0≤γ≤ω0）的最小值是h1,1.     

Field Theory Methods in Classical Dynamics

A Dirac picture perturbation theory is developed for the time evolution operator in classical dynamics in the spirit of the Schwinger–Feynman–Dyson perturbation expansion and detailed rules are derived for computations. Complexification formalisms are given for the time evolution operator suitable for phase space analyses, and then extended to a two-dimensional setting for a study of the geometrical Berry phase as an example. Finally a direct integration of Hamilton's equations is shown to lead naturally to a path integral expression, as a resolution of the identity, as applied to arbitrary functions of generalized coordinates and momenta.     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。     

Truncated Newton method for sparse unconstrained optimization using automatic differentiation

When solving large complex optimization problems, the user is faced with three major problems. These are (i) the cost in human time in obtaining accurate expressions for the derivatives involved; (ii) the need to store second derivative information; and (iii), of lessening importance, the time taken to solve the problem on the computer. For many problems, a significant part of the latter can be attributed to solving Newton-like equations. In the algorithm described, the equations are solved using a conjugate direction method that only needs the Hessian at the current point when it is multiplied by a trial vector. In this paper, we present a method that finds this product using automatic differentiation while only requiring vector storage. The method takes advantage of any sparsity in the Hessian matrix and computes exact derivatives. It avoids the complexity of symbolic differentiation, the inaccuracy of numerical differentiation, the labor of finding analytic derivatives, and the need for matrix store. When far from a minimum, an accurate solution to the Newton equations is not justified, so an approximate solution is obtained by using a version of Dembo and Steihaug's truncated Newton algorithm (Ref. 1).This paper was presented at the SIAM National Meeting, Boston, Massachusetts, 1986.     

甲基紫掺杂聚乙烯醇薄膜材料红光多重全息存储

甲基紫掺杂聚乙烯醇薄膜材料在两束相干光照射下生成相位光栅.当改变一束相干光光程,通过监测相位光栅的一级衍射信号强度的变化,可以检测相位光栅的生长和擦除过程.在此实验基础上,讨论了甲基紫掺杂聚乙烯醇薄膜材料多重全息存储的原理与结果.