• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.999-1011
• /
• 2009

In this paper, we are concerned with the following eigenvalue problems of m-point boundary value problem for p-Laplacian dynamic equation on time scales $(\varphi_p(u^{\Delta}(t)))^\nabla+{\lambda}h(t)f(u(t))=0,\;t\in(0,T)$, $u(0)=0,\varphi_p(u^{\Delta}(T))=\sum\limits_{i=1}^{m-2}a_i\varphi_p(u^{\Delta}(\xi_i))$, where $\varphi_p(u)=|u|^{p-2}$u, p > 1 and $\lambda$ > 0 is a real parameter. Under certain assumptions, some new results on existence of one or two positive solution and nonexistence are obtained for $\lambda$ evaluated in different intervals. Our work develop and improve many known results in the literature even for the continual case. In doing so the usual restriction that $f_0=lim_{u{\rightarrow}0}+f(u)/\varphi_p(u)$ and $f_\infty = lim_{u{\rightarrow}{\infty}}f(u)/\varphi_p({u})$ exist is removed. As an applications, an example is given to illustrate the main results obtained.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.2
• /
• pp.63-69
• /
• 2001

In this study, we shall be concerned with computing in parallel a few of the smallest eigenvalues and their corresponding eigenvectors of the eigenvalue problem, $Ax={\lambda}Bx$, where A is symmetric, and B is symmetric positive definite. Both A and B are large and sparse. Recently iterative algorithms based on the optimization of the Rayleigh quotient have been developed, and CG scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for large sparse eigenproblems for small extreme eigenvalues. As in the case of a system of linear equations, successful application of the CG scheme to eigenproblems depends also upon the preconditioning techniques. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. The idea underlying the present work is a parallel computation of the Multi-Color Block SSOR preconditioning for the CG optimization of the Rayleigh quotient together with deflation techniques. Multi-Coloring is a simple technique to obatin the parallelism of order n, where n is the dimension of the matrix. Block SSOR is a symmetric preconditioner which is expected to minimize the interprocessor communication due to the blocking. We implemented the results on the CRAY-T3E with 128 nodes. The MPI(Message Passing Interface) library was adopted for the interprocessor communications. The test problems were drawn from the discretizations of partial differential equations by finite difference methods.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.4
• /
• pp.669-684
• /
• 2012

Using the minimax methods in critical point theory, we study the multiplicity of solutions for a class of degenerate Dirichlet problem in the case near resonance.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.623-630
• /
• 2003

Recently, Tanaka(1988) derived two influence functions related to an eigenvalue problem $(A-\lambda_sI)\upsilon_s=0$ of real symmetric matrix A and used them for sensitivity analysis in principal component analysis. In this paper, we deal with the perturbation expansions up to quadratic terms of the same functions and discuss the application to sensitivity analysis in principal component regression analysis(PCRA). Numerical example is given to show how the approximation improves with the quadratic term.

• Journal of the Korean Mathematical Society
• /
• v.43 no.1
• /
• pp.1-9
• /
• 2006

Based on the Schauder fixed point theorem, we give a Leray-Schauder type fixed point theorem for countably condensing mappings in a more general setting and apply it to obtain eigenvalue results on condensing mappings in a simple proof. Moreover, we present a generalization of Sadovskii's fixed point theorem for count ably condensing self-mappings due to S. J. Daher.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.4 no.2
• /
• pp.99-110
• /
• 2000

This paper is devoted to the parallelism of a numerical matrix eigenvalue problem. The eigenproblem arises in a variety of applications, including engineering, statistics, and economics. Especially we try to approach the industrial techniques from mathematical modeling. This paper has developed a parallel algorithm to find all eigenvalues. It is contributed to solve a specific practical problem, a vibration problem in the industry. Also we compare the runtime between the serial algorithm and the parallel algorithm for the given problems.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.356-361
• /
• 2008

Eigenvalue reduction schemes approximate the lower eigenmodes that represent the global behavior of the structures. In the previous study, we proposed a two-level condensation scheme (TLCS) for the construction of a reduced system. And we have improved previous TLCS with combination of the iterated improved reduced system method (IIRS) to increase accuracy of the higher modes intermediate range. In this study, we apply previous improved TLCS to multi-level sub-structuring scheme. In the first step, the global system is recursively partitioned into a hierarchy of sub-domain. In second step, each uncoupled sub-domain is condensed by the improved TLCS. After assembly process of each reduced sub-eigenvalue problem, eigen-solution is calculated by Lanczos method (ARPACK). Finally, Numerical examples demonstrate performance of proposed method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1169-1177
• /
• 2002

A study of fee vibration of circular Mindlin plates is presented. The analysis is based on the pseudospctral method, which uses Chebyshev polynomials and Fourier series as basis functions. It Is demonstrated that rapid convergence and accuracy as well as the conceptual simplicity could be achieved when the pseudospectral method was apt)lied to the solution of eigenvalue problems. Numerical examples of circular Mindlin plates with clamped and simply supported boundary conditions are provided for various thickness-to-radius ratios.

• Coupled systems mechanics
• /
• v.1 no.4
• /
• pp.325-343
• /
• 2012

We present different numerical methods for solving the shallow shelf equations with basal drag (SSAB). An alternative approach of splitting the SSAB equation into a Laplacian and diagonal shift operator is discussed with respect to the underlying eigenvalue problem. First, we solve the equations using standard methods. Then, the coupled equations are decomposed into operators for membranes stresses, basal shear stress and driving stress. Applying reasonable parameter values, we demonstrate that the operator of the membrane stresses is much stiffer than the operator of the basal shear stress. Here, we could apply a new splitting method, which alternates between the iteration on the membrane-stress operator and the basal-shear operator, with a more frequent iteration on the operator of the membrane stresses. We show that this splitting accelerates and stabilize the computational performance of the numerical method, although an appropriate choice of the standard method used to solve for all operators in one step speeds up the scheme as well.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.593-600
• /
• 2003

Structural optimization often requires the evaluation of design sensitivities. The Semi Analytic Method(SAM) fur computing sensitivity is popular in shape optimization because this method has several advantages. But when relatively large rigid body motions are identified for individual elements. the SAM shows severe inaccuracy. In this study, the improvement of design sensitivities corresponding to the rigid body mode is evaluated by exact differentiation of the rigid body modes. Moreover. the error of the SAM caused by numerical difference scheme is alleviated by using a series approximation for the sensitivity derivatives and considering the higher order terms. Finally the present study shows that the refined SAM including the iterative method improves the results of sensitivity analysis in dynamic problems.