• 제목/요약/키워드: Eigenvalue problems

검색결과 214건 처리시간 0.028초

Inter-conversion between the power and Arnoldi`s methods

  • Park, Pil-Seong
    • 대한수학회논문집
    • /
    • 제12권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.

  • PDF

DIRICHLET EIGENVALUE PROBLEMS UNDER MUSIELAK-ORLICZ GROWTH

  • Benyaiche, Allami;Khlifi, Ismail
    • 대한수학회지
    • /
    • 제59권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.

Eigenvalue Analysis of Rectangular Mindlin Plates by Chebyshev Pseudospectral Method

  • Lee, Jinhee
    • Journal of Mechanical Science and Technology
    • /
    • 제17권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.

EXISTENCE OF A POSITIVE INFIMUM EIGENVALUE FOR THE p(x)-LAPLACIAN NEUMANN PROBLEMS WITH WEIGHTED FUNCTIONS

  • Kim, Yun-Ho
    • Korean Journal of Mathematics
    • /
    • 제22권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.

DISCRETE COMPACTNESS PROPERTY FOR GENERAL QUADRILATERAL MESHES

  • KIM, JI HYUN
    • Journal of applied mathematics & informatics
    • /
    • 제40권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.

An Efficient Multigrid Algorithm for the Reactor Eigenvalue Problems

  • Cho, Nam-Zin;Lee, Kang-Hyun;Kim, Yong-Hee
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 1997년도 춘계학술발표회논문집(1)
    • /
    • 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.

  • PDF

대수학 부구조법을 이용한 내부 고유치 계산 (Interior Eigenvalue Computation Using Algebraic Substructuring)

  • 고진환;변도영
    • 한국전산구조공학회논문집
    • /
    • 제20권6호
    • /
    • pp.743-749
    • /
    • 2007
  • 대수학 부구조법은 대형 문제들의 고유치 계산에 최고 성능을 지닌 방법이지만 근본적으로 최소 고유치만을 계산하기 위해 설계되었다. 본 논문에서는 이동값을 이용하여 특정범위 안의 내부 고유치를 계산하기 위해 대수학 부구조법의 갱신된 버전을 제안하고, 이를 이동 대수학 부구조법이라 명명한다. 그리고 구조문제의 유한요소모델에 대한 수치실험을 통해 제안된 방법이 다수의 내부고유치를 계산하는데 란쵸스방법보다 월등한 효율성을 가지고 있음을 보였다.

Analysis of alpha modes in multigroup diffusion

  • Sanchez, Richard;Tomatis, Daniele;Zmijarevic, Igor;Joo, Han Gyu
    • Nuclear Engineering and Technology
    • /
    • 제49권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.

AN ASSESSMENT OF PARALLEL PRECONDITIONERS FOR THE INTERIOR SPARSE GENERALIZED EIGENVALUE PROBLEMS BY CG-TYPE METHODS ON AN IBM REGATTA MACHINE

  • Ma, Sang-Back;Jang, Ho-Jong
    • 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.