Numerical performance of Half-Sweep SOR Method for solving second order composite closed Newton-Cotes System by Mohana Sundaram Muthuvalu, Elayaraja Aruchunan, Mohd Kamalrulzaman Md Akhir, Jumat Sulaiman, Samsul Ariffin Abdul Karim

“…In this paper, application of the Half-Sweep Successive Over-Relaxation (HSSOR) iterative method is extended by solving second order composite closed Newton-Cotes quadrature (2-CCNC) system. …”
Get full text

Fifth order two-point block backward differentiation formulas for solving ordinary differential equations. by Ibrahim, Zarina Bibi, Suleiman, Mohamed, Othman, Khairil Iskandar, Nasir, N. A. A. M.

“…We also discussed further the implementation of the method using Newton Iteration. The numerical results are presented to verify the efficiency of this method as compared to the Classical Backward Differentiation Formula (BDF) method and ode15s in Matlab. …”
Get full text

The hybrid BFGS-CG method in solving unconstrained optimization problems by Ibrahim, Mohd Asrul Hery, Mamat, Mustafa, Leong, Wah June

“…In comparison to standard BFGS methods and conjugate gradient methods, the BFGS-CG method shows significant improvement in the total number of iterations and CPU time required to solve large scale unconstrained optimization problems. …”
Get full text

A new diagonal gradient-type method for large scale unconstrained optimization by Farid, Mahboubeh, Leong, Wah June, Zheng, Lihong

“…This new scheme allows us to improve the accuracy of the Hessian's approximation and is also capable to utilize information gathered about the function in previous iterations. It follows by an scaling approach that employs scaling parameter based upon the proposed weak secant equation to guarantee the positive definiteness of the Hessian's approximation. …”
Get full text

Median polish for final grades of MTH3000- and MTH4000- level courses by Fitrianto, Anwar, Wijayanto, Hari, Rana, Md. Sohel, Cheong, Yee Voon

“…Median polish is resistant to holes in the table, that is, cells that have no values, but it may require a lot of iterations through the data. This paper describes a technique that uses median polish to observe the relationship between students’ attendance in classes with their performance in the final exam. …”
Get full text

The CG-BFGS method for unconstrained optimization problems by Ibrahim, Mohd Asrul Hery, Mamat, Mustafa, Leong, Wah June, Mohammad Sofi, Azfi Zaidi

“…The new algorithm is compared with the quasi-Newton methods in terms of the number of iterations and CPU-time. The Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is used as an updating formula for the approximation of the Hessian for both methods. …”
Get full text

SSGARL: hybrid evolutionary computation and reinforcement learning for flexible ligand docking by Marlisah, Erzam, Yaakob, Razali, Sulaiman, Md. Nasir, Abdul Rahman, Mohd Basyaruddin

“…Ten ligands of varying flexibility were chosen to bind with thermolysin to compare the performance of SSGARL and Iterated Local Search global optimizer’s algorithm of AutoDock Vina. …”

Numerical performance of half-sweep SOR method for solving second order composite closed Newton-Cotes system by Muthuvalu, Mohana Sundaram, Aruchunan, Elayaraja, Md Akhir, Mohd Kamalrulzaman, Sulaiman, Jumat, Abdul Karim, Samsul Ariffin

“…In this paper, application of the Half-Sweep Successive Over-Relaxation (HSSOR) iterative method is extended by solving second order composite closed Newton-Cotes quadrature (2-CCNC) system. …”
Get full text

Computation of cryptosystem based on Lucas functions using addition chain by Md Ali, Zulkarnain, Othman, Mohamed, Md. Said, Mohamad Rushdan, Sulaiman, Md. Nasir

“…At the same time, it also reduces some iteration that is involved in LUC Cryptosystem computation.…”
Get full text

Weighted high leverage collinear robust ridge estimator in logistic regression model by Ariffin, Syaiba Balqish, Midi, Habshah

“…A robust logistic ridge regression (RLR) which incorporates the weighted Bianco and Yohai (WBY) robust estimator with fully iterated logistic ridge regression (LR) is proposed to rectify the combined problems of high leverage points and multicollinearity in a data. …”
Get full text

8 Bit Cmos Hybrid Digital-To-Analog Converter For Bluetooth Low Energy Application by Rosli, Alia

“…The hybrid DAC design strategy is based on iterative scheme whose variables are adjusted in a simple way, minimizing the power consumption as well as area and also meeting the design specifications.…”
Get full text

The conjugate gradient method for the adjustment of cadastral data in GIS by Buyong, Taher, Daud, Abdullah

“…The problems are solved by applying an iterative conjugate gradient method (CGM). The proposed method reduces the storage by at least 70% compared to the prevailing usage of the banded storage scheme and significantly speed up processing time as compared to the usual Cholesky Decomposition method.…”
Get full text

A Conjugate Gradient Approach to Least Squares Analysis of Cadastral Survey Data by Daud, Abdullah, Buyong, Taher

“…The nature of cadastral networks is unique compared that of the geodetic or engineering networks and hence require a new approach of the least squares computation. An iterative method known as conjugate gradient is being tested for cadastral applications.…”
Get full text

Global and local convergence of a filter line search method for nonlinear programming. by Chin, Choong Ming, Abdul Rashid, Abdul Halim, Nor, Khaled Mohamed

“…Under mild conditions, we will also show that the algorithm converges two step superlinearly when the iterates are near to the solution. …”

An Efficient Rescaled Perceptron Algorithm for Conic Systems by Vempala, Santosh, Belloni, Alexandre, Freund, Robert Michael

“…A natural condition measure associated with this algorithm is the Euclidean width {tau} of the cone of feasible solutions, and the iteration complexity of the perceptron algorithm is bounded by 1/{tau}2 [see Rosenblatt, F. 1962. …”
Get full text
Get full text

Decentralized chance-constrained finite-horizon by Williams, Brian Charles, Ono, Masahiro

“…We propose a dual decomposition-based algorithm, namely Market-based Iterative Risk Allocation (MIRA), that solves the multi-agent problem in a decentralized manner. …”
Get full text
Get full text

Cloth simulation using an enhanced Catmull-Clark subdivision scheme and collision detection in a virtual environment by Tulasii Sivaraja, Abdullah Bade

“…The enhanced subdivision scheme was only able to create an acceptably smooth surface until the second iteration of the subdivision. On the third iteration, noticeable sharp points were present, which indicated that the enhanced subdivision scheme did not improve the original scheme. …”
Get full text
Get full text

Use of machine learning in radio frequency integrated circuits (RFIC) development by Cui, Qiang (Computer engineer).

Get full text

Holistic optimization framework for the operation of urban energy systems by Chiam, Zhonglin

“…Genetic algorithms are population-based metaheuristics and can require a considerable amount iterations to converge. This issue is further exacerbated in the framework where a mixed-integer linear program has to be solved in each iteration. …”
Get full text

Object detection with deep neural networks under constrained scenarios by Zhang, Gongjie

“…Second, deep-neural-network-based object detectors usually require long training iterations, which are time-consuming and expensive, or even unaffordable to many researchers or companies. …”
Get full text