一类推广后的Feigenbaum函数方程的光滑解

考虑一类推广后的Feigenbaum函数方程｛g（0）=1,-1≤g（x）≤1,x∈[-1,1],h（g（x））=g（g（h（x）））其中h（x）是[-1,1]上的递减光滑奇函数且满足h（0）=0,-1〈h’（x）〈0,z∈[-1,1]．利用构造性方法讨论上述方程的光滑解的存在性及唯一性．     

用半光滑牛顿法求解一般的凸光顺问题

本文讨论一般的凸光顺问题minF（y）：=∫a^b（｜D^k y｜）^2dt＋∑（i=1）^N ωi｜y（ti）-zi｜^2．其中，忌芝3而且可在闭凸集凡K（∪→）L2^k[a,b]．我们把该问题转化为半光滑方程组并给出一个求解该方程组的半光滑牛顿算法．最后证明算法的超线性收敛性并给出数值算例．     

无约束非光滑优化问题的信赖域算法及收敛性

1．引言考虑下列无约束非光滑优化问题：其中f为R”上的局部LIPSChitZ函数．本文将11·112简记为11·l．信赖域算法是通过求解一系列子问题3＊B（二，凸）：来求解问题（1）的，其中拉x，·）为j在x点的一阶近似，B为nxn阶对称阵．下面给出信赖域的基本算法TRA：步1·给定...     

光滑函数有限阶零点的一个性质

一个函数在实数集上无限阶可导,这样的函数为实数集上的光滑函数.如果一个光滑函数f在x=a处函数值为零称x=a是函数f的零点,如果该光滑函数在此点处还满足:直到n-1阶导数都为零,但n阶导数不为零,这个零点称为是n阶零点,本文中证明f与x-a的n次幂之比还是光滑函数.     

对凝聚函数法的探讨

1．引言考虑问题（）：这里人（n）是”中二次连续可微函数，n，n是正整数．（利是非光滑规划中常见的一种情形，且光滑约束优化问题的某种罚函数也是这种形式．因此如何有效地求解（P）是非线性规划中一个重要的课题［’‘］．凝聚函数法是近几年发展起来的一种重要的求解（P）的方法［“‘l，其想法比较简单：用一族二次连续可微的凝聚函数Fp（x）去一致逼近f（x）（PM＋co），从而当p充分大时，用几（X）的极小解X（叫作为（日的近似解．因为马（X）是＊”中光滑函数，所以可用己知的求解光滑无约束优化的数值方法（如＊＊＊S方法）…     

B（E,F）中光滑Banach子流形B＊（E,F）

令E和F是Banach空间;B（E,F）,B^＋（E,F）,Φ（E,F）,SΦ（E,F）和R（E,F）分别表示映E到F的有界线性、双裂、Fredholm、半Fredholm和有限秩算子全体.令∑表示下列集合之一：{T∈Φ（E,F）：IndexT=constant和dimN（T）=constant},{T∈SΦ（E,F）：dimN（T）=constant＆lt;∞或codimR（T）=constant＆lt;∞之一成立}和{T∈R（E,F）：RankT=constant＆lt;∞},下面是已知的：∑是B（E,F）中的光滑子流形,且切空间T_A∑={B∈B（E,F）：BN（A） R（A）,（？）A∈∑}.然而,B^＊（E,F）={T∈B^＋（E,F）：dimN（T）=codimR（T）=∞},失去特征数dimN（A）,codimR（A）,index（A）和Rank（A）,寻找它的一个子类组成B（E,F）中的光滑子流形,这是很困难的.幸运地,我们发现B^＊（E,F）就是B（E,F）的一个光滑子流形,且在每一点A∈B^＊（E,F）它的切空间T_AB^＊（E,F）={T∈B（E,F）：TN（A） R（A）}.这样,B^＋（E,F）的几何结构被给出,亦即,B＋（E,F）是以上互不相交的诸光滑子流形的并．同时我们对任一A∈B＋（E,F）,给出了一个装配在一个固定的Banach空间上,通过A的光滑子流形s（A）．为了这些,许多广义逆扰动分析的结果被推广．特别地,在E：F：Rn情况下,我们得到：Rank（A）=r〈n,的奇异n×n矩阵全体∑r是B（R^n）的一个道路连通的光滑子流形且有维数dime∑r=2nr-r^2．这样,B（R^n）除熟知的代数和分析结构外,又有了一个像B^＋（E,F）一样的几何结构．     

求多变量非光滑函数总体极小点的一类改进的填充函数法

1 引言 设F:ΩR~n→R,其中Ω是对n维欧氏空间中的紧集,F为非光滑函数.假定 F在Ω内部有极小点,我们的问题是考虑求解 minF(x) x∈Ω　 (1.1) 上述即是所谓的求解非光滑函数F总体极小点问题.目前尚未见到有关求解这类问题的总体极小点的理论和算法.葛人溥在讨论求解具有非线性约束、目标函数为光滑的     

有限域上单变量代数函数域中的素数定理

设q是素数的幂次，Fq为一有限域；F为Fq上的单变量代数函数域．在这篇文章中我们证明了下面的素数定理，πF（x）=1/（q-1）.x/logqx＋O（x/log^2qx）.x=q^n→∞其中logqx以q为底的对数，这一结果改进了M．Kruse，H．Stichtenoth的结果．     

赋Orlicz范数的Musielak-Orlicz空间的光滑点与强光滑点(英)

给出赋Ｏｒｌｉｃｚ范数的Ｍｕｓｉｅｌａｋ－Ｏｒｌｉｃｚ函数空间中光滑点、光滑性、强（很）光滑点和强（很）光滑性的充 分必要条件．     

弱半光滑函数总体极小的广义填充函数法

设F:R~n→R为目标函数,并设F存在极小点。我们的目的是求出x∈R~n使得对所有的x∈R~n有 F(X)≤ F(x). (1.1)即求解F的总体极小. 关于求总体极小问题,到目前为止尚无理论上较为成熟、实际计算中又较为有效的方法.葛人溥在[1]中提出一种求解(1.1)的填充函数法.其基本想法是利用填充函数逐次求     

Estimates of stability of characterization of additive types of distributions

An estimate of stability of characterization of distribution types is obtained for the case of additive types. Under some conditions, the estimate has the order ε^1/3L(ε), where L(ε) is a slowly varying function. Proceedings of the Seminar on Stability Problems for Stochastic Models, Moscow, Russia, 1996, Part I.     

一类完全正则半群簇子簇格的性质

本文研究了完全正则半群簇的子簇格［Ｖ＋∩ＰＶ，Ｖ＋∩ＰＶ］的某些格运算性质，我们证明了簇Ｖ＋∩ＰＶ可分解为Ｖ与Ｖ＋∩ＰＶ的并；对任意完全正则半群簇Ｗ，有Ｗ∩（Ｖ∨Ｖ＋∩ＰＶ）＝（Ｗ∩Ｖ）∨（Ｗ∩Ｖ＋∩ＰＶ）．特别地，我们得到了等式Ｖ＋∩ＰＶ＝Ｖ成立的若干条件．     

Study of the blow-up of solutions of systems of equations of hydrodynamic type

Mathematical Notes - We study the initial boundary-value problem for three-dimensional systems of equations of pseudoparabolic type. The system is similar to the Oskolkov system, but differs from...     

Characterization of types of asymptotic discernibility of families of hypotheses

We give a characterization of the types of asymptotic discernibility of families of hypotheses in the case of hypothetical measures that are not, in general, mutually absolutely continuous. The case when the logarithm of the likelihood ratio admits an asymptotic expansion of the type of an expansion with local asymptotic normality is examined in detail. Examples are studied.Translated fromTeoriya Sluchainykh Protsessov, Vol. 15, pp. 64–71, 1987.     

Distribution of types of symmetry of tensors of high degree

The asymptotic distribution of tensors of degree N in symmetry types is studied in this paper.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 155, pp. 181–186, 1986.     

Preservation of equivalence of derivations under reduction of depth of formulas

In this paper we consider derivations in the (&, )-fragment of the intuitionistic propositional calculus. As is known, replacement of any occurrence of a formula [F] in a sequent S by an occurrence of the formula [p], where p is a new propositional variable, with the simultaneous addition to the antecedent of the formula F p or p F depending on the sign of the occurrence of F in S, leaves the derivability unchanged. We give a proof of the fact that the natural extension of this transformation to derivations preserves the relation of equivalence of derivations, i.e., transformed derivations are equivalent if and only if the originals are equivalent. (Derivations are considered equivalent if certain of their normal forms coincide, or, what is the same, if their deductive terms coincide.) It is proved that by the iteration of this transformation, each derivation of an arbitrary sequent S can be transformed into a derivation of a sequent S, depending only on S, whose succedent is a variable, and in the antecedent there occur only formulas of the form a,a & b, a b,,(a b) c, a & b c, a (b & c), wherea, b, c are variables. Here if S is balanced, then S is also balanced. (A sequent is called balanced if each variable occurs in it no more than twice.) The familiar correspondence between certain concepts of the theory of categories and concepts of the theory of proofs allows one to assert that there has been constructed a univalent functor, mapping a free Cartesian closed category into itself.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 197–207, 1979.     

Estimate of growth of Lebesgue functions of linear methods of summation

Sufficient conditions are obtained in terms of matrix elements for the boundedness of Lebesgue functions of linear methods of summation of expansions in orthogonal systems of polynomial type.Translated from Matematicheskie Zametki, Vol. 6, No. 3, pp. 277–286, September, 1969.