Embedded Boundary Methods (EBMs) [1] for the solution of Computational Fluid Dynamics (CFD) and Fluid-Structure Interaction (FSI) problems are typically formulated in the Eulerian setting, which makes them more attractive than Chimera and Arbitrary Lagrangian-Eulerian methods when the structure undergoes large structural motions and/or deformations. In the presence of viscous flows however, the...

The Bank-Holst parallel adaptive meshing paradigm [2, 3, 1] is utilised to solve (1) in a combination of domain decomposition and adaptivity. It can be summarised as follows: Step I Mesh Partition: Starting with a coarse mesh TH , the domain is partitioned into non-overlapping subdomains: Ω = ∪pi=1Ωi. Step II Adaptive Meshing: Each processor i is provided with TH and instructed to sequentially ...

The possibility for connecting mobile end-devices and mobile automation facilities leads to fast deployment of Wireless LANs in factory automation, for instance to connect hand-scanners, mobile operation-terminals, automated guided vehicles. In these applications, WLAN is currently used for transparently prolonging a wired connection at the end of a control line (e.g. for controlling a mobile r...

The possibility to connect mobile end-devices and mobile automation facilities leads to fast deployment of Wireless LANs in factory automation, for instance to connect hand-scanners, mobile operation-terminals, automated guided vehicles. In these applications, WLAN is typically used for transparently prolonging a wired connection at the end of a control line (e.g. for controlling a mobile robot...

Local mesh refinement significantly influences the performance of explicit timestepping methods for numerical wave propagation. Local time-stepping (LTS) methods improve the efficiency by using smaller time-steps precisely where the smallest mesh elements are located, thus permitting a larger time-step in the coarser regions of the mesh without violating the stability condition. However, when t...

In this paper, we investigate subdivision tree representations of arbitrary triangle meshes. By subdivision, we mean the recursive topological partitioning of a triangle into subtriangles. Such a process can be represented by a subdivision tree. We identify the class of regular triangle meshes, those that can be losslessly represented by a nontrivial subdivision tree, i.e. by a subdivision tree...

In this work, we study mesh regularization in Bank-Holst parallel adaptive paradigm when adaptive enrichment in both h (geometry) and p (degree) is used. The paradigm was first introduced by Bank and Holst in [2, 3, 1] and later extended to hp-adaptivity in [5]. In detail, the paradigm can be summarized in the following steps. Step 1 Load Balancing: The problem is solved on a coarse mesh, and a...

We consider the implementation of multiplication and division operations on one and two dimensional mesh of processors. We develop an O( √ n) step 2-dim mesh algorithm for multiplying two n-bit numbers. The algorithm is simple and does not rely upon discrete fourier transforms. We also develop an O(n) step 1-dim mesh algorithm for dividing a 2n-bit number by an n-bit number. This algorithm appe...

The numerical evaluation of individual tunnel currents (pixels) constitutes the bottleneck of fast scanning tunneling microscopy (STM) imaging. The number and the position of grid points where the current is punctually evaluated have to be judiciously chosen to reveal the most important contrasts. In this note, we present an adaptive meshing approach that significantly accelerates the computati...

The Courant-Friedrichs-Lewy (CFL) condition guarantees the stability of the popular explicit leapfrog method for the wave equation. However, it limits the choice of the time step size to be bounded by the minimal mesh size in the spatial finite element mesh. This essentially prohibits any sort of adaptive mesh refinement that would be required to reveal optimal convergence rates on domains with...