• East Asian mathematical journal
• /
• 제39권3호
• /
• pp.279-290
• /
• 2023

We study divisibilities of elements in the q-commuting matrix C^(q). We first make a coefficient matrix Ĉ of C^(q) which is independent of q, study divisibilities over Ĉ and then retrieve our findings to C^(q). Finally we partition the C^(q) into 2 × 2 block matrices.

• Korean Journal of Mathematics
• /
• 제29권4호
• /
• pp.665-677
• /
• 2021

The main object of this study is to introduce the spaces $c_0({\hat{F}^q)$ and $c({\hat{F}^q)$ derived by the matrix ${\hat{F}^q$ which is the multiplication of Riesz matrix and Fibonacci matrix. Moreover, we find the 𝛼-, 𝛽-, 𝛾- duals of these spaces and give the characterization of matrix classes (${\Lambda}({\hat{F}^q)$, Ω) and (Ω, ${\Lambda}({\hat{F}^q)$) for 𝚲 ∈ {c₀, c} and Ω ∈ {ℓ₁, c₀, c, ℓ_∞}.

• Kyungpook Mathematical Journal
• /
• 제58권2호
• /
• pp.271-289
• /
• 2018

Let 0 < q < ${\infty}$. In this study, we introduce the spaces ${\mathcal{BV}}_q$ and ${\mathcal{LS}}_q$ of q-bounded variation double sequences and q-summable double series as the domain of four-dimensional backward difference matrix ${\Delta}$ and summation matrix S in the space ${\mathcal{L}}_q$ of absolutely q-summable double sequences, respectively. Also, we determine their ${\alpha}$- and ${\beta}-duals$ and give the characterizations of some classes of four-dimensional matrix transformations in the case 0 < q ${\leq}$ 1.

• 호남수학학술지
• /
• 제42권3호
• /
• pp.425-447
• /
• 2020

The family of q-Konhauser matrix polynomials have been extended to Konhauser matrix polynomials. The purpose of the present work is to show that an extension of the explicit forms, generating matrix functions, matrix recurrence relations and Rodrigues-type formula for these matrix polynomials are given, our desired results have been established and their applications are presented.

• 호남수학학술지
• /
• 제46권3호
• /
• pp.349-364
• /
• 2024

We give necessary and sufficient conditions for tripotency of the linear combination of the form aQ + bA, under some certain conditions imposed on Q and A, where Q is a nonzero quadratic matrix, A is a nonzero arbitrary matrix and a, b are nonzero complex numbers. Moreover, some examples illustrating the main results are given.

• 대한수학회보
• /
• 제51권3호
• /
• pp.739-763
• /
• 2014

In this paper, the nonlinear matrix equation $$X+\sum_{i=1}^{m}A_i^*X^{-q}A_i=Q(0<q{\leq}1)$$ is investigated. Some necessary conditions and sufficient conditions for the existence of positive definite solutions for the matrix equation are derived. Two iterative methods for the maximal positive definite solution are proposed. A perturbation estimate and an explicit expression for the condition number of the maximal positive definite solution are obtained. The theoretical results are illustrated by numerical examples.

• Korean Journal of Mathematics
• /
• 제24권4호
• /
• pp.681-691
• /
• 2016

In this note, we consider a generalized Fibonacci sequence {$q_n$}. We give a generating matrix for {$q_n$}. With the aid of this matrix, we derive and re-prove some properties involving terms of this sequence.

• 대한수학회보
• /
• 제55권2호
• /
• pp.431-448
• /
• 2018

This paper is concerned with the positive definite solutions of the nonlinear matrix equation $X-A^*{\bar{X}}^{-1}A=Q$, where A, Q are given complex matrices with Q positive definite. We show that such a matrix equation always has a unique positive definite solution and if A is nonsingular, it also has a unique negative definite solution. Moreover, based on Sherman-Morrison-Woodbury formula, we derive elegant relationships between solutions of $X-A^*{\bar{X}}^{-1}A=I$ and the well-studied standard nonlinear matrix equation $Y+B^*Y^{-1}B=Q$, where B, Q are uniquely determined by A. Then several effective numerical algorithms for the unique positive definite solution of $X-A^*{\bar{X}}^{-1}A=Q$ with linear or quadratic convergence rate such as inverse-free fixed-point iteration, structure-preserving doubling algorithm, Newton algorithm are proposed. Numerical examples are presented to illustrate the effectiveness of all the theoretical results and the behavior of the considered algorithms.

• 대한수학회지
• /
• 제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.

• 대한수학회보
• /
• 제50권6호
• /
• pp.2001-2011
• /
• 2013

Cho and Kim [4] have introduced the concept of the competition index of a digraph. Similarly, the competition index of an $n{\times}n$ Boolean matrix A is the smallest positive integer q such that $A^{q+i}(A^T)^{q+i}=A^{q+r+i}(A^T)^{q+r+i}$ for some positive integer r and every nonnegative integer i, where $A^T$ denotes the transpose of A. In this paper, we study the upper bound of the competition index of a Boolean matrix. Using the concept of Boolean rank, we determine the upper bound of the competition index of a nearly reducible Boolean matrix.