• 대한수학회보
• /
• 제37권2호
• /
• pp.401-409
• /
• 2000

In this paper, we determine the structure of ${\kappa}-potent$ elements and regular elements of the semigroup ${\Omega}_n$of doubly stochastic matrices of order n. In connection with this, we find the structure of the matrices X satisfying the equation AXA = A. From these, we determine a condition of a doubly stochastic matrix A whose Moore-Penrose generalized is also a doubly stochastic matrix.

• Korean Journal of Mathematics
• /
• 제11권2호
• /
• pp.155-160
• /
• 2003

In this paper we shall study the limit of the doubly stochastic matrices obtained from Boolean regular matrices.

• 호남수학학술지
• /
• 제35권2호
• /
• pp.211-223
• /
• 2013

We consider permanent function on the faces of the polytope of certain doubly stochastic matrices, whose nonzero entries coincide with those of fully indecomposable square (0, 1)-matrices containing identity submatrix. We determine the minimum permanents and minimizing matrices on the given faces of the polytope using the contraction method.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1143-1155
• /
• 2011

In this paper, we shall establish a new theorem on the existence and uniqueness of the solution to a backward doubly stochastic differential equations under a weaker condition than the Lipschitz coefficient. We also show a comparison theorem for this kind of equations.

• 대한수학회지
• /
• 제36권5호
• /
• pp.1009-1020
• /
• 1999

The minimum permanent and the set of minimizing matrices over the face of the polytope n of all doubly stochastic matrices of order n determined by any staircase matrix was determined in [4] in terms of some parameter called frame. A staircase matrix can be described very simply as a Ferrers matrix by its row sum vector. In this paper, some simple exposition of the permanent minimization problem over the faces determined by Ferrers matrices of the polytope of n are presented in terms of row sum vectors along with simple proofs.

• 대한수학회논문집
• /
• 제16권4호
• /
• pp.679-690
• /
• 2001

Doubly stochastic matrices are n$\times$n nonnegative ma-trices whose row and column sums are all 1. Convex polytope $\Omega$$_{n}$ of doubly stochastic matrices and more generally (R,S), so called transportation polytopes, are important since they form the domains for the transportation problems. A theorem by Birkhoff classifies the extremal matrices of , $\Omega$$_{n}$ and extremal matrices of transporta-tion polytopes (R,S) were all classified combinatorially. In this article, we consider signed version of $\Omega$$_{n}$ and (R.S), obtain signed Birkhoff theorem; we define a new class of convex polytopes (R,S), calculate their dimensions, and classify their extremal matrices, Moreover, we suggest an algorithm to express a matrix in (R,S) as a convex combination of txtremal matrices. We also give an example that a polytope of signed matrices is used as a domain for a decision problem. In this context of finite reflection(Coxeter) group theory, our generalization may also be considered as a generalization from type $A_{*}$ n/ to type B$_{n}$ D$_{n}$. n/.

• 대한수학회지
• /
• 제35권2호
• /
• pp.423-432
• /
• 1998

Let p, q be integers such that 2 $\leq$ p, q $\leq$ n, and let $D_{p, q}$ denote the matrix obtained from $I_{n}$, the identity matrix of order n, by replacing each of the first p columns by an all 1's vector and by replacing each of the first two rows and each of the last q-2 rows by an all 1's vector. In this paper the permanent minimization problem over the face, determined by the matrix $D_{p, q}$, of the polytope of all n $\times$ n doubly stochastic matrices is treated.d.

• 대한수학회보
• /
• 제41권2호
• /
• pp.199-211
• /
• 2004

For positive integers $\kappa$ and p$\geq$3, let(equation omitted) where $J_{p}$ is the p${\times}$p matrix whose entries are all 1. Then, we determine the minimum permanents and minimizing matrices over (1) the face of $\Omega$(D) and (2) the face of $\Omega$($D^{*}$), where (equation omitted).

• 대한수학회논문집
• /
• 제37권2호
• /
• pp.371-384
• /
• 2022

Fix an integer n ≥ 1. Then the simplex Π_n, Birkhoff polytope Ω_n, and Latin square polytope Λ_n each yield projective geometries obtained by identifying antipodal points on a sphere bounding a ball centered at the barycenter of the polytope. We investigate conditions for homogeneous coordinates of points in the projective geometries to locate exact vertices of the respective polytopes, namely crisp distributions, permutation matrices, and quasigroups or Latin squares respectively. In the latter case, the homogeneous conditions form a crucial part of a recent projective-geometrical approach to the study of orthogonality of Latin squares. Coordinates based on the barycenter of Ω_n are also suited to the analysis of generalized doubly stochastic matrices, observing that orthogonal matrices of this type form a subgroup of the orthogonal group.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1110-1122
• /
• 2018

This paper proposes an alternative method to evaluate the effect of wind power to the power system stability with small disturbance. Alternatively, available techniques for stability analysis of a power system based on deterministic methods are less accurate for high penetration of wind power. Numerical simulations of random behaviors are computationally expensive. A stochastic stability index (SSI) is proposed for the power system stability evaluation based on the theory of stochastic stability and energy function, specifically the stochastic derivative of the relative well-defined energy function and the critical energy. The SSI is implemented on the modified nine-bus system including wind turbines under different conditions. A doubly-fed induction generator (DFIG) wind turbine is characterized and modeled using measured wind data from several sites in Thailand. Each of the obtained wind power data is analyzed. The wind power effect is modeled considering the aggregated effect of wind turbines. With the proposed method, the system behavior is properly predicted and the stability is quantitatively evaluated with less computational effort compared with conventional numerical simulation methods.