• Structural Engineering and Mechanics
• /
• v.88 no.5
• /
• pp.493-500
• /
• 2023

The multiparameter eigenvalue method can be used to solve the damped finite element model updating problems. This method transforms the original problems into multiparameter eigenvalue problems. Comparing with the numerical methods based on various optimization methods, a big advantage of this method is that it can provide all possible choices of physical parameters. However, when solving the transformed singular multiparameter eigenvalue problem, the proposed method based on the generalised inverse of a singular matrix has some computational challenges and may fail. In this paper, more details on the transformation from the dynamic model updating problem to the multiparameter eigenvalue problem are presented and the structure of the transformed problem is also exposed. Based on this structure, the rigorous mathematical deduction gives the upper bound of the number of possible choices of the physical parameters, which confirms the singularity of the transformed multiparameter eigenvalue problem. More importantly, we present a row and column compression method to overcome the defect of the proposed numerical method based on the generalised inverse of a singular matrix. Also, two numerical experiments are presented to validate the feasibility and effectiveness of our method.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.1
• /
• pp.213-221
• /
• 2011

In this paper, we establish a multiple critical points theorem for a one-parameter family of non-smooth functionals. The obtained result is then exploited to prove a multiplicity result for a class of periodic eigenvalue problems driven by the p-Laplacian and with a non-smooth potential. Under suitable assumptions, we locate an open subinterval of the eigenvalue.

• Journal of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.477-492
• /
• 1994

For the eigenvalue problem of $Au = \lambda u$ where A is considered as a semi-bounded self-adjoint operator on a Hilbert space, we are used to apply two complentary methods finding upper bounds and lower bounds to the eigenvalues. The most popular method for finding upper bounds may be the Rayleigh-Ritz method which was developed in the 19th century while a method for computing lower bounds may be the method of intermediate eigenvalue problems which has been developed since 1950's. In the method of intermediate eigenvalue problems (IEP), we consider the original operator eigenvalue problem as a perturbation of a simpler, resolvable, self-adjoint eigenvalue problem, called a base problem, that gives rough lower bounds.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1125-1134
• /
• 2017

In this paper, we present a new multilevel in space and energy diffusion (MSED) method for solving multigroup diffusion eigenvalue problems. The MSED method can be described as a PI scheme with three additional features: (1) a grey (one-group) diffusion equation used to efficiently converge the fission source and eigenvalue, (2) a space-dependent Wielandt shift technique used to reduce the number of PIs required, and (3) a multigrid-in-space linear solver for the linear solves required by each PI step. In MSED, the convergence of the solution of the multigroup diffusion eigenvalue problem is accelerated by performing work on lower-order equations with only one group and/or coarser spatial grids. Results from several Fourier analyses and a one-dimensional test code are provided to verify the efficiency of the MSED method and to justify the incorporation of the grey diffusion equation and the multigrid linear solver. These results highlight the potential efficiency of the MSED method as a solver for multidimensional multigroup diffusion eigenvalue problems, and they serve as a proof of principle for future work. Our ultimate goal is to implement the MSED method as an efficient solver for the two-dimensional/three-dimensional coarse mesh finite difference diffusion system in the Michigan parallel characteristics transport code. The work in this paper represents a necessary step towards that goal.

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.211-222
• /
• 2017

In this paper, we consider three inverse eigenvalue problems for a special type of acyclic matrices. The acyclic matrices considered in this paper are described by a graph called a broom on n + m vertices, which is obtained by joining m pendant edges to one of the terminal vertices of a path on n vertices. The problems require the reconstruction of such a matrix from given partial eigen data. The eigen data for the first problem consists of the largest eigenvalue of each of the leading principal submatrices of the required matrix, while for the second problem it consists of an eigenvalue of each of its trailing principal submatrices. The third problem has an eigenvalue and a corresponding eigenvector of the required matrix as the eigen data. The method of solution involves the use of recurrence relations among the leading/trailing principal minors of ${\lambda}I-A$, where A is the required matrix. We derive the necessary and sufficient conditions for the solutions of these problems. The constructive nature of the proofs also provides the algorithms for computing the required entries of the matrix. We also provide some numerical examples to show the applicability of our results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.5-16
• /
• 1999

We introduce a new projector for accelerating convergence of a symmetric eigenvalue problem Ax = x, and devise a power/Lanczos hybrid algorithm. Acceleration can be achieved by removing the hard-to-annihilate nonsolution eigencomponents corresponding to the widespread eigenvalues with modulus close to 1, by estimating them accurately using the Lanczos method. However, the additional Lanczos results can be obtained without expensive matrix-vector multiplications but a very small amount of extra work, by utilizing simple power-Lanczos interconversion algorithms suggested. Numerical experiments are given at the end.

• East Asian mathematical journal
• /
• v.33 no.3
• /
• pp.323-331
• /
• 2017

In this paper, we consider the existence of positive solutions for eigenvalue problems of nonlinear fractional differential equations with singular weights. We give various conditions on f and apply Krasnoselskii's Cone Fixed Point Theorem. As a result, we obtain several existence and nonexistence results corresponding to ${\lambda}$ in certain intervals.

• Communications of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.925-935
• /
• 2023

In this paper, we consider a boundary value problem for a sixth order difference equation. We prove the monotone behavior of the eigenvalue of the problem as the coefficients in the difference equation change values and the existence of a positive solution for a class of problems.

• International Journal of Precision Engineering and Manufacturing
• /
• v.3 no.2
• /
• pp.22-32
• /
• 2002

V-notched crack problems can be formulated as eigenvalue problems. The problem ova v-notched crack in anisotropic and/or pseudo-isotropic dissimilar materials was formulated as an eigenvalue problem to discuss stress singularities. The eigenvalue problem was served by the commercial numerical program; MATHEMATICA. The specific data of eigenvalues possessing the stress singularity were obtained. Stress singularities fur v-notched cracks in anisotropic and/or pseudo-isotropic dissimilar materials were discussed according to the relation between wedge angle and material property. It was shown that there are three cases of eigenvalues possessing the stress singularity; one real, two real and one complex.

• 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.