共查询到20条相似文献,搜索用时 125 毫秒
1.
主要讨论模糊矩阵在max-product复合意义下的收敛性.通过对模糊矩阵元素的有限收敛、无限收敛、有限振荡、无限振荡的情况的讨论,引入模糊矩阵的有限收敛、无限收敛、有限振荡、无限振荡的概念,证明模糊矩阵在max-product复合意义下要么有限收敛,要么无限收敛,要么有限振荡,要么无限振荡,给出了模糊矩阵在max-product复合意义下收敛性的完整结论,并澄清已有文献中的一些错误.最后给出基于max-product复合的模糊矩阵幂序列的分类情况. 相似文献
2.
3.
研究整环Z[3]上无限维矩阵V关于无限维矩阵构造下的逆、M-P逆和群逆,给出V的不同的逆、M-P逆等,推广了Saranya和Sivakumar的结果,并且得到Z[3]上无限维矩阵广义逆更广泛的性质. 相似文献
4.
5.
本文研究了一类具有特殊结构的无限维二次型, 得到这类二次型的对称矩阵是符号为多项式的模的平方的Laurent 矩阵, 进一步得到了这类二次型是强正定的判断标准以及一类Weyl-Heisenberg 框架的构造. 本文还研究了这类二次型的矩阵的所有有限维主对角子矩阵的强正定性, 并由此得到一类子空间Weyl-Heisenberg 框架的构造. 最后举例说明本文的主要结果及其应用. 本文建立了两个看似不相关的领域间的联系. 相似文献
6.
7.
文章考虑一个具有无限多参与人与无限维商品空间的生产经济.在这样的生产经济中,构建一类具有无限参与人的市场博弈,并定义出其中可传递效用核.结合过去有限参与人合作均衡存在性定理,文章主要证明了市场博弈中可传递效用核的存在性.具有无限维商品空间和无限多参与人市场博弈的构建,与市场博弈中的可传递效用核的存在性证明为文章的两个主要贡献. 相似文献
8.
给出了无限布尔方阵周期的概念,研究了无限布尔方阵伴随有向图的若干性质,研究了有限布尔矩阵幂的图论性质,最后给出了无限布尔方阵传递指数的上、下界估计. 相似文献
9.
《数学分析》中我们会遇到许多无限问题,由于无限集不一定有最大值与最小值,而有限集一定有最大值与最小值.因此,《数学分析》中需要把无限问题转化为有限问题.文中主要描述了两个重要的无限化有限的方法.一种是通过把闭区间等分的方法,另一种是利用有限覆盖定理的方法,把无限化为有限,使得问题迎刃而解. 相似文献
10.
11.
12.
We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong duality under a transversality condition that dual prices are asymptotically zero. That is, we show, under this transversality condition, that optimal solutions are attained in both primal and dual problems and their optimal values are equal. The transversality condition, and hence strong duality, is established for an infinite horizon production planning problem.This material is based on work supported by the National Science Foundation under Grant No. ECS-8700836. 相似文献
15.
16.
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi‐tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at least for partial functions f : ℝ → ℕ, the same class of computable functions. Nevertheless, there are infinite time computable functions f : ℝ → ℝ that are not one‐tape computable, and so the two models of infinitary computation are not equivalent. Surprisingly, the class of one‐tape computable functions is not closed under composition; but closing it under composition yields the full class of all infinite time computable functions. Finally, every ordinal that is clockable by an infinite time Turing machine is clockable by a one‐tape machine, except certain isolated ordinals that end gaps in the clockable ordinals. 相似文献
17.
18.
19.
V. Rosenhaus 《Theoretical and Mathematical Physics》2005,144(1):1046-1053
We consider partial differential equations of variational problems with infinite symmetry groups. We study local conservation laws associated with arbitrary functions of one variable in the group generators. We show that only symmetries with arbitrary functions of dependent variables lead to an infinite number of conservation laws. We also calculate local conservation laws for the potential Zabolotskaya-Khokhlov equation for one of its infinite subgroups.__________Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 144, No. 1, pp. 190–198, July, 2005. 相似文献
20.
Xingxing Yu 《Journal of Graph Theory》2008,57(4):275-312
We prove Nash‐Williams' conjecture that every 4‐connected, 3‐indivisible, infinite, planar graph contains a spanning 2‐way infinite path. A graph is said to be 3‐indivisible if the deletion of any finite set of vertices results in at most two infinite components. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 275–312, 2008 相似文献