Results 11 to 20 of about 1,268,311 (320)
Mathematics and Computers in Simulation, 2020 The present work shows the first ever implementation of two-order moments conserving finite volume scheme (FVS) for approximating a multidimensional aggregation population balance equations (PBE’s) on a structured triangular grid. This scheme is based on
Mehakpreet Singh +4 more
semanticscholar +3 more sources
Journal of Aerosol Science, 2019 In this present work, a finite volume scheme for approximating a multidimensional nonlinear agglomeration population balance equation on a regular triangular grid is developed.
Mehakpreet Singh +4 more
semanticscholar +3 more sources
Hamiltonian properties of triangular grid graphs
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Orlovich, Yu. L. +2 more
openaire +5 more sources
Triangular-grid billiards and plabic graphs
Combinatorial Theory, 2023 16 pages, 13 ...
Defant, Colin, Jiradilok, Pakawut
openaire +5 more sources
Applied Sciences, 2021 Three-dimensional finite element (FE) simulations were performed to further develop the Swedish design guidelines for geogrid-reinforced timber pile-supported embankments, also known as lightly piled embankments. Lightly piled embankments are constructed
Per Gunnvard, Hans Mattsson, Jan Laue
doaj +1 more source
Derivative-Free Power Flow Solution for Bipolar DC Networks with Multiple Constant Power Terminals
Sensors, 2022 This paper analyzes the power flow solution in bipolar direct current networks with radial structures considering multiple monopolar and bipolar constant power loads.
Ángeles Medina-Quesada +2 more
doaj +1 more source
Edge-Bandwidth of the Triangular Grid [PDF]
The Electronic Journal of Combinatorics, 2007 In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid $T_n$ is precisely $n+1$; more recently Balogh, Mubayi, and Pluhár posed the problem of determining the edge-bandwidth of $T_n$. We show that the edge-bandwidth of $T_n$ is bounded above by $3n-1$ and below by $3n-o(n)$.
Akhtar, Reza, Jiang, Tao, Pritikin, Dan
openaire +2 more sources
On the Number of Shortest Weighted Paths in a Triangular Grid
Mathematics, 2020 Counting the number of shortest paths in various graphs is an important and interesting combinatorial problem, especially in weighted graphs with various applications. We consider a specific infinite graph here, namely the honeycomb grid. Changing to its
Benedek Nagy, Bashar Khassawneh
doaj +1 more source
IEEE Open Journal of Antennas and Propagation, 2023 This paper deals with the update of the iterative Fourier transform (IFT) method that makes this method suitable for the low sidelobe pattern synthesis of array antennas having a triangular or skew lattice.
Will P. M. N. Keizer
doaj +1 more source
A Note on Triple Repetition Sequence of Domination Number in Graphs
InPrime, 2022 A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph induced by D is connected. A connected
Leomarich F. Casinillo +2 more
doaj +1 more source