On the Newton polygons of twisted L-functions of binomials

Let χ be an order c multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and T-adic Newton polygons of f. When $p>(d-e)(2d-1)$, we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on $p\mathrm{mod}cd$.We conjecture that this condition holds if p is large enough with respect to $c,d$ by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for $e=d-1$.     

Recent Progress in the $L_p$ Theory for Elliptic and Parabolic Equations with Discontinuous Coefficients

In this paper, we review some results over the last 10-15 years on elliptic and parabolic equations with discontinuous coefficients. We begin with an approach given by N. V. Krylov to parabolic equations in the whole space with $\rm{VMO}_x$ coefficients. We then discuss some subsequent development including elliptic and parabolic equations with coefficients which are allowed to be merely measurable in one or two space directions, weighted $L_p$estimates with Muckenhoupt ($A_p$) weights, non-local elliptic and parabolic equations, as well as fully nonlinear elliptic and parabolic equations.     

Decay rate for viscoelastic wave equation of variable coefficients with delay and dynamic boundary conditions

In this paper, we consider a viscoelastic wave equation of variable coefficients in the presence of past history with nonlinear damping and delay in the internal feedback and dynamic boundary conditions. Under suitable assumptions, we establish an explicit and general decay rate result without imposing restrictive assumption on the behavior of the relaxation function at infinity by Riemannian geometry method and Lyapunov functional method.     

非线性互补问题的一种全局收敛的显式光滑Newton方法

本针对Po函数非线性互补问题，给出了一种显式光滑Newton方法，该方法将光滑参数μ进行显式迭代而不依赖于Newton方向的搜索过程，并在适当的假设条件下，证明了算法的全局收敛性。     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

二氧化钒薄膜的低温制备及其性能研究

针对VO₂薄膜在微测辐射热计上的应用，采用射频反应溅射法，在室温下制备氧化钒薄膜；研究了氧分压对薄膜沉积速率、电学性质及成分的影响.通过调节氧分压，先获得成分接近VO₂的非晶化薄膜，再在400℃空气中氧化退火，便可制得高电阻温度系数，低电阻率的VO₂薄膜，电阻温度系数约为-4%/℃，薄膜方块电阻为R_□为100—300kΩ；薄膜在室温下沉积，400℃下退火的制备方法与微机电加工(micro electromechanic 关键词： 二氧化钒 电阻温度系数 氧分压 射频反应溅射法     

Geometric visualization of the Brewster angle from dielectric-magnetic interface

A geometric visualization is presented for the Brewster angle for a plane wave reflecting from an interface. The surface is assumed to be isotropic but it is allowed to display both dielectric and magnetic susceptibility, and hence the Brewster (polarizing) angle can attain any value between 0 and 90^°, and can exist for both parallel and perpendicular polarizations. The geometric construction (a tetrahedron) is spanned by the basic material parameters of the surface. The Brewster angle appears in one of the faces of the tetrahedron.     

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.     

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.     

解奇异非光滑方程组的牛顿法和不精确牛顿法

本文主要解决奇异非光滑方程组的解法。应用一种新的次微分的外逆，我们提出了牛顿法和不精确牛顿法，它们的收敛性同时也得到了证明。这种方法能更容易在一引起实际应用中实现。这种方法可以看作是已存在的解非光滑方程组的方法的延伸。