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.     

The Hahn–Banach Theorem for Partially Ordered Totally Convex, Positively Convex and Superconvex Modules

The Hahn–Banach Theorem for partially ordered totally convex modules [3] and a necessary and sufficient condition for the existence of an extension of a morphism from a submodule C ₀ of a partially ordered totally convex module C (with the ordered unit ball of the reals as codomain) to C, are proved. Moreover, the categories of partially ordered positively convex and superconvex modules are introduced and for both categories the Hahn–Banach Theorem is proved.     

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.     

Regularization of Discrete Ill-Posed Problems

The paper concerns conditioning aspects of finite-dimensional problems arising when the Tikhonov regularization is applied to discrete ill-posed problems. A relation between the regularization parameter and the sensitivity of the regularized solution is investigated. The main conclusion is that the condition number can be decreased only to the square root of that for the nonregularized problem. The convergence of solutions of regularized discrete problems to the exact generalized solution is analyzed just in the case when the regularization corresponds to the minimal condition number. The convergence theorem is proved under the assumption of the suitable relation between the discretization level and the data error. As an example the method of truncated singular value decomposition with regularization is considered. This revised version was published online in July 2006 with corrections to the Cover Date.     

Generating cryptographically strong Boolean functions using partial information

Periodica Mathematica Hungarica - In our paper we study the usage of partially defined Boolean functions (PDBFs) for generating cryptographically strong Boolean functions. A PDBF can be considered...     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

The π-π-theorem for manifold pairs with boundaries

The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L _*(π ₁(Y) → π ₁(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π ₁(X) ? π ₁(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP _* for manifold pairs and splitting obstruction groups LS _*. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.     

无K1,r图中的哈密顿圈（英文）

本文借助对图的本质独立集和图的部分平方图的独立集的研究，对于K1,r图中哈密顿圈的存在性给出了八个充分条件。我们将利用T－插点技术对这八个充分条件给出统一的证明，本文的结果从本质上改进了C－Q.Zhang于1988年利用次形条件给出的k-连通无爪图是哈密顿图的次型充分条件，同时。G.Chen和R.H.Schelp在1995年利用次型条件给出的关于k-连通无K1，4图是哈密顿图的充分条件也被我们的结果改进并推广到无K1,r图。     

Theory and experiment of spatially and temporally partially coherent speckle shearing interferometry

The theory and experiment of spatially and temporally partially coherent speckle shearing interferometry is reported in this rapid communication for the first time. The general requirements for the surface roughness and coherence area of a diffuse object surface in spatially and temporally partially coherent speckle shearing interferometry are discussed. An experimental verification is presented and the results of theory and experiment are in good agreement.     

用于曲面精密检测的新型光纤三角传感器研究

基于光纤传感技术和三角测量方法，提出了一种用于曲面检测的新型光纤三角传感器。根据所设计的轮辐式接收光纤结构，可以在测量曲面与传感头间位移时，首先获取被测点处微面元的倾斜信息，以便对传感器测量值进行实时误差修正，从而解决了被测表面倾斜对坐标测量带来的影响。该传感器还能有效地消除环境光干扰、光源波动、表面反射率变化等对测量带来的影响。建立了传感器测量的数学模型。理论分析和初步的实验结果证明了系统的有效性和实用性。该传感器系统不稳定性好于0.3%，横向分辨率好于8μm，高度分辨率好于0.1μm。