Showing 681 - 700 results of 1,490 for search '"ITER"', query time: 0.05s Refine Results
  1. 681

    Two-point diagonally implicit multistep block method for solving Robin boundary value problems using variable step size strategy by Nadirah, Mohd Nasir, Zanariah, Abdul Majid, Fudziah, Ismail, Norfifah, Bachok

    Published 2019
    “…Newton divided difference interpolation method is used during the iterative process for estimating the guessing values. …”
    Get full text
    Article
  2. 682

    Potts model with competing interactions on a Cayley tree of k-th order by Ganikhodjaev, Nasir, Mohamed Nawi, Ashraf

    Published 2011
    “…To perform this study, an iterative scheme similar to that appearing in real space renormalization group frameworks is established; it recovers as particular case, previous works by Ganikhodjaev et al for k = 2. …”
    Get full text
    Book Chapter
  3. 683

    Potts model with competing interactions on a Cayley tree of k-th order by Ganikhodjaev, Nasir, Mohamed Nawi, Ashraf

    Published 2011
    “…To perform this study, an iterative scheme similar to that appearing in real space renormalization group frameworks is established; it recovers as particular case, previous works by Ganikhodjaev et al for k = 2. …”
    Get full text
    Proceeding Paper
  4. 684

    Gas Phase Structure and Stability of Complex Formed by H2O, NH3, H2S and Their Methyl Derivatives with the Cation Co2+ = Struktur dan Kestabilan Fasa Gas dari Kompleks CO2+-L, deng... by Perpustakaan UGM, i-lib

    Published 2004
    “…The gas-phase interaction energies computed by the SCF method including electron correlation Moller-Plesset 2 (MP2) dan Configuration Iteration (Cl) were comparable in accuracy. The binding energies computed by these two methods reach the targeted chemical accuracy. …”
    Article
  5. 685

    Memoryless quasi-Newton-type methods via some weak secant relations for large-scale unconstrained optimization by Lim, Keat Hee, Leong, Wah June

    Published 2024
    “…Our numerical results indicate that significant improvement has been achieved with respect to iteration counts and number of function evaluations.…”
    Get full text
    Article
  6. 686

    Jacobian computation-free Newton's method for systems of nonlinear equations. by Yusuf, Mohammed Waziri, Leong, Wah June, Abu Hassan, Malik, Monsi, Mansor

    Published 2010
    “…Unlike the classical Newton’s method, the proposed modification neither requires to compute and store the Jacobian matrix,nor to solve a system of linear equations in each iteration. This is made possible by approximating the Jacobian inverse to a diagonal matrix without computing the Jacobian. …”
    Get full text
    Article
  7. 687

    Multi-steps symmetric rank-one update for unconstrained optimization by Modarres, Farzin, Abu Hassan, Malik, Leong, Wah June

    Published 2009
    “…The basic idea is to incorporate the SR1 update within the framework of multi-step methods. Hence iterates could be interpolated by a curve in such a way that the consecutive points define the curves. …”
    Get full text
    Article
  8. 688

    Implementation of VSVO code for solving boundary value problems of Dirichlet and Neumann type by Phang, Pei See, Abdul Majid, Zanariah

    Published 2015
    “…The proposed block method can compute the solutions at two points simultaneously and adapted with multiple shooting technique via three-step iterative method. The performance for the proposed method was tested on the single and system of second order BVPs of Dirichlet and Neumann type. …”
    Get full text
    Conference or Workshop Item
  9. 689

    Operators with diskcyclic vectors subspaces by Bamerni, Nareen, Kilicman, Adem

    Published 2015
    “…In this paper, we prove that if T is diskcyclic operator then the closed unit disk multiplied by the union of the numerical range of all iterations of T is dense in H. Also, if T is diskcyclic operator and |λ| ≤ 1, then T – λI has dense range. …”
    Get full text
    Article
  10. 690

    An approximation of a multivariative stochastic model for the analysis of longitudinal data by Abu Bakar, Mohd Rizam, Ali Salah, Khalid

    Published 2008
    “…We consider a Bayesian approach which is motivated by the complexity of the model, thus, we propose to approximate the IOU stochastic process in a simple way that will mitigate the necessity to invert the stochastic process covariance matrix separately for each group at each iteration of the Markov Chain Monte Carlo (MCMC) sampler. …”
    Get full text
    Article
  11. 691

    An experimental study of the modified accelerated overrelaxation (MAOR) scheme on stationary helmholtz equation by Nik Mazlan, Nik Amir Syafiq, Othman, Mohamed, Senu, Norazak, Ismail, Fudziah

    Published 2019
    “…This research aims to experiment the Modified Accelerated Overrelaxation (MAOR) scheme on second order iterative method for solving two dimensional (2D) Helmholtz Equation. …”
    Get full text
    Article
  12. 692

    Fracture mechanics analysis of cracking in plain and reinforced concrete using the boundary element method by Aliabadi, MH, Saleh, Abdul Latif

    Published 2002
    “…In using the BEM to simulate cracks, the crack path need not be known in advance since it can be calculated during the iteration process and as such remeshing becomes obsolete. …”
    Get full text
    Article
  13. 693

    Adaptive neural network classifier for extracted invariants of handwriten digits by Keng, L. H., Shamsuddin, Siti Mariyam

    Published 2004
    “…The results show that the network applying an adaptive activation function between layers converged much faster compared to non-adaptive activation functions with 50% iterations reduction. In this study, we also present experimental results of feature extraction between Zernike and d-geometric for better feature representations. …”
    Get full text
    Article
  14. 694

    Mussels wandering optimization algorithmn based training of artificial neural networks for pattern classification by Abusnaina, Ahmed A., Abdullah, Rosni

    Published 2013
    “…Training an artificial neural network (ANN) is an optimization task since it is desired to find optimal neurons‘ weight of a neural network in an iterative training process. Traditional training algorithms have some drawbacks such as local minima and its slowness.Therefore, evolutionary algorithms are utilized to train neural networks to overcome these issues.This research tackles the ANN training by adapting Mussels Wandering Optimization (MWO) algorithm.The proposed method tested and verified by training an ANN with well-known benchmarking problems.Two criteria used to evaluate the proposed method were overall training time and classification accuracy.The obtained results indicate that MWO algorithm is on par or better in terms of classification accuracy and convergence training time.…”
    Get full text
    Conference or Workshop Item
  15. 695

    Validation of mGBL engineering model using group treatment experimental study by Zaibon, Syamsul Bahrin, Shiratuddin, Norshuhada

    Published 2011
    “…A mGBL engineering model is proposed intentionally for developing mGBL applications and is outlined in this paper to provide novice developers with an integrated model with which they can approach more systematically the design and development of mGBL.The engineering model combines a game life cycle based on iterative prototyping and learning model, with supporting activities drawn from sources of best practice in mobile game development.This paper describes an experimental study involving the implementation of the proposed model with a group of undergraduate students who are taking Game Application Development course. …”
    Get full text
    Conference or Workshop Item
  16. 696

    Aerodynamic design of annular ducts by Klier, A. M.

    Published 1990
    “…The technique is extended to cater for a class of swirling flows by investigating the derivation of a boundary layer approximation and further development allows the application of numerical iterative techniques to compressible flows with vorticity. …”
    Get full text
    Thesis
  17. 697

    Quarter-sweep preconditioned relaxation method, algorithm and efficiency analysis for fractional mathematical equation by Andang Sunarto, Praveen Agarwal, Jumat Sulaiman, Chew, Jackel Vui Lung, Shaher Momani

    Published 2021
    “…The proposed numerical method is able to solve the selected problems with fewer iterations and a faster execution time than the tested existing methods. …”
    Get full text
    Get full text
    Article
  18. 698

    Q-learning whale optimization algorithm for test suite generation with constraints support by Hassan, Ali Abdullah, Salwani, Abdullah, Kamal Z., Zamli, Rozilawati, Razali

    Published 2023
    “…Unlike WOA, QWOA-EMC permits just-in-time adaptive selection of its operators (i.e., between shrinking mechanism, spiral shape mechanism, and random generation) based on their historical performances as well as exploits the Monte Carlo Acceptance probability to further strengthen its exploration capabilities by allowing a poor performing operator to be reselected with probability in the early part of the iteration. Experimental results for constraints combinatorial test generation demonstrate that the proposed QWOA-EMC outperforms WOA and performs competitively against other metaheuristic algorithms.…”
    Get full text
    Get full text
    Article
  19. 699

    ESTIMASI BAYESIAN PARAMETER BUTIR TES DAN KEMAMPUAN PADA ITEM RESPONSE THEORY (IRT) MODEL 3-PL by MEMOLO, TUNDUNG

    Published 2015
    “…Estimator of item characteristics, difficulty level (b), discrimination (a), and pseudo guessing (c), and estimator of examinee is examinee of ability () gain by using Numeric Method , Newton-Raphson Iteration. The characteristics of item are used to determined information function. …”
    Thesis
  20. 700

    ESTIMASI MAKSIMUM LIKELIHOOD PADA ITEM RESPONSE THEORY (IRT) DAN APLIKASINYA PADA COMPUTERIZED ADAPTIVE TESTS (CAT) by , Yazid Shofwan, , Dr. Dedi Rosadi, M.Sc.

    Published 2011
    “…Estimator of item characteristics, difficulty level (b), disciminant (a), pseudo guessing (c), and examinee ability (ï�±) gain by using Numeric Methode, Newton Raphson Iteration. The item characteristics are used for Adaptive Tests and Computerized Adaptive Tests (CAT).…”
    Thesis