• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.7
• /
• pp.523-528
• /
• 2000

In this short note the characteristics of a nonlinear system of which the state trajectories are oscillating in the phase plane are overviewed. The physical concept of stuck and sliding patch phenomena are also introduced by adding some switching functions and their stability on the sliding patches are analyzed by using the Lyapunov stability theory and Frobenius theorem.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.165-174
• /
• 2012

In this paper, we construct a p-adic analogue of multiple Riemann zeta values and express their values at non-positive integers. In particular, we obtain a new congruence of the higher order Frobenius-Euler numbers and the Kummer congruences for the Bernoulli numbers as a corollary.

• Journal of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.1087-1103
• /
• 2009

Given a system of s independent 1-forms on a smooth manifold M of dimension m, we study the existence of integral manifolds by means of various generalized versions of the Frobenius theorem. In particular, we present necessary and sufficient conditions for there to exist s'-parameter (s' < s) family of integral manifolds of dimension p := m-s, and a necessary and sufficient condition for there to exist integral manifolds of dimension p', p' $\leq$ p. We also present examples and applications to complex analysis in several variables.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.219-236
• /
• 2021

Let �� be a weighted projective line defined over the algebraic closure $k={\bar{\mathbb{F}}}_q$ of the finite field ��q and σ be a weight permutation of ��. By folding the category coh-�� of coherent sheaves on �� in terms of the Frobenius twist functor induced by σ, we obtain an ��q-category, denoted by coh-(��, σ; q). We then prove that coh-(��, σ; q) is derived equivalent to the valued canonical algebra associated with (��, σ).

• Kyungpook Mathematical Journal
• /
• v.61 no.4
• /
• pp.845-858
• /
• 2021

We present new bounds for the numerical radius of bounded linear operators and 2 × 2 operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new estimations for the zeros of that polynomial. We also show with numerical examples that our new estimations improve on the existing estimations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.8
• /
• pp.917-920
• /
• 2016

SpSF algorithm is direction-of-arrival estimation algorithm based on sparse representation of incident signlas. Cost function to be optimized for DOA estimation is multi-dimensional nonlinear function, which is hard to handle for optimization. After some manipulation, the problem can be cast into convex optimiztion problem. Convex optimization problem tuns out to be constrained optimization problem, where the parameter in the constraint has to be determined. The solution of the convex optimization problem is dependent on the specific parameter value in the constraint. In this paper, we propose a rule-of-thumb for determining the parameter value in the constraint. Based on the fact that the noise in the array elements is complex Gaussian distributed with zero mean, the average of the Frobenius norm of the matrix in the constraint can be rigorously derived. The parameter in the constrint is set to be two times the average of the Frobenius norm of the matrix in the constraint. It is shown that the SpSF algorithm actually works with the parameter value set by the method proposed in this paper.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.65-76
• /
• 2005

Speeding up scalar multiplication of an elliptic curve point has been a prime approach to efficient implementation of elliptic curve schemes such as EC-DSA and EC-ElGamal. Koblitz introduced a $base-{\phi}$ expansion method using the Frobenius map. Kobayashi et al. extended the $base-{\phi}$ scalar multiplication method to suit Optimal Extension Fields(OEF) by introducing the table reference method. In this paper we propose an efficient scalar multiplication algorithm on elliptic curve over OEF. The proposed $base-{\phi}$ scalar multiplication method uses an optimized batch technique after rearranging the computation sequence of $base-{\phi}$ expansion usually called Horner's rule. The simulation results show that the new method accelerates the scalar multiplication about $20\%{\sim}40\%$ over the Kobayashi et al. method and is about three times as fast as some conventional scalar multiplication methods.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.5
• /
• pp.1133-1138
• /
• 2012

In the paper, design of nonlinear sliding surfaces which are based on optimal control is studied, The state trajectory by the input of optimal control was obtained by Frobenius theorem and matrix decomposition method, was set the nonlinear sliding surfaces of the system. The states is maintained to sliding surfaces from initial states. As the result, robustness of the system can be guaranteed throughout an entire response of the system starting form the initial time instance, the uncertainty and external disturbance that can occur during the reaching time is removed, the problem of large control input was solved, and setting the sliding surfaces optimal path was able to reduce the tracking time. The validity of the proposed control scheme is shown in computer simulation for inverted pendulum.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.237-252
• /
• 2002

We study the compatibility conditions and the existence of solutions or overdetermined PDE systems that admit complete prolongation. For a complete system of order k there exists a submanifold of the ($\kappa$-1)st jet space of unknown functions that is the largest possible set on which the initial conditions of ($\kappa$-1)st order may take values. There exists a unique solution for any initial condition that belongs to this set if and only if the complete system satisfies the compatibility conditions on the initial data set. We prove by applying the Frobenius theorem to a Pfaffian differential system associated with the complete prolongation.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.809-823
• /
• 2015

This paper is devoted to presenting a MacWilliams type identity for m-spotty RT weight enumerators of byte error control codes over finite commutative Frobenius rings, which can be used to determine the error-detecting and error-correcting capabilities of a code. This provides the relation between the m-spotty RT weight enumerator of the code and that of the dual code. We conclude the paper by giving three illustrations of the results.