Search Results - (( initial iteration method algorithm ) OR ( using codification based algorithm ))

Multiple equations model selection algorithm with iterative estimation method by Kamarudin, Nur Azulia, Ismail, Suzilah

“…There have been various procedures suggested to date, whether through manual or automated selections, to choose the best model.This study nonetheless focuses on an automated selection for multiple equations model with the use of iterative estimation method. In particular, an algorithm on model selection for seemingly unrelated regression equations model using iterative feasible generalized least squares estimation method is proposed. …”
Get full text
Get full text
Get full text

Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

“…This method involves guessing initial conditions and iteratively adjusting them until the solution satisfies the boundary conditions at the other end of the domain. …”
Get full text
Get full text

Shortcomings analysis of iterative methods to solve ill-condition systems of linear equations / Nur Nabil Nadiah Elias by Elias, Nur Nabil Nadiah

Get full text
Get full text

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

“…In this study, emphasis is placed on analytical approximate methods. These methods include the combination of the Sumudu transform (ST) with the homotopy perturbation method (HPM), namely the Sumudu transform homotopy perturbation method (STHPM), the combination of the ST with the variational iteration method (VIM), namely the Sumudu transform variational iteration method (STVIM) and finally, the combination of the ST with the homotopy analysis method (HAM), namely the Sumudu transform homotopy analysis method (STHAM). …”
Get full text
Get full text

Modified Sumudu Transform Analytical Approximate Methods For Solving Boundary Value Problems by Al-Nemrat, Asem Mustafa Moh’ad

“…In this study, emphasis is placed on analytical approximate methods. These methods include the combination of the Sumudu transform (ST) with the homotopy perturbation method (HPM), namely the Sumudu transform homotopy perturbation method (STHPM), the combination of the ST with the variational iteration method (VIM), namely the Sumudu transform variational iteration method (STVIM) and finally, the combination of the ST with the homotopy analysis method (HAM), namely the Sumudu transform homotopy analysis method (STHAM). …”
Get full text
Get full text

Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

“…The LP’s application is need to be further computed with a technique and Simplex algorithm is the one that commonly used. The Simplex algorithm has three stages of computation namely initialization, iterative calculation and termination. …”
Get full text
Get full text
Get full text
Get full text

Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

“…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
Get full text
Get full text

A study on unsteady flow of gas through a porous medium by Muhammad Aslam Noor, Syed Tauseef Mohyud-Din

“…The diagonal Pade approximants are effectively used in the analysis to capture the essential behavior of y(x) and to determine the initial slope y'(0). The fact that the iterative method solves nonlinear problems without using Adomian’s polynomials is a clear advantage of this technique over the decomposition method…”
Get full text
Get full text

Identification of manipulator kinematics parameters through iterative method by Baharin, Iskandar, Hasan, Md. Mahmud

“…The proposed method is numerically stable since it converges to the correct answer, with virtually any initial approximation. and also produces the null solution. …”
Get full text

Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

“…In terms of iterations count, the iterative methods based on the 9-Point Laplacian give the less number of iterations than the 5-Point Laplacian. …”
Get full text
Get full text
Get full text

Numerical performance of three conjugate gradient methods using exact line search / Nurul Asyiqin Sobaruddin by Sobaruddin, Nurul Asyiqin

Get full text
Get full text

Generalized Fibonacci search for optimization of unconstrained one-and two-dimensional unimodal functions by Chong, Chin Yoon *

“…The Swing Descent method also involves the use of Initial Interval and Bracketing searches. …”
Get full text

Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi by Rozaimi, Nur Farah Hanis

Get full text
Get full text

Improved hybrid methods in solving single variable nonlinear algebraic equations / Nor Hanim Abd Rahman by Abd Rahman, Nor Hanim

“…Secondly, some of the methods utilized successive approximation procedure to ensure every step of computing will converge to the desired root and one of the most common problems is the improper initial values for the iterative methods. …”
Get full text
Get full text

Enhanced Algorithms By Combining Gauss-Seidel And Newton-Raphson In Load Flow Analysis by Abouhasera, Mohamed Khalid Mohamed

“…Traditional load flow solution methods like Newton-Raphson has a great convergence characteristics with regards to its number of iterations and computing time, but suffers from poor convergence when used to solve ill-conditioned networks or if the starting initial values are far from solution. …”
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

“…Unlike the normal PSO algorithm which initializes the particle swarm at the robot’s starting position and iteratively determining each waypoint until a completed path is generated, MPSO algorithm initializes the particle swarm within a predefined search space and searches for the global best position within it to determine a specific robot waypoint through iteration updates. …”
Get full text
Get full text

Solving of Lane-Emden Equation using Semi-Analytical Iterative method / Masitoh Mustafah, Nor Afif Muhammad Nor and Puteri Fatin Syazwani Mohamad by Mustafah, Masitoh, Muhammad Nor, Nor Afif, Mohamad, Puteri Fatin Syazwani

“…Recently, many research about solving Lane-Emden equations have been done by using different type of methods but to solve using Semi-Analytical Iterative Method are still new and undiscover. …”
Get full text
Get full text

Comparative study of nonlinear root finding using improvised Secant methods / Nurul Nabilah Rosli … [et al.] by Rosli, Nurul Nabilah, Shahari, Nor Azni, Mohamad Azraei, Farah Atikah, Izaham, Siti Najwa

“…The Secant method is one of the best iterative methods since it only requires a single evaluation of function. …”
Get full text
Get full text
Get full text

Solving Zhou's chaotic system using Euler's method by Mohd Roslan, Umuu ’Atiqah, Salleh, Zabidin, Kilicman, Adem

“…An algorithm for Euler’s method is used to obtain an approximation for the initial-value problem for ordinary differential equation. …”
Get full text
Get full text
Get full text