How to calculate the content for a given realizable fuzzy matrix

MaRDI QIDQ1574264zbMATH OpenFDO

Authors Xueping Wang

Publication date 9 November 2000

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decomposition algorithmfuzzy matrixmatrix decompositionmatrix over latticemax-min rankrealizable matrixSchein rank

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Matrix equations and identities (15A24) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Review text

The paper deals with \(n\times n\) symmetric, diagonally dominated matrices over the lattice \(([0,1],\max,\min)\), which are called realizable [cf. \textit{W. J. Liu}, J. Fuzzy Math. 1, 69-76 (1982)]. The Schein rank \(r\) [cf. \textit{K. H. Kim} and \textit{F. W. Roush}, Fuzzy Sets Syst. 4, 293-315 (1980; Zbl 0451.20055)] of such matrices is called here the content of a matrix. An exponential algorithm with complexity \(O(r^{n^2+1})\) for calculation of this rank and of the minimal decomposition of the form \(A = B \circ B^T\) is presented.

Recommendations

• An improved algorithm on the content of realizable fuzzy matrices
• scientific article; zbMATH DE number 3906654
• scientific article; zbMATH DE number 1559488
• scientific article; zbMATH DE number 3979268

Cited in

(11)

• The least upper bound of content for realizable matrices on lattice \([0,1]\)
• Decomposition of realizable fuzzy relations
• The sub-content for a sub-symmetric fuzzy matrix
• A note on the realizability problem of nonnegative integral symmetric matrices
• scientific article; zbMATH DE number 4045808 (Why is no real title available?)
• An improved algorithm on the content of realizable fuzzy matrices
• scientific article; zbMATH DE number 711407 (Why is no real title available?)
• scientific article; zbMATH DE number 1559488 (Why is no real title available?)
• scientific article; zbMATH DE number 3893353 (Why is no real title available?)
• Cliques and clique covers in fuzzy graphs
• On the computational complexity of the Schein rank of fuzzy matrices

This page was built for publication: How to calculate the content for a given realizable fuzzy matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1574264)