• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.691-707
• /
• 2016

In this paper, we first introduce two one-parameter relaxation (OPR) iterative methods for solving singular saddle point problems whose semi-convergence rate can be accelerated by using scaled preconditioners. Next we present formulas for finding their optimal parameters which yield the best semi-convergence rate. Lastly, numerical experiments are provided to examine the efficiency of the OPR methods with scaled preconditioners by comparing their performance with the parameterized Uzawa method with optimal parameters.

• Journal of the Korean Mathematical Society
• /
• v.59 no.6
• /
• pp.1067-1082
• /
• 2022

This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

• Journal of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.841-857
• /
• 1997

We present analysis and some computational methods for boundary optimal and feedback control problems for Navier-Stokes equations. We use one example to illustrate our methodology and ideas which are applicable to general control problems for Navier-Stokes equations. First, we discuss the existence of optimal solutions and derive an optimality system of equations from which an optimal solution may be computed. Then we present a gradient type iterative method. Finally, we present some numerical results.

• Journal of applied mathematics & informatics
• /
• v.38 no.5_6
• /
• pp.489-506
• /
• 2020

The spatial fractional diffusion equation can be discretized by employing the implicit finite difference scheme using the shifted Grünwald formula. The discretized linear system is obtained, whose the coefficient matrix has a diagonal-plus-Toeplitz structure. In order to solve the diagonal-plus-Toeplitz linear system, on the basis of circulant and skew-circulant splitting (CSCS splitting), we construct a new and efficient iterative method, called DSCS iterative methods, which have two parameters. Than we prove the convergence of DSCS methods. As a focus, we derive the simple and effective values of two optimal parameters under some restrictions. Some numerical experiments are carried out to illustrate the validity and accuracy of the new methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.216-225
• /
• 2007

This paper presents bit splitting methods to apply multilevel modulation to iterative codes such as turbo code, low density parity check code and turbo product code. Log-likelihood ratio method splits multilevel symbols to bits using the received in-phase and quadrature component based on Gaussian approximation. However it is too complicate to calculate and implement hardware due to exponential and log calculation. therefore this paper presents Euclidean, MAX and Sector method to reduce the high complexity of LLR method. We propose optimal bit splitting method for three iterative codes.

• Journal of the Chungcheong Mathematical Society
• /
• v.29 no.4
• /
• pp.663-676
• /
• 2016

In this paper we propose a new family of eighth order optimal methods for solving nonlinear equations by using weight function methods. The methods of the family require three function and one derivative evaluations per step and has order of convergence eight, and so they are optimal in the sense of Kung-Traub hypothesis. Precise analysis of convergence is given. Some members of the family are compared with several existing methods to show their performance and as a result to confirm that our methods are as competitive as compared to them.

• Korean Journal of Mathematics
• /
• v.13 no.1
• /
• pp.113-122
• /
• 2005

We consider the iterative schemes for the large sparse linear system to solve partial differential equations. Using spectral radius of iteration matrices, the optimal relaxation parameters and good parameters can be obtained. With those parameters we compare the effectiveness of the SOR and SSOR algorithms. Applying Crank-Nicolson approximation, we observe the error distribution according to domain decomposition. The number of processors due to domain decomposition affects time and error. Numerical experiments show that effectiveness of SOR and SSOR can be reversed as time size varies, which is not the usual case. Finally, these phenomena suggest conjectures about equilibrium time grid for SOR and SSOR.

• Journal of applied mathematics & informatics
• /
• v.34 no.1_2
• /
• pp.85-94
• /
• 2016

In this paper, we first propose a fast one-parameter relaxation (FOPR) method with a scaled preconditioner for solving the saddle point problems, and then we present a formula for finding its optimal parameter. To evaluate the effectiveness of the proposed FOPR method with a scaled preconditioner, numerical experiments are provided by comparing its performance with the existing one or two parameter relaxation methods with optimal parameters such as the SOR-like, the GSOR and the GSSOR methods.

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

The Helmholtz equation is very important in physics and engineering. However, solution of the Helmholtz equation is in general known as a very difficult phenomenon. For if the ${\omega}$ is negative, the FDM discretized linear system becomes indefinite, whose solution by iterative method requires a very clever preconditioner. In this paper we assume that ${\omega}$ is nonnegative, and determine the optimal ${\rho}$ parameter for the three dimensional ADI iteration for the Helmholtz equation. The ADI(Alternating Direction Implicit) method is also getting new attentions due to the fact that it is very suitable to the vector/parallel computers, for example, as a preconditioner to the Krylov subspace methods. However, classical ADI was developed for two dimensions, and for three dimensions it is known that its convergence behaviour is quite different from that in two dimensions. So far, in three dimensions the so-called Douglas-Rachford form of ADI was developed. It is known to converge for a relatively wide range of ${\rho}$ values but its convergence is very slow. In this paper we determine the necessary conditions of the ${\rho}$ parameter for the convergence and optimal ${\rho}$ for the three dimensional ADI iteration of the Peaceman-Rachford form for the real Helmholtz equation with nonnegative ${\omega}$. Also, we conducted some experiments which is in close agreement with our theory. This straightforward extension of Peaceman-rachford ADI into three dimensions will be useful as an iterative solver itself or as a preconditioner to the the Krylov subspace methods, such as CG(Conjugate Gradient) method or GMRES(m).

• Coupled systems mechanics
• /
• v.4 no.3
• /
• pp.263-277
• /
• 2015

This paper presents a coupled FEM-BEM strategy for the numerical analysis of elastodynamic problems where infinite-domain models and complex heterogeneous media are involved, rendering a configuration in which neither the Finite Element Method (FEM) nor the Boundary Element Method (BEM) is most appropriate for the numerical analysis. In this case, the coupling of these methodologies is recommended, allowing exploring their respective advantages. Here, frequency domain analyses are focused and an iterative FEM-BEM coupling technique is considered. In this iterative coupling, each sub-domain of the model is solved separately, and the variables at the common interfaces are iteratively updated, until convergence is achieved. A relaxation parameter is introduced into the coupling algorithm and an expression for its optimal value is deduced. The iterative FEM-BEM coupling technique allows independent discretizations to be efficiently employed for both finite and boundary element methods, without any requirement of matching nodes at the common interfaces. In addition, it leads to smaller and better-conditioned systems of equations (different solvers, suitable for each sub-domain, may be employed), which do not need to be treated (inverted, triangularized etc.) at each iterative step, providing an accurate and efficient methodology.