Kourosh Parand

NA
h-index34
23papers
115citations
Novelty33%
AI Score31

23 Papers

1.2NAJun 24, 2016
A new approach for solving nonlinear Thomas-Fermi equation based on fractional order of rational Bessel functions

K. Parand, A. Ghaderi, M. Delkhosh et al.

In this paper, the fractional order of rational Bessel functions collocation method (FRBC) to solve Thomas-Fermi equation which is defined in the semi-infinite domain and has singularity at $x = 0$ and its boundary condition occurs at infinity, have been introduced. We solve the problem on semi-infinite domain without any domain truncation or transformation of the domain of the problem to a finite domain. This approach at first, obtains a sequence of linear differential equations by using the quasilinearization method (QLM), then at each iteration solves it by FRBC method. To illustrate the reliability of this work, we compare the numerical results of the present method with some well-known results in other to show that the new method is accurate, efficient and applicable.

1.2NAJan 25, 2016
Using Hermite Function for Solving Thomas-Fermi Equation

Fattaneh Bayatbabolghani, Kourosh Parand

In this paper, we propose Hermite collocation method for solving Thomas-Fermi equation that is nonlinear ordinary differential equation on semi-infinite interval. This method reduces the solution of this problem to the solution of a system of algebraic equations. We also present the comparison of this work with solution of other methods that shows the present solution is more accurate and faster convergence in this problem.

1.2NAFeb 13, 2018
Generalized Lagrangian Jacobi-Gauss-Radau collocation method for solving a nonlinear 2-D optimal control problem with the classical diffusion equation

Kourosh Parand, Sobhan Latifi, Mehdi Delkhosh et al.

In this paper, a nonlinear 2D Optimal Control Problem (2DOCP) is considered. The quadratic performance index of a nonlinear cost function is endowed with the state and control functions. In this problem, the dynamic constraint of the system is given by a classical diffusion equation. This article is concerned with a generalization of Lagrangian functions. Besides, a Generalized Lagrangian Jacobi-Gauss-Radau (GLJGR)-collocation method is introduced and applied to solve the aforementioned 2DOCP. Based on initial and boundary conditions, the time and space variables t and x are considered Jacobi-Gauss-Radau points clustered on first or end of interval respectively. Then, to solve the 2DOCP, Lagrange Multipliers are used and the optimal control problem is reduced to a parameter optimization problem. Numerical results demonstrate its accuracy, efficiency, and versatility of the presented method.

1.2NAAug 10, 2014
A new operational matrix based on Bernoulli polynomials

J. A. Rad, S. Kazem, M. Shaban et al.

In this research, the Bernoulli polynomials are introduced. The properties of these polynomials are employed to construct the operational matrices of integration together with the derivative and product. These properties are then utilized to transform the differential equation to a matrix equation which corresponds to a system of algebraic equations with unknown Bernoulli coefficients. This method can be used for many problems such as differential equations, integral equations and so on. Numerical examples show the method is computationally simple and also illustrate the efficiency and accuracy of the method.

11.5LGSep 14, 2023
deepFDEnet: A Novel Neural Network Architecture for Solving Fractional Differential Equations

Ali Nosrati Firoozsalari, Hassan Dana Mazraeh, Alireza Afzal Aghaei et al.

The primary goal of this research is to propose a novel architecture for a deep neural network that can solve fractional differential equations accurately. A Gaussian integration rule and a $L_1$ discretization technique are used in the proposed design. In each equation, a deep neural network is used to approximate the unknown function. Three forms of fractional differential equations have been examined to highlight the method's versatility: a fractional ordinary differential equation, a fractional order integrodifferential equation, and a fractional order partial differential equation. The results show that the proposed architecture solves different forms of fractional differential equations with excellent precision.

6.6LGAug 7, 2023
Solving Falkner-Skan type equations via Legendre and Chebyshev Neural Blocks

Alireza Afzal Aghaei, Kourosh Parand, Ali Nikkhah et al.

In this paper, a new deep-learning architecture for solving the non-linear Falkner-Skan equation is proposed. Using Legendre and Chebyshev neural blocks, this approach shows how orthogonal polynomials can be used in neural networks to increase the approximation capability of artificial neural networks. In addition, utilizing the mathematical properties of these functions, we overcome the computational complexity of the backpropagation algorithm by using the operational matrices of the derivative. The efficiency of the proposed method is carried out by simulating various configurations of the Falkner-Skan equation.

7.9LGSep 3, 2024Code
PINNIES: An Efficient Physics-Informed Neural Network Framework to Integral Operator Problems

Alireza Afzal Aghaei, Mahdi Movahedian Moghaddam, Kourosh Parand

This paper introduces an efficient tensor-vector product technique for the rapid and accurate approximation of integral operators within physics-informed deep learning frameworks. Our approach leverages neural network architectures to evaluate problem dynamics at specific points, while employing Gaussian quadrature formulas to approximate the integral components, even in the presence of infinite domains or singularities. We demonstrate the applicability of this method to both Fredholm and Volterra integral operators, as well as to optimal control problems involving continuous time. Additionally, we outline how this approach can be extended to approximate fractional derivatives and integrals and propose a fast matrix-vector product algorithm for efficiently computing the fractional Caputo derivative. In the numerical section, we conduct comprehensive experiments on forward and inverse problems. For forward problems, we evaluate the performance of our method on over 50 diverse mathematical problems, including multi-dimensional integral equations, systems of integral equations, partial and fractional integro-differential equations, and various optimal control problems in delay, fractional, multi-dimensional, and nonlinear configurations. For inverse problems, we test our approach on several integral equations and fractional integro-differential problems. Finally, we introduce the pinnies Python package to facilitate the implementation and usability of the proposed method.

1.2NAJul 10, 2016
GPU-Acceleration of Parallel Unconditionally Stable Group Explicit Finite Difference Method

K. Parand, Saeed Zafarvahedian, Sayyed A. Hossayni

Graphics Processing Units (GPUs) are high performance co-processors originally intended to improve the use and quality of computer graphics applications. Once, researchers and practitioners noticed the potential of using GPU for general purposes, GPUs applications have been extended from graphics applications to other fields. The main objective of this paper is to evaluate the impact of using GPU in solution of the transient diffusion type equation by parallel and stable group explicit finite difference method and encourage the researchers in this field to immigrate from implementing their algorithms in CPU to the GPU emerging world. For comparing them, we implemented the method in both GPU and CPU (multi-core) programming context. Moreover, we proposed an optimal synchronization arrangement for the implementation pseudo-code. Also, the interrelation of GPU parallel programming and initializing the algorithm variables were discussed, taking advantage of numerical experiences. The GPU-approach results are faster than those obtained from a much expensive parallel 8-thread CPU-based programming. The GPU used in this paper, is an ordinary old laptop GPU (GT 335M, launched at 2010) and is accessible for everyone and the newer generations of GPU (as discussed in paper) have even more performance priority over the similar-price GPUs. Then, the results are expected to encourage the entire research society to take advantage of GPUs and improve the time efficiency of their studies.

1.2NASep 27, 2017
A Comparison Between Laguerre, Hermite, and Sinc Orthogonal Functions

Fattaneh Bayatbabolghani, Kourosh Parand

A series of problems in different fields such as physics and chemistry are modeled by differential equations. Differential equations are divided into partial differential equations and ordinary differential equations which can be linear or nonlinear. One approach to solve those kinds of equations is using orthogonal functions into spectral methods. In this paper, we firstly describe Laguerre, Hermite, and Sinc orthogonal functions. Secondly, we select three interesting problems which are modeled as differential equations over the interval $[0, +\infty)$. Then, we use the collocation method as a spectral method for solving those selected problems and compare the performance of Laguerre, Hermite, and Sinc orthogonal functions in solving those types of equations.

1.2NAAug 10, 2014
The meshless method for solving radiative transfer problems in a slab medium based on radial basis functions

J. A. Rad, S. Kazem, K. Parand

In this paper a numerical meshless method for solving the radiative transfer equations in a slab medium with an isotropic scattering is considered. The method is based on radial basis functions to approximate the solution of an integral-partial differential equation by using collocation method. For this purpose different applications of RBFs are used. To this end the numerical solutions are obtained without any mesh generation into the domain of the problems. The results of numerical experiments are compared with the existing results in illustrative examples to confirm the accuracy and efficiency of the presented scheme. Also the norm of the residual functions are obtained to show the convergence of the method.

8.5IVJan 4, 2024
Using Singular Value Decomposition in a Convolutional Neural Network to Improve Brain Tumor Segmentation Accuracy

Pegah Ahadian, Maryam Babaei, Kourosh Parand

A brain tumor consists of cells showing abnormal brain growth. The area of the brain tumor significantly affects choosing the type of treatment and following the course of the disease during the treatment. At the same time, pictures of Brain MRIs are accompanied by noise. Eliminating existing noises can significantly impact the better segmentation and diagnosis of brain tumors. In this work, we have tried using the analysis of eigenvalues. We have used the MSVD algorithm, reducing the image noise and then using the deep neural network to segment the tumor in the images. The proposed method's accuracy was increased by 2.4% compared to using the original images. With Using the MSVD method, convergence speed has also increased, showing the proposed method's effectiveness

7.1LGJan 22, 2025
Advanced Physics-Informed Neural Network with Residuals for Solving Complex Integral Equations

Mahdi Movahedian Moghaddam, Kourosh Parand, Saeed Reza Kheradpisheh

In this paper, we present the Residual Integral Solver Network (RISN), a novel neural network architecture designed to solve a wide range of integral and integro-differential equations, including one-dimensional, multi-dimensional, ordinary and partial integro-differential, systems, fractional types, and Helmholtz-type integral equations involving oscillatory kernels. RISN integrates residual connections with high-accuracy numerical methods such as Gaussian quadrature and fractional derivative operational matrices, enabling it to achieve higher accuracy and stability than traditional Physics-Informed Neural Networks (PINN). The residual connections help mitigate vanishing gradient issues, allowing RISN to handle deeper networks and more complex kernels, particularly in multi-dimensional problems. Through extensive experiments, we demonstrate that RISN consistently outperforms not only classical PINNs but also advanced variants such as Auxiliary PINN (A-PINN) and Self-Adaptive PINN (SA-PINN), achieving significantly lower Mean Absolute Errors (MAE) across various types of equations. These results highlight RISN's robustness and efficiency in solving challenging integral and integro-differential problems, making it a valuable tool for real-world applications where traditional methods often struggle.

7.1LGJul 15, 2025
LyAm: Robust Non-Convex Optimization for Stable Learning in Noisy Environments

Elmira Mirzabeigi, Sepehr Rezaee, Kourosh Parand

Training deep neural networks, particularly in computer vision tasks, often suffers from noisy gradients and unstable convergence, which hinder performance and generalization. In this paper, we propose LyAm, a novel optimizer that integrates Adam's adaptive moment estimation with Lyapunov-based stability mechanisms. LyAm dynamically adjusts the learning rate using Lyapunov stability theory to enhance convergence robustness and mitigate training noise. We provide a rigorous theoretical framework proving the convergence guarantees of LyAm in complex, non-convex settings. Extensive experiments on like as CIFAR-10 and CIFAR-100 show that LyAm consistently outperforms state-of-the-art optimizers in terms of accuracy, convergence speed, and stability, establishing it as a strong candidate for robust deep learning optimization.

1.2COMP-PHJun 4, 2025
BridgeNet: A Hybrid, Physics-Informed Machine Learning Framework for Solving High-Dimensional Fokker-Planck Equations

Elmira Mirzabeigi, Rezvan Salehi, Kourosh Parand

BridgeNet is a novel hybrid framework that integrates convolutional neural networks with physics-informed neural networks to efficiently solve non-linear, high-dimensional Fokker-Planck equations (FPEs). Traditional PINNs, which typically rely on fully connected architectures, often struggle to capture complex spatial hierarchies and enforce intricate boundary conditions. In contrast, BridgeNet leverages adaptive CNN layers for effective local feature extraction and incorporates a dynamically weighted loss function that rigorously enforces physical constraints. Extensive numerical experiments across various test cases demonstrate that BridgeNet not only achieves significantly lower error metrics and faster convergence compared to conventional PINN approaches but also maintains robust stability in high-dimensional settings. This work represents a substantial advancement in computational physics, offering a scalable and accurate solution methodology with promising applications in fields ranging from financial mathematics to complex system dynamics.

1.2NAFeb 16, 2024
Hermite Neural Network Simulation for Solving the 2D Schrodinger Equation

Kourosh Parand, Aida Pakniyat

The Schrodinger equation is a mathematical equation describing the wave function's behavior in a quantum-mechanical system. It is a partial differential equation that provides valuable insights into the fundamental principles of quantum mechanics. In this paper, the aim was to solve the Schrodinger equation with sufficient accuracy by using a mixture of neural networks with the collocation method base Hermite functions. Initially, the Hermite functions roots were employed as collocation points, enhancing the efficiency of the solution. The Schrodinger equation is defined in an infinite domain, the use of Hermite functions as activation functions resulted in excellent precision. Finally, the proposed method was simulated using MATLAB's Simulink tool. The results were then compared with those obtained using Physics-informed neural networks and the presented method.

2.3NAJan 25, 2024
An Orthogonal Polynomial Kernel-Based Machine Learning Model for Differential-Algebraic Equations

Tayebeh Taheri, Alireza Afzal Aghaei, Kourosh Parand

The recent introduction of the Least-Squares Support Vector Regression (LS-SVR) algorithm for solving differential and integral equations has sparked interest. In this study, we expand the application of this algorithm to address systems of differential-algebraic equations (DAEs). Our work presents a novel approach to solving general DAEs in an operator format by establishing connections between the LS-SVR machine learning model, weighted residual methods, and Legendre orthogonal polynomials. To assess the effectiveness of our proposed method, we conduct simulations involving various DAE scenarios, such as nonlinear systems, fractional-order derivatives, integro-differential, and partial DAEs. Finally, we carry out comparisons between our proposed method and currently established state-of-the-art approaches, demonstrating its reliability and effectiveness.

7.9LGJan 25, 2024
Accelerating Fractional PINNs using Operational Matrices of Derivative

Tayebeh Taheri, Alireza Afzal Aghaei, Kourosh Parand

This paper presents a novel operational matrix method to accelerate the training of fractional Physics-Informed Neural Networks (fPINNs). Our approach involves a non-uniform discretization of the fractional Caputo operator, facilitating swift computation of fractional derivatives within Caputo-type fractional differential problems with $0<α<1$. In this methodology, the operational matrix is precomputed, and during the training phase, automatic differentiation is replaced with a matrix-vector product. While our methodology is compatible with any network, we particularly highlight its successful implementation in PINNs, emphasizing the enhanced accuracy achieved when utilizing the Legendre Neural Block (LNB) architecture. LNB incorporates Legendre polynomials into the PINN structure, providing a significant boost in accuracy. The effectiveness of our proposed method is validated across diverse differential equations, including Delay Differential Equations (DDEs) and Systems of Differential Algebraic Equations (DAEs). To demonstrate its versatility, we extend the application of the method to systems of differential equations, specifically addressing nonlinear Pantograph fractional-order DDEs/DAEs. The results are supported by a comprehensive analysis of numerical outcomes.

1.2SPJan 30, 2022
A least squares support vector regression for anisotropic diffusion filtering

Arsham Gholamzadeh Khoee, Kimia Mohammadi Mohammadi, Mostafa Jani et al.

Anisotropic diffusion filtering for signal smoothing as a low-pass filter has the advantage of the edge-preserving, i.e., it does not affect the edges that contain more critical data than the other parts of the signal. In this paper, we present a numerical algorithm based on least squares support vector regression by using Legendre orthogonal kernel with the discretization of the nonlinear diffusion problem in time by the Crank-Nicolson method. This method transforms the signal smoothing process into solving an optimization problem that can be solved by efficient numerical algorithms. In the final analysis, we have reported some numerical experiments to show the effectiveness of the proposed machine learning based approach for signal smoothing.

3.3NAJun 27, 2021
Legendre Deep Neural Network (LDNN) and its application for approximation of nonlinear Volterra Fredholm Hammerstein integral equations

Zeinab Hajimohammadi, Kourosh Parand, Ali Ghodsi

Various phenomena in biology, physics, and engineering are modeled by differential equations. These differential equations including partial differential equations and ordinary differential equations can be converted and represented as integral equations. In particular, Volterra Fredholm Hammerstein integral equations are the main type of these integral equations and researchers are interested in investigating and solving these equations. In this paper, we propose Legendre Deep Neural Network (LDNN) for solving nonlinear Volterra Fredholm Hammerstein integral equations (VFHIEs). LDNN utilizes Legendre orthogonal polynomials as activation functions of the Deep structure. We present how LDNN can be used to solve nonlinear VFHIEs. We show using the Gaussian quadrature collocation method in combination with LDNN results in a novel numerical solution for nonlinear VFHIEs. Several examples are given to verify the performance and accuracy of LDNN.

4.2LGNov 12, 2020
Symbolically Solving Partial Differential Equations using Deep Learning

Maysum Panju, Kourosh Parand, Ali Ghodsi

We describe a neural-based method for generating exact or approximate solutions to differential equations in the form of mathematical expressions. Unlike other neural methods, our system returns symbolic expressions that can be interpreted directly. Our method uses a neural architecture for learning mathematical expressions to optimize a customizable objective, and is scalable, compact, and easily adaptable for a variety of tasks and configurations. The system has been shown to effectively find exact or approximate symbolic solutions to various differential equations with applications in natural sciences. In this work, we highlight how our method applies to partial differential equations over multiple variables and more complex boundary and initial value conditions.

1.2NAAug 23, 2017
A matrix formulation of the Tau method for the numerical solution of non-linear problems

Kourosh Parand, Amin Ghaderi, Mehdi Delkhosh et al.

The purpose of this research is to propose a new approach named the shifted Bessel Tau (SBT) method for solving higher-order ordinary differential equations (ODE). The operational matrices of derivative, integral and product of shifted Bessel polynomials on the interval [a, b] are calculated. These matrices together with the Tau method are utilized to reduce the solution of the higher-order ODE to the solution of a system of algebraic equations with unknown Bessel coefficients. The comparisons between the results of the present work and other the numerical method are shown that the present work is computationally simple and highly accurate.

1.2NAAug 23, 2017
Two efficient computational algorithms to solve the singularly perturbed Lane-Emden problem

Kourosh Parand, Amin Ghaderi

In this paper, we decide to compare two new approaches based on Rational and Exponential Bessel functions (RBs and EBs) to solve several well-known class of Lane-Emden type models. The problems, which define in some models of non-Newtonian fluid mechanics and mathematical physics, are nonlinear ordinary differential equations of second-order over the semiinfinite interval and have singularity at x = 0. We have converted the nonlinear Lane-Emden equation to a sequence of linear equations by utilizing the quasilinearization method (QLM) and then, these linear equations have been solved by RBs and EBs collocation-spectral methods. Afterward, the obtained results are compared with the solution of other methods for demonstrating the efficiency and applicability of the proposed methods.

1.2NAOct 15, 2015
Collocation Method using Compactly Supported Radial Basis Function for Solving Volterra's Population Model

Kourosh Parand, Mohammad Hemami

In this paper, indirect collocation approach based on compactly supported radial basis function is applied for solving Volterras population model. The method reduces the solution of this problem to the solution of a system of algebraic equations. Volterras model is a non-linear integro-differential equation where the integral term represents the effect of toxin. To solve the problem, we use the well-known CSRBF: Wendland3,5. Numerical results and residual norm 2 show good accuracy and rate of convergence.