ORDERING OBJECTS ON THE BASIS OF POTENTIAL FUZZY RELATION FOR GROUP EXPERT EVALUATION
|
|
- Timothy Willis Miles
- 5 years ago
- Views:
Transcription
1 ORDERING OBJECTS ON THE BASIS OF POTENTIAL FUZZY RELATION FOR GROUP EXPERT EVALUATION B. Kh. Sanzhapov and R. B. Sanzhapov Volgograd State University of Architecture and Civil Engineering, Akademicheskaya st. 1, Volgograd, Russia ABSTRACT The problem of ordering objects (determination of importance coefficients) indecision support systems is often connected with processing of expert information. The method for solving this problem with the presence of several fuzzy relations, which simulate the preferences of different expert groups, is proposed. Unlike the well-known approaches to the ordering of objects according to the fuzzy estimations of paired comparisons, the proposed method makes it possible to determine the resulting weights (potentials) of objects without the preliminary approximation of expert information.a numerical example is given. Keywords: ordering objects, fuzzy binary relation, system of potentials, transitive matrix. 1. INTRODUCTION In many decision support systems the standard task is to determine importance coefficients of objects - systems, subsystems, and means implementing solutions. Information can be based on the expert estimates, represented in the form of fuzzy relations. As a rule, even in the case of considering the only single fuzzy relation (FR), the constructed relation does not possess the property of the transitivity, necessary for the ordering of objects [1]. Construction of fuzzy potential relation (FPR), approximating a singular fuzzy binary relation, will allow to determine the weights of the objects (so-called, potentials) and on that basis to order set of objects [2]. Nevertheless, in some cases, the evaluation of superiority of one object over another object is not a single number. This can happen when there is no unity in the evaluation of superiority in a group of experts when considering a particular pair of objects, or paired comparison is made by several expert groups. Unlike the existing approaches, we propose a method to construct the resulting PFR closest to expert evaluation when considering initial fuzzy relations on the set of pairs of objects without the use of preliminary aggregation processes, which increases the accuracy of the calculations. The task of ordering a set of objects X (determination of their weights) in the case of a single matrix of expert estimates was successfully solved in papers [2-8]. In practical problems, the evaluation of superiority of the object i over the object j given by matrix = { } whose elements =,, are determined by experts. Here values x i are the weights of the objects. Equations describing the full consistency of expert estimates are presented as [8] = ۰,,. Equalities (2) characterize the transitivity of the matrix R [8]. Because the matrix R is based on expert estimates, equations (2) are often not carried out. The inconsistency of such expert evaluation makes it necessary use the following transitive matrix instead of the matrix R for ordering objects: = ( ),,. This matrix is somewhat similar to the matrix of expert evaluation R. The proximity matrices of paired comparisons are treated differently. For example, the distance, between the matrices R and T is axiomatically defined. A matrix similar to R is selected as T [2,3]. The papers [4-6] consider the functional,, determining the measure of approximation of matrix R by the transitive matrix T. Matrix T is calculated by solving the corresponding optimization problems. In one paper [7] the weights of objects x i are determined based on the calculation of the maximum eigenvalue of matrix R, and further definition of its eigenvector. In contrast to the above mentioned papers, the proposed method determines the value of the importance of objects (their potentials) on the basis of the approximation of initial FR by one PFR. In some cases it can be rather difficult to directly apply the results of papers [2-8] for the search of the approximating PFR in solving the problem of ordering objects at several FR on basis of the exhaustive sorting of all possible options, each of which is described by a singular FR. This is due to difficulties of computational nature. Indeed, even in the case of two independent expert groups, for n objects the required number of computations will be proportional to. 2. THE MATHEMATICAL STATEMENT OF THE PROBLEM For many methods of the ordering objects [2-8], including ours, the initial information consists of a finite set of objects = {,,, }, and a set of object pairs U = { i, j X X, i, j X}. Fuzzy relations, =,, characterizing opinions of different experts, are established on the set of such object pairs. For each such FR the membership function : [, ] is 8544
2 defined, where, is interpreted as a measure of superiority of the object i over the object j for the expert with the number k. Further in the article we will use the concept of potential fuzzy relation (PFR)[2]. Definition 1 [2].FRR is a PFR, if there exists a function,, and that = (, ),, =,,,,. Elements of which satisfy the relations, =, +,,,,.,, =,,. The value is called the potential of object, the set of their values = { } is called the system of potentials of PFR. The relationships (3) determine the system of potentials ambiguously, with accuracy up to an arbitrary constant. That is, by adding to all the potentials the same random number; we can obtain a new system of potentials of the same PFR. The value of this constant may be determined so that the potentials will be in the interval [2], Let us consider a matrix =, with elements, =,, for which hold the properties, =,. If FR R is a PFR, then relations hold [2]:, =,,,, =, +,,,,. The matrix W R is the logarithmic analogue of the matrix R. The properties (5), (6) and (1), (2) correspond to each other. In particular, the choice of this matrix W R is due to the possibility of considering absolute superiority of the object i over the object j as, =, =. It should be noted that for any system of potentials, which satisfies restrictions (4), there exists a single reversible PFRR, on the basis of which it is possible to calculate the superiority measure of the object i over the object j. I.e., it is possible to determine the values of membership function, = [ + ]/,,. As mentioned above, in solving practical problems the original information can be given on the basis of expert estimates. Based on them FR =,, =, in general is not PFR. Then it is necessary to clarify the formulation of the problem of the approximation of initial FR by closest PFR. As discussed above, the system of potentials is determined up to an arbitrary constant. Therefore, further down as a source of initial information we will consider a set of matrices B 1,B 2,...,B K, which elements are defined as, =,,,,, =,. Let us choose as PFR 7) Let {T} denote the set of PFR with elements satisfying the equalities (8) and (9). In this case, it is necessary to determine = { },,,,. For each fixed pair of objects (i,j) closest to, value from the set {,,,,,, } is determined. The maximum value for all pairs (i, j) of considered elements will determine the deviation the matrix T from the matrices B 1,B 2,...,B K. The calculation of the minimum value of this deviation for all matrices {T} will define the closest to B 1,B 2,...,B K transitive matrices. It should be noted that in considering only one group of experts, that is, when K=1, the set of matrices will consist of a single element. 3. THE METHOD OF CALCULATING THE SYSTEM OF POTENTIALS For each value : and for each expert k, let us determine the permissible domains for the elements of the transitive matrix = (, ),,.These domains will look as follows, = [max,,, min,, + ],,, =,. Taking into account the relationships for all matrices B 1,B 2,...,B K such as, =,,,, =,, let us rewrite (11) in the format convenient for further calculations:, = [max,,, min,, ],,, =,. Formula (12) allows considering only the lower boundaries of permissible intervals constituting the permissible domains. Then the permissible domain for a possible change of the matrix elements, of PFR will be represented as the union of sets (12):, =,,,. =, In fact, for a fixed value of λ, a graph =,, is considered, where X is the set of vertices, = is the set of arcs, C = { c,, = max, b i, j 8545
3 λ, i, j X, k =,,, K}is the set of weights of arcs. The weight of each arc of this graph can have K different values. In other words, the graph D can be represented as the union of graphs =,, in which each arc has a single weight. The number = is the number of such graphs. Thus, =, =,,,. We shall consider the graph =,,. Let us denote as a weight of the path = {,,,,,, } which sequentially passes through the vertices,,,. The weight of the path is the sum of weights of arcs that pass through these vertices. As shown in previous paper [2], the condition of existence of transitive matrix, each element of which belongs to the corresponding interval of the permissible weights of the arcs, is the condition for all paths of this graph D l. The existence of transitive matrix for the graph D means the existence of at least one graph D l for which condition for the existence of such a matrix is satisfied. Then the solution of the problem (8) - (10) consists of the search for zero cycle in this graph [2]. In some cases, because of the difficulty of computational nature, it is difficult to examine all the graphs, =,,,. The following is an effective approach to solving this problem (8) - (10). Let us rewrite the task (10) in the following format:,, min, with the performance restrictions (8), (9), (12), (13). Taking into account obtained from (8) relationships for the matrix =,,, =,,,,, and the relationships (9) it is easy to prove that the matrix is uniquely determined by any of its column (or row). Therefore, to construct a permissible solution at a fixed value, which will not be specified further, and satisfying (8), (9), (12), (13), (16), it is sufficient to calculate one column of the matrix T. Further, as such a column, the column number n is selected. Let us consider the square submatrix =,, of the matrix T. All its elements can also be determined by any column (or row). As such column let us select the column with number m: =,,,,, (T is a sign of the transposition). It is to be noted, the diagonals of matrices and consist of zeros. Definition 2. The column with the number m: =,,,,,, which belongs to the submatrix =,, of the matrix T, is called permissible if at fixed value and X=(1,2,...,m) conditions (12),(13),(16) are satisfied. Proposition 1. Elements, +, =, belonging to the permissible column +, are determined by the following conditions:, +, +,, +, +, +. The proof of Proposition 1 follows from the sequential application of the equalities (9). The proposed calculation scheme is to continuously increase the value of λ from zero up until the permissible solution (the permissible column l n ) is achieved. Certainly the value λ is changed in a discrete manner in numerical realization of the algorithm. Continuous change in the value λ is chosen for a clearer demonstration of the algorithm. The calculated λ=λ 0 will be the solution of the problem (8), (9), (12) - (16). The search algorithm for the permissible matrices set { =,,, }, based on the paper [9], is proposed for the fixed value of variable λ. 3.1 Algorithm 1. For the value,, let us construct the column =,,. By its construction this column will be permissible. 2. At this stage, the permissible columns l m, m=3,4,...,n are calculated. Let us fix the arbitrary element,,. From the set of permissible columns {l m-1 } we choose the ones for elements of which the following conditions are satisfied, =, +,,,. =, Thus obtained column =,,,,, on the basis of Proposition 1is permissible. 3. If { = }, then the solution of problem (8), (9), (12), (13) does not exist, and the value of λ should be increased. 4. This stage considers the procedure of a large agreement of the obtained set of matrices with the expert evaluations. Suppose that in the previous stage the value λ=λ 0 was obtained. From the acquired set of matrices defined by {l n }, one with elements satisfying the following conditions are distinguished. Value, of one of the solution matrices belongs to the lower boundary or to the upper boundary of the respective interval (12), and it is unique on this interval. Further, elements,,, of matrix T are determined; those elements are simultaneously upper or lower boundaries of the corresponding intervals from the permissible domains (12). These elements, according to (9), determine the value of,. Let us designate this set of the calculated pairs of elements as U 0. If the number of experts is K=1, then the number of calculated above elements, will be equal to one. For the case of K> 1, the 8546
4 number of such elements, can be represented by a nonunique number. Their combinatorial combinations will divide the initial set of expert estimates into a number of subsets. In all the above defined subsets elements,,,,, are the only numbers on the respective intervals. All such subsets are investigated separately. Elements calculated previously will considered further as constants. They of course can be considered as the lower and the upper boundaries of the respective intervals Taking into account relationships, =,,, let us determine the pairs of objects set Y as = {,, <,, }. For the large agreement of the remained variables the problem is solved again with the initial value of λ=0. Subsequently we shall examine the set of the elements \. Obtained in this case value λ (1) <λ 0. The process of calculations continues until all elements of each subset thus constructed are determined. Thus, the following proposition was proved. Proposition 2. Each matrix calculated according to the algorithm determines PFR. Calculated matrices will make it possible to order the objects set. Each matrix will determine the system of potentials of which differ from each other by some constant. It should be noted, if the expert evaluations are conducted by one group (K=1), the computed matrix T will be unique. 3.2 Numerical example Tables 1 and 2 show the expert evaluations made by the two groups of experts, that is, K = 2. Table-1. Matrix =,. 0,5 0,13 0,25 0,4 0, ,5 0,62 0,5 1 0,5 0,45 0,5 0,85 0,9 0,55 0,2 0,4 0,5 0,85 0,1 0,45 0,55 0,35 0,5 Table-2. Matrix =,. 0,5 0 0,4 0,65 0,65 1 0,5 0,82 0,4 0,65 0,9 0,65 0,5 0,45 0,65 1 0,1 0,3 0,5 0,75 0,4 0,1 0,8 0,4 0,5 Let us calculate matrices and using formula (7). Solution of the problem of approximation of these matrices is the value λ 0 =0,0667. At this value λ 0 there were obtained the values of elements, =,, the upper boundary of the corresponding permissible interval [,;,] λ,, and, =,, the upper boundary of the corresponding permissible interval [,;,] λ,. Equality. =, +, will allow to determine, =, [,;,] λ,,which is the lower boundary of the corresponding permissible interval. The determined elements are assumed constants. Accordingly, the set of element pairs = {,,,,, } were determined. Subsequently we will define elements of the set \. Let us set the initial value λ=0. The approximation problem λ (1) =0,052 at which values, =, [,;,], and, =, [,;,], are determined is solved according to the equation, +, =, =,. Values, =, and, =, are believed to be constants. In this case, the calculated set is = {,,, }. Next, it is necessary to determine the elements of the set \ \.We set the initial value λ = 0. The value λ (2) =0,0415 will be the solution of the approximation problem. From the equation, +, =, =, values, =, [,;,], and, =, [,;,], are determined. The set = {,,, } is determined in this stage. Subsequently we will examine the set \ \ \. The obtained value λ (3) =0,024 allows to determine the value, =, [,;,], from the equation, +, =,. Thus, the obtained set is represented by = {, }. It is further necessary to investigate the set \ \ \ \ with the initial value λ=0. The value λ (4) =0,015 will be the solution of the approximation problem. In this case, the element value, =, [,;,], is calculated from the equation, +, =,. At this stage, the set = {, } has been determined. The last stage is calculated value of λ (5) =0,007, in which the equation, +, =, calculates the value of, =, [,;,],. Thus, based on the calculated values of matrix elements =,, we define the object potentials. To demonstrate, let us assume the maximum value of the potential to be equal to 1. Then, the calculated system of potentials takes the form of = { =,; = ; =,; =,; =,}.The defined system of potentials will make it possible to uniquely order the set of objects as { }. 4. CONCLUSIONS The proposed approach can be used at the stage of the preliminary analysis of the various systems projects, such as technical, social and other. At this stage, expert information typically does not have the property of potentiality. Therefore, when determining the priority of objects, it is desirable to take into account the opinions of all the experts, which can be contradictory. REFERENCES 8547
5 [1] L.A. Zadeh Similarity Relations and Fuzzy Ordering. Information Sciences. 3: [2] Zhukovin V. Ye., Makeyev S. P., Shakhnov I. F Potential fuzzy relations and their use in object ordering problems. Soviet J. of Computer and Systems Sciences. 27(1): [3] Cook D., Kress M Deriving weights from pairwise comparison ratio matrices: An axiomatic approach. Eur. J. of Operational Research. 37(3): [4] Chu A. T. W., Kalaba R. E., Spingarn K. A A comparison of two methods for determining the weights of belonging to fuzzy sets. J. of Optimization Theory and Applications. 27: [5] Krovalz J Ranking alternatives comparison of different methods based on binary comparison matrices. Eur. J. of operational Research. 32: [6] Blankmeyer E Approaches to consistency adjustment. J. of Optimization Theory and Applications. 54(3): [7] SaatyT.L Decision-making with the AHP: Why is the principal eigenvector necessary. European Journal of Operational Research. 145: [8] Makeyev S.P., Shakhnov I.F Ordering objects in hierarchical systems. Soviet J. of Computer and Systems Sciences. 30(4): [9] Sanzhapov B. Kh Polymodal expert estimates. J. of Computer and Systems Sciences International. 33(5):
Spanning trees and logarithmic least squares optimality for complete and incomplete pairwise comparison matrices. Sándor Bozóki
Spanning trees and logarithmic least squares optimality for complete and incomplete pairwise comparison matrices Sándor Bozóki Institute for Computer Science and Control Hungarian Academy of Sciences (MTA
More informationGroup Decision-Making with Incomplete Fuzzy Linguistic Preference Relations
Group Decision-Making with Incomplete Fuzzy Linguistic Preference Relations S. Alonso Department of Software Engineering University of Granada, 18071, Granada, Spain; salonso@decsai.ugr.es, F.J. Cabrerizo
More informationAdditive Consistency of Fuzzy Preference Relations: Characterization and Construction. Extended Abstract
Additive Consistency of Fuzzy Preference Relations: Characterization and Construction F. Herrera a, E. Herrera-Viedma a, F. Chiclana b Dept. of Computer Science and Artificial Intelligence a University
More informationWEIGHTED AND LOGARITHMIC LEAST SQUARE METHODS FOR MUTUAL EVALUATION NETWORK SYSTEM INCLUDING AHP AND ANP
Journal of the Operations Research Society of Japan 2009, Vol. 52, No. 3, 221-244 WEIGHTED AND LOGARITHMIC LEAST SQUARE METHODS FOR MUTUAL EVALUATION NETWORK SYSTEM INCLUDING AHP AND ANP Kazutomo Nishizawa
More informationLinear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.
POLI 7 - Mathematical and Statistical Foundations Prof S Saiegh Fall Lecture Notes - Class 4 October 4, Linear Algebra The analysis of many models in the social sciences reduces to the study of systems
More informationB best scales 51, 53 best MCDM method 199 best fuzzy MCDM method bound of maximum consistency 40 "Bridge Evaluation" problem
SUBJECT INDEX A absolute-any (AA) critical criterion 134, 141, 152 absolute terms 133 absolute-top (AT) critical criterion 134, 141, 151 actual relative weights 98 additive function 228 additive utility
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationElementary Linear Algebra
Matrices J MUSCAT Elementary Linear Algebra Matrices Definition Dr J Muscat 2002 A matrix is a rectangular array of numbers, arranged in rows and columns a a 2 a 3 a n a 2 a 22 a 23 a 2n A = a m a mn We
More informationMulti-criteria Decision Making by Incomplete Preferences
Journal of Uncertain Systems Vol.2, No.4, pp.255-266, 2008 Online at: www.jus.org.uk Multi-criteria Decision Making by Incomplete Preferences Lev V. Utkin Natalia V. Simanova Department of Computer Science,
More information3.3 Easy ILP problems and totally unimodular matrices
3.3 Easy ILP problems and totally unimodular matrices Consider a generic ILP problem expressed in standard form where A Z m n with n m, and b Z m. min{c t x : Ax = b, x Z n +} (1) P(b) = {x R n : Ax =
More informationOn pairwise comparison matrices that can be made consistent by the modification of a few elements
Noname manuscript No. (will be inserted by the editor) On pairwise comparison matrices that can be made consistent by the modification of a few elements Sándor Bozóki 1,2 János Fülöp 1,3 Attila Poesz 2
More informationNotes on Row Reduction
Notes on Row Reduction Francis J. Narcowich Department of Mathematics Texas A&M University September The Row-Reduction Algorithm The row-reduced form of a matrix contains a great deal of information, both
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationDECISION MAKING SUPPORT AND EXPERT SYSTEMS
325 ITHEA DECISION MAKING SUPPORT AND EXPERT SYSTEMS UTILITY FUNCTION DESIGN ON THE BASE OF THE PAIRED COMPARISON MATRIX Stanislav Mikoni Abstract: In the multi-attribute utility theory the utility functions
More informationCOMPARISON OF A DOZEN AHP TECHNIQUES FOR GLOBAL VECTORS IN MULTIPERSON DECISION MAKING AND COMPLEX HIERARCHY
COMPARISON OF A DOZEN AHP TECHNIQUES FOR GLOBAL VECTORS IN MULTIPERSON DECISION MAKING AND COMPLEX HIERARCHY Stan Lipovetsky GfK Custom Research North America Minneapolis, MN, USA E-mail: stan.lipovetsky@gfk.com
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 8 MATRICES III Rank of a matrix 2 General systems of linear equations 3 Eigenvalues and eigenvectors Rank of a matrix
More informationCa Foscari University of Venice - Department of Management - A.A Luciano Battaia. December 14, 2017
Ca Foscari University of Venice - Department of Management - A.A.27-28 Mathematics Luciano Battaia December 4, 27 Brief summary for second partial - Sample Exercises Two variables functions Here and in
More informationMeasuring transitivity of fuzzy pairwise comparison matrix
Measuring transitivity of fuzzy pairwise comparison matrix Jaroslav Ramík 1 Abstract. A pair-wise comparison matrix is the result of pair-wise comparison a powerful method in multi-criteria optimization.
More informationTechnische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik. Combinatorial Optimization (MA 4502)
Technische Universität München, Zentrum Mathematik Lehrstuhl für Angewandte Geometrie und Diskrete Mathematik Combinatorial Optimization (MA 4502) Dr. Michael Ritter Problem Sheet 1 Homework Problems Exercise
More informationCOMPSCI 514: Algorithms for Data Science
COMPSCI 514: Algorithms for Data Science Arya Mazumdar University of Massachusetts at Amherst Fall 2018 Lecture 8 Spectral Clustering Spectral clustering Curse of dimensionality Dimensionality Reduction
More informationREMOVING INCONSISTENCY IN PAIRWISE COMPARISON MATRIX IN THE AHP
MULTIPLE CRITERIA DECISION MAKING Vol. 11 2016 Sławomir Jarek * REMOVING INCONSISTENCY IN PAIRWISE COMPARISON MATRIX IN THE AHP DOI: 10.22367/mcdm.2016.11.05 Abstract The Analytic Hierarchy Process (AHP)
More informationTHE IMPACT ON SCALING ON THE PAIR-WISE COMPARISON OF THE ANALYTIC HIERARCHY PROCESS
ISAHP 200, Berne, Switzerland, August 2-4, 200 THE IMPACT ON SCALING ON THE PAIR-WISE COMPARISON OF THE ANALYTIC HIERARCHY PROCESS Yuji Sato Department of Policy Science, Matsusaka University 846, Kubo,
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationJUST THE MATHS UNIT NUMBER 9.9. MATRICES 9 (Modal & spectral matrices) A.J.Hobson
JUST THE MATHS UNIT NUMBER 9.9 MATRICES 9 (Modal & spectral matrices) by A.J.Hobson 9.9. Assumptions and definitions 9.9.2 Diagonalisation of a matrix 9.9.3 Exercises 9.9.4 Answers to exercises UNIT 9.9
More informationDimensionality Reduction: PCA. Nicholas Ruozzi University of Texas at Dallas
Dimensionality Reduction: PCA Nicholas Ruozzi University of Texas at Dallas Eigenvalues λ is an eigenvalue of a matrix A R n n if the linear system Ax = λx has at least one non-zero solution If Ax = λx
More informationLinear Algebra. and
Instructions Please answer the six problems on your own paper. These are essay questions: you should write in complete sentences. 1. Are the two matrices 1 2 2 1 3 5 2 7 and 1 1 1 4 4 2 5 5 2 row equivalent?
More information22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationInternational Journal of Mathematics Trends and Technology (IJMTT) Volume 51 Number 5 November 2017
A Case Study of Multi Attribute Decision Making Problem for Solving Intuitionistic Fuzzy Soft Matrix in Medical Diagnosis R.Rathika 1 *, S.Subramanian 2 1 Research scholar, Department of Mathematics, Prist
More informationSolving Fully Fuzzy Linear Systems with Trapezoidal Fuzzy Number Matrices by Singular Value Decomposition
Intern. J. Fuzzy Mathematical Archive Vol. 3, 23, 6-22 ISSN: 232 3242 (P), 232 325 (online) Published on 8 November 23 www.researchmathsci.org International Journal of Solving Fully Fuzzy Linear Systems
More informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationIncomplete Pairwise Comparison Matrices and Weighting Methods
Incomplete Pairwise Comparison Matrices and Weighting Methods László Csató Lajos Rónyai arxiv:1507.00461v2 [math.oc] 27 Aug 2015 August 28, 2015 Abstract A special class of preferences, given by a directed
More informationUncertainty and Rules
Uncertainty and Rules We have already seen that expert systems can operate within the realm of uncertainty. There are several sources of uncertainty in rules: Uncertainty related to individual rules Uncertainty
More informationDiagonalization by a unitary similarity transformation
Physics 116A Winter 2011 Diagonalization by a unitary similarity transformation In these notes, we will always assume that the vector space V is a complex n-dimensional space 1 Introduction A semi-simple
More informationDesigning Information Devices and Systems I Discussion 4B
Last Updated: 29-2-2 9:56 EECS 6A Spring 29 Designing Information Devices and Systems I Discussion 4B Reference Definitions: Matrices and Linear (In)Dependence We ve seen that the following statements
More informationVasiliy Saiko Institute for Entrepreneurship Strategy, Zhovty Vody, Ukraine
Specific Characteristics of Applying the Paired Comparison Method for Parameterization of Consumer Wants Vasiliy Saiko Institute for Entrepreneurship Strategy, Zhovty Vody, Ukraine ABSTRACT. The article
More informationPREFERENCE MATRICES IN TROPICAL ALGEBRA
PREFERENCE MATRICES IN TROPICAL ALGEBRA 1 Introduction Hana Tomášková University of Hradec Králové, Faculty of Informatics and Management, Rokitanského 62, 50003 Hradec Králové, Czech Republic e-mail:
More informationTopic 1: Matrix diagonalization
Topic : Matrix diagonalization Review of Matrices and Determinants Definition A matrix is a rectangular array of real numbers a a a m a A = a a m a n a n a nm The matrix is said to be of order n m if it
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationCanonical lossless state-space systems: staircase forms and the Schur algorithm
Canonical lossless state-space systems: staircase forms and the Schur algorithm Ralf L.M. Peeters Bernard Hanzon Martine Olivi Dept. Mathematics School of Mathematical Sciences Projet APICS Universiteit
More information22m:033 Notes: 7.1 Diagonalization of Symmetric Matrices
m:33 Notes: 7. Diagonalization of Symmetric Matrices Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman May 3, Symmetric matrices Definition. A symmetric matrix is a matrix
More information22.4. Numerical Determination of Eigenvalues and Eigenvectors. Introduction. Prerequisites. Learning Outcomes
Numerical Determination of Eigenvalues and Eigenvectors 22.4 Introduction In Section 22. it was shown how to obtain eigenvalues and eigenvectors for low order matrices, 2 2 and. This involved firstly solving
More informationInverse Eigenvalue Problems for Two Special Acyclic Matrices
mathematics Communication Inverse Eigenvalue Problems for Two Special Acyclic Matrices Debashish Sharma, *, and Mausumi Sen, Department of Mathematics, Gurucharan College, College Road, Silchar 788004,
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationChapter 3 Transformations
Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases
More informationTropical Optimization Framework for Analytical Hierarchy Process
Tropical Optimization Framework for Analytical Hierarchy Process Nikolai Krivulin 1 Sergeĭ Sergeev 2 1 Faculty of Mathematics and Mechanics Saint Petersburg State University, Russia 2 School of Mathematics
More informationDecision-Making with the AHP: Why is The Principal Eigenvector Necessary
Decision-Making with the AHP: Why is The Principal Eigenvector Necessary Thomas L. Saaty Keywords: complex order, consistent, near consistent, priority, principal eigenvector Summary: We will show here
More informationANALYTIC HIERARCHY PROCESS (AHP)
ANALYTIC HIERARCHY PROCESS (AHP) PAIRWISE COMPARISON Is it or less important? How much or less important is it? equal equal equal equal equal equal PAIRWISE COMPARISON Is it or less important? How much
More informationConditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina
Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic
More informationAdvanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur
Advanced Engineering Mathematics Prof. Pratima Panigrahi Department of Mathematics Indian Institute of Technology, Kharagpur Lecture No. #07 Jordan Canonical Form Cayley Hamilton Theorem (Refer Slide Time:
More informationJim Lambers MAT 610 Summer Session Lecture 2 Notes
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 2 Notes These notes correspond to Sections 2.2-2.4 in the text. Vector Norms Given vectors x and y of length one, which are simply scalars x and y, the
More informationType-2 Fuzzy Shortest Path
Intern. J. Fuzzy Mathematical rchive Vol. 2, 2013, 36-42 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 15 ugust 2013 www.researchmathsci.org International Journal of Type-2 Fuzzy Shortest Path V.
More informationCombinatorial Types of Tropical Eigenvector
Combinatorial Types of Tropical Eigenvector arxiv:1105.55504 Ngoc Mai Tran Department of Statistics, UC Berkeley Joint work with Bernd Sturmfels 2 / 13 Tropical eigenvalues and eigenvectors Max-plus: (R,,
More informationORDER STABILITY ANALYSIS OF RECIPROCAL JUDGMENT MATRIX
ISAHP 003, Bali, Indonesia, August 7-9, 003 ORDER STABILITY ANALYSIS OF RECIPROCAL JUDGMENT MATRIX Mingzhe Wang a Danyi Wang b a Huazhong University of Science and Technology, Wuhan, Hubei 430074 - P.
More informationInternational Journal of Information Technology & Decision Making c World Scientific Publishing Company
International Journal of Information Technology & Decision Making c World Scientific Publishing Company A MIN-MAX GOAL PROGRAMMING APPROACH TO PRIORITY DERIVATION IN AHP WITH INTERVAL JUDGEMENTS DIMITRIS
More informationRecall : Eigenvalues and Eigenvectors
Recall : Eigenvalues and Eigenvectors Let A be an n n matrix. If a nonzero vector x in R n satisfies Ax λx for a scalar λ, then : The scalar λ is called an eigenvalue of A. The vector x is called an eigenvector
More informationInverse Sensitive Analysis of Pairwise Comparison Matrices
Inverse Sensitive Analysis of Pairwise Comparison Matrices Kouichi TAJI Keiji Matsumoto October 18, 2005, Revised September 5, 2006 Abstract In the analytic hierarchy process (AHP), the consistency of
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationClassification: Linear Discriminant Analysis
Classification: Linear Discriminant Analysis Discriminant analysis uses sample information about individuals that are known to belong to one of several populations for the purposes of classification. Based
More informationAppendix A: Matrices
Appendix A: Matrices A matrix is a rectangular array of numbers Such arrays have rows and columns The numbers of rows and columns are referred to as the dimensions of a matrix A matrix with, say, 5 rows
More informationName Solutions Linear Algebra; Test 3. Throughout the test simplify all answers except where stated otherwise.
Name Solutions Linear Algebra; Test 3 Throughout the test simplify all answers except where stated otherwise. 1) Find the following: (10 points) ( ) Or note that so the rows are linearly independent, so
More informationx y = 1, 2x y + z = 2, and 3w + x + y + 2z = 0
Section. Systems of Linear Equations The equations x + 3 y =, x y + z =, and 3w + x + y + z = 0 have a common feature: each describes a geometric shape that is linear. Upon rewriting the first equation
More informationRule-Based Fuzzy Model
In rule-based fuzzy systems, the relationships between variables are represented by means of fuzzy if then rules of the following general form: Ifantecedent proposition then consequent proposition The
More informationEIGENVALUES AND SINGULAR VALUE DECOMPOSITION
APPENDIX B EIGENVALUES AND SINGULAR VALUE DECOMPOSITION B.1 LINEAR EQUATIONS AND INVERSES Problems of linear estimation can be written in terms of a linear matrix equation whose solution provides the required
More informationFall TMA4145 Linear Methods. Exercise set Given the matrix 1 2
Norwegian University of Science and Technology Department of Mathematical Sciences TMA445 Linear Methods Fall 07 Exercise set Please justify your answers! The most important part is how you arrive at an
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
More informationRepeated Eigenvalues and Symmetric Matrices
Repeated Eigenvalues and Symmetric Matrices. Introduction In this Section we further develop the theory of eigenvalues and eigenvectors in two distinct directions. Firstly we look at matrices where one
More informationA Novel Approach to Decision-Making with Pythagorean Fuzzy Information
mathematics Article A Novel Approach to Decision-Making with Pythagorean Fuzzy Information Sumera Naz 1, Samina Ashraf 2 and Muhammad Akram 1, * ID 1 Department of Mathematics, University of the Punjab,
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationLecture 1 and 2: Random Spanning Trees
Recent Advances in Approximation Algorithms Spring 2015 Lecture 1 and 2: Random Spanning Trees Lecturer: Shayan Oveis Gharan March 31st Disclaimer: These notes have not been subjected to the usual scrutiny
More informationLinear Algebra: Matrix Eigenvalue Problems
CHAPTER8 Linear Algebra: Matrix Eigenvalue Problems Chapter 8 p1 A matrix eigenvalue problem considers the vector equation (1) Ax = λx. 8.0 Linear Algebra: Matrix Eigenvalue Problems Here A is a given
More information5 Linear Algebra and Inverse Problem
5 Linear Algebra and Inverse Problem 5.1 Introduction Direct problem ( Forward problem) is to find field quantities satisfying Governing equations, Boundary conditions, Initial conditions. The direct problem
More informationIncompatibility Paradoxes
Chapter 22 Incompatibility Paradoxes 22.1 Simultaneous Values There is never any difficulty in supposing that a classical mechanical system possesses, at a particular instant of time, precise values of
More informationContents. 1 Vectors, Lines and Planes 1. 2 Gaussian Elimination Matrices Vector Spaces and Subspaces 124
Matrices Math 220 Copyright 2016 Pinaki Das This document is freely redistributable under the terms of the GNU Free Documentation License For more information, visit http://wwwgnuorg/copyleft/fdlhtml Contents
More informationDistributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 55, NO. 9, SEPTEMBER 2010 1987 Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE Abstract
More informationSolving Systems of Equations Row Reduction
Solving Systems of Equations Row Reduction November 19, 2008 Though it has not been a primary topic of interest for us, the task of solving a system of linear equations has come up several times. For example,
More informationMetoda porównywania parami
Metoda porównywania parami Podejście HRE Konrad Kułakowski Akademia Górniczo-Hutnicza 24 Czerwiec 2014 Advances in the Pairwise Comparisons Method Heuristic Rating Estimation Approach Konrad Kułakowski
More information(1) for all (2) for all and all
8. Linear mappings and matrices A mapping f from IR n to IR m is called linear if it fulfills the following two properties: (1) for all (2) for all and all Mappings of this sort appear frequently in the
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationLinear Algebra Review. Fei-Fei Li
Linear Algebra Review Fei-Fei Li 1 / 51 Vectors Vectors and matrices are just collections of ordered numbers that represent something: movements in space, scaling factors, pixel brightnesses, etc. A vector
More informationELE/MCE 503 Linear Algebra Facts Fall 2018
ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2
More informationStudy Notes on Matrices & Determinants for GATE 2017
Study Notes on Matrices & Determinants for GATE 2017 Matrices and Determinates are undoubtedly one of the most scoring and high yielding topics in GATE. At least 3-4 questions are always anticipated from
More information15 Singular Value Decomposition
15 Singular Value Decomposition For any high-dimensional data analysis, one s first thought should often be: can I use an SVD? The singular value decomposition is an invaluable analysis tool for dealing
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationlinearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice
3. Eigenvalues and Eigenvectors, Spectral Representation 3.. Eigenvalues and Eigenvectors A vector ' is eigenvector of a matrix K, if K' is parallel to ' and ' 6, i.e., K' k' k is the eigenvalue. If is
More informationA Consistency Based Procedure to Estimate Missing Pairwise Preference Values
A Consistency Based Procedure to Estimate Missing Pairwise Preference Values S. Alonso F. Chiclana F. Herrera E. Herrera-Viedma J. Alcalá-Fernádez C. Porcel Abstract In this paper, we present a procedure
More informationModeling dependence and feedback in ANP with fuzzy cognitive maps Jiří Mazurek 1, Zuzana Kiszová 2
roceedings of th International Conference Mathematical Methods in conomics Introduction Modeling dependence and feedback in N with fuzzy cognitive maps Jiří Mazurek, Zuzana Kiszová bstract: The obective
More informationShortest paths with negative lengths
Chapter 8 Shortest paths with negative lengths In this chapter we give a linear-space, nearly linear-time algorithm that, given a directed planar graph G with real positive and negative lengths, but no
More informationUsing Markov Chains To Model Human Migration in a Network Equilibrium Framework
Using Markov Chains To Model Human Migration in a Network Equilibrium Framework Jie Pan Department of Mathematics and Computer Science Saint Joseph s University Philadelphia, PA 19131 Anna Nagurney School
More informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationSolution of a Distributed Linear System Stabilisation Problem
Solution of a Distributed Linear System Stabilisation Problem NICTA Linear Systems Workshop ANU Brian Anderson (ANU/NICTA) with contributions from: Brad Yu, Baris Fidan, Soura Dasgupta, Steve Morse Overview
More informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationAALBORG UNIVERSITY. Directed strongly regular graphs with rank 5. Leif Kjær Jørgensen. Department of Mathematical Sciences. Aalborg University
AALBORG UNIVERSITY Directed strongly regular graphs with ran 5 by Leif Kjær Jørgensen R-2014-05 May 2014 Department of Mathematical Sciences Aalborg University Fredri Bajers Vej G DK - 9220 Aalborg Øst
More informationMATH 2030: MATRICES ,, a m1 a m2 a mn If the columns of A are the vectors a 1, a 2,...,a n ; A is represented as A 1. .
MATH 030: MATRICES Matrix Operations We have seen how matrices and the operations on them originated from our study of linear equations In this chapter we study matrices explicitely Definition 01 A matrix
More informationData Preprocessing Tasks
Data Tasks 1 2 3 Data Reduction 4 We re here. 1 Dimensionality Reduction Dimensionality reduction is a commonly used approach for generating fewer features. Typically used because too many features can
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information