一类拟线性椭圆方程边值问题弱解的研究

本文应用上、下解方法和 Leray-Schauder不动点定理 ,证明了一类拟线性椭圆方程边值问题弱解的存在性 ,并且给出了一个应用实例     

Existence of the optimal measurable coupling and ergodicity for Markov processes

The existence theorem of the optimal measurable coupling of two probability kernels on a complete separable metric measurable space is proved. Then by this theorem, a general ergodicity theorem for Markov processes is obtained. And as an immediate application to particle systems the uniqueness theorem of the stationary distribution is supplemented, i.e. the uniqueness theorem also implies the existence of the stationary distribution.     

On the divisibility of the class number of imaginary quadratic fields

The theorem presented in this paper provides a sufficient condition for the divisibility of the class number of an imaginary quadratic field by an odd prime. Two corollaries to this theorem are also included. They represent special cases of the theorem which in general use are somewhat easier to apply.     

单侧导数和对称导数混合方式下的微分中值定理

微分中值定理是分析中的一个重要定理,文[1-2]用对称导数讨论该定理,文[3-4]用单侧导数讨论该定理,而本文把两种导数结合起来以混合方式给出该定理的三种形式,且条件更弱.     

On the Convergence of the Brent Method

1.IntroductionItiswellknownthattheBrentmethodforsolvingsystemsofnonlinearequati0nsistosolvethefo1lowingsystem:bymaldnguseoftheorthogonaltriangulaxfaCtoriz8tion.SupP0sethatwehaveanaPprokimationx(k)tox*,asoluti0nof(1.1).Thenthek-thiterativeprocedurecanbedescribedasfollows[1]:wherehk/Oisthedifferencestepcorrespondingtotheindexk(wewilldiscussthechoicesofhkinSecti0n4)-Constructanorthogonalmatrix(usuallybytheHouseholdtransf0rmation)Step4.Ifj相似文献   

A generalization of the Gronwall-Bellman lemma and its applications

In this study we present an important theorem of the alternative involving convex functions and convex cones. From this theorem we develop saddle value optimality criteria and stationary optimality criteria for convex programs. Under suitable constraint qualification we obtain a generalized form of the Kuhn-Tucker conditions. We also use the theorem of the alternative in developing an important duality theorem. No duality gaps are encountered under the constraint qualification imposed earlier and the dual problem always possesses a solution. Moreover, it is shown that all constraint qualifications assure that the primal problem is stable in the sense used by Gale and others. The notion of stability is closely tied up with the positivity of the lagrangian multiplier of the objective function.     

A Generalized Sampling Theorem with the Inverse of an Arbitrary Square Summable Sequence as Sampling Points

In this article a generalized sampling theorem using an arbitrary sequence of sampling points is derived. The sampling theorem is a Kramer-type sampling theorem, but unlike Kramer's theorem the sampling points are not necessarily eigenvalues of some boundary value problems. The theorem is then used to characterize a class of entire functions that can be reconstructed from their sample values at the points t_n = an + b if n = 0, 1, 2, ... and t_n = an + c if n = 0, -1, -2, ..., where a, b, c are arbitrary constants. The reconstruction formula is derived explicitly in the form of a sampling series expansion. When a = 1, b = 0 = c, the famous Whittaker-Shannon-Kotel'nikov sampling theorem is obtained as a special case.     

A stable theorem of the alternative: an extension of the gordan theorem

A theorem with a number of equivalent alternatives is proposed as an extension of the classical Gordan theorem of the alternative. The theorem can handle nonzero unrestricted variables which cannot be directly treated by ordinary theorems of the alternative. Like the Gordan theorem, the extended theorem has the stability feature that small perturbations in the data will not invalidate an alternative that is in force. The theorem has useful applications in establishing the boundedness and uniqueness of feasible points of polyhedral sets and of solutions to linear programming problems.     

On the Structure of the B—cocleft Module Coalgebra

§１．　ＴｈｅＥｑｕｉｖａｌｅｎｔＴｈｅｏｒｅｍｏｆｔｈｅＣｒｏｓｓｅｄＣｏｐｒｏｄｕｃｔＬｅｔＣｂｅａｌｅｆｔＨ－ｗｅａｋｌｙｃｏｍｏｄｕｌｅｃｏａｌｇｅｂｒａ［４］ｗｉｔｈｔｈｅｓｔｒｕｃｔｕｒｅρ－Ｃ（ｃ）＝∑ｃ（１）ｃ（２）．ＤｂｅｌｅｆｔＨ－ｍｏｄｕｌｅｃｏａｌｇｅｂｒａ［２］ｗｉｔｈｔｈｅｓｔｒｕｃｔｕｒｅ“”．Ｆｏｒα∈Ｈｏｍκ（Ｃ，ＨＨ）ｄｅｎｏｔｅα（ｃ）＝∑α１（ｃ）α２（ｃ）．Ｄｅｆｉｎｅ△－：ＣＤ→（ＣＤ）（ＣＤ）ａｎｄε－：ＣＤ→κａｓｆｏｌｌｏｗ－ｉ…     

纯正的群的正则带的构造

本文研究纯正的群的正则带.在给出这类半群的若干特征后,建立了纯正的群的正则带的构造定理.作为应用,同时给出了纯正的群的右拟正规带的构造定理.     

Remark on the convergence of the midpoint method under mild differentiability conditions

We establish a convergence theorem for the Midpoint method using a new system of recurrence relations. The purpose of this note is to relax its convergence conditions. We also given an example where our convergence theorem can be applied but other ones cannot.     

A proof of the montague-plemmons-schein theorem on maximal subgroups of the semigroup of binary relations

The theorem in question is that the group of automorphisms of a partially ordered set (X,π), π denoting the order relation on the set X, is isomorphic to the maximal subgroup of ℬ_x containing π, where ℬ_x is the semigroup of all binary relations on X. This theorem is due to Montague and Plemmons [1] for the case X finite or countably infinite, and was extended by Schein to the general case, using a theorem due to Zaretsky [4]. A proof of the general case, based on [1] and results due to Plemmons and West [3], is also given in the preceding note by Plemmons and Schein [2]. The purpose of this note is to give an entirely self-contained proof of this intersesting theorem.     

输入存贮线性有限自动机的极小化

由输入存贮线性有限自动机的线性系数组成的矩阵得出输入存贮线性有限自动机极小的等价定理,由此定理得出输入存贮线性有限自动机的极小化方法.     

A categorical approach to the maximum theorem

Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double categories.This approach allows us to generalise (the main assertion of) the maximum theorem, which is classically stated for topological spaces, to pseudotopological spaces and pretopological spaces, as well as to closure spaces, approach spaces and probabilistic approach spaces, amongst others. As a part of this we prove a generalisation of the extreme value theorem.     

An acceleration theorem for the ρ-algorithm

Summary. The ρ-algorithm of Wynn is an excellent device for accelerating the convergence of some logarithmically convergent sequences. Until now a convergence theorem and an acceleration theorem for the ρ-algorithm have not been obtained. The purpose of this paper is to give an acceleration theorem for the ρ-algorithm. Moreover, it is proved that the ρ-algorithm cannot accelerate linear convergence. Numerical examples are given. Received October 20, 1994 / Revised version received July 2, 1995     

Whitney定理的一个推广形式

Whitney's theorem is a famous theorem in the local singularity theory. In this paper, as an application of Malgrange preparation theorem, a generalized form of Whitney's theorem will be derived.     

A Generalized Form of Whitney's Theorem

Whitney's theorem is a famous theorem in the local singularity theory.In this paper,as an application of Malgrange preparation theorem,a generalized form of Whitney's theorem will be derived.     

A Generalized Form of Whitney＇s Theorem

Whitney's theorem is a famous theorem in the local singularity theory.In this paper,as an application of Malgrange preparation theorem,a generalized form of Whitney's theorem will be derived.     

On the Construction of Regular Orthocryptogroups

The aim of this paper is to study regular orthocryptogroups. After obtaining some characterizations of such semigroups, we establish the construction theorem of regular orthocryptogroups. As an application, we give the construction theorem of right quasi-normal orthocryptogroups and study homomorphisms between two regular orthocryptogroups. Received September 24, 1999, Accepted May 9, 2001