this paper introduces a new method for accelerating current sluggish fem and improving memory demand in fem problems with high node resolution or bulky structures. like most of the numerical methods, fem results to a matrix equation which normally has huge dimension. breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. for implementing ...

Abstract We consider accurate and stable interpolation procedures for numerical simulations utilizing time dependent adaptive meshes. The of solution values between meshes is considered as a transmission problem with respect to the underlying semi-discretized equations, theoretical framework using inner product preserving operators developed, which allows both explicit implicit implementations....

Adaptive, locally refined and locally adjusted meshes are preferred over uniform meshes for capturing singular or localised solutions. Roughly speaking, for a given degree of freedom a solution associated with adaptive, locally refined and locally adjusted meshes is more accurate than the solution given by uniform meshes. In this work, we answer the question which meshes are better conditioned....

Online software tutorials help a wide range of users acquire skills with complex software, but are not always easy to follow. For example, a tutorial might target users with a high skill level, or it might contain errors and omissions. Prior work has shown that user contributions, such as user comments, can add value to a tutorial. Building on this prior work, we investigate an approach to soli...

A cell by cell adaptive mesh technique is described and implemented to solve the Euler equations. The adaptive mesh scheme builds upon a staggered grid Lagrangian code similar to the AWE code CORVUS. The mesh is automatically refined in a cell by cell manner using a solution gradient refinement criteria. The method has the automatic response of adaptive mesh refinement but without storing and s...

Mesh generation and refinement are widely used in applications that require a decomposition of geometric objects for processing. Longest edge refinement algorithms seek to obtain a better decomposition over selected regions of the mesh by the division of its elements. Until now, these algorithms did not provide theoretical guarantees on the size of the triangulation obtained. In this paper we p...