• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.111-133
• /
• 2000

A Legendre spectral tau approximation scheme for solving the two-dimensional stationary incompressible Stokes equations is considered. Based on the vorticity-stream function formulation and variational forms, boundary value and normal derivative of vorticity are computed. A factorization technique for matrix stems based on the Schur decomposition is derived. Several numerical experiments are performed.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.265-275
• /
• 1992

The characteristic free representation theory of the general linear group has found a wide range of applications, ranging from the theory of free resolutions to the symmetric function theory. Representation theory is used to facilitate the calculation of explicit free resolutions of large classes of ideals (and modules). Recently, K. Akin and D. A. Buchsbaum [2] realized the Jacobi-Trudi identity for a Schur function as a resolution of GL$_{n}$-modules. Over a field of characteristic zero, it was observed by A. Lascoux [6]. T.Jozefiak and J.Weyman [5] used the Koszul complex to realize a formula of D.E. Littlewood as a resolution of schur modules. This leads us to further study resolutions of Schur modules of a particular form. In this article we will describe some new classes of finite free resolutions associated to the Pieri type skew Young diagrams. As a special case of these finite free resolutions we obtain the generalized Koszul complex constructed in [1]. In section 2 we review some of the basic difinitions and properties of Schur modules that we shall use. In section 3 we describe certain exact complexes associated to the Pieri type skew partitions. Throughout this article, unless otherwise specified, R is a commutative ring with an identity element and a mudule F is a finitely generated free R-module.e.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.617-625
• /
• 2011

In [6], it was shown that hyponormality for Toeplitz operators with polynomial symbols can be reduced to classical Schur's algorithm in function theory. In [6], Zhu has also given the explicit values of the Schur's functions ${\Phi}_0$, ${\Phi}_1$ and ${\Phi}_2$. Here we explicitly evaluate the Schur's function ${\Phi}_3$. Using this value we find necessary and sufficient conditions under which the Toeplitz operator $T_{\varphi}$ is hyponormal, where ${\varphi}$ is a trigonometric polynomial given by ${\varphi}(z)$ = ${\sum}^N_{n=-N}a_nz_n(N{\geq}4)$ and satisfies the condition $\bar{a}_N\(\array{a_{-1}\\a_{-2}\\a_{-4}\\{\vdots}\\a_{-N}}\)=a_{-N}\;\(\array{\bar{a}_1\\\bar{a}_2\\\bar{a}_4\\{\vdots}\\\bar{a}_N}\)$. Finally we illustrate the easy applicability of the derived results with a few examples.

• Journal of the Korean Mathematical Society
• /
• v.56 no.4
• /
• pp.947-984
• /
• 2019

We provide two shifted analogues of the tableau switching process due to Benkart, Sottile, and Stroomer; the shifted tableau switching process and the modified shifted tableau switching process. They are performed by applying a sequence of elementary transformations called switches and shares many nice properties with the tableau switching process. For instance, the maps induced from these algorithms are involutive and behave very nicely with respect to the lattice property. We also introduce shifted generalized evacuation which exactly agrees with the shifted J-operation due to Worley when applied to shifted Young tableaux of normal shape. Finally, as an application, we give combinatorial interpretations of Schur P- and Schur Q-function related identities.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.28-35
• /
• 2013

The Krylov-Schur algorithm has been applied to reveal the eigen-properties of the wave guide having the square cross section. The eigen-matrix equation has been constructed from FEM with the basis function of the tangential edge-vectors of the triangular element. This equation has been treated firstly with Arnoldi decomposition to obtain a upper Hessenberg matrix. The QR algorithm has been carried out to transform it into Schur form. The several eigen values satisfying the convergent condition have appeared in the diagonal components. The eigen-modes for them have been calculated from the inverse iteration method. The wanted eigen-pairs have been reordered in the leading principle sub-matrix of the Schur matrix. This sub-matrix has been deflated from the eigen-matrix equation for the subsequent search of other eigen-pairs. These processes have been conducted several times repeatedly. As a result, a few primary eigen-pairs of TE and TM modes have been obtained with sufficient reliability.

• Korean Journal of Mathematics
• /
• v.22 no.2
• /
• pp.325-337
• /
• 2014

In 1911 Schur[6] derived degree and character formulas for projective representations of the symmetric groups remarkably similar to the corresponding formulas for ordinary representations. Morris[3] derived a recurrence for evaluation of spin characters and Stembridge[8] gave a combinatorial reformulation for Morris' recurrence. In this paper we give combinatorial interpretations for the orthogonality relations of spin characters based on Stembridge's combinatorial reformulation for Morris' rule.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.44.1-44
• /
• 2002

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of a guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and upper bound of guaranteed cost function can be obtained simultaneously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3761-3779
• /
• 2022

The performance of existing recognition algorithms for binary phase shift keying (BPSK) and quadrature phase shift keying (QPSK) signals degrade under conditions of low signal-to-noise ratios (SNR). Hence, a novel recognition algorithm based on features in the graph domain is proposed in this study. First, the power spectrum of the squared candidate signal is truncated by a rectangular window. Thereafter, the graph representation of the truncated spectrum is obtained via normalization, quantization, and edge construction. Based on the analysis of the connectivity difference of the graphs under different hypotheses, the sum of degree (SD) of the graphs is utilized as a discriminate feature to classify BPSK and QPSK signals. Moreover, we prove that the SD is a Schur-concave function with respect to the probability vector of the vertices (PVV). Extensive simulations confirm the effectiveness of the proposed algorithm, and its superiority to the listed model-driven-based (MDB) algorithms in terms of recognition performance under low SNRs and computational complexity. As it is confirmed that the proposed method reduces the computational complexity of existing graph-based algorithms, it can be applied in modulation recognition of radar or communication signals in real-time processing, and does not require any prior knowledge about the training sets, channel coefficients, or noise power.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1623-1626
• /
• 1991

The paper considers the algorithms of balanced realization from SISO transfer functions. Some methods which have been proposed to find a balanced realization from the companion form realization, are investigated. Then a new method is proposed which finds a balanced realization from the discrete Schwarz form realization. The process of computing the elements of Schwarz matrix from the transfer function is equivalent to the Schur-Cohn stability test procedure. Comparison of the proposed method with the previous works is also discussed.

• The Pure and Applied Mathematics
• /
• v.22 no.3
• /
• pp.245-261
• /
• 2015

The notion of a parabolically semistandard tableau is a generalisation of Young tableau, which explains combinatorial aspect of various Howe dualities of type A. We prove a Jacobi-Trudi type formula for the character of parabolically semistandard tableaux of a given generalised partition shape by using non-intersecting lattice paths.