• 한국해안해양공학회지
• /
• 제10권2호
• /
• pp.93-99
• /
• 1998

타원형 유한차분모형에서 개방 경계조건으로 포물선 근사식과 스폰지층 경계를 사용하여 모형의 개량을 도모하였다. 수치기법은 GCG(Generalized conjugate gradient)기법을 사용하였고 구형해저실험에서 포물형 근사식을 사용하여 부적절한 반사파를 상당 부분 제거할 수 있었다. 스폰지층 경계의 경우 2파장 이상의 스폰지층을 사용할 때 포물형 근사식과 유사한 결과를 얻을 수있었다. 직사각형 항만에 대한 실험을 통하여 임의 형상의 대상 해역에도 쉽게 모형을 적용할 수 있음을 확인하였다.

• 한국해양공학회지
• /
• 제20권6호
• /
• pp.61-66
• /
• 2006

Two iterative solvers are applied to solve the modified mild slope equation. The elliptic formulation of the governing equation is selected for numerical treatment because it is partly suited for complex wave fields, like those encountered inside harbors. The requirement that the computational model should be capable of dealing with a large problem domain is addressed by implementing and testing two iterative solvers, which are based on the Stabilized Bi-Conjugate Gradient Method (BiCGSTAB) and Generalized Conjugate Gradient Method (GCGM). The characteristics of the solvers are compared, using the results for Berkhoff's shoal test, used widely as a benchmark in coastal modeling. It is shown that the GCGM algorithm has a better convergence rate than BiCGSTAB, and preconditioning of these algorithms gives more than half a reduction of computational cost.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.331-339
• /
• 2002

A preconditioned conjugate gradient(PCG) scheme with the aid of deflation for computing a few of the smallest eigenvalues arid their corresponding eigenvectors of the large generalized eigenproblems is considered. Topically there are two types of deflation techniques, the deflation with partial shifts and an arthogonal deflation. The efficient way of determining partial shifts is suggested and the deflation-PCG schemes with various partial shifts are investigated. Comparisons of theme schemes are made with orthogonal deflation-PCG, and their asymptotic behaviors with restart operation are also discussed.

• 한국전산구조공학회논문집
• /
• 제24권4호
• /
• pp.405-412
• /
• 2011

본 논문에서는 켤레구배법을 이용해 전체-국부 확장함수를 지닌 일반유한요소법을 해석하는 방식을 제안한다. 이 기법은 편미분방정식의 해에 대한 정보가 충분하지 않은 경우에도 수치해석적인 방법으로 일반유한요소법의 확장함수를 구성할 수 있으며, 해석과정 중 약간의 추가적인 연산만으로 좋은 성능을 지닌 전처리행렬 및 초기 추측치를 구성할 수 있어 국부적으로 복잡한 거동을 보이는 문제의 해석에 효과적이다. 본 논문에 포함된 수치해석 예제의 결과는 제안된 기법이 가우스 소거법과 같은 직접 솔버를 이용하는 경우보다 수치해석적으로 더 효율적임을 보여준다.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.467-474
• /
• 2006

We present and study the stability and convergence of a deflation-preconditioned conjugate gradient(PCG) scheme for the interior generalized eigenvalue problem $Ax = {\lambda}Bx$, where A and B are large sparse symmetric positive definite matrices. Numerical experiments are also presented to support our theoretical results.

• ETRI Journal
• /
• 제42권6호
• /
• pp.922-931
• /
• 2020

A hierarchical iterative algorithm for the canonical polyadic decomposition (CPD) of tensors is proposed by improving the traditional conjugate gradient least squares (CGLS) method. Methods based on algebraic operations are investigated with the objective of estimating the direction of arrival (DoA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors. The proposed algorithm adopts a hierarchical iterative strategy, which enables the algorithm to obtain a fast recovery for the highly collinear factor matrix. Moreover, considering the same accuracy threshold, the proposed algorithm can achieve faster convergence compared with the alternating least squares (ALS) algorithm wherein the highly collinear factor matrix is absent. The results reveal that the proposed algorithm can achieve better performance under the condition of fewer snapshots, compared with the ALS-based algorithm and the algorithm based on generalized eigenvalue decomposition (GEVD). Furthermore, with regard to an array with a small number of sensors, the observed advantage in estimating the DoA and polarization parameters of the signal is notable.

• 충청수학회지
• /
• 제27권4호
• /
• pp.675-688
• /
• 2014

In this paper, we present an efficient way to determine a suitable value of the regularization parameter using the global generalized cross validation and analyze the experimental results from preconditioned global conjugate gradient linear least squares(Gl-CGLS) method in solving image deblurring problems. Preconditioned Gl-CGLS solves general linear systems with multiple right-hand sides. It has been shown in [10] that this method can be effectively applied to image deblurring problems. The regularization parameter, chosen from the global generalized cross validation, with preconditioned Gl-CGLS method can give better reconstructions of the true image than other parameters considered in this study.

• 충청수학회지
• /
• 제29권1호
• /
• pp.59-71
• /
• 2016

To obtain more accurate approximation of the true images in the deblurring problems, the weighted global generalized cross validation(GCV) function to the inverse problem with multiple right-hand sides is suggested as an efficient way to determine the regularization parameter. We analyze the experimental results for many test problems and was able to obtain the globally useful range of the weight when the preconditioned global conjugate gradient linear least squares(Gl-CGLS) method with the weighted global GCV function is applied.

• Journal of applied mathematics & informatics
• /
• 제25권1_2호
• /
• pp.435-443
• /
• 2007

Computing the interior spectrum of large sparse generalized eigenvalue problems $Ax\;=\;{\lambda}Bx$, where A and b are large sparse and SPD(Symmetric Positive Definite), is often required in areas such as structural mechanics and quantum chemistry, to name a few. Recently, CG-type methods have been found useful and hence, very amenable to parallel computation for very large problems. Also, as in the case of linear systems proper choice of preconditioning is known to accelerate the rate of convergence. After the smallest eigenpair is found we use the orthogonal deflation technique to find the next m-1 eigenvalues, which is also suitable for parallelization. This offers advantages over Jacobi-Davidson methods with partial shifts, which requires re-computation of preconditioner matrx with new shifts. We consider as preconditioners Incomplete LU(ILU)(0) in two variants, ever-relaxation(SOR), and Point-symmetric SOR(SSOR). We set m to be 5. We conducted our experiments on matrices from discretizations of partial differential equations by finite difference method. The generated matrices has dimensions up to 4 million and total number of processors are 32. MPI(Message Passing Interface) library was used for interprocessor communications. Our results show that in general the Multi-Color ILU(0) gives the best performance.

• 한국해양공학회지
• /
• 제18권4호
• /
• pp.40-45
• /
• 2004

An efficient numerical model of the modified mild slope equation, based on the robust iterative method is presented. The model developed is verified against other numerical experimental results, related to wave reflection from an arc-shaped bar and wave transformation over a circular shoal. The results show that the modified mild slope equation model is capable of producing accurate results for wave propagation in a region where water depth varies substantially, while the conventional mild slope equation model yeilds large errors, as the mild slope assumption is violated.