凝聚映象的歧点和应用

得到凝聚映象的新的歧点和渐近歧点定理 ,并指出它的固有值的某种全局特征 .     

全连续算子的歧点

本得到全连续算子和锥映象的新的歧点和渐近歧点定理,并指出它们的固有值的某种全局特征。     

非线性算子的歧点

本文研究了Banach空间中非线性全连续算子在不假设Fréchet可微的条件下,歧点的存在性和不存在性.利用齐次算子,获得了这类算子歧点的存在和不存在的充分条件,推广和改进了已有文献中的结果.     

关于随机算子若干问题的研究

研究了新的随机不动点指数的计算问题,利用随机不动点指数的理论推广了著名的Amann定理.提出了随机算子的随机渐进歧点的新概念,并且研究了随机k(ω)-集压缩算子的随机渐进歧点的一些问题,也得到了若干新的结果.     

零点不可导时锥映射的歧点与正特征元的全局结构

研究了半序Banach空间中一类非线性锥映射歧点的存在性与正特征元的全局结构.与已知文献不同的是,不要求算子在零点沿着锥Frechet可微. 作为应用,讨论了一类椭圆型偏微分方程边值问题正解的歧点与全局结构.     

权为整数的Eisenstein空间

<正> 对上述条件3需要作些解释.对任一有理数(歧点)s,存在ρ∈SL_2(Z),使ρ(s)=i∞.上述条件3的含意是指 f(ρ~(-1)(z))j(ρ~(-1),z)~(-k)在 z=i∞的 Fourier 展开式形如sum from n=0 to ∞ a_ne(nz).即不存在 n<0的项.如果在所有歧点(包括 i∞)s,上述 Fourier 展开式中都有 a_0=0,这时 f 称为歧点型模形式.M_k(T)中所有歧点型模形式构成的子空间记作 S_k(Γ).     

一类非线性中子迁移算子的歧点

本文应用非线性泛函分析理论证明了一类非线性算子有无穷可数多个歧点。定义算子A:     

非线性多孔介质流动模型问题的分歧

本文讨论一类多孔介质流动模型非线性边值问题．对这类问题以及广泛的一类算子方程，我们得到了渐近歧点的存在性     

随机凝聚算子的歧点( 英文)

本文没有假设随机算子是Frechet可微,利用随机拓扑度的方法,研究了Banach空间中随机凝聚算子的歧点的存在性.     

非线性算子的渐近歧点

利用拓扑度方法作为主要工具研究Banach空间中非线性算子的渐近歧点的存在性,但并没有假定非线性算子是渐近线性算子.最后,把一般结果应用于常微分方程的Sturm-Liouville问题.     

Local completeness, drop theorem and Ekeland's variational principle

By using a very general drop theorem in locally convex spaces we obtain some extended versions of Ekeland's variational principle, which only need assume local completeness of some related sets and improve Hamel's recent results. From this, we derive some new versions of Caristi's fixed points theorems. In the framework of locally convex spaces, we prove that Daneš' drop theorem, Ekeland's variational principle, Caristi's fixed points theorem and Phelps lemma are equivalent to each other.     

Weak convergence theorem for zero points of inverse strongly monotone mapping and fixed points of nonexpansive mapping in Hilbert space

We know that variational inequality problem is very important in the nonlinear analysis. For a variational inequality problem defined over a nonempty fixed point set of a nonexpansive mapping in Hilbert space, the strong convergence theorem has been proposed by I. Yamada. The algorithm in this theorem is named the hybrid steepest descent method. Based on this method, we propose a new weak convergence theorem for zero points of inverse strongly monotone mapping and fixed points of nonexpansive mapping in Hilbert space. Using this result, we obtain some new weak convergence theorems which are useful in nonlinear analysis and optimization problem.     

Fixed points for contractive mappings of third order in pseudo-quasimetric spaces

In this paper we define a new class of mappings, different from mappings of Banach type (see definition 2.4). A new theorem on fixed points and another theorem on identity mappings are given in the more general setting of pseudo-quasimetric spaces.     

THE AMBIGUOUS TYPE THEORY IS HEREDITARILY UNDECIDABLE

The ambiguous type theory ATT is introduced in [1] in order to obtain a new proof of Specker's theorem on typical ambiguity [3]. In the present paper we imbed the recursively undecidable theory TR of a single transitive-reflexive relation in an arbitrary stratified theory T such that T ? ATT and so reduce the problem of derivability in TR to the same problem for T. From this it follows that ATT is hereditarily undecidable, i.e. ATT has no decidable subtheories.     

Reich一个定理的改进及其应用

本文使用新的分析技巧研究了一致光滑Banach空间中一类增生映像的零点的迭代构造问题, 所得结果改进了Reich早期的一个著名定理.作为应用,导出了连续伪压缩映像的不动点的迭代算法的强收敛定理.     

Maximal (Minimal) Conditional Expectation and European Option Pricing with Ambiguous Return Rate and Volatility

In this paper, we consider the problem of option pricing when return rate and volatility are ambiguous. Firstly we illustrate how to describe this ambiguous option pricing model by using set-valued differential inclusion and how to change the discussion of pricing bound problems of options into that of maximal and minimal conditional expectations. Secondly we discuss the properties of maximal and minimal conditional expectations, especially the representation theorem of maximal and minimal expectations. Finally we give the bounds of the European option pricing by using above theorems.     

More efficient left-to-right matching for overlapping pattern

Pattern matching is a fundamental feature in many applications such as functional programming, logic programming, theorem proving, term rewriting and rule-based expert systems. Usually, patterns are pre-processed into a deterministic finite automaton. Using such an automaton allows one to determine the matched pattern(s) by a single scan of the input term. The matching automaton is typically based on left-to-right traversal of patterns. In this paper, we propose a method to build such an automaton. Then, we propose an incremental method to build a deterministic concise automaton for non-necessarily sequential rewriting systems. With ambiguous patterns a subject term may be an instance of more than one pattern. To select the pattern to use, a priority rule is usually engaged. The pre-processing of the patterns adds new patterns, which are instances of the original ones. When the original patterns are ambiguous, some of the instances supplied may be irrelevant for the matching process. They may cause an unnecessary increase in the space requirements of the automaton and may also reduce the time efficiency of the matching process. Here, we devise a new pre-processing operation that recognises and avoids such irrelevant instances. Hence improves space and time requirements for the matching automaton.