http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A NEW APPROACH FOR ASYMPTOTIC STABILITY A SYSTEM OF THE NONLINEAR ORDINARY DIFFERENTIAL EQUATIONS
Effati, Sohrab,Nazemi, Ali Reza 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.25 No.1
In this paper, we use measure theory for considering asymptotically stable of an autonomous system [1] of first order nonlinear ordinary differential equations(ODE's). First, we define a nonlinear infinite-horizon optimal control problem related to the ODE. Then, by a suitable change of variable, we transform the problem to a finite-horizon nonlinear optimal control problem. Then, the problem is modified into one consisting of the minimization of a linear functional over a set of positive Radon measures. The optimal measure is approximated by a finite combination of atomic measures and the problem converted to a finite-dimensional linear programming problem. The solution to this linear programming problem is used to find a piecewise-constant control, and by using the approximated control signals, we obtain the approximate trajectories and the error functional related to it. Finally the approximated trajectories and error functional is used to for considering asymptotically stable of the original problem.
Jae Ug Jeong 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.1
In this paper, we introduce and study a class of completely generalized quasi-variational inclusions with fuzzy mappings. A new iterative algorithm for finding the approximate solutions and the convergence criteria of the iterative sequences generated by the algorithm are also given. These results of existence,algorithm and convergence generalize many known results.
SEVERAL NEW PRACTICAL CRITERIA FOR NONSINGULAR H-MATRICES
Hongmin Mo 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.3
H-matrix is a special class of matrices with wide applications in engineering and scientific computation,how to judge if a given matrix is an H-matrix is very important,especially for large scale matrices.In this paper,we obtain several new practical criteria for judging nonsingular H-matrices by using the partitioning technique and Schur complement of matrices.Their effectiveness is illustrated by numerical examples.
Zhuohong Huang,Ting-Zhu Huang 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.3
In this paper,we give the lower and upper bounds for inverse elements of strictly diagonally dominant seventh-diagonal matrices, and improve the bounds on [SIAM. J. matrix Anal.Appl.20(1999)820-837]. In this paper,we give the lower and upper bounds for inverse elements of strictly diagonally dominant seventh-diagonal matrices, and improve the bounds on [SIAM. J. matrix Anal.Appl.20(1999)820-837].
NOETHERIAN RINGS OF KRULL DIMENSION 2
신용수 한국전산응용수학회 2010 Journal of applied mathematics & informatics Vol.28 No.3
We prove that a maximal ideal M of D[x] has two generators and is of the form <p, q(x)>where p is an irreducible element in a PID D having infinitely many nonassociate irreducible elements and q(x) is an irreducible non-constant polynomial in D[x]. Moreover, we find how minimal generators of maximal ideals of a polynomial ring D[x] over a DVR D consist of and how many generators those maximal ideals have.
Doubly simulative WFI-algebras
전영배,이경자,Chul Hwan Park 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.1
Characterizations of simulative WFI-algebras are provided. Thenotion of commutators, doubly simulative parts, doubly simulativeWFI-algebras, and WFI-morphisms are introduced. Using the notionof commutators, the conditions for a WFI-algebra to besimulative are given. Characterizations of doubly simulativeWFI-algebras are discussed. Using the notion of doublysimulative WFI-algebras, a commutative pomonoid is established.
Construction of Cartesian authentication codes over untitray geometry
Wenyan Xu,You Gao 한국전산응용수학회 2009 Journal of applied mathematics & informatics Vol.27 No.5
A construction of Cartesian authentication codes over unitary geometry is presented and its size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed. A construction of Cartesian authentication codes over unitary geometry is presented and its size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed.