• The Journal of Natural Sciences
• /
• v.8 no.2
• /
• pp.9-11
• /
• 1996

We apply a full mutigrid scheme to computing eigenvalues of the Laplace eigenvalue problem with Dirichlet boundary condition. We use finite difference method to get an algebraic equation and apply inverse power method to estimating the smallest eigenvalue. Our result shows that combined method of inverse power method and full multigrid scheme is very effective in calculating eigenvalue of the eigenvalue problem.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.243-248
• /
• 1997

A full multigrid scheme was used in computing some eigenvalues of the Laplace eigenvalues problem with the Dirichlet bound-ary condition. We get a system of algebraic equations with an aid of finite difference method and apply subspace iteration method to the system to compute first some eigenvalues. The result shows that this is very effective in calculating some eigenvalues of this problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.181-186
• /
• 2022

Poisson-Boltzmann equation (PBE) is used to model problems arising from various disciplinary including bio-pysics and colloid chemistry. Therefore, to predict a numerical solution of PBE is an important issue. The authors proposed deep learning based methods to solve PBE while the computational time to generate finite element method (FEM) solutions were bottlenecks of the algorithms. In this work, we shorten the generation time of FEM solutions in two directions. First, we experimentally find certain penalty parameter in a bilinear form. Second, we applied algebraic multigrids methods to the algebraic system so that condition number is bounded regardless of the meshsize. In conclusion, we have reduced computation times to solve algebraic systems for PBE. We expect that algebraic multigrids methods can be further employed in various disciplinary to generate deep learning samples.

• Computers and Concrete
• /
• v.29 no.2
• /
• pp.93-105
• /
• 2022

The degrees of freedom (DOFs) of high-rise structures increase rapidly due to the need for refined analysis, which poses a challenge toward a computationally efficient method for numerical analysis of high-rise structures using the finite element method (FEM). This paper presented an efficient iterative method, an algebraic multigrid (AMG) with a Jacobi overrelaxation smoother preconditioned conjugate gradient method (AMG-CG) used for solving large-scale structural system equations running on heterogeneous platforms with parallel accelerator graphics processing units (GPUs) enabled. Furthermore, an AMG-CG FEM application framework was established for the numerical analysis of high-rise structures. In the proposed method, the coarsening method, the optimal relaxation coefficient of the JOR smoother, the smoothing times, and the solution method for the coarsest grid of an AMG preconditioner were investigated via several numerical benchmarks of high-rise structures. The accuracy and the efficiency of the proposed FEM application framework were compared using the mature software Abaqus, and there were speedups of up to 18.4x when using an NVIDIA K40C GPU hosted in a workstation. The results demonstrated that the proposed method could improve the computational efficiency of solving structural system equations, and the AMG-CG FEM application framework was inherently suitable for numerical analysis of high-rise structures.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1114-1124
• /
• 2017

Acceleration/preconditioning strategies available in the SCEPTRE radiation transport code are described. A flexible transport synthetic acceleration (TSA) algorithm that uses a low-order discrete-ordinates ($S_N$) or spherical-harmonics ($P_N$) solve to accelerate convergence of a high-order $S_N$ source-iteration (SI) solve is described. Convergence of the low-order solves can be further accelerated by applying off-the-shelf incomplete-factorization or algebraic-multigrid methods. Also available is an algorithm that uses a generalized minimum residual (GMRES) iterative method rather than SI for convergence, using a parallel sweep-based solver to build up a Krylov subspace. TSA has been applied as a preconditioner to accelerate the convergence of the GMRES iterations. The methods are applied to several problems involving electron transport and problems with artificial cross sections with large scattering ratios. These methods were compared and evaluated by considering material discontinuities and scattering anisotropy. Observed accelerations obtained are highly problem dependent, but speedup factors around 10 have been observed in typical applications.