有关不能全含于半球中的一些曲面的性质讨论

本文主要研究了不能全含于开半球中的一些特殊曲面.利用Lr算子的相关性质,证明了对S~(n+1)中紧致r-极小超曲面,如果第二基本形式的秩rank(h_(ij))r,则其不全含在S~(n+1)的一个开半球中.     

一类具有年龄和病程的SEIR传染病模型无病平衡解分析

研究一类具有年龄和病程的SEIR传染病模型.利用特征线方法、Lebesgue控制收敛定理对无病平衡解的渐近性进行了分析,证明了当R1时无病平衡解是全局渐近吸引的.     

Concentration on minimal submanifolds for a Yamabe-type problem

We construct solutions to a Yamabe-type problem on a Riemannian manifold M without boundary and of dimension greater than 2, with nonlinearity close to higher critical Sobolev exponents. These solutions concentrate their mass around a nondegenerate minimal submanifold of M, provided a certain geometric condition involving the sectional curvatures is satisfied. A connection with the solution of a class of PDE's on the submanifold with a singular term of attractive or repulsive type is established.     

Asynchronous cellular automata and pattern classification

This article designs an efficient two‐class pattern classifier utilizing asynchronous cellular automata (ACAs). The two‐state three‐neighborhood one‐dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern classification. To design the classifier, (1) we first identify a set of ACAs that always converge to fixed points from any seeds, (2) each ACA should have at least two but not huge number of fixed point attractors, and (3) the convergence time of these ACAs are not to be exponential. To address the second issue, we propose a graph, coined as fixed point graph of an ACA that facilitates in counting the fixed points. We further perform an experimental study to estimate the convergence time of ACAs, and find there are some convergent ACAs which demand exponential convergence time. Finally, we identify there are 73 (out of 256) ACAs which can be effective candidates as pattern classifier. We use each of the candidate ACAs on some standard datasets, and observe the effectiveness of each ACAs as pattern classifier. It is observed that the proposed classifier is very competitive and performs reliably better than many standard existing classifier algorithms. © 2016 Wiley Periodicals, Inc. Complexity 21: 370–386, 2016     

A unique continuation result for the plate equation and an application

In this paper, we prove the unique continuation property for the weak solution of the plate equation with the low regular coefficient. Then, we apply this result to study the global attractor for the semilinear plate equation with a localized damping. Copyright © 2015 John Wiley & Sons, Ltd.     

Global attractors for the coupled suspension bridge system with temperature

This paper deals with the long‐term properties of the thermoelastic nonlinear string‐beam system related to the well‐known Lazer–McKenna suspension bridge model (0.1) In particular, no mechanical dissipation occurs in the equations, because the loss of energy is entirely due to thermal effects. The existence of regular global attractors for the associated solution semigroup is proved (without resorting to a bootstrap argument) for time‐independent supplies f,g,h and any . Copyright © 2015 John Wiley & Sons, Ltd.     

A new two‐phase structure‐preserving doubling algorithm for critically singular M‐matrix algebraic Riccati equations

Among numerous iterative methods for solving the minimal nonnegative solution of an M‐matrix algebraic Riccati equation, the structure‐preserving doubling algorithm (SDA) stands out owing to its overall efficiency as well as accuracy. SDA is globally convergent and its convergence is quadratic, except for the critical case for which it converges linearly with the linear rate 1/2. In this paper, we first undertake a delineatory convergence analysis that reveals that the approximations by SDA can be decomposed into two components: the stable component that converges quadratically and the rank‐one component that converges linearly with the linear rate 1/2. Our analysis also shows that as soon as the stable component is fully converged, the rank‐one component can be accurately recovered. We then propose an efficient hybrid method, called the two‐phase SDA, for which the SDA iteration is stopped as soon as it is determined that the stable component is fully converged. Therefore, this two‐phase SDA saves those SDA iterative steps that previously have to have for the rank‐one component to be computed accurately, and thus essentially, it can be regarded as a quadratically convergent method. Numerical results confirm our analysis and demonstrate the efficiency of the new two‐phase SDA. Copyright © 2015 John Wiley & Sons, Ltd.     

Finite element Galerkin approximations to a class of nonlinear and nonlocal parabolic problems

In this article, a finite element Galerkin method is applied to a general class of nonlinear and nonlocal parabolic problems. Based on an exponential weight function, new a priori bounds which are valid for uniform in time are derived. As a result, existence of an attractor is proved for the problem with nonhomogeneous right hand side which is independent of time. In particular, when the forcing function is zero or decays exponentially, it is shown that solution has exponential decay property which improves even earlier results in one dimensional problems. For the semidiscrete method, global existence of a unique discrete solution is derived and it is shown that the discrete problem has an attractor. Moreover, optimal error estimates are derived in both and ‐norms with later estimate is a new result in this context. For completely discrete scheme, backward Euler method with its linearized version is discussed and existence of a unique discrete solution is established. Further, optimal estimates in ‐norm are proved for fully discrete schemes. Finally, several numerical experiments are conducted to confirm our theoretical findings. © 2016 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1232–1264, 2016     

Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details. AMS subject classification (2000) 65F30, 15A18     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.