Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

91 results for “Convergence Problem”
Set a search alert
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,684 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Method for Constructing the Coefficients of Pressure Correction Equation for Colocated Unstructured GridsR. Rafee, H. RahimzadehOne of the important equations in numerical solution of Navier Stokes equations is the pressure correction equation. In this article, a new method for constructing the coefficients of this equation for colocated unstructured meshes is proposed. This method is based on momentum interpolation. The method is compared with the approach adopted in literature. The complete discretization of the Navier Stokes … …American Journal of Applied Sciences, Vol. 6, Issue 1 · 31 Jan 2009 · 7,142 accessesView PDFCite
Research ArticleOpen accessIn the abstractMemory Convergence and Optimization with Fuzzy PSO and ACSSubhash C. Pandey, Dr. P. MisraAssociative neural memories are models of biological phenomena that allow for the storage of pattern associations and the retrieval of the desired output pattern upon presentation of a possibly noisy or incomplete version of an input pattern. In this study, we introduce fuzzy swarm particle optimization technique for convergence of associative neural memories based on fuzzy set theory. A Fuzzy … …Journal of Computer Science, Vol. 4, Issue 2 · 28 Feb 2008 · 7,176 accessesView PDFCite
Research ArticleOpen accessIn the abstractSpeedup of Particle Transport Problems with a Beowulf ClusterZhongxiang Zhao, G. Ivan MaldonadoThe MCNP code is a general Monte Carlo N-Particle Transport program that is widely used in health physics, medical physics and nuclear engineering for problems involving neutron, photon and electron transport[1]. However, due to the stochastic nature of the algorithms employed to solve the Boltzmann transport equation, MCNP generally exhibits a slow rate of convergence. In fact, engineers and scientists … …American Journal of Applied Sciences, Vol. 3, Issue 8 · 31 Dec 2006 · 6,923 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Iterative Algorithms with Accelerate Convergence for Solving Implicit Difference EquationsQing-Fu Liu, Wei-Jun Zhong, Mancho ManevThis study focuses on the solution of implicit difference equations, which are very difficult to compute in parallel for the diffusion equation. For improving the convergence rates and the properties of gradual-approach convergence of Segment-Classic-Implicit-Iterative (SCII) and Segment-Crank-Nicolson-Iterative (SCNI) algorithms realizing efficient iterative computation in parallel by segmenting grid domains, SCII and SCNI algorithms with accelerated convergence are studied and … …American Journal of Applied Sciences, Vol. 1, Issue 1 · 31 Mar 2004 · 6,801 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn the Discretized Algorithm for Optimal Problems Constrained by Differential Equation with Real CoefficientsO. OlotuA discretized scheme, Discretized Continuous Algorithm (DCA), for solving constrained quadratic optimal control problems was developed to ease the computational cumbersomeness inherent in some existing algorithms, particularly, the Function Space A lgorithm (FSA) by replacing the integral by a series of summation. In order to accomplish this numerical scheme, we resort to a finite approximation of it by discretizing its … …Journal of Mathematics and Statistics, Vol. 3, Issue 4 · 31 Dec 2007 · 6,854 accessesView PDFCite
Research ArticleOpen accessIn the abstractSufficient Descent Condition of the Polak-Ribière-Polyak (PRP) Conjugate Gradient Method without Line SearchAbdelrahman A., KH. I. Osman, Osman O.O. Yousif et al.Nonlinear conjugate gradient methods for unconstrained optimization problems are used in many aspects of theoretical and applied sciences. They are iterative methods, so at any iteration a step length is computed using a method called line search. In most cases, the sufficient descent condition plays an important role to prove the global convergence of a conjugate gradient method. Due to … …Journal of Mathematics and Statistics, Vol. 18, Issue 1 · 14 Mar 2022 · 6,365 accessesView PDFCite
Research ArticleOpen accessIn the abstractTrajectory Tracking Control of UR5 Robot Manipulator Using Fuzzy Gain Scheduling Terminal Sliding Mode ControllerAndualem Welabo, Gebremichael TesfamariamrIn dealing with the trajectory tracking control of robotic manipulator many scholars have had to work in a sliding mode controller. However, SMC has two major limitations one is chattering the other is asymptotical convergence. The chattering problem occurs in traditional SMC due to the switching function of the discontinuous controller and the constant gain parameter of K. Though in … …Journal of Mechatronics and Robotics, Vol. 4, Issue 1 · 24 Jul 2020 · 11,722 accessesView PDFCite
Research ArticleOpen accessIn the abstractReactive Power Optimization Using Quantum Particle Swarm OptimizationK. S. Chandragupta Mauryan, K. Thanushkodi, A. SakthisuganyaProblem statement: The problem of controlling a power system is not an easy task; it is subjected to various constraints. There are at risks of voltage instability problems due to highly stressed operating conditions caused by increased load demand and other constraints in the power system network. Approach: This study presents the implementation of Quantum Particle Swarm Optimization (QPSO) in … …Journal of Computer Science, Vol. 8, Issue 10 · 24 Aug 2012 · 6,842 accessesView PDFCite