• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.387-401
• /
• 2006

This paper deals with the problem of a ratio-dependent prey- predator model with combined harvesting. The existence of steady states and their stability are studied using eigenvalue analysis. Boundedness of the exploited system is examined. We derive conditions for persistence and global stability of the system. The possibility of existence of bionomic equilibria has been considered. The problem of optimal harvest policy is then solved by using Pontryagin's maximal principle.

• Steel and Composite Structures
• /
• v.22 no.2
• /
• pp.369-386
• /
• 2016

In this work, the two-dimensional generalized magneto-thermoelastic problem of a fiber-reinforced anisotropic material is investigated under Green and Naghdi theory of type III. The solution will be obtained for a certain model when the half space subjected to ramp-type heating and traction free surface. Laplace and exponential Fourier transform techniques are used to obtain the analytical solutions in the transformed domain by the eigenvalue approach. The inverses of Fourier transforms are obtained analytically. The results have been verified numerically and are represented graphically. Comparisons are made with the results predicted by the presence and absence of reinforcement and magnetic field.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.3
• /
• pp.261-267
• /
• 2007

We show the existence of the positive solution for the system of the following nonlinear wave equations with Dirichlet boundary conditions $$u_{tt}-u_{xx}+av^+=s{\phi}_{00}+f$$, $$v_{tt}-v_{xx}+bu^+=t{\phi}_{00}+g$$, $$u({\pm}\frac{\pi}{2},t)=v({\pm}\frac{\pi}{2},t)=0$$, where $u_+=max\{u,0\}$, s, $t{\in}R$, ${\phi}_{00}$ is the eigenfunction corresponding to the positive eigenvalue ${\lambda}_{00}=1$ of the eigenvalue problem $u_{tt}-u_{xx}={\lambda}_{mn}u$ with $u({\pm}\frac{\pi}{2},t)=0$, $u(x,t+{\pi})=u(x,t)=u(-x,t)=u(x,-t)$ and f, g are ${\pi}$-periodic, even in x and t and bounded functions in $[-\frac{\pi}{2},\frac{\pi}{2}]{\times}[-\frac{\pi}{2},\frac{\pi}{2}]$ with $\int_{-\frac{\pi}{2}}^{\frac{\pi}{2}}f{\phi}_{00}=\int_{-\frac{\pi}{2}}^{\frac{\pi}{2}}g{\phi}_{00}=0$.

• Structural Engineering and Mechanics
• /
• v.5 no.2
• /
• pp.137-148
• /
• 1997

In computing eigenvalues for a large finite element system it has been observed that the eigenvalue extractors produce eigenvectors that are in some sense more accurate than their corresponding eigenvalues. From this observation the paper uses a patch type technique based on the eigenvector for one mesh quality to provide an eigenvalue error indicator. Tests show this indicator to be both accurate and reliable. This technique was first observed by Stephen and Steven for an error estimation for buckling and natural frequency of beams and two dimensional in-plane and out-of-plane structures. This paper produces and error indicator for the more difficult problem of three dimensional brick elements.

• Journal of applied mathematics & informatics
• /
• v.3 no.2
• /
• pp.193-204
• /
• 1996

Overflow queuing models are ofter analyzed by explicitly solving a large sparse singular linear systems arising from Kolmogorov balance equation. The system is often converted into an eigenvalue problem the dominant eigenvector of which is the desired null vector. In this paper we convert an overflow queuing problem the dominant eigenvector of which is the desired null vector. In this paper we convert an overflow queuing problem into an overflow queuing problem into an eigen-value problem into an eigen-value problem of size 1/2 of the original. Then we devise an orthogonal projector that enhances its convergence by removing unsanted eigen-components effectively. Numerical result with some suggestion is given at the end.

• The Journal of Engineering Geology
• /
• v.18 no.4
• /
• pp.381-391
• /
• 2008

The eigenvalue technique is introduced to overcome the problem of truncation errors caused by temporal discretization of numerical analysis. The eigenvalue technique is different from simulation in that only the space is discretized. The spatially discretized equation is diagonized and the linear dynamic system is then decoupled. The time integration can be done independently and continuously for any nodal point at any time. The results of eigenvalue technique are compared with the exact solution and FEM numerical solution. The eigenvalue technique is more efficient than the FEM to the computation time and the computer storage in the same conditions. This technique is applied to the solute transport analysis in nonuniform flow fields around underground storage caverns. This method can be very useful for time consuming simulations. So, a sensitivity analysis is carried out by using this method to analyze the safety of caverns from nearly located contaminant sources. According to the simulations, the reaching time from source to the nearest cavern may takes 50 years with longitudinal dispersivity of 50 m and transversal dispersivity of 5 m, respectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.197-202
• /
• 1992

In this paper, we consider the synthesis of mixed H$_{2}$/H$_{\infty}$ controllers such that the closed-loop poles are located in a specified region in the complex plane. Using solution to a generalized Riccati equation and a change of variable technique, it is shown that this synthesis problem can be reduced to a convex optimization problem over a bounded subset of matrices. This convex programming can be further reduced to Generalized Eigenvalue Minimization Problem where Interior Point method has been recently developed to efficiently solve this problem..

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.575-580
• /
• 1992

Mixed H$_{2}$/H$_{\infty}$ robust control synthesis is considered for finite dimensional linear time-invariant systems under the presence of diagonal structured uncertainties. Such uncertainties arise for instance when there is real perturbation in the nominal model of the state space system or when modeling multiple (unstructured) uncertainty at different locations in the feedback loop. This synthesis problem is reduced to convex optimization problem over a bounded subset of matrices as well as diagonal matrix having certain structure. For computational purpose, this convex optimization problem is further reduced into Generalized Eigenvalue Minimization Problem where a powerful algorithm based on interior point method has been recently developed..

• Nuclear Engineering and Technology
• /
• v.55 no.4
• /
• pp.1350-1364
• /
• 2023

2D/1D coupling method is an important neutron transport calculation method due to its high accuracy and relatively low computation cost. However, 2D/1D coupling method may diverge especially in small axial mesh size. To analyze the convergence behavior of 2D/1D coupling method, a Fourier analysis for k-eigenvalue neutron transport problems is implemented. The analysis results present the divergence problem of 2D/1D coupling method in small axial mesh size. Several common attempts are made to solve the divergence problem, which are to increase the number of inner iterations of the 2D or 1D calculation, and two times 1D calculations per outer iteration. However, these attempts only could improve the convergence rate but cannot deal with the divergence problem of 2D/1D coupling method thoroughly. Moreover, the choice of axial solvers, such as DGFEM SN and traditional SN, and its effect on the convergence behavior are also discussed. The results show that the choice of axial solver is a key point for the convergence of 2D/1D method. The DGFEM SN based 2D/1D method could converge within a wide range of optical thickness region, which is superior to that of traditional SN method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1852-1861
• /
• 1997

An enhanced subspace iteration algorithm has been developed to solve eigenvalue problems reliably and efficiently. Basic subspace iteration algorithm has been improved by eliminating recalculation of converged eigenvectors, using Krylov sequence as initial vectors and incorporating with shifting techniques. The number of iterations and computational time have been considerably reduced when compared with the original one, and reliability for catching copies of the multiple roots has been retained successfully. Further research would be required for mathematical justification of the present method.