O-对称矩阵的奇异值分解及其算法

本文研究了具有轴对称结构矩阵的奇异值分解,找出了这类矩阵奇异值分解与其子阵奇异值分解之间的定量关系.利用这些定量关系给出这类矩阵奇异值分解和Moore-Penrose逆的算法,据此可极大地节省求该类矩阵奇异值分解和Moore-Penrose逆时的计算量和存储量.     

Fuzzy矩阵Schein秩的计算复杂性

本文讨论Fuzzy矩阵Schein秩的计算复杂性问题,证明了它是一个"NP-完全问题".首先,刻画了交可分解的Puzzy关系的交分解解集.然后,从Fuzzy关系的交分解与广义分解之间的关系出发,给出了Fuzzy关系广义分解的算法.最后,从Fuzzy关系广义分解的角度来讨论Fuzzy矩阵的Schein秩.指出它与色数问题之间的关系,即Fuzzy矩阵的Schein秩等于由它生成的简单图的色数,从而证明了计算Fuzzy矩阵的Schein秩是一个"NP-完全问题".     

几类B值小指标鞅空间的原子分解

本文对几类B值小指标鞅空间建立了原子分解定理,利用原子分解讨论了它们之间的相互嵌入关系,其原子分解的存在性和它们之间的关系均与Banach空间的凸性和光滑性有密切联系.     

酉延拓矩阵的奇异值分解及其广义逆

从普通奇异值分解出发,导出了酉延拓矩阵的奇异值和奇异向量与母矩阵的奇异值和奇异向量间的定量关系,同时对酉延拓矩阵的满秩分解及g逆,反射g逆,最小二乘g逆,最小范数g逆作了定量分析,得到了酉延拓矩阵的满秩分解矩阵F*和G*与母矩阵A的分解矩阵F和G之间的关系.最后给出了相应的快速求解算法,并举例说明该算法大大降低了分解的计算量和存储量,提高了计算效率.     

Banach空间的框架及原子分解的性质

本文利用Hilbert空间的框架理论对Banach空间的框架和原子分解的性质进行了研究,给出了Banach空间的框架和原子分解的一个充分条件,并讨论了Banach空间的框架和原子分解的关系。     

正规密码■富足半群(英文)

将Green关系推广到Green~-关系。给出了密码■-富足半群的半格分解,利用此分解,证明了■-富足半群为正规密码■-富足半群当且仅当它是完全■-单半群的强半格.     

正规密码(H)-富足半群

将Green关系推广到Green～-关系。给出了密码^ ～ H-富足半群的半格分解,利用此分解,证明了^ ～ H-富足半群为正规密码^H-富足半群当且仅当它是完全^ ～ H-单半群的强半格.     

凹函数生成的Hardy-Orlicz鞅的原子分解

本文我们讨论凹函数生成的Hardy-Orlicz鞅的原子分解.通过原子分解,鞅空间与Banach空间几何性质之间的关系得到研究,扩展了许多已经结论.     

关于一种相对域的素理想分解

主要讨论了代数域的扩张平稳之前与扩张平移之后的分解各间的关系问题,以及素理想分解问题,改进了文「３」的结果。     

B值弱Orlicz α拟鞅空间的原子分解

众所周知,原子分解是研究鞅空间的有力工具,可以简洁有效地处理问题.该文定义了几种弱Orliczα拟鞅空间和三种拟原子,并建立了强原子分解定理.通过原子分解,证明了这些空间上次线性算子的有界性以及这些空间之间的连续嵌入关系.     

Coherent confluence modulo relations and double groupoids

A coherent presentation of an n-category is a presentation by generators, relations and relations among relations. Confluent and terminating rewriting systems generate coherent presentations, whose relations among relations are defined by confluence diagrams of critical branchings. This article introduces a procedure to compute coherent presentations when the rewrite relations are defined modulo a set of axioms. Our coherence results are formulated using the structure of n-categories enriched in double groupoids, whose horizontal cells represent rewriting paths, vertical cells represent the congruence generated by the axioms and square cells represent coherence cells induced by diagrams of confluence modulo. We illustrate our constructions on rewriting systems modulo commutation relations in commutative monoids, isotopy relations in pivotal monoidal categories, and inverse relations in groups.     

Categories of Relations and Functional Relations

We define relations and their composition in a category with (E, M)-factorization structure, with M consisting of monomorphisms, but E not restricted to epimorphisms. We obtain an associativity criterion for composition of relations, and we study functional and induced relations. We show that under our assumptions, the categories of relations on functional and induced relations are isomorphic to the category of relations for the given category.     

二元关系的完全计数

根据二元关系与其矩阵的关系,讨论了满足特殊性质的二元关系的完全计数.特别是以整数分拆的办法得到二元等价关系的完全计数.     

Normal extensions of subnormal linear relations via quaternionic Cayley transforms

A quaternionic Cayley transform for linear relations is introduced and some of its properties are exhibited. We emphasize the role played by the linear relations whose quaternionic Cayley transforms are unitary operators, which happen to be normal relations, and investigate the class of those linear relations which extend to such normal relations.     

On consistency measures of linguistic preference relations

Inspired by the concept of deviation measure between two linguistic preference relations, this paper further defines the deviation measure of a linguistic preference relation to the set of consistent linguistic preference relations. Based on this, we present a consistency index of linguistic preference relations and develop a consistency measure method for linguistic preference relations. This method is performed to ensure that the decision maker is being neither random nor illogical in his or her pairwise comparisons using the linguistic label set. Using this consistency measure, we discuss how to deal with inconsistency in linguistic preference relations, and also investigate the consistency properties of collective linguistic preference relations. These results are of vital importance for group decision making with linguistic preference relations.     

Clusterwise aggregation of relations

In this paper we handle the general problem of finding q(> 1) central relations on a set of objects which best fit the information contained in a finite number of given relations on that set. The proposed CAR (clusterwise aggregation of relations) algorithm allows one to consider the well-known situation of determining a single central relation as a special case (q = 1) and takes into account the fact that the representation of appropriately selected subsets of relations by different central relations can provide additional insights into whether different clusters or segments of relations exist in the given set of relations. Two examples demonstrate the usefulness of the suggested approach.     

Classes of finite relations as initial abstract data types I

The aim of this paper is to give axiomatizations for sixteen types of finite relations. These classes of relations are obtained as intersections of the following basic classes of relations: total relations, surjective relations, partial functions, and injective relations.

A normal form for all relations is given and each of the sixteen types of relations is (syntactically) characterized by certain additional conditions on this normal form.

For each of the sixteen types T, a set of identities E_T is singled out. The class of relations of type T forms an initial algebra in the category of all algebras which satisfy E_T. In the first part of this paper, for each type T the involved algebras are symmetric strict monoidal categories (in the sense of MacLane), enriched with certain specific constants.     

An integrated model-based interactive approach to FMAGDM with incomplete preference information

Incomplete fuzzy preference relations, incomplete multiplicative preference relations, and incomplete linguistic preference relations are very useful to express decision makers’ incomplete preferences over attributes or alternatives in the process of decision making under fuzzy environments. The aim of this paper is to investigate fuzzy multiple attribute group decision making problems where the attribute values are represented in intuitionistic fuzzy numbers and the information on attribute weights is provided by decision makers by means of one or some of the different preference structures, including weak ranking, strict ranking, difference ranking, multiple ranking, interval numbers, incomplete fuzzy preference relations, incomplete multiplicative preference relations, and incomplete linguistic preference relations. We transform all individual intuitionistic fuzzy decision matrices into the interval decision matrices and construct their expected decision matrices, and then aggregate all these expected decision matrices into a collective one. We establish an integrated model by unifying the collective decision matrix and all the given different structures of incomplete weight preference information, and develop an integrated model-based approach to interacting with the decision makers so as to adjust all the inconsistent incomplete fuzzy preference relations, inconsistent incomplete linguistic preference relations and inconsistent incomplete multiplicative preference relations into the ones with acceptable consistency. The developed approach can derive the attribute weights and the ranking of the alternatives directly from the integrated model, and thus it has the following prominent characteristics: (1) it does not need to construct the complete fuzzy preference relations, complete linguistic preference relations and complete multiplicative preference relations from the incomplete fuzzy preference relations, incomplete linguistic preference relations and incomplete multiplicative preference relations, respectively; (2) it does not need to unify the different structures of incomplete preferences, and thus can simplify the calculation and avoid distorting the given preference information; and (3) it can sufficiently reflect and adjust the subjective desirability of decision makers in the process of interaction. A practical example is also provided to illustrate the developed approach.     

Partial order relations on family of sets and scalarizations for set optimization

In this study, some new order relations on family of sets are introduced by using Minkowski difference. The relations between these orders and the ordering cone of the vector space are obtained. It is shown that depending on the corresponding cone, these order relations are partial orders on the family of nonempty bounded sets. Some relationships between these order relations and upper and lower set less order relations are investigated. Also, two scalarizing functions are introduced in order to replace set optimization problems with respect to these partial order relations with scalar optimization problems. Moreover, necessary and sufficient optimality conditions are presented.     

Essential spectra of self-adjoint relations under relatively compact perturbations

This paper is concerned with the stability of essential spectra of self-adjoint relations under relatively compact perturbation in Hilbert spaces. Relationships between relative boundedness and relative compactness of linear relations are established, and some necessary and sufficient conditions of relative compactness and relative boundedness of linear relations are given. It is shown that the essential spectra of self-adjoint relations are invariant under either relatively compact perturbation or a more general perturbation. The results obtained in the present paper generalize the corresponding results for operators to relations, and some of which weaken certain assumptions of the related existing results.