• Communications of the Korean Mathematical Society
• /
• v.12 no.1
• /
• pp.145-155
• /
• 1997

We present a couple of tools that can be used in the solution of nonsymmetric eigenvalue problems. The first one allows us to convert power iterates into Arnoldi's results so that a few eigenpairs are easily obtainable. The other converts Arnoldi's results into power iterates to simulate the power method and improve the result. Suggestions for application are also given.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1139-1151
• /
• 2022

This paper studies the eigenvalues of the G(·)-Laplacian Dirichlet problem $$\{-div\;\(\frac{g(x,\;{\mid}{\nabla}u{\mid})}{{\mid}{\nabla}u{\mid}}{\nabla}u\)={\lambda}\;\(\frac{g(x,{\mid}u{\mid})}{{\mid}u{\mid}}u\)\;in\;{\Omega}, \\u\;=\;0\;on\;{\partial}{\Omega},$$ where Ω is a bounded domain in ℝ^N and g is the density of a generalized Φ-function G(·). Using the Lusternik-Schnirelmann principle, we show the existence of a nondecreasing sequence of nonnegative eigenvalues.

• Journal of Mechanical Science and Technology
• /
• v.17 no.3
• /
• pp.370-379
• /
• 2003

A study of free vibration of rectangular Mindlin plates is presented. The analysis is based on the Chebyshev pseudospectral method, which uses test functions that satisfy the boundary conditions as basis functions. The result shows that rapid convergence and accuracy as well as the conceptual simplicity are achieved when the pseudospectral method is applied to the solution of eigenvalue problems. Numerical examples of rectangular Mindlin plates with clamped and simply supported boundary conditions are provided for various aspect ratios and thickness-to length ratios.

• Korean Journal of Mathematics
• /
• v.22 no.3
• /
• pp.395-406
• /
• 2014

We study the following nonlinear problem $-div(w(x){\mid}{\nabla}u{\mid}^{p(x)-2}{\nabla}u)+{\mid}u{\mid}^{p(x)-2}u={\lambda}f(x,u)$ in ${\Omega}$ which is subject to Neumann boundary condition. Under suitable conditions on w and f, we give the existence of a positive infimum eigenvalue for the p(x)-Laplacian Neumann problem.

• The Journal of Natural Sciences
• /
• v.9 no.1
• /
• pp.69-74
• /
• 1997

We introduce the Crawford number and codal metric to analyze perturbation bounds of the generalized eigenvalue problem.

• Journal of applied mathematics & informatics
• /
• v.40 no.5_6
• /
• pp.949-958
• /
• 2022

The aim of this papaer is to prove the discrete compactness property for modified Raviart-Thomas element(MRT) of lowest order on quadrilateral meshes. Then MRT space can be used for eigenvalue problems, and is more efficient than the lowest order ABF space since it has less degrees of freedom.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.05a
• /
• pp.27-32
• /
• 1997

In this paper, a new multigrid method is developed to solve the reactor eigenvalue problems. The new algorithm can be used in any matrix equation concerned with the eigenvalue problem. The finite difference neutron diffusion problem is considered demonstration of the performance of the new multigrid algorithm. The numerical results show that the new multigrid algorithm works well and requires much shorter (7~10 times) computing time compaired to the production code VENTURE.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.6
• /
• pp.743-749
• /
• 2007

Algebraic substructuring (AS) is a state-of-the-art method in eigenvalue computations, especially for large size problems, but, originally, it was designed to calculate only the smallest eigenvalues. In this paper, an updated version of AS is proposed to calculate the interior eigenvalues over a specified range by using a shift value, which is referred to as the shifted AS. Numerical experiments demonstrate that the proposed method has better efficiency to compute numerous interior eigenvalues for the finite element models of structural problems than a Lanczos-type method.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1259-1268
• /
• 2017

The alpha eigenvalue problem in multigroup neutron diffusion is studied with particular attention to the theoretical analysis of the model. Contrary to previous literature results, the existence of eigenvalue and eigenflux clustering is investigated here without the simplification of a unique fissile isotope or a single emission spectrum. A discussion about the negative decay constants of the neutron precursors concentrations as potential eigenvalues is provided. An in-hour equation is derived by a perturbation approach recurring to the steady state adjoint and direct eigenvalue problems of the effective multiplication factor and is used to suggest proper detection criteria of flux clustering. In spite of the prior work, the in-hour equation results give a necessary and sufficient condition for the existence of the eigenvalue-eigenvector pair. A simplified asymptotic analysis is used to predict bands of accumulation of eigenvalues close to the negative decay constants of the precursors concentrations. The resolution of the problem in one-dimensional heterogeneous problems shows numerical evidence of the predicted clustering occurrences and also confirms previous theoretical analysis and numerical results.

• Journal of applied mathematics & informatics
• /
• v.25 no.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.