Su Hoe Yeak
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Su Hoe Yeak has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
- Kim Meow Liew
Department of Architecture and Civil Engineering, Centre for Nature-Inspired Engineering, City University of Hong Kong, Hong Kong, China
3 shared publications - Shafaruniza Mahadi
College of Computing, Informatics and Mathematics, Universiti Teknologi MARA Cawangan Johor, Kampus Segamat, 85000 Segamat, Johor, Malaysia
3 shared publications - Ahmad Qushairi Mohamad
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, Johor Bahru, Malaysia
2 shared publications - Ali Hassan Mohamed Murid
Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia
2 shared publications Arifah Bahar
UTM Centre for Industrial and Applied Mathematics (UTM-CIAM), Universiti Teknologi Malaysia
2 shared publications- Faisal Md Basir
STEM and Community Group, Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Skudai, Johor, Malaysia
2 shared publications
Latest Publications
- Open Access
- 22 July 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (7) , 117
Strang Splitting Combined with Periodically Fitted Adams–Bashforth–Moulton Method for High-Precision Simulation of Multiplicative Noise SDEs with Periodic Drift
Many applications in finance and biology involve multiplicative noise geometric Brownian motion (GBM)-type stochastic differential equations (SDEs) whose drift carries a single dominant periodic component. Such structures arise in seasonal Black–Scholes option pricing, commodity derivatives with annual price cycles, and stochastic biological oscillators driven by a known frequency; the primary contribution of this paper is a high-precision numerical scheme validated on GBM-type test problems with periodic drift. This paper proposes a Strang operator splitting scheme within the Logarithmic Drift-Diffusion Splitting (LDDS) framework, which splits the SDE in y-space into a deterministic drift ODE sub-step (Step A) and an exactly solvable multiplicative diffusion sub-step (Step B). Step A employs the Periodically Fitted Adams–Bashforth–Moulton fourth-order predictor–corrector method (PABM4), which achieves zero local truncation error for trigonometric forcing terms by introducing additional shift terms and simultaneously imposing polynomial exactness conditions and trigonometric fitting conditions. When the Step A forcing belongs to the PABM4 exact function class , the Strang+PABM4 scheme achieves floating-point precision saturation. We investigate three test problems: the cosine-drift GBM (Test Problem 1), the polynomial–trigonometric mixed drift GBM (Test Problem 2), and a dual-frequency drift applicability test (Test Problem 3). Monte Carlo strong error experiments ( paths) validate that Strang+PABM4 achieves saturation at machine precision (≈) on Test Problems 1 and 2, improving precision by ≈ over the best algebraically convergent reference. Test Problem 3 identifies the method’s applicability boundary: when the drift contains a second frequency outside , Strang+PABM4 degrades gracefully to order ≈ 4 without catastrophic failure. The floating-point saturation of Strang+PABM4 is contingent on the drift belonging to ; when this condition is violated, the method degrades gracefully to algebraic order ≈ 4, as demonstrated in Test Problem 3.- 22 July 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (7) , 117
Open AccessStrang Splitting Combined with Periodically Fitted Adams–Bashforth–Moulton Method for High-Precision Simulation of Multiplicative Noise SDEs with Periodic Drift
Many applications in finance and biology involve multiplicative noise geometric Brownian motion (GBM)-type stochastic differential equations (SDEs) whose drift carries a single dominant periodic component. Such structures arise in seasonal Black–Scholes option pricing, commodity derivatives with annual price cycles, and stochastic biological oscillators driven by a known frequency; the primary contribution of this paper is a high-precision numerical scheme validated on GBM-type test problems with periodic drift. This paper proposes a Strang operator splitting scheme within the Logarithmic Drift-Diffusion Splitting (LDDS) framework, which splits the SDE in y-space into a deterministic drift ODE sub-step (Step A) and an exactly solvable multiplicative diffusion sub-step (Step B). Step A employs the Periodically Fitted Adams–Bashforth–Moulton fourth-order predictor–corrector method (PABM4), which achieves zero local truncation error for trigonometric forcing terms by introducing additional shift terms and simultaneously imposing polynomial exactness conditions and trigonometric fitting conditions. When the Step A forcing belongs to the PABM4 exact function class , the Strang+PABM4 scheme achieves floating-point precision saturation. We investigate three test problems: the cosine-drift GBM (Test Problem 1), the polynomial–trigonometric mixed drift GBM (Test Problem 2), and a dual-frequency drift applicability test (Test Problem 3). Monte Carlo strong error experiments ( paths) validate that Strang+PABM4 achieves saturation at machine precision (≈) on Test Problems 1 and 2, improving precision by ≈ over the best algebraically convergent reference. Test Problem 3 identifies the method’s applicability boundary: when the drift contains a second frequency outside , Strang+PABM4 degrades gracefully to order ≈ 4 without catastrophic failure. The floating-point saturation of Strang+PABM4 is contingent on the drift belonging to ; when this condition is violated, the method degrades gracefully to algebraic order ≈ 4, as demonstrated in Test Problem 3. - Open Access
- 5 February 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (2) , 21
Fifth-Order Block Hybrid Approach for Solving First-Order Stiff Ordinary Differential Equations
This study introduces a novel single-step hybrid block method with three intra-step points that attains fifth-order accuracy, offering an accurate and computationally economical tool for solving first-order differential equations. The method is specifically designed to handle first-order differential equations with efficiency and precision while employing a constant step size throughout the computation. To further enhance accuracy, interpolation techniques are incorporated to approximate function values at specific positions, addressing the fundamental properties of the method and verifying its mathematical soundness. These analyses confirm that the scheme satisfies the essential requirements of stability, consistency, and convergence, ensuring reliability in practical applications. In addition, the method demonstrates strong adaptability, making it suitable for a broad spectrum of problem settings that involve both stiff and non-stiff systems. Numerical experiments are carried out, and the results consistently demonstrate that the proposed method is robust and effective under various test cases. The outcomes further reveal that it frequently outperforms several existing numerical approaches in terms of both accuracy and computational efficiency.
- 5 February 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (2) , 21
Open AccessFifth-Order Block Hybrid Approach for Solving First-Order Stiff Ordinary Differential Equations
This study introduces a novel single-step hybrid block method with three intra-step points that attains fifth-order accuracy, offering an accurate and computationally economical tool for solving first-order differential equations. The method is specifically designed to handle first-order differential equations with efficiency and precision while employing a constant step size throughout the computation. To further enhance accuracy, interpolation techniques are incorporated to approximate function values at specific positions, addressing the fundamental properties of the method and verifying its mathematical soundness. These analyses confirm that the scheme satisfies the essential requirements of stability, consistency, and convergence, ensuring reliability in practical applications. In addition, the method demonstrates strong adaptability, making it suitable for a broad spectrum of problem settings that involve both stiff and non-stiff systems. Numerical experiments are carried out, and the results consistently demonstrate that the proposed method is robust and effective under various test cases. The outcomes further reveal that it frequently outperforms several existing numerical approaches in terms of both accuracy and computational efficiency.
- Open Access
- 11 December 2025
- Published by Springer Nature in Research Square
Comparative Evaluation of Finite Difference and Finite Element Methods for Reactive Nitrogen Transport in Layered Sandy Loam with Wheat Root Uptake
Accurate simulation of nutrient transport in soil–plant systems is crucial for understanding nitrogen availability, uptake efficiency, and environmental losses. This study presents a comparative evaluation of the Finite Difference Method (FDM) and the Finite Element Method (FEM) in modeling nitrogen transport within sandy loam soil under wheat cultivation. Two representative problems were considered: (i) a one-dimensional vertical transport problem for benchmarking and (ii) a two-dimensional heterogeneous soil scenario with distributed wheat root sinks. Both methods incorporated Michaelis–Menten root uptake kinetics, heterogeneous diffusion coefficients, and a decaying flux boundary at the soil surface. The 1D problem demonstrated that both FDM and FEM reproduced the expected downward migration of nitrogen fronts and uptake-driven depletion zones. However, FEM provided smoother concentration fields and superior mass conservation, while FDM showed oscillatory residuals and sensitivity to discretization. In the 2D problem, FEM successfully captured spatial heterogeneity and root-induced depletion zones with minimal mass imbalance, whereas FDM underestimated depletion near deeper roots and exhibited cumulative mass loss. Overall, the results confirm that FEM is more robust for predictive simulations involving heterogeneity and root uptake, while FDM remains useful for exploratory studies due to its computational simplicity. These findings have direct implications for precision nitrogen management and sustainable agricultural practices in sandy loam systems.
- 11 December 2025
- Published by Springer Nature in Research Square
Open AccessComparative Evaluation of Finite Difference and Finite Element Methods for Reactive Nitrogen Transport in Layered Sandy Loam with Wheat Root Uptake
Accurate simulation of nutrient transport in soil–plant systems is crucial for understanding nitrogen availability, uptake efficiency, and environmental losses. This study presents a comparative evaluation of the Finite Difference Method (FDM) and the Finite Element Method (FEM) in modeling nitrogen transport within sandy loam soil under wheat cultivation. Two representative problems were considered: (i) a one-dimensional vertical transport problem for benchmarking and (ii) a two-dimensional heterogeneous soil scenario with distributed wheat root sinks. Both methods incorporated Michaelis–Menten root uptake kinetics, heterogeneous diffusion coefficients, and a decaying flux boundary at the soil surface. The 1D problem demonstrated that both FDM and FEM reproduced the expected downward migration of nitrogen fronts and uptake-driven depletion zones. However, FEM provided smoother concentration fields and superior mass conservation, while FDM showed oscillatory residuals and sensitivity to discretization. In the 2D problem, FEM successfully captured spatial heterogeneity and root-induced depletion zones with minimal mass imbalance, whereas FDM underestimated depletion near deeper roots and exhibited cumulative mass loss. Overall, the results confirm that FEM is more robust for predictive simulations involving heterogeneity and root uptake, while FDM remains useful for exploratory studies due to its computational simplicity. These findings have direct implications for precision nitrogen management and sustainable agricultural practices in sandy loam systems.
- Open Access
- 9 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (12) , 1920
Fast Implementation of Generalized Koebe’s Iterative Method
Let G be a given bounded multiply connected domain of connectivity bounded by smooth Jordan curves. Koebe’s iterative method is a classical method for computing the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing m disks from the unit disk. Koebe’s method has been generalized to compute the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing disks from a circular ring. A fast numerical implementation of the generalized Koebe’s iterative method is presented in this paper. The proposed method is based on using the boundary integral equation with the generalized Neumann kernel. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method.- 9 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (12) , 1920
Open AccessFast Implementation of Generalized Koebe’s Iterative Method
Let G be a given bounded multiply connected domain of connectivity bounded by smooth Jordan curves. Koebe’s iterative method is a classical method for computing the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing m disks from the unit disk. Koebe’s method has been generalized to compute the conformal mapping from the domain G onto a bounded multiply connected circular domain obtained by removing disks from a circular ring. A fast numerical implementation of the generalized Koebe’s iterative method is presented in this paper. The proposed method is based on using the boundary integral equation with the generalized Neumann kernel. Several numerical examples are presented to demonstrate the accuracy and efficiency of the proposed method. - Open Access
- 22 May 2025
- Published by Akademia Baru Publishing in Warisan Journal of Mathematical Sciences and Engineering
- Vol. 1 (1) , 48-59
A Comparative Study of First Order Polarization in Spherical Structures: Exploring Numerical Approaches
The first-order polarization tensor (PT) is the basic term of the generalized polarization tensor (GPT), which represents the asymptotic series in the form of an integral equation. It is crucial in engineering applications, such as material characterization and electromagnetic modeling. Many approaches have been implemented to enhance computational efficiency and accuracy in the numerical computation of the first-order polarization tensor. Among these methods, two have received the attention of the researchers, but their comparative effectiveness remains uncertain. Hence, this study aims to analyse and compare these two methods in approximating the first-order polarization tensor for a specific object inclusion, the sphere. The methodology involves numerical simulations where the performance of both methods is observed. From the results obtained, both methods satisfy the theoretical statement that as the number of mesh discretization increases, the accuracy of the numerical simulations improves. Two types of software are used in this study: Netgen Mesh Generator and MATLAB, which assist in the pre-processing, processing, and post-processing stages of numerical computation. The simulation and numerical examples will help verify the comparative analysis of both methods.
- 22 May 2025
- Published by Akademia Baru Publishing in Warisan Journal of Mathematical Sciences and Engineering
- Vol. 1 (1) , 48-59
Open AccessA Comparative Study of First Order Polarization in Spherical Structures: Exploring Numerical Approaches
The first-order polarization tensor (PT) is the basic term of the generalized polarization tensor (GPT), which represents the asymptotic series in the form of an integral equation. It is crucial in engineering applications, such as material characterization and electromagnetic modeling. Many approaches have been implemented to enhance computational efficiency and accuracy in the numerical computation of the first-order polarization tensor. Among these methods, two have received the attention of the researchers, but their comparative effectiveness remains uncertain. Hence, this study aims to analyse and compare these two methods in approximating the first-order polarization tensor for a specific object inclusion, the sphere. The methodology involves numerical simulations where the performance of both methods is observed. From the results obtained, both methods satisfy the theoretical statement that as the number of mesh discretization increases, the accuracy of the numerical simulations improves. Two types of software are used in this study: Netgen Mesh Generator and MATLAB, which assist in the pre-processing, processing, and post-processing stages of numerical computation. The simulation and numerical examples will help verify the comparative analysis of both methods.
- Open Access
- 8 May 2025
- Published by Akademia Baru Publishing in Semarak International Journal of STEM Education
- Vol. 3 (1) , 29-42
Exploring Mathematics through Game-Based Learning Mastermind Game: Colour Code Breaker
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.
- 8 May 2025
- Published by Akademia Baru Publishing in Semarak International Journal of STEM Education
- Vol. 3 (1) , 29-42
Open AccessExploring Mathematics through Game-Based Learning Mastermind Game: Colour Code Breaker
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.
- Open Access
- 2 May 2025
- Published by Akademia Baru Publishing in Semarak International Journal of Machine Learning
- Vol. 1 (1) , 11-19
Fuzzy Predator-Prey Systems by Extended Runge-Kutta Method with Polynomial Interpolation Technique
The growing significance of uncertainty quantification in mathematical modeling of physical phenomena is evident, with fuzzy sets emerging as an alternative approach. This paper focuses on exploring a numerical method for addressing fuzzy differential equations in two-dimensional problems like fuzzy predator-prey systems. The numerical solution employed the extended Runge-Kutta fourth-order method. To overcome challenges related to polynomial fuzzy differential equations, a combination of the polynomial interpolation technique and the extended Runge-Kutta fourth-order method was applied, mitigating the issues associated with high-degree polynomials. The proposed approach for fuzzy predator-prey systems is briefly described, accompanied by a numerical example. The obtained results underscore the efficacy of the extended Runge-Kutta fourth-order method with polynomial interpolation, showcasing its remarkable accuracy and potential as an alternative method for addressing various uncertainty-related problems.
- 2 May 2025
- Published by Akademia Baru Publishing in Semarak International Journal of Machine Learning
- Vol. 1 (1) , 11-19
Open AccessFuzzy Predator-Prey Systems by Extended Runge-Kutta Method with Polynomial Interpolation Technique
The growing significance of uncertainty quantification in mathematical modeling of physical phenomena is evident, with fuzzy sets emerging as an alternative approach. This paper focuses on exploring a numerical method for addressing fuzzy differential equations in two-dimensional problems like fuzzy predator-prey systems. The numerical solution employed the extended Runge-Kutta fourth-order method. To overcome challenges related to polynomial fuzzy differential equations, a combination of the polynomial interpolation technique and the extended Runge-Kutta fourth-order method was applied, mitigating the issues associated with high-degree polynomials. The proposed approach for fuzzy predator-prey systems is briefly described, accompanied by a numerical example. The obtained results underscore the efficacy of the extended Runge-Kutta fourth-order method with polynomial interpolation, showcasing its remarkable accuracy and potential as an alternative method for addressing various uncertainty-related problems.
- Open Access
- 30 December 2024
- Published by Akademia Baru Publishing in Semarak International Journal of STEM Education
- Vol. 3 (1) , 29-42
Exploring Mathematics through Game-Based Learning Mastermind Game: Colour Code Breaker
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.
- 30 December 2024
- Published by Akademia Baru Publishing in Semarak International Journal of STEM Education
- Vol. 3 (1) , 29-42
Open AccessExploring Mathematics through Game-Based Learning Mastermind Game: Colour Code Breaker
Mastermind, a classic code-breaking game for two players, features various versions with differing numbers of code pegs (ranging from 4 to 6) and rules concerning repeated colours and blank pegs. This paper explores a simplified variant of Mastermind, where solutions are restricted to code pegs with unique colours and no blank pegs. By focusing on a subset of two code pegs, we model each attempt as a linear system. Through three attempts that satisfy the criteria of a linear system, we determine the initial colour solution for each small group. Further analysis allows for the calculation of the correct colours and their positions within each group using probability measurements. This approach provides a systematic method for solving the simplified Mastermind game and demonstrates the application of linear systems and probabilistic techniques in code-breaking. The findings offer insights into the effectiveness of these mathematical methods in deriving accurate solutions and enhancing problem-solving strategies within the game.
- Open Access
- 18 April 2024
- Published by Akademia Baru Publishing in Semarak International Journal of Machine Learning
- Vol. 1 (1) , 11-19
Fuzzy Predator-Prey Systems by Extended Runge-Kutta Method with Polynomial Interpolation Technique
The growing significance of uncertainty quantification in mathematical modeling of physical phenomena is evident, with fuzzy sets emerging as an alternative approach. This paper focuses on exploring a numerical method for addressing fuzzy differential equations in two-dimensional problems like fuzzy predator-prey systems. The numerical solution employed the extended Runge-Kutta fourth-order method. To overcome challenges related to polynomial fuzzy differential equations, a combination of the polynomial interpolation technique and the extended Runge-Kutta fourth-order method was applied, mitigating the issues associated with high-degree polynomials. The proposed approach for fuzzy predator-prey systems is briefly described, accompanied by a numerical example. The obtained results underscore the efficacy of the extended Runge-Kutta fourth-order method with polynomial interpolation, showcasing its remarkable accuracy and potential as an alternative method for addressing various uncertainty-related problems.
- 18 April 2024
- Published by Akademia Baru Publishing in Semarak International Journal of Machine Learning
- Vol. 1 (1) , 11-19
Open AccessFuzzy Predator-Prey Systems by Extended Runge-Kutta Method with Polynomial Interpolation Technique
The growing significance of uncertainty quantification in mathematical modeling of physical phenomena is evident, with fuzzy sets emerging as an alternative approach. This paper focuses on exploring a numerical method for addressing fuzzy differential equations in two-dimensional problems like fuzzy predator-prey systems. The numerical solution employed the extended Runge-Kutta fourth-order method. To overcome challenges related to polynomial fuzzy differential equations, a combination of the polynomial interpolation technique and the extended Runge-Kutta fourth-order method was applied, mitigating the issues associated with high-degree polynomials. The proposed approach for fuzzy predator-prey systems is briefly described, accompanied by a numerical example. The obtained results underscore the efficacy of the extended Runge-Kutta fourth-order method with polynomial interpolation, showcasing its remarkable accuracy and potential as an alternative method for addressing various uncertainty-related problems.
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3023 (1) , 030009
Hybrid numerical approach for MHD fourth-grade non-Newtonian fluid flow in a rotating frame over semi-infinite boundary condition with a presence of heat transfer
This study investigates the problem of unsteady fourth-grade fluid flow in a rotating frame with the effects of the magnetic field and heat transfer. The non-Ne
- 1 January 2024
- Published by AIP Publishing in AIP Conference Proceedings
- Vol. 3023 (1) , 030009
Hybrid numerical approach for MHD fourth-grade non-Newtonian fluid flow in a rotating frame over semi-infinite boundary condition with a presence of heat transfer
This study investigates the problem of unsteady fourth-grade fluid flow in a rotating frame with the effects of the magnetic field and heat transfer. The non-Ne