The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...

Ž . ABSTRACT: The Kohn]Sham KS procedure for variational minimization of the Hohenberg]Kohn density functional utilizes a one-particle reduced density matrix of assumed diagonal form, hence depends implicitly on a set of auxiliary states. Originally, the auxiliary state was assumed to be a single determinant with doubly occupied spin orbitals, i.e., of the same form as in ‘‘restricted’’ Hartree...

Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, called Sparse Spatial Selection (SSS). The main characteristic of this method is that it guarantees a good pivot selection more efficiently than other methods previously proposed. In addition, SSS adapts itself to the di...

The construction of auxiliary matrices for the six-vertex model at a root of unity is investigated from a quantum group theoretic point of view. Employing the concept of intertwiners associated with the quantum loop algebra Uq(s̃l2) at qN = 1 a three parameter family of auxiliary matrices is constructed. The elements of this family satisfy a functional relation with the transfer matrix allowing ...

The construction of auxiliary matrices for the six-vertex model at a root of unity is investigated from a quantum group theoretic point of view. Employing the concept of intertwiners associated with the quantum loop algebra Uq(s̃l2) at q N = 1 a three parameter family of auxiliary matrices is constructed. The elements of this family satisfy a functional relation with the transfer matrix allowing...

Given a rectangular m × n matrix stored as a two-dimensional array, we want to transpose it in place andmeasure the cost by the number of memory writes and the number of auxiliary cells used. We propose a transposition algorithm with optimal complexity O(mn) using only min(m, n) auxiliary memory cells. © 2009 Elsevier Inc. All rights reserved.

In the mid-eighties Tardos proposed a strongly polynomial algorithm for solving linear programming problems for which the size of the coefficient matrix is polynomially bounded in the dimension of the input. Combining Orlin’s primal-basedmodification andMizuno’s use of the simplex method, we introduce a modification of Tardos’ algorithm considering only the primal problem and using the simplex ...

A new parallel preconditioning algorithm for 3D nonconforming FEM elasticity systems is presented. The preconditioner is constructed in two steps. First displacement decomposition of the stiffness matrix is used. Than MIC(0) factorization is applied to a proper auxiliary M-matrix to get an approximate factorization of the obtained blockdiagonal matrix. The auxiliary matrix has a special block s...

The aim of this paper is to develop a methodology for solving matrix games with payoffs of trapezoidal intuitionistic fuzzy numbers (TrIFNs). In this methodology, the concepts of TrIFNs and solutions for matrix games with payoffs of TrIFNs are defined. Two new auxiliary intuitionistic fuzzy nonlinear programming models are hereby constructed to solve matrix games with payoffs of TrIFNs. Using a...