BookDOI
Numerische Mathematik 1
Reads0
Chats0
About:
The article was published on 1989-01-01. It has received 2186 citations till now.read more
Citations
More filters
Journal ArticleDOI
Distributed Approach for Solving Time-Dependent Problems in Multimodal Transport Networks
TL;DR: A new graph structure to abstract multimodal networks, called transfer graph, is described, which adapts to the distributed nature of real information sources of transportation networks, and a decomposition of the Shortest Path Problem in transfer graph is proposed to optimize the computation time.
Proceedings ArticleDOI
An FPGA based simulation acceleration platform for spiking neural networks
H. Hellmich,H. Klar +1 more
TL;DR: The acceleration platform, called spiking neural network emulation engine (SEE), makes use of this fact in order to tackle the main bottleneck of memory bandwidth during the simulation of large networks and is capable to treat up to 2/sup 19/ neurons and more than 800 10/sup 6/ synaptic weights.
Journal ArticleDOI
Lucas Polynomial Approach for System of High-Order Linear Differential Equations and Residual Error Estimation
TL;DR: An approximation method based on Lucas polynomials is presented for the solution of the system of high-order linear differential equations with variable coefficients under the mixed conditions and the error analysis based on residual function is developed for present method.
Book ChapterDOI
Multigrid Optimization Methods for Stationary Parameter Identification Problems in Groundwater Flow
Volker Schulz,Gabriel Wittum +1 more
TL;DR: The focus of this paper is on the development of new multigrid optimization methods for the numerical treatment of this practical problem class in the context of stationary flow problems.
Journal ArticleDOI
A discrete particle swarm optimization algorithm for rectilinear branch pipe routing
Qiang Liu,Chengen Wang +1 more
TL;DR: A discrete particle swarm optimization (PSO) algorithm for rectilinear branch pipe routing (DPSO‐RBPRA) problems, which adopts an attraction operator and an energy function to plan the shortest collision‐free connecting networks in a discrete graph space.