• 대한수학회지
• /
• 제54권2호
• /
• pp.461-477
• /
• 2017

A dual substructuring method with a penalty term was introduced in the previous works by the authors, which is a variant of the FETI-DP method. The proposed method imposes the continuity not only by using Lagrange multipliers but also by adding a penalty term which consists of a positive penalty parameter ${\eta}$ and a measure of the jump across the interface. Due to the penalty term, the proposed iterative method has a better convergence property than the standard FETI-DP method in the sense that the condition number of the resulting dual problem is bounded by a constant independent of the subdomain size and the mesh size. In this paper, a further study for a dual iterative substructuring method with a penalty term is discussed in terms of its convergence analysis. We provide an improved estimate of the condition number which shows the relationship between the condition number and ${\eta}$ as well as a close spectral connection of the proposed method with the FETI-DP method. As a result, a choice of a moderately small penalty parameter is guaranteed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권7호
• /
• pp.2010-2026
• /
• 2024

This work investigates the hybrid precoder scheme in a millimeter wave (mmWave) multi-user MIMO system. We study a sum rate maximization scheme by jointly designing the digital precoder and the analog precoder. To handle the non-convex problem, a block coordinate descent (BCD) method is formulated, where the digital precoder is solved by a bisection search and the analog precoder is addressed by the penalty dual decomposition (PDD) alternately. Then, we extend the proposed algorithm to the sub-connected schemes. Besides, the proposed algorithm enjoys lower computational complexity when compared with other benchmarks. Simulation results verify the performance of the proposed scheme and provide some meaningful insight.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• 대한수학회지
• /
• 제58권3호
• /
• pp.791-797
• /
• 2021

In this corrigendum, we offer a correction to [J. Korean Math. Soc. 54 (2017), No. 2, 461-477]. We construct a counterexample for the strengthened Cauchy-Schwarz inequality used in the original paper. In addition, we provide a new proof for Lemma 5 of the original paper, an estimate for the extremal eigenvalues of the standard unpreconditioned FETI-DP dual operator.

• Korean Journal of Mathematics
• /
• 제31권4호
• /
• pp.419-431
• /
• 2023

In this paper, we propose an iterative method for a symmetric interior penalty Galerkin method for heterogeneous elliptic problems. The iterative method consists mainly of two parts based on a non-overlapping domain decomposition approach. One is an intermediate preconditioner constructed by understanding the properties of the discontinuous finite element functions and the other is a preconditioning related to the dual-primal finite element tearing and interconnecting (FETI-DP) methodology. Numerical results for the proposed method are presented, which demonstrate the performance of the iterative method in terms of various parameters associated with the elliptic model problem, the finite element discretization, and non-overlapping subdomain decomposition.

• 한국전산구조공학회논문집
• /
• 제25권6호
• /
• pp.469-476
• /
• 2012

본 논문에서는 대규모 구조해석을 위하여 국부(local) 및 전역-국부 혼합(mixed) Lagrange 승수(Lagrange multiplier)를 이용한 새로운 유한요소 영역분할 기법을 제시한다. 제시되는 FETI 알고리즘은 계산 효율성을 향상시키기 위하여 기존의 FETI 기법들에서 사용되어 온 전통적인 Lagrange 승수법과는 달리, 국부 및 전역-국부 혼합 Lagrange 승수를 도입하고 ALF(Augmented Lagrangian Formulation)과의 결합을 유도하여 공유면 문제(interface problem)의 해의 수렴성을 향상 시켰다. 추가적으로, 몇 가지 수치예제 계산을 통해 기존의 FETI-DP 기법과 비교하여 유연도 행렬의 조건수, 계산 시간 그리고 메모리 사용량에 대한 계산결과를 제시하였다.