Modelling urban floods using a finite element staggered scheme with porosity and anisotropic resistance [PDF]
, 2018 Artificial porosity models for urban flooding use porosity as a statistical descriptor for the presence of buildings, which are then treated as subgridscale features. Computational efficiency makes porosity models attractive for large-scale applications.
Viero, Daniele P.
core +1 more source
Fine Grid Numerical Solutions of Triangular Cavity Flow
, 2007 Numerical solutions of 2-D steady incompressible flow inside a triangular cavity are presented. For the purpose of comparing our results with several different triangular cavity studies with different triangle geometries, a general triangle mapped onto a
Barragy +22 more
core +1 more source
h-multigrid agglomeration based solution strategies for discontinuous Galerkin discretizations of incompressible flow problems [PDF]
, 2017 In this work we exploit agglomeration based $h$-multigrid preconditioners to speed-up the iterative solution of discontinuous Galerkin discretizations of the Stokes and Navier-Stokes equations.
Bassi, Francesco +2 more
core +2 more sources
Numerical study of the 2D lid-driven triangular cavities based on the Lattice Boltzmann method [PDF]
, 2016 Numerical study of two dimensional lid driven triangular cavity flow is performed via using lattice Boltzmann method on low Reynolds numbers. The equilateral triangular cavity is the first geometry to be studied, the simulation is performed at Reynolds
AN, BO, Bergadà Granyó, Josep Maria
core +1 more source
Cellular Automata Approach to Mathematical Morphology in the Triangular Grid
Acta Polytechnica Hungarica, 2018 Cellular automata are parallel computing devices working on a discrete timescale. In the paper, each cell of the triangular grid has a state from the binary set (i.e., we have a binary pattern, an image, on the grid), and the state in the next time ...
M. Saadat, B. Nagy
semanticscholar +1 more source
CYCLIC PROPERTIES OF TRIANGULAR GRID GRAPHS [PDF]
IFAC Proceedings Volumes, 2006 Abstract It is known that all 2-connected, linearly convex triangular grid graphs, with only one exception, are hamiltonian (Reay and Zamfirescu, 2000). In the paper, it is shown that this result holds for a wider class of connected, locally connected triangular grid graphs and, with more exceptions, even for some general class of graphs.
Yury Orlovich +2 more
openaire +1 more source
The ICON-1.2 hydrostatic atmospheric dynamical core on triangular grids – Part 1: Formulation and performance of the baseline version [PDF]
Geoscientific Model Development, 2013 As part of a broader effort to develop next-generation models for numerical weather prediction and climate applications, a hydrostatic atmospheric dynamical core is developed as an intermediate step to evaluate a finite-difference discretization of ...
H. Wan +10 more
doaj +1 more source
Triangular Energy-Saving Cache-Based Routing Protocol by Energy Sieving
International Journal of Distributed Sensor Networks, 2011 In wireless ad hoc networks, designing an energy-efficient routing protocol is a major issue since nodes are energy limited. To address energy issue, we proposed a triangular energy-saving cached-based routing protocol by energy sieving (TESCES).
Chiu-Ching Tuan, Yi-Chao Wu
doaj +1 more source
On Triangular Secure Domination Number
InPrime, 2020 Let T_m=(V(T_m), E(T_m)) be a triangular grid graph of m ϵ N level. The order of graph T_m is called a triangular number. A subset T of V(T_m) is a dominating set of T_m if for all u_V(T_m)\T, there exists vϵT such that uv ϵ E(T_m), that is, N[T]=V(T_m).
Emily L Casinillo +3 more
doaj +1 more source