• Structural Engineering and Mechanics
• /
• 제41권5호
• /
• pp.591-604
• /
• 2012

This paper provides an iteration approach for the solution of multiple notch problem, which is based on the complex variable boundary integral equation (CVBIE). The contours of notches are applied by some loadings. The source points are assumed on the boundary of individual notch and the displacements along the boundaries become unknowns to be investigated. After discretization of the BIE, many influence matrices are obtained. One does not need to assemble many influence matrices into a larger matrix. This will considerably reduce the work in the program. The displacements along the many boundaries can be obtained from an iteration. There is no limitation for the configuration of notches. Several numerical examples are provided to prove the efficiency of the suggested approach.

• Steel and Composite Structures
• /
• 제14권6호
• /
• pp.605-620
• /
• 2013

This paper provides an innovative iteration technique for the large deflection problem of annular plate. After some manipulation, the problem is reduced to a couple of ODEs (ordinary differential equation). Among them, one is derived from the plane stress problem for plate, and other is derived from the bending of plate. Since the large deflection for plate is assumed in the problem, the relevant non-linear terms appear in the resulting ODEs. The pseudo-linearization procedure is suggested to solve the problem and the nonlinear ODEs can be solved in the way for the solution of linear ODE. To obtain the final solution, it is necessary to use the iteration. Several numerical examples are provided. In the study, the assumed value for non-dimensional loading is larger than those in the available references.

• Nonlinear Functional Analysis and Applications
• /
• 제26권5호
• /
• pp.995-1009
• /
• 2021

Many iterative algorithms like that Picard, Mann, Ishikawa and S-iteration are very useful to elucidate the fixed point problems of a nonlinear operators in various topological spaces. The recent trend for elucidate the fixed point via inertial iterative algorithm, in which next iterative depends on more than one previous terms. The purpose of the paper is to establish convergence theorems of new inertial Picard normal S-iteration algorithm for nonexpansive mapping in Hilbert spaces. The comparison of convergence of InerNSP and InerPNSP is done with InerSP (introduced by Phon-on et al. [25]) and MSP (introduced by Suparatulatorn et al. [27]) via numerical example.

• Nonlinear Functional Analysis and Applications
• /
• 제27권1호
• /
• pp.59-82
• /
• 2022

In this paper, we present a modified (improved) generalized M-iteration with the inertial technique for three quasi-nonexpansive multivalued mappings in a real Hilbert space. In addition, we obtain a weak convergence result under suitable conditions and the strong convergence result is achieved using the hybrid projection method with our modified generalized M-iteration. Finally, we apply our convergence results to certain optimization problem, and present some numerical experiments to show the efficiency and applicability of the proposed method in comparison with other improved iterative methods (modified SP-iterative scheme) in the literature. The results obtained in this paper extend, generalize and improve several results in this direction.

• Journal of applied mathematics & informatics
• /
• 제36권3_4호
• /
• pp.181-203
• /
• 2018

In this paper, we have constructed an overlapping Schwarz method for singularly perturbed second order convection-diffusion equations. The method splits the original domain into two overlapping subdomains. A hybrid difference scheme is proposed in which on the boundary layer region we use the central finite difference scheme on a uniform mesh while on the non-layer region we use the mid-point difference scheme on a uniform mesh. It is shown that the numerical approximations which converge in the maximum norm to the exact solution. When appropriate subdomains are used, the numerical approximations generated from the method are shown to be first order convergent. Furthermore it is shown that, two iterations are sufficient to achieve the expected accuracy. Numerical examples are presented to support the theoretical results. The main advantages of this method used with the proposed scheme is it reduces iteration counts very much and easily identifies in which iteration the Schwarz iterate terminates.

• Nonlinear Functional Analysis and Applications
• /
• 제27권1호
• /
• pp.189-201
• /
• 2022

The aim of the current work is to investigate the numerical study of a nonlinear Volterra-Fredholm integro-differential equation with initial conditions. Our approximation techniques modified adomian decomposition method (MADM) and variational iteration method (VIM) are based on the product integration methods in conjunction with iterative schemes. The convergence of the proposed methods have been proved. We conclude the paper with numerical examples to illustrate the effectiveness of our methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3338-3355
• /
• 2018

Images acquired by Large Aperture Static Imaging Spectrometer (LASIS) exhibit obvious interference stripes, which are vertical and stationary due to the special imaging principle of interference hyperspectral image (IHI) data. As the special characteristics above will seriously affect the intrinsic structure and sparsity of IHI, decomposition of IHI has drawn considerable attentions of many scientists and lots of efforts have been made. Although some decomposition methods for interference hyperspectral data have been proposed to solve the above problem of interference stripes, too many times of iteration are necessary to get an optimal solution, which will severely affect the efficiency of application. A novel algorithm for decomposition of interference hyperspectral images based on split Bregman iteration is proposed in this paper, compared with other decomposition methods, numerical experiments have proved that the proposed method will be much more efficient and can reduce the times of iteration significantly.

• 대한기계학회논문집A
• /
• 제27권4호
• /
• pp.551-558
• /
• 2003

An efficient and reliable subspace iteration algorithm using the block algorithm is proposed. The block algorithm is the method dividing eigenpairs into several blocks when a lot of eigenpairs are required. One of the key for the faster convergence is carefully selected initial vectors. As the initial vectors, the proposed method uses the modified Ritz vectors for guaranteering all the required eigenpairs and the quasi-static Ritz vectors for accelerating convergency of high frequency eigenvectors. Applying the quasi-static Ritz vectors, a shift is always required, and the proper shift based on the geometric average is proposed. To maximize efficiency, this paper estimates the proper number of blocks based on the theoretical amount of calculation in the subspace iteration. And it also considers the problems generated in the process of combining various algorithms and the solutions to the problems. Several numerical experiments show that the proposed subspace iteration algorithm is very efficient, reliable ,and accurate.

• 대한수학회보
• /
• 제55권2호
• /
• pp.431-448
• /
• 2018

This paper is concerned with the positive definite solutions of the nonlinear matrix equation $X-A^*{\bar{X}}^{-1}A=Q$, where A, Q are given complex matrices with Q positive definite. We show that such a matrix equation always has a unique positive definite solution and if A is nonsingular, it also has a unique negative definite solution. Moreover, based on Sherman-Morrison-Woodbury formula, we derive elegant relationships between solutions of $X-A^*{\bar{X}}^{-1}A=I$ and the well-studied standard nonlinear matrix equation $Y+B^*Y^{-1}B=Q$, where B, Q are uniquely determined by A. Then several effective numerical algorithms for the unique positive definite solution of $X-A^*{\bar{X}}^{-1}A=Q$ with linear or quadratic convergence rate such as inverse-free fixed-point iteration, structure-preserving doubling algorithm, Newton algorithm are proposed. Numerical examples are presented to illustrate the effectiveness of all the theoretical results and the behavior of the considered algorithms.

• 한국광학회:학술대회논문집
• /
• 한국광학회 1990년도 제5회 파동 및 레이저 학술발표회 5th Conference on Waves and lasers 논문집 - 한국광학회
• /
• pp.79-81
• /
• 1990

Temperature distribution of laser diode chip mounted on ideal heat kink was calculated by numerical analysis. In numerical analysis, infinite difference method and Gauss-Scidel iteration was adopted on the basis of two dimensional heat conduction phenomena. As a result, temperature increase of active medium of laser diode driven at 60mA was calculated to be 1.47$^{\circ}C$