• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.179-195
• /
• 2024

In this article, we study the Picard-Ishikawa iterative method for approximating the fixed point of generalized α-Reich-Suzuki nonexpanisive mappings. The weak and strong convergence theorems of the considered method are established with mild assumptions. Numerical example is provided to illustrate the computational efficiency of the studied method. We apply our results to the solution of a nonlinear delay integral equation. The results in this article are improvements of well-known results.

• Nuclear Engineering and Technology
• /
• v.53 no.8
• /
• pp.2556-2563
• /
• 2021

Metaheuristic algorithms can work well in solving or optimizing problems, especially those that require approximation or do not have a good analytical solution. Particle swarm optimization (PSO) is one of these algorithms. The response quality of these algorithms depends on the objective function and its regulated parameters. The nonlinear nature of the pressurized light-water nuclear reactor (PWR) dynamics is a significant target for PSO. The two-point kinetics model of this type of reactor is used because of fission products properties. The proportional-integral-derivative (PID) controller is intended to control the power level of the PWR at a short-time transient. The absolute error (IAE), integral of square error (ISE), integral of time-absolute error (ITAE), and integral of time-square error (ITSE) objective functions have been used as performance indexes to tune the PID gains with PSO. The optimization results with each of them are evaluated with the number of function evaluations (NFE). All performance indexes achieve good results with differences in the rate of over/under-shoot or convergence rate of the cost function, in the desired time domain.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.2 no.2
• /
• pp.81-95
• /
• 1998

The superconvergence of the Sloan iterate obtained from a Galerkin method for the approximate solution of the singular integral equation based on the use of two sets of orthogonal polynomials is investigated. The discrete Sloan iterate using Gaussian quadrature to evaluate the integrals in the equation becomes the Nystr$\ddot{o}$m approximation obtained by the same rules. Consequently, it is impossible to expect the faster convergence of the Sloan iterate than the discrete Galerkin approximation in practice.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.429-437
• /
• 2001

In [1, 2], described a Chebyshev series method for the numerical solution of integral equations with three automatic algorithms for computing tow regularization parameters, C/sub f/ and r. Here we describe a Fourier series expansion method for a class singular integral equations with Hilbert kernel and constant coefficients with using a new automatic algorithm.

• The Pure and Applied Mathematics
• /
• v.17 no.2
• /
• pp.175-183
• /
• 2010

Using Darbo's fixed point theorem, we establish the existence of monotone solutions for a nonlinear quadratic integral equation of Volterra type in the Banach space of real functions defined and continuous on a bounded and closed interval.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.247-262
• /
• 2016

We propose and analyze spectral and pseudo-spectral Jacobi-Galerkin approaches for weakly singular Volterra integral equations (VIEs). We provide a rigorous error analysis for spectral and pseudo-spectral Jacobi-Galerkin methods, which show that the errors of the approximate solution decay exponentially in $L^{\infty}$ norm and weighted $L^2$-norm. The numerical examples are given to illustrate the theoretical results.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.503-512
• /
• 1999

The purpose of this paper is to introduce the (Toeplitz) quadrature method for solving fredholm integral equations of the second kind with mildly singular kernels. We are presented some numerical examples for the computation of the error estimate using the MathCad package.

• Kyungpook Mathematical Journal
• /
• v.51 no.3
• /
• pp.251-260
• /
• 2011

The aim of this paper is to obtain a solution of a certain multidimensional convolution integral equation of Fredholm type whose kernel involves a generalized polynomial set. A number of results follow as special cases from the main theorem by specifying the parameters of the generalized polynomial set.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.23-37
• /
• 2011

In this paper, we use a modified Tikhonov regularization method to solve the Fredholm integral equation of the first kind. Under the assumption that measured data are contaminated with deterministic errors, we give two error estimates. The convergence rates can be obtained under the suitable choices of regularization parameters and the number of measured points. Some numerical experiments show that the proposed method is effective and stable.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.261-275
• /
• 2002

Besides asymptotic method, the method of orthogonal polynomials has been used to obtain the solution of the Fredholm integral equation. The principal (singular) part of the kerne1 which corresponds to the selected domain of parameter variation is isolated. The unknown and known functions are expanded in a Chebyshev polynomial and an infinite a1gebraic system is obtained.