Search
Search Results
-
High-order nonstandard finite difference methods preserving dynamical properties of one-dimensional dynamical systems
In this work, we introduce a simple and efficient approach for constructing dynamically consistent and high-order nonstandard finite difference...
-
Computational Study of Some Numerical Methods for the Generalized Burgers-Huxley Equation
In this work, we initially construct three finite difference methods in order to solve the 1D Generalized Burgers-Huxley (GBH) equation which...
-
Simulating Bluetooth virus propagation on the real map via infectious attenuation algorithm and discrete dynamical system
In recent years, mobile smart devices have gained popularity globally due to their convenience and efficiency. However, this popularity has also...
-
Improving Relative Transfer Function Estimates Using Second-Order Cone Programming
This paper addresses the estimation of Relative Transfer Function (RTF) between microphones from noisy recordings. We utilize an incomplete initial...
-
Application of Efficient Numerical Methods in Solution of Ordinary Differential Equations for Modeling Electrical Activity in Cardiac Cells
There is a large number of ordinary differential equations (ODEs) characterize the electrical behavior generated by ionic movements in human...
-
Efficient Solution of Bidomain Equations in Simulation of Cardiac Excitation Anisotropic Propagation
Bidomain equations are used to characterize myocardial physiological activation and propagation. Their numerical solution is costly computation...
-
Fluid Mechanics Applications
This chapter brings together numerical and implementational topics from the previous chapters in three application areas taken from fluid mechanics....
-
Getting Started
This chapter introduces the reader to various basic aspects of numerical simulation, including derivation of partial differential equations,...
-
Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
A Sequential Quadratic Programming algorithm designed to efficiently solve nonlinear optimization problems with many inequality constraints, e.g....
-
Complexity results for HTN planning
Most practical work on AI planning systems during the last fifteen years has been based on Hierarchical Task Network (HTN) decomposition, but until...
-
Starfield visualization with interactive smooth zooming
This paper discusses the design and implementation of interactive smooth zooming of a starfield display (which is a visualization of a...
-
Algebraic analysis of the generating functional for discrete random sets and statistical inference for intensity in the discrete Boolean random-set model
We consider binary digital images as realizations of a uniformly bounded discrete random set, a mathematical object that can be defined directly on a...
-
Optimal algorithms for adjacent side routing
We consider the switchbox routing problem of two-terminal nets in the case when all the k nets lie on two adjacent sides of the rectangle. Our routing...