• Bulletin of the Korean Mathematical Society
• /
• v.56 no.3
• /
• pp.691-702
• /
• 2019

We characterize coefficient multipliers from certain Dirichlet type spaces to Hardy spaces and weighted Bergman spaces.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.469-476
• /
• 2012

In this paper, a finite element domain decomposition method using local and mixed Lagrange multipliers for a large scal structural analysis is presented. The proposed algorithms use local and mixed Lagrange multipliers to improve computational efficiency. In the original FETI method, classical Lagrange multiplier technique was used. In the dual-primal FETI method, the interface nodes are used at the corner nodes of each sub-domain. On the other hand, the proposed FETI-local analysis adopts localized Lagrange multipliers and the proposed FETI-mixed analysis uses both global and local Lagrange multipliers. The numerical analysis results by the proposed algorithms are compared with those obtained by dual-primal FETI method.

• Journal of Convergence for Information Technology
• /
• v.9 no.5
• /
• pp.7-13
• /
• 2019

Role-based access or attribute-based access control in cloud environment or big data environment need requires a suitable mathematical structure to represent a hierarchical model. This paper define the notion of multipliers and simple multipliers of lattice implication algebras that can implement a hierarchical model of role-based or attribute-based access control, and prove every multiplier is simple multiplier. Also we research the relationship between multipliers and homomorphisms of a lattice implication algebra L, and prove that the lattice [0, u] is isomorphic to a lattice $[u^{\prime},1]$ for each $u{\in}L$ and that L is isomorphic to $[u,1]{\times}[u^{\prime},1]$ as lattice implication algebras for each $u{\in}L$ satisfying $u{\vee}u^{\prime}=1$.

• Communications of the Korean Mathematical Society
• /
• v.10 no.3
• /
• pp.633-642
• /
• 1995

Recently S. Axler proved that every sequence in the unit disk U converging to the boundary contains an interpolating subsequence for the multipliers of the Dirichlet space D(U). In this paper we generalizes Axler's result to the finitely connected planer domains such that the Dirichlet spaces are contained in the Bergman spaces.

• Korean Journal of Mathematics
• /
• v.17 no.4
• /
• pp.437-449
• /
• 2009

In this paper, we establish the stability of cubic double centralizers and cubic multipliers on Banach algebras. We also prove the superstability of cubic double centralizers on Banach algebras which are cubic commutative and cubic without order.

• Honam Mathematical Journal
• /
• v.35 no.2
• /
• pp.201-210
• /
• 2013

In this paper, we introduced the notion of multiplier of a BCC-algebra, and gave some properties of BCC-algebras. Also, we characterized kernels and normal ideals of multipliers on BCC-algebras.

• Communications of Mathematical Education
• /
• v.37 no.1
• /
• pp.65-84
• /
• 2023

The method of Lagrange multipliers, one of the most fundamental algorithms for solving equality constrained optimization problems, has been widely used in basic mathematics for artificial intelligence (AI), linear algebra, optimization theory, and control theory. This method is an important tool that connects calculus and linear algebra. It is actively used in artificial intelligence algorithms including principal component analysis (PCA). Therefore, it is desired that instructors motivate students who first encounter this method in college calculus. In this paper, we provide an integrated perspective for instructors to teach the method of Lagrange multipliers effectively. First, we provide visualization materials and Python-based code, helping to understand the principle of this method. Second, we give a full explanation on the relation between Lagrange multiplier and eigenvalues of a matrix. Third, we give the proof of the first-order optimality condition, which is a fundamental of the method of Lagrange multipliers, and briefly introduce the generalized version of it in optimization. Finally, we give an example of PCA analysis on a real data. These materials can be utilized in class for teaching of the method of Lagrange multipliers.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.570-581
• /
• 2017

Multiplication in finite fields is used in many applications, especially in cryptography. It is a basic and the most computationally intensive operation from among all such operations. Several systolic multipliers are proposed in the literature that offer low hardware complexity or high speed. In this paper, a bit-parallel polynomial basis systolic multiplier for generic irreducible polynomials is proposed based on a modified interleaved multiplication method. The hardware complexity and delay of the proposed multiplier are estimated, and a comparison with the corresponding multipliers available in the literature is presented. Of the corresponding multipliers, the proposed multiplier achieves a reduction in the hardware complexity of up to 20% when compared to the best multiplier for m = 163. The synthesis results of application-specific integrated circuit and field-programmable gate array implementations of the proposed multiplier are also presented. From the synthesis results, it is inferred that the proposed multiplier achieves low power consumption and low area complexitywhen compared to the best of the corresponding multipliers.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.25 no.3
• /
• pp.157-161
• /
• 2020

High voltage gain converters are essential for distributed power generation systems with renewable energy sources, such as fuel cells and solar cells, because of their low voltage characteristics. This paper introduces a novel nonisolated DC-DC converter topology developed by combining an inverting buck-boost converter and voltage multipliers. In the proposed converter, the input voltage is connected in series with the output, and the majority of the input power is directly delivered to the load. The voltage multipliers are stacked in series to achieve high step-up voltage gain. The voltage stress across all of the switches and capacitors can be significantly reduced. As a result, the switches with low voltage ratings can be used to achieve high efficiency and low cost. To verify the validity of the proposed topology, a 360-W prototype converter is built to obtain the experimental results.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.2
• /
• pp.267-281
• /
• 2016

In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.