Complexity bounds on supermesh construction for quasi-uniform meshes

11/26/2019
by   M. Croci, et al.
0

Projecting fields between different meshes commonly arises in computational physics. This operation requires a supermesh construction and its computational cost is proportional to the number of cells of the supermesh n. Given any two quasi-uniform meshes of n_A and n_B cells respectively, we show under standard assumptions that n is proportional to n_A + n_B. This result substantially improves on the best currently available upper bound on n and is fundamental for the analysis of algorithms that use supermeshes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2020

On the monotonicity of high order discrete Laplacian

The monotonicity of discrete Laplacian, i.e., inverse positivity of stif...
research
06/27/2019

Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes

A d-dimensional polycube is a facet-connected set of cells (cubes) on th...
research
12/31/2019

Near-best adaptive approximation on conforming meshes

We devise a generalization of tree approximation that generates conformi...
research
11/11/2020

Superconvergence analysis of FEM and SDFEM on graded meshes for a problem with characteristic layers

We consider a singularly perturbed convection-diffusion with exponential...
research
01/13/2020

Error analysis for time-fractional semilinear parabolic equations using upper and lower solutions

A semilinear initial-boundary value problem with a Caputo time derivativ...
research
09/14/2020

Bounds and Code Constructions for Partially Defect Memory Cells

This paper considers coding for so-called partially stuck memory cells. ...
research
11/22/2017

Proportionally Representative Participatory Budgeting: Axioms and Algorithms

Participatory budgeting is one of the exciting developments in deliberat...

Please sign up or login with your details

Forgot password? Click here to reset