Banach空间中二阶脉冲微分-积分方程的解

该文利用不动点定理研究了Ｂａｎａｃｈ空间中二阶脉冲微分－积分方程初值问题解的存在性,推广了文［１］中的结果．     

脉冲强迫非线性时滞微分方程的渐近性

本文研究一类脉冲强迫非线性时滞微分方程的渐近性,所得结果不仅适用于线性方程和非线性方程,强迫方程和非强迫方程,脉冲方程和非脉冲方程,而且改进了最近文献［８］的主要结果．     

Banach空间中二阶非线性脉冲微分积分方程初值问题的整体解

通过逐步求解,应用Banach不动点定理,在较宽松的条件下,获得Banach空间中二阶非线性脉冲微分积分方程初值问题解的存在性与唯一性及解的迭代逼近.对文［1］的结果及文［2］相应于d\-0=0的结果,作了重要改进和推广.     

具有可变脉冲点的脉冲微分方程的稳定性

该文考虑具有可变脉冲点的脉冲微分方程零解的稳定性。通过利用L yapunov函数以及Razumikhin技巧，可以得到关于具有可变脉冲点的脉冲微分方程零 解的一致稳定和一致渐近稳定的充分条件。     

Banach空间非线性脉冲Fredholm型积分方程的耦合极值拟解

In recent years, the research in integral equations in Banach spaces has achieved many results (refer to ［1］, ［2］, ［3］ etc.). It is well known that, generally, one must first establish the comparison theorem before applying the method of (coupled) lower and upper (quasi)solutions to investigate the (quasi)solutions of integral equations. This can be easily done for Volterra integral equations, but seems impossible for the cases of Fredholm type. Though ［3］ avoided the establishment of…     

带脉冲的EmdenFowler方程次线性奇异边值问题的正解

该文讨论了带脉冲的Emden Fowler方程次线性奇异Dirichlet边值问题,利用上下解方法得到了该类问题正解存在的充分必要条件. 在脉冲的影响下得到了多解的存在性结果。     

有约束错误指定模型下的优化问题

文［１］ 利用文［3］的结果证明了一般有约束线性模型下参数的最优估计的方差协方差阵与有约束错误指定模型下最优估计的方差协方差阵间差是非负定的充分条件［２］也是必要的。更进一步，文［4］将［1］中的定理1推广到奇异线性模型上。该文的主要目的是证明了［２］的猜想在奇异线性模型中也是正确的，同时，推广了［１］中的定理2。     

脉冲中立型时滞微分方程解的振动性

本文讨论一阶脉冲中立型时滞微分方程［ｙ（ｔ）＋Ｐｙ（ｔ－σ）］′＋Ｑ（ｔ）ｙ（ｔ－σ）＝０，ｔ０，ｔ≠ｔｋ，ｋ＝１，２，…，ｙ（ｔ＋ｋ）－ｙ（ｔ－ｋ）＝ｂｋｙ（ｔｋ），ｋ＝１，２，…，｛（Ｅ）这里τ，σ，Ｐ均为常数，τ＞０，σ＞０，Ｑ（ｔ）∈Ｃ（［０，∞），Ｒ＋），ｂｋ＞－１，ｋ＝１，２，…．分三种情况，Ｐ－１；－１＜Ｐ＜０；Ｐ＞０给出了方程（Ｅ）所有解振动的充分条件．     

一类高阶线性微分方程解的增长性

该文研究了一类高阶线性微分方程解的增长性，推广并完善了文献［３］［４］［５］［７ ］的结果.     

二阶非线性脉冲积分-微分方程初值问题的解

该文利用单调迭代技术讨论了Banach空间中含有非线性一阶微分项x'的二阶脉冲积分-微分方程初值问题的最大最小解的存在性问题. 作为该文主要结论的应用,作者给出了一个例子.     

Bounds for the Graham–Pollak theorem for hypergraphs

Let $f_r\left(n\right)$ represent the minimum number of complete $r$-partite $r$-graphs required to partition the edge set of the complete $r$-uniform hypergraph on $n$ vertices. The Graham–Pollak theorem states that $f_2\left(n\right)=n?1$. An upper bound of $(1+o\left(1\right))\left(\genfrac{}{}{0ex}{}{n}{?\frac{r}{2}?}\right)$ was known. Recently this was improved to $\frac{14}{15}(1+o\left(1\right))\left(\genfrac{}{}{0ex}{}{n}{?\frac{r}{2}?}\right)$ for even $r\ge 4$. A bound of $\left[\frac{r}{2}{\left(\frac{14}{15}\right)}^{\frac{r}{4}}+o\left(1\right)\right](1+o\left(1\right))\left(\genfrac{}{}{0ex}{}{n}{?\frac{r}{2}?}\right)$ was also proved recently. Let $c_r$ be the limit of $\frac{f_r\left(n\right)}{\left(\genfrac{}{}{0ex}{}{n}{?\frac{r}{2}?}\right)}$ as $n\to \infty$. The smallest odd $r$ for which $c_r<1$ that was known was for $r=295$. In this note we improve this to $c_{113}<1$ and also give better upper bounds for $f_r\left(n\right)$, for small values of even $r$.     

A new stabilized finite element method for optimal control for a Ladyzhenskaya model for unsteady flows

This article considers the time‐dependent optimal control problem of tracking the velocity for the viscous incompressible flows which is governed by a Ladyzhenskaya equations with distributed control. The existence of the optimal solution is shown and the first‐order optimality condition is established. The semidiscrete‐in‐time approximation of the optimal control problem is also given. The spatial discretization of the optimal control problem is accomplished by using a new stabilized finite element method which does not need a stabilization parameter or calculation of high order derivatives. Finally a gradient algorithm for the fully discrete optimal control problem is effectively proposed and implemented with some numerical examples. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 263–287, 2012     

New convergence estimates for multilevel algorithms for finite-element approximations

New convergence estimates are established for some multilevel algorithms for finite-element methods applied to elliptic problems with jump coefficients. A uniform rate of convergence is derived if the coefficient has only one jump interface. If the coefficient has multi-jump interfaces which meet at only one interior point in the domain, the convergence rate is bounded by 1−(CJ)⁻¹, where J is the number of levels and C is a constant independent of the jump.     

New error bound for linear complementarity problems for B-matrices

A new error bound for the linear complementarity problem is obtained when the involved matrix is a B-matrix. This bound improves existing results. Finally, two numerical examples are also given to show that the bound is better than some previous results.     

积分中值定理中间点比较及有关平均不等式

中值定理中间点是区间端点的平均.设f (x)、g(x)在同一区间[a,b]内严格单调并可积,p(x)、q(x)恒正可积,按积分中值定理各有唯一的中间点ξf ,p(a,b)和ξg,q(a,b) .当f递增(减)且f (g- 1)凸(凹)时,有ξg,p(a,b) <ξf,p(a,b) ;当p(x)q(x) 递增(减)且q(x) ∫bap(x) dx >( <) 0时,有ξf,q(a,b) <ξf ,p(a,b) .由此可证明和发现一系列有关平均的不等式.     

Graphical Diagnostics for Markov Models for Categorical Data

Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment.

Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN.     

Algorithms for approximation of invariant measures for IFS

We prove convergence of two algorithms approximating invariant measures to iterated function systems numerically. We consider IFSs with finitely many continuous and injective non-overlapping maps on the unit interval. The first algorithm is a version of the Ulam algorithm for IFSs introduced by Strichartz et al. [16]. We obtain convergence in the supremum metric for distribution functions of the approximating eigen-measures to a unique invariant measure for the IFS. We have to make some modifications of the usual way of treating the Ulam algorithm due to a problem concerning approximate eigenvalues, which is part of our more general situation with weights not necessarily being related to the maps of the IFS. The second algorithm is a new recursive algorithm which is an analogue of forward step algorithms in the approximation theory of ODEs. It produces a sequence of approximating measures that converges to a unique invariant measure with geometric rate in the supremum metric. The main advantage of the recursive algorithm is that it runs much faster on a computer (using Maple) than the Ulam algorithm.Mathematics Subject Classification (2000): 37A30, 37C30, 37M25, 47A58Acknowledgement I would like to express my deep gratitude to Andreas Strömbergsson and to the anonymous referee. The referee had several very enlightening comments, which Andreas helped me to deal with. Section 4 is essentially due to Andreas and he also came up with the new Proposition 3 and helped me to improve Lemma 1. Thanks also to Svante Janson, Anders Johansson, Sten Kaijser, Robert Strichartz and Hans Wallin.     

Algorithm for choosing conjunctions for logical recognition methods

A new family of recognition algorithms for problems with binary information is constructed. A natural method is proposed for ordering conjunctions used in pattern recognition problems in the standard formulation and with binary features.     

A hybrid method for inverse cavity scattering problem for shape

In this paper, we give a hybrid method to numerically solve the inverse open cavity scattering problem for cavity shape, given the scattered solution on the opening of the cavity. This method is a hybrid between an iterative method and an integral equations method for solving the Cauchy problem. The idea of this hybrid method is simple, the operation is easy, and the computation cost is small. Numerical experiments show the feasibility of this method, even for cases with noise.