A Generalized Particle Search–Locate Algorithm for Arbitrary Grids
✍ Scribed by Alejandro Allievi; Rodolfo Bermejo
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 442 KB
- Volume
- 132
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme ge
This article describes a computational method to calculate solutions of elliptic boundary value problems using arbitrary irregular grids. The main feature of the numerical method is its ability to approximate solutions of differential equations without co-ordinate mapping or metric tensor informatio
A simple algorithm for generating stream¯ow networks for macroscale hydrological models (MHMs) from digital elevation models (DEMs) is presented. Typically these hydrological models are grid based, with the simulated runo produced within each cell routed through a stream network which connects the c
## Abstract We consider an inverse problem for finding the anomaly of discontinuous electrical conductivity by one current‐voltage observation. We develop a real time algorithm for determining the location of the anomaly. This new idea is based on the observation of the pattern of a simple weighted
We present a new method to derive transport equations for non-relativistic quantum manyparticle systems. This method uses an equation-of-motion technique and is applicable to interacting fermions and (or) bosons in arbitrary time-dependent external fields. Using a cluster expansion of the r-particle