• 전자공학회논문지
• /
• 제50권11호
• /
• pp.28-35
• /
• 2013

Krylov-Schur 반복법을 활용하여 2-차원 사각 도파관에서 나타나는 고유특성을 밝혔다. 고유 행렬 방정식은 삼각형 그물 요소의 접선을 기저벡터로 사용한 FEM(유한요소법)으로 구성하였다. 우선 Arnoldi 분해법을 이용하여 이 방정식에 대한 상위 Hessenberg 행렬을 구하였다. 그리고 QR 알골리즘을 통하여 이것을 삼각형 대각 행렬인 Shur 형태로 변형하였다. 수렴 조건에 부합된 몇몇 고유 값들이 삼각형 대각 행렬의 대각 요소에 나타났다. 이들에 대응하는 고유 모드들을 역-반복법으로 구하였다. 수렴조건에 부합되는 고유 값들은 Shur 행렬의 대각선 선두 부분으로 재배열시켰다. 이들은 나머지 고유값 및 고유모드의 쌍을 구하는 반복 과정에서 변형되지 않도록 배제되었다. 이 과정이 연속하여 서너 번 반복되었는데, 그 결과 충분한 신뢰도를 갖는 주요한 몇 개의 TM 및 TE 고유 쌍들이 구하여졌다.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.179-182
• /
• 2004

This paper deals with a new mathematical formulation of nonlinear wave profile based on Banach fixed point theorem. As application of the formulation and its solution procedure, some numerical solutions was presented in this paper and nonlinear equation was derived. Also we introduce a new operator for iteration and getting solution. A numerical study was accomplished with Stokes' first-order solution and iteration scheme, and then we can know the nonlinear characteristic of Stokes' high-order solution. That is, using only Stokes' first-oder(linear) velocity potential and an initial guess of wave profile, it is possible to realize the corresponding high-oder Stokian wave profile with tile new numerical scheme which is the method of iteration. We proved the mathematical convergence of tile proposed scheme. The nonlinear strategy of iterations has very fast convergence rate, that is, only about 6-10 iterations arc required to obtain a numerically converged solution.

• 한국컴퓨터산업학회논문지
• /
• 제6권3호
• /
• pp.447-456
• /
• 2005

국부 반복 복원 처리는 영상 전체를 반복 복원하는 기존의 반복 복원과는 달리, 영상을 국부적으로 구분하여, 변화량이 큰 부분은 기존의 반복 복원으로 처리하고 변화량이 적은 부분은 LOG함수의 특성을 이용하여 신장 시킨 다음 처리하고, 다시 압축시키므로, 기존의 반복 복원 처리보다도 MSE(Mean Square Error)를 월등히 줄일 수 있을 뿐 아니라 변화량이 적은 부분도 처리가 잘되고, 또 기존의 반복처리 방법이 갖는, 적은 메모리 용량의 소요, 비선형 제약조건의 사용 가능, 약간의 변형으로 언제나 수렴성을 보장하는 등의 장점을 모두 가진다. 이 방법을 영상에 적용시킨 결과, MSE의 현저한 감소, 반복횟수 감소에 따른 반복시간 단축을 확인 할 수 있었다. 그러므로, 이 방법은 MSE를 줄이고 또한 처리 시간 단축을 목적으로 하는 영상의 복원에 적용될 수 있는 매우 우수한 방법임을 알 수 있다.

• Steel and Composite Structures
• /
• 제17권5호
• /
• pp.753-776
• /
• 2014

In this paper, nonlinear vibration and post-buckling analysis of beams made of functionally graded materials (FGMs) resting on nonlinear elastic foundation subjected to thermo-mechanical loading are studied. The thermo-mechanical material properties of the beams are assumed to be graded in the thickness direction according to a simple power law distribution in terms of the volume fractions of the constituents, and to be temperature-dependent. The assumption of a small strain, moderate deformation is used. Based on Euler-Bernoulli beam theory and von-Karman geometric nonlinearity, the integral partial differential equation of motion is derived. Then this PDE problem which has quadratic and cubic nonlinearities is simplified into an ODE problem by using the Galerkin method. Finally, the governing equation is solved analytically using the variational iteration method (VIM). Some new results for the nonlinear natural frequencies and buckling load of the FG beams such as the influences of thermal effect, the effect of vibration amplitude, elastic coefficients of foundation, axial force, end supports and material inhomogenity are presented for future references. Results show that the thermal loading has a significant effect on the vibration and post-buckling response of FG beams.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1303-1309
• /
• 2011

Based on the PRP method, a new spectral PRP conjugate gradient method has been proposed to solve general unconstrained optimization problems which produce sufficient descent search direction at every iteration without any line search. Under the Wolfe line search, we prove the global convergence of the new method for general nonconvex functions. The numerical results show that the new method is efficient for the given test problems.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.909-920
• /
• 2011

A regularized Newton method for nonlinear ill-posed problems is considered. In each Newton step an implicit iterative method with an appropriate stopping rule is proposed and analyzed. Under certain assumptions on the nonlinear operator, the convergence of the algorithm is proved and the algorithm is stable if the discrepancy principle is used to terminate the outer iteration. Numerical experiment shows the effectiveness of the method.

• 한국국방경영분석학회지
• /
• 제29권1호
• /
• pp.28-42
• /
• 2003

The simplex method requires basis update in each iteration, which is the most time consuming process. Several methods have been developed for the update of basis which is represented in LU factorized form, such as Bartels-Golub's method, Forrest-Tomlin's method, Reid's method, Saunders's method, etc. In this research, we compare between the updating methods in terms of sparsity, data structure and computing time issues. The analysis is mainly based on the computational experience.

• 한국CDE학회논문집
• /
• 제2권4호
• /
• pp.237-243
• /
• 1997

A new method is introduced for the interpolation in NURBS Surface. This method uses the basis functions to assign the parameter values to the arbitrary set of geometric data and uses the iteration method to compute the control net. The advantages of this method are the feasible transformation of the data set to the matrix form and the effective surface generation as a result, especially to the design engineer.

• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.323-340
• /
• 1997

In this study we prove the mesh-independence principle via Steffensen's method. This principle asserts that when Steffensen's method is applied to a nonlinear equation between some Banach spaces as well as to some finite-dimensional discretization of that equation then the behavior of th discretized process is asymptoti-cally the same as that for the original iteration. Local and semilo-cal convergencve results as well as an error analysis for Steffensen's method are also provided.

• 한국경영과학회지
• /
• 제6권2호
• /
• pp.25-34
• /
• 1981

In this paper, we propose a non-edge following method for linear programs. Unlike alledged poor performance of algorithms of this type, this method performs well at least with 25 randomly generated problems. This method is comparable to Rosen's gradient projection method as applied to the dual formulation. The latter is of general purpose, and no implementation rules are available for linear program applications. This paper suggests ways of finding improving dual feasible directions, and of allowing to move across the extreme faces of a higher dimension polyhedron. Rather simple computational rules are provided for projection operations needed at each iteration.