• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.61-71
• /
• 2020

Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

• The Pure and Applied Mathematics
• /
• v.8 no.2
• /
• pp.153-162
• /
• 2001

In this Paper, the notion of $\varepsilon$-Birkhoff orthogonality introduced by Dragomir [An. Univ. Timisoara Ser. Stiint. Mat. 29(1991), no. 1, 51-58] in normed linear spaces has been extended to metric linear spaces and a decomposition theorem has been proved. Some results of Kainen, Kurkova and Vogt [J. Approx. Theory 105 (2000), no. 2, 252-262] proved on e-near best approximation in normed linear spaces have also been extended to metric linear spaces. It is shown that if (X, d) is a convex metric linear space which is pseudo strictly convex and M a boundedly compact closed subset of X such that for each $\varepsilon$>0 there exists a continuous $\varepsilon$-near best approximation $\phi$ : X → M of X by M then M is a chebyshev set .

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.497-512
• /
• 2021

In this paper, we study the analytical and approximate solutions for a fractional quadratic integral equation involving Katugampola fractional integral operator. The existence and uniqueness results obtained in the given arrangement are not only new but also yield some new particular results corresponding to special values of the parameters 𝜌 and ϑ. The main results are obtained by using Banach fixed point theorem, Picard Method, and Adomian decomposition method. An illustrative example is given to justify the main results.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1563-1567
• /
• 2021

We show that if M is a Utumi module, in particular if M is quasi-continuous, then M = Q ⊕ K, where Q is quasi-injective that is both a square-full as well as a dual-square-full module, K is a square-free module, and Q & K are orthogonal. Dually, we also show that if M is a dual-Utumi module whose local summands are summands, in particular if M is quasi-discrete, then M = P ⊕ K where P is quasi-projective that is both a square-full as well as a dual-square-full module, K is a dual-square-free module, and P & K are factor-orthogonal.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.4
• /
• pp.989-1004
• /
• 2023

In this paper, we are motivated to evaluate and investigate the necessary conditions for the fractional Volterra Fredholm integro-differential equation involving the ς-Hilfer fractional derivative. The given problem is converted into an equivalent fixed point problem by introducing an operator whose fixed points coincide with the solutions to the problem at hand. The existence and uniqueness results for the given problem are derived by applying Krasnoselskii and Banach fixed point theorems respectively. Furthermore, we investigate the convergence of approximated solutions to the same problem using the modified Adomian decomposition method. An example is provided to illustrate our findings.

• School Mathematics
• /
• v.12 no.3
• /
• pp.371-388
• /
• 2010

The goals of this study are to inquire middle school students' understanding about prime number and to propose pedagogical implications for school mathematics. Written questionnaire were given to 198 Korean seventh graders who had just finished learning about prime number and prime factorization and then 20 students participated in individual interviews for member checks. In defining prime and composite numbers, the students focused on distinguishing one from another by numbering of factors of agiven natural number. However, they hardly recognize the mathematical connection between prime and composite numbers related on the multiplicative structure of natural number. This study suggests that it is needed to emphasize the conceptual relationship between divisibility and prime decomposition and the prime numbers as the multiplicative building blocks of natural numbers based on the Fundamental Theorem of Arithmetic.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.288-307
• /
• 2013

This paper formulates resource allocation for decode-and-forward (DF) relay assisted multi-cell orthogonal frequency division multiple (OFDM) networks as an optimization problem taking into account of inter-cell interference and users fairness. To maximize the transmit rate of system we propose a joint interference coordination, subcarrier and power allocation algorithm. To reduce the complexity, this semi-distributed algorithm divides the primal optimization into three sub-optimization problems, which transforms the mixed binary nonlinear programming problem (BNLP) into standard convex optimization problems. The first layer optimization problem is used to get the optimal subcarrier distribution index. The second is to solve the problem that how to allocate power optimally in a certain subcarrier distribution order. Based on the concept of equivalent channel gain (ECG) we transform the max-min function into standard closed expression. Subsequently, with the aid of dual decomposition, water-filling theorem and iterative power allocation algorithm the optimal solution of the original problem can be got with acceptable complexity. The third sub-problem considers dynamic co-channel interference caused by adjacent cells and redistributes resources to achieve the goal of maximizing system throughput. Finally, simulation results are provided to corroborate the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1493-1499
• /
• 2009

Let $A_1$ and $A_2$ be nonzero complex idempotent and tripotent matrix, respectively. Denote a linear combination of the two matrices by A = $c_1A_1$ + $c_2A_2$, where $c_1,\;c_2$ are nonzero complex scalars. In this paper, under an assumption of $A_1A_2$ = $A_2A_1$, we characterize all situations in which the linear combination is tripotent. A statistical interpretation of this tripotent problem is also pointed out. Moreover, In [2], Baksalary characterized all situations in which the above linear combination is idem-potent by using the property of decomposition of a tripotent matrix, i.e. if $A_2$ is tripotent, then $A_2$ = $B_1-B_2$, where $B^2_i=B_i$, i = 1, 2 and $B_1B_2=B_2B_1=0$. While in this paper, by utilizing a method different from the one used by Baksalary in [2], we prove the theorem 1 in [2] again.

• Journal of the Society of Naval Architects of Korea
• /
• v.32 no.3
• /
• pp.62-71
• /
• 1995

In the numerical analysis of incompressible unsteady Navier-stokes equation, large time is required for solving the pressure Poisson equation of the elliptic type at each time step. In this paper, a numerical analysis by the direct method is carried out to solve the pressure Poisson equation and the computing time is analyzed as mesh size increases. The pressure Poisson equation can be transformed to the boundary value problem by the Green theorem. The computing time for the convolution type of the domain integral can be reduced by using F.F.T. and the computing time in the direct method depends entirely on obtaining the solution of the boundary value problem. The numerical analysis on the known solutions is carried out and compared for the verification of the direct method. And the numerical analysis on the body boundary and domain decomposition problem are carried out with the computing time less than O($n^{3}$) in the (n.n) mesh.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.324-329
• /
• 2003

The public-key cryptosystems such as Diffie-Hellman Key Distribution and Elliptical Curve Cryptosystems are built on the basis of the operations defined in GF(2$^{m}$ ):addition, subtraction, multiplication and multiplicative inversion. It is important that these operations should be computed at high speed in order to implement these cryptosystems efficiently. Among those operations, as being the most time-consuming, multiplicative inversion has become the object of lots of investigation Formant's theorem says $\beta$$^{-1}$ =$\beta$$^{2}$sup m/-2/, where $\beta$$^{-1}$ is the multiplicative inverse of $\beta$$\in$GF(2$^{m}$ ). Therefore, to compute the multiplicative inverse of arbitrary elements of GF(2$^{m}$ ), it is most important to reduce the number of times of multiplication by decomposing 2$^{m}$ -2 efficiently. Among many algorithms relevant to the subject, the algorithm proposed by Itoh and Tsujii[2] has reduced the required number of times of multiplication to O(log m) by using normal basis. Furthermore, a few papers have presented algorithms improving the Itoh and Tsujii's. However they have some demerits such as complicated decomposition processes[3,5]. In this paper, in the case of 2$^{m}$ -2, which is mainly used in practical applications, an efficient algorithm is proposed for computing the multiplicative inverse at high speed by using both the factorization formula x$^3$-y$^3$=(x-y)(x$^2$＋xy＋y$^2$) and normal basis. The number of times of multiplication of the algorithm is smaller than that of the algorithm proposed by Itoh and Tsujii. Also the algorithm decomposes 2$^{m}$ -2 more simply than other proposed algorithms.