• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.747-760
• /
• 2014

In this paper a higher order iterative algorithm is developed for an unconstrained multivariate optimization problem. Taylor expansion of matrix valued function is used to prove the cubic order convergence of the proposed algorithm. The methodology is supported with numerical and graphical illustration.

• East Asian mathematical journal
• /
• v.33 no.5
• /
• pp.511-525
• /
• 2017

We introduce an extrapolated higher order characteristic finite element method to construct approximate solutions of a Sobolev equation with a convection term. The higher order of convergence in both the temporal direction and the spatial direction in $L^2$ normed space is established and some computational results to support our theoretical results are presented.

• Journal of the Chungcheong Mathematical Society
• /
• v.25 no.2
• /
• pp.359-365
• /
• 2012

The purpose of this paper is to provide some corrections regarding algebraic flaws encountered in the paper entitled "Sixteenth-order method for nonlinear equations" which was published in January of 2010 by Li et al.[9]. Further detailed comments on their error equation are stated together with convergence analysis as well as high-precision numerical experiments.

• Journal of applied mathematics & informatics
• /
• v.7 no.2
• /
• pp.527-538
• /
• 2000

We provide sufficient conditions for the monotone convergence of a Chebysheff-Halley-type method or method of tangent hyperbolas in a partially ordered topological space setting. The famous kantorovich theorem on fixed points is used here.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.773-781
• /
• 2010

Recently, Yun [8] proposed a new three-step iterative method with the fourth-order convergence for solving nonlinear equations. By using his ideas, we develop a general form of multi-step iterative methods with higher order convergence for solving nonlinear equations, and then we study convergence analysis of the multi-step iterative methods. Lastly, some numerical experiments are given to illustrate the performance of the multi-step iterative methods.

• Journal of the Chungcheong Mathematical Society
• /
• v.21 no.4
• /
• pp.483-492
• /
• 2008

The k-fold pseudo-Newton's method is proposed and its convergence behavior is investigated near a simple zero. The order of convergence is proven to be at least k + 2. The asymptotic error constant is explicitly given in terms of k and the corresponding simple zero. High-precison numerical results are successfully implemented via Mathematica and illustrated for various examples.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.77-85
• /
• 1994

In this study an adaptive algorithm with optimum convergence factor for steepest descent method is proposed, which controls automatically the filter order to take the appropriate level. So far, fixed order filters have been used when adaptive filter is employed according to the priori knowledge or experience in various adaptive signal processing applications. But, it is so difficult to know the filter order needed in real implementations that high order filters have to be performed. As a result, redundant calculations are increased in the case of high order filters. The proposed variable length optimum convergence factor (VLOCF) algorithm takes the appropriated filter order within the given one so that the redundant calculation is decreased to get the enhancement of convergence speed and smaller convergence error during the steady state. The proposed algorithm is evaluated to prove the validity by computer simulation for system Identification.

• Journal of the Chungcheong Mathematical Society
• /
• v.37 no.1
• /
• pp.27-40
• /
• 2024

In this paper, we consider the higher-order HartreeFock equations. The higher-order linear Schrödinger equation was introduced in [5] as the formal finite Taylor expansion of the pseudorelativistic linear Schrödinger equation. In [13], the authors established global-in-time Strichartz estimates for the linear higher-order equations which hold uniformly in the speed of light c ≥ 1 and as their applications they proved the convergence of higher-order Hartree-Fock equations to the corresponding pseudo-relativistic equation on arbitrary time interval as c goes to infinity when the Taylor expansion order is odd. To achieve this, they not only showed the existence of solutions in L² space but also proved that the solutions stay bounded uniformly in c. We address the remaining question on the convergence of higherorder Hartree-Fock equations when the Taylor expansion order is even. The distinguished feature from the odd case is that the group velocity of phase function would be vanishing when the size of frequency is comparable to c. Owing to this property, the kinetic energy of solutions is not coercive and only weaker Strichartz estimates compared to the odd case were obtained in [13]. Thus, we only manage to establish the existence of local solutions in H^s space for s > $\frac{1}{3}$ on a finite time interval [-T, T], however, the time interval does not depend on c and the solutions are bounded uniformly in c. In addition, we provide the convergence result of higher-order Hartree-Fock equations to the pseudo-relativistic equation with the same convergence rate as the odd case, which holds on [-T, T].

• The Journal of the Acoustical Society of Korea
• /
• v.12 no.1
• /
• pp.37-46
• /
• 1993

The adaptive algorithm for the Volterra filter is considered. Owing to its simplicity, the LMS algorithm for adaptive Volterra filter(AVF) is widely used as in linear adaptive filters. However, the convergence speed is unsatisfactory. For improving the convergence speed, the frequency domain LMS second order adaptive Volterra filter(FLMS-AVF) is proposed and analyzed. We show that the time and frequency domain LMS AVF's have the same steady state performance under approprate conditons. Moreover, it can be shown that this algorithm can improve the convergence speed significantly by applying self-orthogonalizing method.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.4
• /
• pp.753-762
• /
• 2014

A three-step sextic simple-root finder is constructed with the use of weighting functions of derivative-to-derivative ratios. Their convergence and computational properties are investigated along with concrete numerical examples to verify the theoretical analysis.