• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.37-48
• /
• 2009

In the theory and the applications of Numerical Linear Algebra, the class of H-matrices is very important. In recent years, many appeared works have proposed iterative criterion for H-matrices. In this paper, we provide a new type of interleaved iterative algorithm, which is always convergent in finite steps for H-matrices and needs fewer iterations than those proposed in the related works, and a corresponding algorithm for general matrix, which eliminates the redundant computations when the given matrix is not an H-matrix. Finally, several numerical examples are presented to show the effectiveness of the proposed algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.886-889
• /
• 2004

A simple macro triangle with drilling d.o.f.'s is proposed for plane stress problems based on IET(Individual element test) and finite element template. Three-node triangular element has geometrical advantages in preprocessing but suffers from bad performance comparing to other shapes of elements -especially quadrilateral. Main purpose of this study is to construct a high-performance linear triangular element with limited supplementary d.o.f.'s. A triangle is divided by three sub-triangles with drilling d.o.f.'s. The sub-triangle stiffness come from IET passing force-lumping matrix, so this assures the consistency of the element. The macro element strategy takes care of the element‘s stability and accuracy like higher-order stiffness in the F.E. template. The resulting element fits on the uses of conventional three-node. Benchmark examples show proposed element in closed form stiffness from CAS (Computer algebra system) gives the improved results without more computational efforts than others.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.4
• /
• pp.1303-1315
• /
• 2018

For principal component analysis (PCA) to efficiently analyze large scale matrices, it is crucial to find a few singular vectors in cheaper computational cost and under lower memory requirement. To compute those in a fast and robust way, we propose a new stochastic method. Especially, we adopt the stochastic variance reduced gradient (SVRG) method [11] to avoid asymptotically slow convergence in stochastic gradient descent methods. For that purpose, we reformulate the PCA problem as a unconstrained optimization problem using a quadratic penalty. In general, increasing the penalty parameter to infinity is needed for the equivalence of the two problems. However, in this case, exact penalization is guaranteed by applying the analysis in [24]. We establish the convergence rate of the proposed method to a stationary point and numerical experiments illustrate the validity and efficiency of the proposed method.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.707-720
• /
• 2008

Molodtsov [12] introduced the concept of soft set as a new mathematical tool for dealing with uncertainties that is free from the difficulties that have troubled the usual theoretical approaches. In this paper we apply the notion of soft sets by Molodtsov to commutative ideals of BCK-algebras, The notions of commutative soft ideals and commutative idealistic soft BCK-algebras are introduced, and their basic properties are investigated. Examples to show that there is no relations between positive implicative idealistic soft BCK-algebras and commutative idealistic soft BCK-algebras are provided.

• Journal of applied mathematics & informatics
• /
• v.36 no.5_6
• /
• pp.459-474
• /
• 2018

Cao et al. in (Numer. Linear. Algebra Appl. 18 (2011) 875-895) proposed a splitting method for saddle point problems which unconditionally converges to the solution of the system. It was shown that a Krylov subspace method like GMRES in conjunction with the induced preconditioner is very effective for the saddle point problems. In this paper we first modify the iterative method, discuss its convergence properties and apply the induced preconditioner to the problem. Numerical experiments of the corresponding preconditioner are compared to the primitive one to show the superiority of our method.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.1-57
• /
• 2003

Vector fields in three-space admit bundles of internal variables such as a Heisenberg algebra bundle. Information transmission along field lines of vector fields is described by a wave linked to the Schrodinger representation in the realm of time-frequency analysis. The preservation of local information causes geometric optics and a quantization scheme. A natural circle bundle models quantum information visualized by holographic methods. Features of this setting are applied to magnetic resonance imaging.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.211-222
• /
• 2023

In this paper, we study the following hybrid Caputo-Fabrizio fractional differential equation: ^𝐶𝓕_α𝕯^θ_ϑ [ω(ϑ) - 𝕱(ϑ, ω(ϑ))] = 𝕲(ϑ, ω(ϑ)), ϑ ∈ 𝕵 := [a, b], ω(α) = 𝜑_α ∈ ℝ, The result is based on a Dhage fixed point theorem in Banach algebra. Further, an example is provided for the justification of our main result.

• Journal of applied mathematics & informatics
• /
• v.34 no.3_4
• /
• pp.257-267
• /
• 2016

We find examples of Ideals in a tridiagonal algebra ALGL_∞ and study some properties of Ideals in ALGL_∞. We prove the following theorems: Let k and j be fixed natural numbers. Let A be a subalgebra of ALGL_∞ and let A_2,{k} ⊂ A ⊂ {T ∈ ALGL_∞ | T_(2k-1,2k) = 0}. Then A is an ideal of ALGL_∞ if and only if A = A_2,{k} where A_2,{k} = {T ∈ ALGL_∞ | T_(2k-1,2k) = 0, T_(2k-1,2k-1) = T_(2k,2k) = 0}. Let B be a subalgebra of ALGL_∞ such that B_2,{j} ⊂ B ⊂ {T ∈ ALGL_∞ | T_(2j+1,2j) = 0}. Then B is an ideal of ALGL_∞ if and only if B = B_2,{j}, where B_2,{j} = {T ∈ ALGL_∞ | T_(2j+1,2j) = 0, T_(2j,2j) = T_(2j+1,2j+1) = 0}.

• Journal of the Korean School Mathematics Society
• /
• v.18 no.2
• /
• pp.223-240
• /
• 2015

This paper deals with how to design and develop white-box based e-learning contents which are equipped with conceptual understanding and step-by-step computational procedures for studying vector calculus for science-engineering majors who might need supplementary mathematics learning. Noting that rewriting rules are often used in school mathematics for students' problem solving, the theoretical aspects of rewriting rules are reviewed for developing supplementary e-learning contents for them. The software design of step-by-step problem solving requires careful arrangement of rewriting rules and pattern matching techniques for white-box procedures using a computer algebra system such as Mathematica. Several modules for step-by-step problem solving as well as producing dynamic display of e-learning contents was coded by Mathematica in order to find the length of a curve in vector calculus after implementing several rules for differentiation and integration. The developed contents are equipped with diagnostic modules and immediate feedback for supplementary learning in terms of a tutorial. At the end, this paper indicates the strengths and features of the developed contents for college students who need to increase math learning capabilities, and suggests future research directions.