Related papers: A new numerical algorithm for the solutions of hyp…
This paper developed a method called "modified exponential cubic B-Spline differential quadrature (mExp-DQM) for space discretization together with a time integration algorithm" for the numerical computation of hyperbolic telegraph equation…
This paper deals with the numerical computations of two space dimensional time dependent parabolic partial differential equations by adopting adopting an optimal five stage fourth-order strong stability preserving Runge Kutta (SSP-RK54)…
This paper deals with a new algorithm called modified trigonometric cubic B-spline differential quadrature method for numerical computation of the time dependent partial differential equations. Specially the numerical computation of the…
The time-fractional Black-Scholes equation (TFBSE) is intended to price the options for which the underlying price fluctuates within a correlated fractal transmission system. Although the TFBSE is an influential approach for grasping the…
This paper presents a new approach and methodology to solve the second order one dimensional hyperbolic telegraph equation with Dirichlet and Neumann boundary conditions using the cubic trigonometric B-spline collocation method. The usual…
In this paper, an efficient numerical technique for the time-fractional telegraph equation is proposed. The aim of this paper is to use a relatively new type of B-spline called the cubic trigonometric B-splines for the proposed scheme. This…
This paper introduces the discrete-velocity-direction model (DVDM) in conjunction with the hyperbolic quadrature method of moments (HyQMOM) to develop a multidimensional spatial-temporal approximation of the BGK equation, termed DVD-HyQMOM.…
In this work, we develop a localized numerical scheme with low regularity requirements for solving time-fractional integro-differential equations. First, a fully discrete numerical scheme is constructed. Specifically, for temporal…
We consider partial differential equations on networks with a small parameter $\epsilon$, which are hyperbolic for $\epsilon>0$ and parabolic for $\epsilon=0$. With a combination of an $\epsilon$-expansion and Runge-Kutta schemes for…
This paper introduces a novel Differential Dynamic Programming (DDP) algorithm for solving discrete-time finite-horizon optimal control problems with inequality constraints. Two variants, namely Feasible- and Infeasible-IPDDP algorithms,…
This paper presents a linear computational technique based on cubic trigonometric cubic B-splines for time fractional burgers' equation. The nonlinear advection term is approximated by a new linearization technique which is very efficient…
Neural network-based solvers for partial differential equations (PDEs) have attracted considerable attention, yet they often face challenges in accuracy and computational efficiency. In this work, we focus on time-dependent PDEs and observe…
This work outlines a time-domain numerical integration technique for linear hyperbolic partial differential equations sourced by distributions (Dirac $\delta$-functions and their derivatives). Such problems arise when studying binary black…
In this paper, we develop regularized discrete least squares collocation and finite volume methods for solving two-dimensional nonlinear time-dependent partial differential equations on irregular domains. The solution is approximated using…
A multi-cube method is developed for solving systems of elliptic and hyperbolic partial differential equations numerically on manifolds with arbitrary spatial topologies. It is shown that any three-dimensional manifold can be represented as…
We propose a parallel algorithm for the numerical solution of a class of second order semi-linear equations coming from stochastic optimal control problems, by means of a dynamic domain decomposition technique. The new method is an…
Numerically solving parabolic equations with quasiperiodic coefficients is a significant challenge due to the potential formation of space-filling quasiperiodic structures that lack translational symmetry or decay. In this paper, we…
This paper considers decentralized consensus optimization problems where nodes of a network have access to different summands of a global objective function. Nodes cooperate to minimize the global objective by exchanging information with…
This article studies a direct numerical approach for fractional advection-diffusion equations (ADEs). Using a set of cubic trigonometric B-splines as test functions, a differential quadrature (DQ) method is firstly proposed for the 1D and…
Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order…