Abstract: In this paper, the modified Gauss-Seidel method with the new preconditioner for solving the linear system Ax = b, where A is a nonsingular M-matrix with unit diagonal, is considered. The convergence property and the comparison theorems of the proposed method are established. Two examples are given to show the efficiency and effectiveness of the modified Gauss-Seidel method
with the presented new preconditioner.
Abstract: We prove the weak convergence of Mann iteration for a hybrid pair of maps to a common fixed point of a selfmap f and a multivalued f nonexpansive mapping T in Banach space E.
Abstract: In this paper, we propose Hermite collocation method for solving Thomas-Fermi equation that is nonlinear ordinary differential equation on semi-infinite interval. This method reduces the solution of this problem to the solution of a system of algebraic equations. We also present the comparison of this work with solution of other methods that shows the present solution is more accurate and faster convergence in this problem.
Abstract: Conjugate gradient method has been enormously used
to solve large scale unconstrained optimization problems due to the
number of iteration, memory, CPU time, and convergence property,
in this paper we find a new class of nonlinear conjugate gradient
coefficient with global convergence properties proved by exact line
search. The numerical results for our new βK give a good result when
it compared with well known formulas.
Abstract: In this paper, we prove a strong convergence result using a recently introduced iterative process with contractive-like operators. This improves andgeneralizes corresponding results in the literature in two ways: iterativeprocess is faster, operators are more general. At the end, we indicatethat the results can also be proved with the iterative process witherror terms.
Abstract: This paper investigates a method for the state estimation of nonlinear systems described by a class of differential-algebraic equation (DAE) models using the extended Kalman filter. The method involves the use of a transformation from a DAE to ordinary differential equation (ODE). A relevant dynamic power system model using decoupled techniques will be proposed. The estimation technique consists of a state estimator based on the EKF technique as well as the local stability analysis. High performances are illustrated through a simulation study applied on IEEE 13 buses test system.
Abstract: Due to uncertainty of wind velocity, wind power generators don’t have deterministic output power. Utilizing wind power generation and thermal power plants together create new concerns for operation engineers of power systems. In this paper, a model is presented to implement the uncertainty of load and generated wind power which can be utilized in power system operation planning. Stochastic behavior of parameters is simulated by generating scenarios that can be solved by deterministic method. A mixed-integer linear programming method is used for solving deterministic generation scheduling problem. The proposed approach is applied to a 12-unit test system including 10 thermal units and 2 wind farms. The results show affectivity of piecewise linear model in unit commitment problems. Also using linear programming causes a considerable reduction in calculation times and guarantees convergence to the global optimum. Neglecting the uncertainty of wind velocity causes higher cost assessment of generation scheduling.
Abstract: We model the process of a data center as a multi- objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consump¬tion and response time (makespan) subject to the constraints of deadlines and architectural requirements. A simple technique based on multi-objective goal programming is proposed that guarantees Pareto optimal solution with excellence in convergence process. The proposed technique also is compared with other traditional approach. The simulation results show that the proposed technique achieves superior performance compared to the min-min heuristics, and com¬petitive performance relative to the optimal solution implemented in UNDO for small-scale problems.
Abstract: Recent experimental evidences have shown that because
of a fast convergence and a nice accuracy, neural networks training
via extended kalman filter (EKF) method is widely applied. However,
as to an uncertainty of the system dynamics or modeling error, the
performance of the method is unreliable. In order to overcome this
problem in this paper, a new finite impulse response (FIR) filter based
learning algorithm is proposed to train radial basis function neural
networks (RBFN) for nonlinear function approximation. Compared
to the EKF training method, the proposed FIR filter training method
is more robust to those environmental conditions. Furthermore , the
number of centers will be considered since it affects the performance
of approximation.
Abstract: A numerical approach for solving constant-coefficient differential equations whose solutions exhibit boundary layer structure is built by inserting Bernstein Partition of Unity into Galerkin variational weak form. Due to the reproduction capability of Bernstein basis, such implementation shows excellent accuracy at boundaries and is able to capture sharp gradients of the field variable by p-refinement using regular distributions of equi-spaced evaluation points. The approximation is subjected to convergence experimentation and a procedure to assemble the discrete equations without a background integration mesh is proposed.
Abstract: To solve saddle point systems efficiently, several preconditioners have been published. There are many methods for constructing preconditioners for linear systems from saddle point problems, for instance, the relaxed dimensional factorization (RDF) preconditioner and the augmented Lagrangian (AL) preconditioner are used for both steady and unsteady Navier-Stokes equations. In this paper we compare the RDF preconditioner with the modified AL (MAL) preconditioner to show which is more effective to solve Navier-Stokes equations. Numerical experiments indicate that the MAL preconditioner is more efficient and robust, especially, for moderate viscosities and stretched grids in steady problems. For unsteady cases, the convergence rate of the RDF preconditioner is slightly faster than the MAL perconditioner in some circumstances, but the parameter of the RDF preconditioner is more sensitive than the MAL preconditioner. Moreover the convergence rate of the MAL preconditioner is still quite acceptable. Therefore we conclude that the MAL preconditioner is more competitive than the RDF preconditioner. These experiments are implemented with IFISS package.
Abstract: By means of Sidi-Israeli’s quadrature rules, mechanical quadrature methods (MQMs) for solving the first kind boundary integral equations (BIEs) of steady state Stokes problem are presented. The convergence of numerical solutions by MQMs is proved based on Anselone’s collective compact and asymptotical compact theory, and the asymptotic expansions with the odd powers of the errors are provided, which implies that the accuracy of the approximations by MQMs possesses high accuracy order O (h3). Finally, the numerical examples show the efficiency of our methods.
Abstract: In this article, a new inexact alternating direction method(ADM) is proposed for solving a class of variational inequality problems. At each iteration, the new method firstly solves the resulting subproblems of ADM approximately to generate an temporal point ˜xk, and then the multiplier yk is updated to get the new iterate yk+1. In order to get xk+1, we adopt a new descent direction which is simple compared with the existing prediction-correction type ADMs. For the inexact ADM, the resulting proximal subproblem has closedform solution when the proximal parameter and inexact term are chosen appropriately. We show the efficiency of the inexact ADM numerically by some preliminary numerical experiments.
Abstract: GMDH algorithm can well describe the internal structure of objects. In the process of modeling, automatic screening of model structure and variables ensure the convergence rate.This paper studied a new GMDH model based on polynomial spline stimation. The polynomial spline function was used to instead of the transfer function of GMDH to characterize the relationship between the input variables and output variables. It has proved that the algorithm has the optimal convergence rate under some conditions. The empirical results show that the algorithm can well forecast Consumer Price Index (CPI).
Abstract: In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some preliminary numerical results, which indicate that the new method is quite efficient.
Abstract: A new basis function neural network algorithm is proposed for numerical integration. The main idea is to construct neural network model based on spline basis functions, which is used to approximate the integrand by training neural network weights. The convergence theorem of the neural network algorithm, the theorem for numerical integration and one corollary are presented and proved. The numerical examples, compared with other methods, show that the algorithm is effective and has the characteristics such as high precision and the integrand not required known. Thus, the algorithm presented in this paper can be widely applied in many engineering fields.
Abstract: In this paper, we discuss semiconvergence of the alternating iterative methods for solving singular systems. The semiconvergence theories for the alternating methods are established when the coefficient matrix is a singular matrix. Furthermore, the corresponding comparison theorems are obtained.
Abstract: Learning the gradient of neuron's activity function
like the weight of links causes a new specification which is
flexibility. In flexible neural networks because of supervising and
controlling the operation of neurons, all the burden of the learning is
not dedicated to the weight of links, therefore in each period of
learning of each neuron, in fact the gradient of their activity function,
cooperate in order to achieve the goal of learning thus the number of
learning will be decreased considerably.
Furthermore, learning neurons parameters immunes them against
changing in their inputs and factors which cause such changing.
Likewise initial selecting of weights, type of activity function,
selecting the initial gradient of activity function and selecting a fixed
amount which is multiplied by gradient of error to calculate the
weight changes and gradient of activity function, has a direct affect
in convergence of network for learning.
Abstract: This work presents a numerical simulation of the interaction of an incident shock wave propagates from the left to the right with a cone placed in a tube at shock. The Mathematical model is based on a non stationary, viscous and axisymmetric flow. The Discretization of the Navier-stokes equations is carried out by the finite volume method in the integral form along with the Flux Vector Splitting method of Van Leer. Here, adequate combination of time stepping parameter, CFL coefficient and mesh size level is selected to ensure numerical convergence. The numerical simulation considers a shock tube filled with air. The incident shock wave propagates to the right with a determined Mach number and crosses the cone by leaving behind it a stationary detached shock wave in front of the nose cone. This type of interaction is observed according to the time of flow.
Abstract: An adaptive dynamic cerebellar model articulation
controller (DCMAC) neural network used for solving the prediction
and identification problem is proposed in this paper. The proposed
DCMAC has superior capability to the conventional cerebellar model
articulation controller (CMAC) neural network in efficient learning
mechanism, guaranteed system stability and dynamic response. The
recurrent network is embedded in the DCMAC by adding feedback
connections in the association memory space so that the DCMAC
captures the dynamic response, where the feedback units act as
memory elements. The dynamic gradient descent method is adopted to
adjust DCMAC parameters on-line. Moreover, the analytical method
based on a Lyapunov function is proposed to determine the
learning-rates of DCMAC so that the variable optimal learning-rates
are derived to achieve most rapid convergence of identifying error.
Finally, the adaptive DCMAC is applied in two computer simulations.
Simulation results show that accurate identifying response and
superior dynamic performance can be obtained because of the
powerful on-line learning capability of the proposed DCMAC.