Algebraic surface design and finite element meshes
NASA Technical Reports Server (NTRS)
Bajaj, Chandrajit L.
1992-01-01
Some of the techniques are summarized which are used in constructing C sup 0 and C sup 1 continuous meshes of low degree, implicitly defined, algebraic surface patches in three dimensional space. These meshes of low degree algebraic surface patches are used to construct accurate computer models of physical objects. These meshes are also used in the finite element simulation of physical phenomena (e.g., heat dissipation, stress/strain distributions, fluid flow characteristics) required in the computer prototyping of both the manufacturability and functionality of the geometric design.
Mesh Quality Improvement Toolkit
Energy Science and Technology Software Center (ESTSC)
2002-11-15
MESQUITE is a linkable software library to be used by simulation and mesh generation tools to improve the quality of meshes. Mesh quality is improved by node movement and/or local topological modifications. Various aspects of mesh quality such as smoothness, element shape, size, and orientation are controlled by choosing the appropriate mesh qualtiy metric, and objective function tempate, and a numerical optimization solver to optimize the quality of meshes, MESQUITE uses the TSTT mesh interfacemore » specification to provide an interoperable toolkit that can be used by applications which adopt the standard. A flexible code design makes it easy for meshing researchers to add additional mesh quality metrics, templates, and solvers to develop new quality improvement algorithms by making use of the MESQUITE infrastructure.« less
Algebraic turbulence modeling for unstructured and adaptive meshes
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1990-01-01
An algebraic turbulence model based on the Baldwin-Lomax model, has been implemented for use on unstructured grids. The implementation is based on the use of local background structured turbulence meshes. At each time-step, flow variables are interpolated from the unstructured mesh onto the background structured meshes, the turbulence model is executed on these meshes, and the resulting eddy viscosity values are interpolated back to the unstructured mesh. Modifications to the algebraic model were required to enable the treatment of more complicated flows, such as confluent boundary layers and wakes. The model is used in conjuction with an efficient unstructured multigrid finite-element Navier-Stokes solver in order to compute compressible turbulent flows on fully unstructured meshes. Solutions about single and multiple element airfoils are obtained and compared with experimental data.
Assessing the quality of curvilinear coordinate meshes by decomposing the Jacobian matrix
NASA Technical Reports Server (NTRS)
Kerlick, G. D.; Klopfer, G. H.
1982-01-01
An algebraic decomposition of the Jacobian matrix which relates physical and computational variables is presented. This invertible decomposition parameterizes the mesh by the physically intuitive qualities of cell orientation, cell orthogonality, cell volume, and cell aspect ratio. The decomposition can be used to analyze numerically generated curvilinear coordinate meshes and to assess the contribution of the mesh to the truncation error for any specific differential operator and algorithm. This is worked out in detail for Laplace's equation in nonconservative and conservative forms. The analysis is applied to the solution of the full potential code TAIR, showing grid plots, carpet plots, and truncation error for a NACA 0012 airfoil.
Mesh quality control for multiply-refined tetrahedral grids
NASA Technical Reports Server (NTRS)
Biswas, Rupak; Strawn, Roger
1994-01-01
A new algorithm for controlling the quality of multiply-refined tetrahedral meshes is presented in this paper. The basic dynamic mesh adaption procedure allows localized grid refinement and coarsening to efficiently capture aerodynamic flow features in computational fluid dynamics problems; however, repeated application of the procedure may significantly deteriorate the quality of the mesh. Results presented show the effectiveness of this mesh quality algorithm and its potential in the area of helicopter aerodynamics and acoustics.
Feature-Sensitive Tetrahedral Mesh Generation with Guaranteed Quality
Wang, Jun; Yu, Zeyun
2012-01-01
Tetrahedral meshes are being extensively used in finite element methods (FEM). This paper proposes an algorithm to generate feature-sensitive and high-quality tetrahedral meshes from an arbitrary surface mesh model. A top-down octree subdivision is conducted on the surface mesh and a set of tetrahedra are constructed using adaptive body-centered cubic (BCC) lattices. Special treatments are given to the tetrahedra near the surface such that the quality of the resulting tetrahedral mesh is provably guaranteed: the smallest dihedral angle is always greater than 5.71°. The meshes generated by our method are not only adaptive from the interior to the boundary, but also feature-sensitive on the surface with denser elements in high-curvature regions where geometric feature most likely reside. A variety of experimental results are presented to demonstrate the effectiveness and robustness of this algorithm. PMID:22328787
Adaptive and Quality Quadrilateral/Hexahedral Meshing from Volumetric Data⋆
Zhang, Yongjie; Bajaj, Chandrajit
2009-01-01
This paper describes an algorithm to extract adaptive and quality quadrilateral/hexahedral meshes directly from volumetric data. First, a bottom-up surface topology preserving octree-based algorithm is applied to select a starting octree level. Then the dual contouring method is used to extract a preliminary uniform quad/hex mesh, which is decomposed into finer quads/hexes adaptively without introducing any hanging nodes. The positions of all boundary vertices are recalculated to approximate the boundary surface more accurately. Mesh adaptivity can be controlled by a feature sensitive error function, the regions that users are interested in, or finite element calculation results. Finally, a relaxation based technique is deployed to improve mesh quality. Several demonstration examples are provided from a wide variety of application domains. Some extracted meshes have been extensively used in finite element simulations. PMID:19750180
Quality mesh generation in higher dimensions.
Mitchell, S. A.; Vavasis, S. A.; SNL; Cornell Univ.
2000-03-06
We consider the problem of triangulating a d-dimensional region. Our mesh generation algorithm, called QMG, is a quadtree-based algorithm that can triangulate any polyhedral region including nonconvex regions with holes. Furthermore, our algorithm guarantees a bounded aspect ratio triangulation provided that the input domain itself has no sharp angles. Finally, our algorithm is guaranteed never to overrefine the domain, in the sense that the number of simplices produced by QMG is bounded above by a factor times the number produced by any competing algorithm, where the factor depends on the aspect ratio bound satisfied by the competing algorithm. The QMG algorithm has been implemented in C++ and is used as a mesh generator for the finite element method.
Mesh quality effects on the accuracy of CFD solutions on unstructured meshes
NASA Astrophysics Data System (ADS)
Katz, Aaron; Sankaran, Venkateswaran
2011-08-01
The order of accuracy and error magnitude of node- and cell-centered schemes are examined on representative unstructured meshes and flowfield solutions for computational fluid dynamics. Specifically, we investigate the properties of inviscid and viscous flux discretizations for isotropic and highly stretched meshes using the Method of Manufactured Solutions. Grid quality effects are studied by randomly perturbing the base meshes and cataloguing the error convergence as a function of grid size. For isotropic grids, node-centered approaches produce less error than cell-centered approaches. Moreover, a corrected node-centered scheme is shown to maintain third order accuracy for the inviscid terms on arbitrary triangular meshes. In contrast, for stretched meshes, cell-centered schemes are favored, with cell-centered prismatic approaches in particular showing the lowest levels of error. In three dimensions, simple flux integrations on non-planar control volume faces lead to first-order solution errors, while second-order accuracy is recovered by triangulation of the non-planar faces.
Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2012-01-01
Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing “bad” triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method. PMID:23144522
Quality Tetrahedral Mesh Smoothing via Boundary-Optimized Delaunay Triangulation.
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2012-12-01
Despite its great success in improving the quality of a tetrahedral mesh, the original optimal Delaunay triangulation (ODT) is designed to move only inner vertices and thus cannot handle input meshes containing "bad" triangles on boundaries. In the current work, we present an integrated approach called boundary-optimized Delaunay triangulation (B-ODT) to smooth (improve) a tetrahedral mesh. In our method, both inner and boundary vertices are repositioned by analytically minimizing the error between a paraboloid function and its piecewise linear interpolation over the neighborhood of each vertex. In addition to the guaranteed volume-preserving property, the proposed algorithm can be readily adapted to preserve sharp features in the original mesh. A number of experiments are included to demonstrate the performance of our method. PMID:23144522
A structured multi-block solution-adaptive mesh algorithm with mesh quality assessment
NASA Technical Reports Server (NTRS)
Ingram, Clint L.; Laflin, Kelly R.; Mcrae, D. Scott
1995-01-01
The dynamic solution adaptive grid algorithm, DSAGA3D, is extended to automatically adapt 2-D structured multi-block grids, including adaption of the block boundaries. The extension is general, requiring only input data concerning block structure, connectivity, and boundary conditions. Imbedded grid singular points are permitted, but must be prevented from moving in space. Solutions for workshop cases 1 and 2 are obtained on multi-block grids and illustrate both increased resolution of and alignment with the solution. A mesh quality assessment criteria is proposed to determine how well a given mesh resolves and aligns with the solution obtained upon it. The criteria is used to evaluate the grid quality for solutions of workshop case 6 obtained on both static and dynamically adapted grids. The results indicate that this criteria shows promise as a means of evaluating resolution.
Teacher Quality and Teaching Quality of 7th-Grade Algebra I Honors Teachers
ERIC Educational Resources Information Center
Perez, Barbara
2013-01-01
With more and more focus on accountability, algebra achievement has become a major focus of math curriculum developers. In many states, students are expected to pass standardized Algebra achievement tests in order to satisfy graduation requirements. The purpose of this study was to identify teacher qualities and teaching qualities linked to…
Graphical postprocessing for 3-D mesh quality evaluation
NASA Technical Reports Server (NTRS)
Panthaki, M. J.; Abel, J. F.; Wawrzynek, P. A.
1989-01-01
An important objective of three-dimensional graphical finite-element postprocessing is to indicate to the engineer the accuracy of analysis results. The inclusion of mesh quality sensors permits a subjective evaluation of the adequacy of a single analysis being interpreted. For graphical approaches, both strain-energy-density gradients and discontinuities of unsmoothed responses and their gradients have proved to be effective sensors. Interactive graphical tools which can display discontinuity information effectively are described; these are essentially different from the ordinary methods used for the viewing of smoothed results.
A computational study of the effect of unstructured mesh quality on solution efficiency
Batdorf, M.; Freitag, L.A.; Ollivier-Gooch, C.
1997-09-01
It is well known that mesh quality affects both efficiency and accuracy of CFD solutions. Meshes with distorted elements make solutions both more difficult to compute and less accurate. We review a recently proposed technique for improving mesh quality as measured by element angle (dihedral angle in three dimensions) using a combination of optimization-based smoothing techniques and local reconnection schemes. Typical results that quantify mesh improvement for a number of application meshes are presented. We then examine effects of mesh quality as measured by the maximum angle in the mesh on the convergence rates of two commonly used CFD solution techniques. Numerical experiments are performed that quantify the cost and benefit of using mesh optimization schemes for incompressible flow over a cylinder and weakly compressible flow over a cylinder.
Quality Partitioned Meshing of Multi-Material Objects
Zhang, Qin; Cha, Deukhyun; Bajaj, Chandrajit
2016-01-01
We present a simple but effective algorithm for generating topologically and geometrically consistent quality triangular surface meshing of compactly packed multiple heterogeneous domains in R3. By compact packing we imply that adjacent homogeneous domains or materials share some 0, 1, and/or 2 dimensional boundary. Such packed multiple material (or multi-material) solids arise naturally from classification/partitioning/segmentation of homogeneous domains in R3 into different sub-regions. The multi-materials may also represent separate functionally classified sections or just be multiple component copies tightly fused together as perhaps by layered manufacturing processes. The input to our algorithm is a geometric representation of the entire multi-material solid, and a volumetric classification map identifying the individual materials. As output, each individual material region is represented by a triangulated 2-manifold boundary, with adjacent material regions having shared boundaries. Our algorithm has been implemented, and applied to different multi-material solids, and the results are additionally presented with quantitative analysis of detection and cure of non-manifold interfaces as well as spurious small components. These meshes are useful for combined boundary element analysis, however these simulation results are not presented.
Production-quality Tools for Adaptive Mesh RefinementVisualization
Weber, Gunther H.; Childs, Hank; Bonnell, Kathleen; Meredith,Jeremy; Miller, Mark; Whitlock, Brad; Bethel, E. Wes
2007-10-25
Adaptive Mesh Refinement (AMR) is a highly effectivesimulation method for spanning a large range of spatiotemporal scales,such as astrophysical simulations that must accommodate ranges frominterstellar to sub-planetary. Most mainstream visualization tools stilllack support for AMR as a first class data type and AMR code teams usecustom built applications for AMR visualization. The Department ofEnergy's (DOE's) Science Discovery through Advanced Computing (SciDAC)Visualization and Analytics Center for Enabling Technologies (VACET) isextending and deploying VisIt, an open source visualization tool thataccommodates AMR as a first-class data type, for use asproduction-quality, parallel-capable AMR visual data analysisinfrastructure. This effort will help science teams that use AMR-basedsimulations and who develop their own AMR visual data analysis softwareto realize cost and labor savings.
NASA Astrophysics Data System (ADS)
Papadakis, A. P.; Georghiou, G. E.; Metaxas, A. C.
2008-12-01
A new adaptive mesh generator has been developed and used in the analysis of high-pressure gas discharges, such as avalanches and streamers, reducing computational times and computer memory needs significantly. The new adaptive mesh generator developed, uses normalized error indicators, varying from 0 to 1, to guarantee optimal mesh resolution for all carriers involved in the analysis. Furthermore, it uses h- and r-refinement techniques such as mesh jiggling, edge swapping and node addition/removal to develop an element quality improvement algorithm that improves the mesh quality significantly and a fast and accurate algorithm for interpolation between meshes. Finally, the mesh generator is applied in the characterization of the transition from a single electron to the avalanche and streamer discharges in high-voltage, high-pressure gas discharges for dc 1 mm gaps, RF 1 cm point-plane gaps and parallel-plate 40 MHz configurations, in ambient atmospheric air.
Topology, accuracy, and quality of isosurface meshes using dynamic particles.
Meyer, Miriah; Kirby, Robert M; Whitaker, Ross
2007-01-01
This paper describes a method for constructing isosurface triangulations of sampled, volumetric, three-dimensional scalar fields. The resulting meshes consist of triangles that are of consistently high quality, making them well suited for accurate interpolation of scalar and vector-valued quantities, as required for numerous applications in visualization and numerical simulation. The proposed method does not rely on a local construction or adjustment of triangles as is done, for instance, in advancing wavefront or adaptive refinement methods. Instead, a system of dynamic particles optimally samples an implicit function such that the particles' relative positions can produce a topologically correct Delaunay triangulation. Thus, the proposed method relies on a global placement of triangle vertices. The main contributions of the paper are the integration of dynamic particles systems with surface sampling theory and PDE-based methods for controlling the local variability of particle densities, as well as detailing a practical method that accommodates Delaunay sampling requirements to generate sparse sets of points for the production of high-quality tessellations. PMID:17968128
Application of Quaternions for Mesh
NASA Technical Reports Server (NTRS)
Samareh, Jamshid A.
2002-01-01
A new three dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.
New Software Developments for Quality Mesh Generation and Optimization from Biomedical Imaging Data
Yu, Zeyun; Wang, Jun; Gao, Zhanheng; Xu, Ming; Hoshijima, Masahiko
2013-01-01
In this paper we present a new software toolkit for generating and optimizing surface and volumetric meshes from three-dimensional (3D) biomedical imaging data, targeted at image-based finite element analysis of some biomedical activities in a single material domain. Our toolkit includes a series of geometric processing algorithms including surface re-meshing and quality-guaranteed tetrahedral mesh generation and optimization. All methods described have been encapsulated into a user-friendly graphical interface for easy manipulation and informative visualization of biomedical images and mesh models. Numerous examples are presented to demonstrate the effectiveness and efficiency of the described methods and toolkit. PMID:24252469
Lattice Cleaving: Conforming Tetrahedral Meshes of Multimaterial Domains with Bounded Quality
Bronson, Jonathan R.; Levine, Joshua A.; Whitaker, Ross T.
2013-01-01
Summary We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, in order to reduce element counts in regions of homogeneity. PMID:25309969
Edge groups: an approach to understanding the mesh quality of marching methods.
Dietrich, Carlos A; Scheidegger, Carlos E; Comba, João L D; Nedel, Luciana P; Silva, Cláudio T
2008-01-01
Marching Cubes is the most popular isosurface extraction algorithm due to its simplicity, efficiency and robustness. It has been widely studied, improved, and extended. While much early work was concerned with efficiency and correctness issues, lately there has been a push to improve the quality of Marching Cubes meshes so that they can be used in computational codes. In this work we present a new classification of MC cases that we call Edge Groups, which helps elucidate the issues that impact the triangle quality of the meshes that the method generates. This formulation allows a more systematic way to bound the triangle quality, and is general enough to extend to other polyhedral cell shapes used in other polygonization algorithms. Using this analysis, we also discuss ways to improve the quality of the resulting triangle mesh, including some that require only minor modifications of the original algorithm. PMID:18989022
A priori mesh quality metrics for three-dimensional hybrid grids
Kallinderis, Y. Fotia, S.
2015-01-01
Use of general hybrid grids to attain complex-geometry field simulations poses a challenge on estimation of their quality. Apart from the typical problems of non-uniformity and non-orthogonality, the change in element topology is an extra issue to address. The present work derives and evaluates an a priori mesh quality indicator for structured, unstructured, as well as hybrid grids consisting of hexahedra, prisms, tetrahedra, and pyramids. Emphasis is placed on deriving a direct relation between the quality measure and mesh distortion. The work is based on use of the Finite Volume discretization for evaluation of first order spatial derivatives. The analytic form of the truncation error is derived and applied to elementary types of mesh distortion including typical hybrid grid interfaces. The corresponding analytic expressions provide relations between the truncation error and the degree of stretching, skewness, shearing, torsion, expansion, as well as the type of grid interface.
Application of Quaternions for Mesh Deformation
NASA Technical Reports Server (NTRS)
Samareh, Jamshid A.
2002-01-01
A new three-dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.
Knupp, P.M.
1999-01-18
Structured mesh quality optimization methods are extended to optimization of unstructured triangular, quadrilateral, and mixed finite element meshes. N"ew interpretations of well-known nodally-bssed objective functions are made possible using matrices and matrix norms. The matrix perspective also suggests several new objective functions. Particularly significant is the interpretation of the Oddy metric and the Smoothness objective functions in terms of the condition number of the metric tensor and Jacobian matrix, respectively. Objective functions are grouped according to dimensionality to form weighted combinations. A simple unconstrained local optimum is computed using a modiiied N-ewton iteration. The optimization approach was implemented in the CUBIT mesh generation code and tested on several problems. Results were compared against several standard element-based quaIity measures to demonstrate that good mesh quality can be achieved with nodally-based objective functions.
Kuprat, A.; George, D.
1998-12-01
When modeling deformation of geometrically complex regions, unstructured tetrahedral meshes provide the flexibility necessary to track interfaces as they change geometrically and topologically. In the class of time-dependent simulations considered in this paper, multimaterial interfaces are represented by sets of triangular facets, and motion of the interfaces is controlled by physical considerations. The motion of interior points in the conforming tetrahedral mesh (i.e., points not on interfaces) is arbitrary and may be chosen to produce good element shapes. In the context of specified boundary motion driven by physical considerations, they have found that a rather large glossary of mesh changes is required to allow the simulation to survive all the transitions of interface geometry and topology that occur during time evolution. This paper will describe mesh changes required to maintain good element quality as the geometry evolves, as well as mesh changes required to capture changes i n topology that occur when material regions collapse or pinch off. This paper will present a detailed description of mesh changes necessary for capturing the aforementioned geometrical and topological changes, as implemented in the code GRAIN3D, and will provide examples from a metallic grain growth simulation in which the normal velocity of the grain boundary is proportional to mean curvature.
Local meshing plane analysis as a source of information about the gear quality
NASA Astrophysics Data System (ADS)
Mączak, Jędrzej
2013-07-01
In the paper the application of the local meshing plane concept is discussed and applied for detecting of tooth degradation due to fatigue, and for overall gear quality assessment. Knowing the kinematic properties of the machine (i.e. gear tooth numbers) it is possible to modify the diagnostic signal in such a manner that its fragments will be linked to different rotating parts. This allows for presentation of either raw or processed gearbox signal in a form of three dimensional map on the plane "pinion teeth×gear teeth", called local meshing plane. The meshing plane in Cartesian coordinates z1×z2 allows for precise location and assessment of gear faults in terms of meshing quality of consecutive tooth pairs. Although the method was applied to simulated signals generated by the gearbox model, similar results were obtained for the measurement signals recorded during the back-to-back test stand experiment. The described method could be used for assessing the manufacturing quality of gears, the assembly quality as well as for the gear failure evaluation during normal exploitation.
Automatic MeSH term assignment and quality assessment.
Kim, W.; Aronson, A. R.; Wilbur, W. J.
2001-01-01
For computational purposes documents or other objects are most often represented by a collection of individual attributes that may be strings or numbers. Such attributes are often called features and success in solving a given problem can depend critically on the nature of the features selected to represent documents. Feature selection has received considerable attention in the machine learning literature. In the area of document retrieval we refer to feature selection as indexing. Indexing has not traditionally been evaluated by the same methods used in machine learning feature selection. Here we show how indexing quality may be evaluated in a machine learning setting and apply this methodology to results of the Indexing Initiative at the National Library of Medicine. PMID:11825203
Moriconi, S; Scalco, E; Broggi, S; Avuzzi, B; Valdagni, R; Rizzo, G
2015-08-01
A novel approach for three-dimensional (3D) surface reconstruction of anatomical structures in radiotherapy (RT) is presented. This is obtained from manual cross-sectional contours by combining both image voxel segmentation processing and implicit surface streaming methods using wavelets. 3D meshes reconstructed with the proposed approach are compared to those obtained from traditional triangulation algorithm. Qualitative and quantitative evaluations are performed in terms of mesh quality metrics. Differences in smoothness, detail and accuracy are observed in the comparison, considering three different anatomical districts and several organs at risk in radiotherapy. Overall best performances were recorded for the proposed approach, regardless the complexity of the anatomical structure. This demonstrates the efficacy of the proposed approach for the 3D surface reconstruction in radiotherapy and allows for further specific image analyses using real biomedical data. PMID:26737226
2011-01-01
Background Mesh repair of incisional hernia is superior to the conventional technique. From all available materials for open surgery polypropylene (PP) is the most widely used. Development resulted in meshes with larger pore size, decreased mesh surface and lower weight. The aim of this retrospective non randomized study was to compare the quality of life in the long term follow up (> 72 month) after incisional hernia repair with "light weight"(LW) and "heavy weight"(HW) PP meshes. Methods 12 patients who underwent midline open incisional hernia repair with a HW-PP mesh (Prolene® 109 g/m2 pore size 1.6 mm) between January 1996 and December 1997 were compared with 12 consecutive patients who underwent the same procedure with a LW-PP mesh (Vypro® 54 g/m2, pore size 4-5 mm) from January 1998. The standard technique was the sublay mesh-plasty with the retromuscular positioning of the mesh. The two groups were equal in BMI, age, gender and hernia size. Patients were routinely seen back in the clinic. Results In the long term run (mean follow up 112 ± 22 months) patients of the HW mesh group revealed no significant difference in the SF-36 Health Survey domains compared to the LW group (mean follow up 75 ± 16 months). Conclusions In this study the health related quality of life based on the SF 36 survey after open incisional hernia repair with light or heavy weight meshes is not related to the mesh type in the long term follow up. PMID:21917180
ERIC Educational Resources Information Center
Chingos, Matthew M.
2016-01-01
Little is known about the importance of instructional quality in American higher education because few recent studies have had access to direct measures of student learning that are comparable across sections of the same course. Using data from two developmental algebra courses at a large community college, I found that student learning varies…
A Program to Improve the Triangulated Surface Mesh Quality Along Aircraft Component Intersections
NASA Technical Reports Server (NTRS)
Cliff, Susan E.
2005-01-01
A computer program has been developed for improving the quality of unstructured triangulated surface meshes in the vicinity of component intersections. The method relies solely on point removal and edge swapping for improving the triangulations. It can be applied to any lifting surface component such as a wing, canard or horizontal tail component intersected with a fuselage, or it can be applied to a pylon that is intersected with a wing, fuselage or nacelle. The lifting surfaces or pylon are assumed to be aligned in the axial direction with closed trailing edges. The method currently maintains salient edges only at leading and trailing edges of the wing or pylon component. This method should work well for any shape of fuselage that is free of salient edges at the intersection. The method has been successfully demonstrated on a total of 125 different test cases that include both blunt and sharp wing leading edges. The code is targeted for use in the automated environment of numerical optimization where geometric perturbations to individual components can be critical to the aerodynamic performance of a vehicle. Histograms of triangle aspect ratios are reported to assess the quality of the triangles attached to the intersection curves before and after application of the program. Large improvements to the quality of the triangulations were obtained for the 125 test cases; the quality was sufficient for use with an automated tetrahedral mesh generation program that is used as part of an aerodynamic shape optimization method.
Loderer, Christian; Wörle, Anna; Fuchs, Werner
2012-04-01
Recently, a new type of wastewater treatment system became the focus of scientific research: the mesh filter activated sludge system. It is a modification of the membrane bioreactor (MBR), in which a membrane filtration process serves for sludge separation. The main difference is that a mesh filter is used instead of the membrane. The effluent is not of the same excellent quality as with membrane bioreactors due to the much lager pore sizes of the mesh. Nevertheless, it still resembles the quality of currently used standard treatment system, the activated sludge process. The new process shows high future potential as an alternative where a small footprint of these plants is required (3 times lower footprint than conventional activated sludge systems because of neglecting the secondary clarifier and reducing the biological stage). However, so far only limited information on this innovative process is available. In this study, the effect of different pore sizes and different mesh module configurations on the effluent quality was investigated varying the parameters cross-flow velocity (CFV) and flux rate. Furthermore the long-term filtration performance was studied in a pilot reactor system and results were compared to the full-scale conventional activated sludge process established at the same site. The results demonstrate that the configuration of the filter module has little impact on effluent quality and is only of importance with regard to engineering aspects. Most important for a successful operation are the hydrodynamic conditions within the filter module. The statement "the higher the pore size the higher the effluent turbidity" was verified. Excellent effluent quality with suspended solids between 5 and 15 mg L(-1) and high biological elimination rates (chemical oxygen demand (COD) 90-95%, biological oxygen demand (BOD5) 94-98%, total nitrogen (TN) 70-80%, and ammonium nitrogen (NH(4)-N) 95-99%) were achieved and also compared to those of conventional
Spherical geodesic mesh generation
Fung, Jimmy; Kenamond, Mark Andrew; Burton, Donald E.; Shashkov, Mikhail Jurievich
2015-02-27
In ALE simulations with moving meshes, mesh topology has a direct influence on feature representation and code robustness. In three-dimensional simulations, modeling spherical volumes and features is particularly challenging for a hydrodynamics code. Calculations on traditional spherical meshes (such as spin meshes) often lead to errors and symmetry breaking. Although the underlying differencing scheme may be modified to rectify this, the differencing scheme may not be accessible. This work documents the use of spherical geodesic meshes to mitigate solution-mesh coupling. These meshes are generated notionally by connecting geodesic surface meshes to produce triangular-prismatic volume meshes. This mesh topology is fundamentally different from traditional mesh topologies and displays superior qualities such as topological symmetry. This work describes the geodesic mesh topology as well as motivating demonstrations with the FLAG hydrocode.
Matrix Norms and the Condition Number: A General Framework to Improve Mesh Quality via Node-Movement
KNUPP,PATRICK
1999-09-27
Objective functions for unstructured hexahedral and tetrahedral mesh optimization are analyzed using matrices and matrix norms. Mesh untangling objective functions that create valid meshes are used to initialize the optimization process. Several new objective functions to achieve element invertibility and quality are investigated, the most promising being the ''condition number''. The condition number of the Jacobian matrix of an element forms the basis of a barrier-based objective function that measures the distance to the set of singular matrices and has the ideal matrix as a stationary point. The method was implemented in the Cubit code, with promising results.
NASA Astrophysics Data System (ADS)
Jermyn, Michael; Ghadyani, Hamid; Mastanduno, Michael A.; Turner, Wes; Davis, Scott C.; Dehghani, Hamid; Pogue, Brian W.
2013-08-01
Multimodal approaches that combine near-infrared (NIR) and conventional imaging modalities have been shown to improve optical parameter estimation dramatically and thus represent a prevailing trend in NIR imaging. These approaches typically involve applying anatomical templates from magnetic resonance imaging/computed tomography/ultrasound images to guide the recovery of optical parameters. However, merging these data sets using current technology requires multiple software packages, substantial expertise, significant time-commitment, and often results in unacceptably poor mesh quality for optical image reconstruction, a reality that represents a significant roadblock for translational research of multimodal NIR imaging. This work addresses these challenges directly by introducing automated digital imaging and communications in medicine image stack segmentation and a new one-click three-dimensional mesh generator optimized for multimodal NIR imaging, and combining these capabilities into a single software package (available for free download) with a streamlined workflow. Image processing time and mesh quality benchmarks were examined for four common multimodal NIR use-cases (breast, brain, pancreas, and small animal) and were compared to a commercial image processing package. Applying these tools resulted in a fivefold decrease in image processing time and 62% improvement in minimum mesh quality, in the absence of extra mesh postprocessing. These capabilities represent a significant step toward enabling translational multimodal NIR research for both expert and nonexpert users in an open-source platform.
Ghadyani, Hamid; Mastanduno, Michael A.; Turner, Wes; Davis, Scott C.; Dehghani, Hamid; Pogue, Brian W.
2013-01-01
Abstract. Multimodal approaches that combine near-infrared (NIR) and conventional imaging modalities have been shown to improve optical parameter estimation dramatically and thus represent a prevailing trend in NIR imaging. These approaches typically involve applying anatomical templates from magnetic resonance imaging/computed tomography/ultrasound images to guide the recovery of optical parameters. However, merging these data sets using current technology requires multiple software packages, substantial expertise, significant time-commitment, and often results in unacceptably poor mesh quality for optical image reconstruction, a reality that represents a significant roadblock for translational research of multimodal NIR imaging. This work addresses these challenges directly by introducing automated digital imaging and communications in medicine image stack segmentation and a new one-click three-dimensional mesh generator optimized for multimodal NIR imaging, and combining these capabilities into a single software package (available for free download) with a streamlined workflow. Image processing time and mesh quality benchmarks were examined for four common multimodal NIR use-cases (breast, brain, pancreas, and small animal) and were compared to a commercial image processing package. Applying these tools resulted in a fivefold decrease in image processing time and 62% improvement in minimum mesh quality, in the absence of extra mesh postprocessing. These capabilities represent a significant step toward enabling translational multimodal NIR research for both expert and nonexpert users in an open-source platform. PMID:23942632
Dubai 3d Textuerd Mesh Using High Quality Resolution Vertical/oblique Aerial Imagery
NASA Astrophysics Data System (ADS)
Tayeb Madani, Adib; Ziad Ahmad, Abdullateef; Christoph, Lueken; Hammadi, Zamzam; Manal Abdullah Sabeal, Manal Abdullah x.
2016-06-01
Providing high quality 3D data with reasonable quality and cost were always essential, affording the core data and foundation for developing an information-based decision-making tool of urban environments with the capability of providing decision makers, stakeholders, professionals, and public users with 3D views and 3D analysis tools of spatial information that enables real-world views. Helps and assist in improving users' orientation and also increase their efficiency in performing their tasks related to city planning, Inspection, infrastructures, roads, and cadastre management. In this paper, the capability of multi-view Vexcel UltraCam Osprey camera images is examined to provide a 3D model of building façades using an efficient image-based modeling workflow adopted by commercial software's. The main steps of this work include: Specification, point cloud generation, and 3D modeling. After improving the initial values of interior and exterior parameters at first step, an efficient image matching technique such as Semi Global Matching (SGM) is applied on the images to generate point cloud. Then, a mesh model of points is calculated using and refined to obtain an accurate model of buildings. Finally, a texture is assigned to mesh in order to create a realistic 3D model. The resulting model has provided enough LoD2 details of the building based on visual assessment. The objective of this paper is neither comparing nor promoting a specific technique over the other and does not mean to promote a sensor-based system over another systems or mechanism presented in existing or previous paper. The idea is to share experience.
Quality-of-service-based protection in MPLS control WDM mesh networks
NASA Astrophysics Data System (ADS)
Wen, Wushao; Mukherjee, Biswanath; Yoo, S. J. B.
2001-10-01
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality of service (QoS)-based protection in term of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and its impact to the sharing of their backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and fully automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration when deciding backup lightpaths. A simple analysis of the proposed algorithm in terms of computation, time, and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based sharing backup algorithms indicates that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network-resource utilization.
Knupp, P.M.
1999-03-26
Three-dimensional unstructured tetrahedral and hexahedral finite element mesh optimization is studied from a theoretical perspective and by computer experiments to determine what objective functions are most effective in attaining valid, high quality meshes. The approach uses matrices and matrix norms to extend the work in Part I to build suitable 3D objective functions. Because certain matrix norm identities which hold for 2 x 2 matrices do not hold for 3 x 3 matrices. significant differences arise between surface and volume mesh optimization objective functions. It is shown, for example, that the equivalence in two-dimensions of the Smoothness and Condition Number of the Jacobian matrix objective functions does not extend to three dimensions and further. that the equivalence of the Oddy and Condition Number of the Metric Tensor objective functions in two-dimensions also fails to extend to three-dimensions. Matrix norm identities are used to systematically construct dimensionally homogeneous groups of objective functions. The concept of an ideal minimizing matrix is introduced for both hexahedral and tetrahedral elements. Non-dimensional objective functions having barriers are emphasized as the most logical choice for mesh optimization. The performance of a number of objective functions in improving mesh quality was assessed on a suite of realistic test problems, focusing particularly on all-hexahedral ''whisker-weaved'' meshes. Performance is investigated on both structured and unstructured meshes and on both hexahedral and tetrahedral meshes. Although several objective functions are competitive, the condition number objective function is particularly attractive. The objective functions are closely related to mesh quality measures. To illustrate, it is shown that the condition number metric can be viewed as a new tetrahedral element quality measure.
Multigrid techniques for unstructured meshes
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1995-01-01
An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples of practical applications. Advanced multigrid topics, such as the use of algebraic multigrid methods, and the combination of multigrid techniques with adaptive meshing strategies are dealt with in subsequent sections. These represent current areas of research, and the unresolved issues are discussed. The presentation is organized in an educational manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.
Adaptive Skin Meshes Coarsening for Biomolecular Simulation.
Shi, Xinwei; Koehl, Patrice
2011-06-01
In this paper, we present efficient algorithms for generating hierarchical molecular skin meshes with decreasing size and guaranteed quality. Our algorithms generate a sequence of coarse meshes for both the surfaces and the bounded volumes. Each coarser surface mesh is adaptive to the surface curvature and maintains the topology of the skin surface with guaranteed mesh quality. The corresponding tetrahedral mesh is conforming to the interface surface mesh and contains high quality tetrahedral that decompose both the interior of the molecule and the surrounding region (enclosed in a sphere). Our hierarchical tetrahedral meshes have a number of advantages that will facilitate fast and accurate multigrid PDE solvers. Firstly, the quality of both the surface triangulations and tetrahedral meshes is guaranteed. Secondly, the interface in the tetrahedral mesh is an accurate approximation of the molecular boundary. In particular, all the boundary points lie on the skin surface. Thirdly, our meshes are Delaunay meshes. Finally, the meshes are adaptive to the geometry. PMID:21779137
Adaptive Skin Meshes Coarsening for Biomolecular Simulation
Shi, Xinwei; Koehl, Patrice
2011-01-01
In this paper, we present efficient algorithms for generating hierarchical molecular skin meshes with decreasing size and guaranteed quality. Our algorithms generate a sequence of coarse meshes for both the surfaces and the bounded volumes. Each coarser surface mesh is adaptive to the surface curvature and maintains the topology of the skin surface with guaranteed mesh quality. The corresponding tetrahedral mesh is conforming to the interface surface mesh and contains high quality tetrahedral that decompose both the interior of the molecule and the surrounding region (enclosed in a sphere). Our hierarchical tetrahedral meshes have a number of advantages that will facilitate fast and accurate multigrid PDE solvers. Firstly, the quality of both the surface triangulations and tetrahedral meshes is guaranteed. Secondly, the interface in the tetrahedral mesh is an accurate approximation of the molecular boundary. In particular, all the boundary points lie on the skin surface. Thirdly, our meshes are Delaunay meshes. Finally, the meshes are adaptive to the geometry. PMID:21779137
NASA Astrophysics Data System (ADS)
Zheng, J.; Zhu, J.; Wang, Z.; Fang, F.; Pain, C. C.; Xiang, J.
2015-10-01
An integrated method of advanced anisotropic hr-adaptive mesh and discretization numerical techniques has been, for first time, applied to modelling of multiscale advection-diffusion problems, which is based on a discontinuous Galerkin/control volume discretization on unstructured meshes. Over existing air quality models typically based on static-structured grids using a locally nesting technique, the advantage of the anisotropic hr-adaptive model has the ability to adapt the mesh according to the evolving pollutant distribution and flow features. That is, the mesh resolution can be adjusted dynamically to simulate the pollutant transport process accurately and effectively. To illustrate the capability of the anisotropic adaptive unstructured mesh model, three benchmark numerical experiments have been set up for two-dimensional (2-D) advection phenomena. Comparisons have been made between the results obtained using uniform resolution meshes and anisotropic adaptive resolution meshes. Performance achieved in 3-D simulation of power plant plumes indicates that this new adaptive multiscale model has the potential to provide accurate air quality modelling solutions effectively.
Optimization of tetrahedral meshes
Briere De L`Isle, E.; George, P.L.
1995-12-31
Finite element computations are all the more exact if we start from {open_quotes}good{close_quotes} elements. We are interested in meshes where the elements are tetrahedra and we shall develop utilities allowing us to improve the quality of these meshes.
Lazarov, R; Pasciak, J; Jones, J
2002-02-01
Construction, analysis and numerical testing of efficient solution techniques for solving elliptic PDEs that allow for parallel implementation have been the focus of the research. A number of discretization and solution methods for solving second order elliptic problems that include mortar and penalty approximations and domain decomposition methods for finite elements and finite volumes have been investigated and analyzed. Techniques for parallel domain decomposition algorithms in the framework of PETC and HYPRE have been studied and tested. Hierarchical parallel grid refinement and adaptive solution methods have been implemented and tested on various model problems. A parallel code implementing the mortar method with algebraically constructed multiplier spaces was developed.
Mesh Excision: Is Total Mesh Excision Necessary?
Wolff, Gillian F; Winters, J Christian; Krlin, Ryan M
2016-04-01
Nearly 29% of women will undergo a secondary, repeat operation for pelvic organ prolapse (POP) symptom recurrence following a primary repair, as reported by Abbott et al. (Am J Obstet Gynecol 210:163.e1-163.e1, 2014). In efforts to decrease the rates of failure, graft materials have been utilized to augment transvaginal repairs. Following the success of using polypropylene mesh (PPM) for stress urinary incontinence (SUI), the use of PPM in the transvaginal repair of POP increased. However, in recent years, significant concerns have been raised about the safety of PPM mesh. Complications, some specific to mesh, such as exposures, erosion, dyspareunia, and pelvic pain, have been reported with increased frequency. In the current literature, there is not substantive evidence to suggest that PPM has intrinsic properties that warrant total mesh removal in the absence of complications. There are a number of complications that can occur after transvaginal mesh placement that do warrant surgical intervention after failure of conservative therapy. In aggregate, there are no high-quality controlled studies that clearly demonstrate that total mesh removal is consistently more likely to achieve pain reduction. In the cases of obstruction and erosion, it seems clear that definitive removal of the offending mesh is associated with resolution of symptoms in the majority of cases and reasonable practice. There are a number of complications that can occur with removal of mesh, and patients should be informed of this as they formulate a choice of treatment. We will review these considerations as we examine the clinical question of whether total versus partial removal of mesh is necessary for the resolution of complications following transvaginal mesh placement. PMID:26905696
Prakash, Pradeep; Bansal, Virinder Kumar; Misra, Mahesh Chandra; Babu, Divya; Sagar, Rajesh; Krishna, Asuri; Kumar, Subodh; Rewari, Vimi; Subramaniam, Rajeshwari
2016-01-01
BACKGROUND: The aim of our study was to compare chronic groin pain and quality of life (QOL) after laparoscopic lightweight (LW) and heavyweight (HW) mesh repair for groin hernia. MATERIALS AND METHODS: One hundred and forty adult patients with uncomplicated inguinal hernia were randomised into HW mesh group or LW mesh group. Return to activity, chronic groin pain and recurrence rates were assessed. Short form-36 v2 health survey was used for QOL analysis. RESULTS: One hundred and thirty-one completed follow-up of 3 months, 66 in HW mesh group and 65 in LW mesh group. Early post-operative convalescence was better in LW mesh group in terms of early return to walking (P = 0.01) and driving (P = 0.05). The incidence of early post-operative pain, chronic groin pain and QOL and recurrences were comparable. CONCLUSION: Outcomes following laparoscopic inguinal hernia repair using HW and LW mesh are comparable in the short-term as well as long-term. PMID:27073309
NASA Technical Reports Server (NTRS)
Panthaki, Malcolm J.
1987-01-01
Three general tasks on general-purpose, interactive color graphics postprocessing for three-dimensional computational mechanics were accomplished. First, the existing program (POSTPRO3D) is ported to a high-resolution device. In the course of this transfer, numerous enhancements are implemented in the program. The performance of the hardware was evaluated from the point of view of engineering postprocessing, and the characteristics of future hardware were discussed. Second, interactive graphical tools implemented to facilitate qualitative mesh evaluation from a single analysis. The literature was surveyed and a bibliography compiled. Qualitative mesh sensors were examined, and the use of two-dimensional plots of unaveraged responses on the surface of three-dimensional continua was emphasized in an interactive color raster graphics environment. Finally, a postprocessing environment was designed for state-of-the-art workstation technology. Modularity, personalization of the environment, integration of the engineering design processes, and the development and use of high-level graphics tools are some of the features of the intended environment.
Darmoni, S J; Thirion, B; Leroyt, J P; Douyère, M; Lacoste, B; Godard, C; Rigolle, I; Brisou, M; Videau, S; Goupyt, E; Piott, J; Quéré, M; Ouazir, S; Abdulrab, H
2001-01-01
In the year 2001, the Internet has become a major source of health information for the health professional and the Netizen. The objective of Doc' CISMeF (D'C) was to create a powerful generic search tool based on a structured information model which 'encapsulates' the MeSH thesaurus to index and retrieve quality health resources on the Internet. To index resources, D'C uses four sections in its information model: 'meta-term', keyword, subheading, and resource type. Two search options are available: simple and advanced. The simple search requires the end-user to input a single term or expression. If this term belongs to the D'C information structure model, it will be exploded. If not, a full-text search is performed. In the advanced search, complex searches are possible combining Boolean operators with meta-terms, keywords, subheadings and resource types. D'C uses two standard tools for organising information: the MeSH thesaurus and the Dublin Core metadata format. Resources included in D'C are described according to the following elements: title, author or creator, subject and keywords, description, publishers, date, resource type, format, identifier, and language. PMID:11706927
Algebraic connectivity and graph robustness.
Feddema, John Todd; Byrne, Raymond Harry; Abdallah, Chaouki T.
2009-07-01
Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.
Advanced numerical methods in mesh generation and mesh adaptation
Lipnikov, Konstantine; Danilov, A; Vassilevski, Y; Agonzal, A
2010-01-01
Numerical solution of partial differential equations requires appropriate meshes, efficient solvers and robust and reliable error estimates. Generation of high-quality meshes for complex engineering models is a non-trivial task. This task is made more difficult when the mesh has to be adapted to a problem solution. This article is focused on a synergistic approach to the mesh generation and mesh adaptation, where best properties of various mesh generation methods are combined to build efficiently simplicial meshes. First, the advancing front technique (AFT) is combined with the incremental Delaunay triangulation (DT) to build an initial mesh. Second, the metric-based mesh adaptation (MBA) method is employed to improve quality of the generated mesh and/or to adapt it to a problem solution. We demonstrate with numerical experiments that combination of all three methods is required for robust meshing of complex engineering models. The key to successful mesh generation is the high-quality of the triangles in the initial front. We use a black-box technique to improve surface meshes exported from an unattainable CAD system. The initial surface mesh is refined into a shape-regular triangulation which approximates the boundary with the same accuracy as the CAD mesh. The DT method adds robustness to the AFT. The resulting mesh is topologically correct but may contain a few slivers. The MBA uses seven local operations to modify the mesh topology. It improves significantly the mesh quality. The MBA method is also used to adapt the mesh to a problem solution to minimize computational resources required for solving the problem. The MBA has a solid theoretical background. In the first two experiments, we consider the convection-diffusion and elasticity problems. We demonstrate the optimal reduction rate of the discretization error on a sequence of adaptive strongly anisotropic meshes. The key element of the MBA method is construction of a tensor metric from hierarchical edge
Teaching Algebra without Algebra
ERIC Educational Resources Information Center
Kalman, Richard S.
2008-01-01
Algebra is, among other things, a shorthand way to express quantitative reasoning. This article illustrates ways for the classroom teacher to convert algebraic solutions to verbal problems into conversational solutions that can be understood by students in the lower grades. Three reasonably typical verbal problems that either appeared as or…
Physician autonomy vs. accountability: making quality standards and medical style mesh.
Larson, Laurie
2007-01-01
As hospitals endeavor to follow more evidence-based care protocols for improving quality and patient safety, their biggest challenge may be the historic independence of physicians' medical practices. PMID:17685362
Chiu, Yuan-Shyi Peter; Chou, Chung-Li; Chang, Huei-Hsin; Chiu, Singa Wang
2016-01-01
A multi-customer finite production rate (FPR) model with quality assurance and discontinuous delivery policy was investigated in a recent paper (Chiu et al. in J Appl Res Technol 12(1):5-13, 2014) using differential calculus approach. This study employs mathematical modeling along with a two-phase algebraic method to resolve such a specific multi-customer FPR model. As a result, the optimal replenishment lot size and number of shipments can be derived without using the differential calculus. Such a straightforward method may assist practitioners who with insufficient knowledge of calculus in learning and managing the real multi-customer FPR systems more effectively. PMID:27186457
Gradient scaling for nonuniform meshes
Margolin, L.G.; Ruppel, H.M.; Demuth, R.B.
1985-01-01
This paper is concerned with the effect of nonuniform meshes on the accuracy of finite-difference calculations of fluid flow. In particular, when a simple shock propagates through a nonuniform mesh, one may fail to model the jump conditions across the shock even when the equations are differenced in manifestly conservative fashion. We develop an approximate dispersion analysis of the numerical equations and identify the source of the mesh dependency with the form of the artificial viscosity. We then derive an algebraic correction to the numerical equations - a scaling factor for the pressure gradient - to essentially eliminate the mesh dependency. We present several calculations to illustrate our theory. We conclude with an alternate interpretation of our results. 14 refs., 5 figs.
... Device Safety Safety Communications Surgical Mesh: FDA Safety Communication Share Tweet Linkedin Pin it More sharing options ... Prolapse and Stress Urinary Incontinence More in Safety Communications Information About Heparin Preventing Tubing and Luer Misconnections ...
Cubit Adaptive Meshing Algorithm Library
Energy Science and Technology Software Center (ESTSC)
2004-09-01
CAMAL (Cubit adaptive meshing algorithm library) is a software component library for mesh generation. CAMAL 2.0 includes components for triangle, quad and tetrahedral meshing. A simple Application Programmers Interface (API) takes a discrete boundary definition and CAMAL computes a quality interior unstructured grid. The triangle and quad algorithms may also import a geometric definition of a surface on which to define the grid. CAMALs triangle meshing uses a 3D space advancing front method, the quadmore » meshing algorithm is based upon Sandias patented paving algorithm and the tetrahedral meshing algorithm employs the GHS3D-Tetmesh component developed by INRIA, France.« less
Adaptive Meshing Techniques for Viscous Flow Calculations on Mixed Element Unstructured Meshes
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1997-01-01
An adaptive refinement strategy based on hierarchical element subdivision is formulated and implemented for meshes containing arbitrary mixtures of tetrahendra, hexahendra, prisms and pyramids. Special attention is given to keeping memory overheads as low as possible. This procedure is coupled with an algebraic multigrid flow solver which operates on mixed-element meshes. Inviscid flows as well as viscous flows are computed an adaptively refined tetrahedral, hexahedral, and hybrid meshes. The efficiency of the method is demonstrated by generating an adapted hexahedral mesh containing 3 million vertices on a relatively inexpensive workstation.
Iterative methods for elliptic finite element equations on general meshes
NASA Technical Reports Server (NTRS)
Nicolaides, R. A.; Choudhury, Shenaz
1986-01-01
Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.
Douyère, Magaly; Soualmia, Lina F; Névéol, Aurélie; Rogozan, Alexandrina; Dahamna, Badisse; Leroy, Jean-Philippe; Thirion, Benoît; Darmoni, Stefan J
2004-12-01
The amount of health information available on the Internet is considerable. In this context, several health gateways have been developed. Among them, CISMeF (Catalogue and Index of Health Resources in French) was designed to catalogue and index health resources in French. The goal of this article is to describe the various enhancements to the MeSH thesaurus developed by the CISMeF team to adapt this terminology to the broader field of health Internet resources instead of scientific articles for the medline bibliographic database. CISMeF uses two standard tools for organizing information: the MeSH thesaurus and several metadata element sets, in particular the Dublin Core metadata format. The heterogeneity of Internet health resources led the CISMeF team to enhance the MeSH thesaurus with the introduction of two new concepts, respectively, resource types and metaterms. CISMeF resource types are a generalization of the publication types of medline. A resource type describes the nature of the resource and MeSH keyword/qualifier pairs describe the subject of the resource. A metaterm is generally a medical specialty or a biological science, which has semantic links with one or more MeSH keywords, qualifiers and resource types. The CISMeF terminology is exploited for several tasks: resource indexing performed manually, resource categorization performed automatically, visualization and navigation through the concept hierarchies and information retrieval using the Doc'CISMeF search engine. The CISMeF health gateway uses several MeSH thesaurus enhancements to optimize information retrieval, hierarchy navigation and automatic indexing. PMID:15606883
ERIC Educational Resources Information Center
Bull, Elizabeth Kay
The goal of this study was to find a way to quantify three criteria of representational quality, described by Greeno, so that it would be possible to examine statistically the relationship between representational quality and other variables related to problem solution. The sample consisted of 18 college students, 84 percent of whom had…
Adaptive and Unstructured Mesh Cleaving
Bronson, Jonathan R.; Sastry, Shankar P.; Levine, Joshua A.; Whitaker, Ross T.
2015-01-01
We propose a new strategy for boundary conforming meshing that decouples the problem of building tetrahedra of proper size and shape from the problem of conforming to complex, non-manifold boundaries. This approach is motivated by the observation that while several methods exist for adaptive tetrahedral meshing, they typically have difficulty at geometric boundaries. The proposed strategy avoids this conflict by extracting the boundary conforming constraint into a secondary step. We first build a background mesh having a desired set of tetrahedral properties, and then use a generalized stenciling method to divide, or “cleave”, these elements to get a set of conforming tetrahedra, while limiting the impacts cleaving has on element quality. In developing this new framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a generalization of the isosurface stuffing and lattice cleaving algorithms to unstructured background meshes. PMID:26137171
Energy Science and Technology Software Center (ESTSC)
2010-10-05
MeshKit is an open-source library of mesh generation functionality. MeshKit has general mesh manipulation and generation functions such as Copoy, Move, Rotate and Extrude mesh. In addition, new quad mesh and embedded boundary Cartesian mesh algorithm (EB Mesh) are included. Interfaces to several public domain meshing algorithms (TetGen, netgen, triangle, Gmsh, camal) are also offered. This library interacts with mesh data mostly through iMesh including accessing the mesh in parallel. It also can interact withmore » iGeom interface to provide geometry functionality such as importing solid model based geometries. iGeom and IMesh are implemented in the CGM and MOAB packages, respectively. For some non-existing function in iMesh such as tree-construction and ray-tracing, MeshKit also interacts with MOAB functions directly.« less
2010-10-05
MeshKit is an open-source library of mesh generation functionality. MeshKit has general mesh manipulation and generation functions such as Copoy, Move, Rotate and Extrude mesh. In addition, new quad mesh and embedded boundary Cartesian mesh algorithm (EB Mesh) are included. Interfaces to several public domain meshing algorithms (TetGen, netgen, triangle, Gmsh, camal) are also offered. This library interacts with mesh data mostly through iMesh including accessing the mesh in parallel. It also can interact with iGeom interface to provide geometry functionality such as importing solid model based geometries. iGeom and IMesh are implemented in the CGM and MOAB packages, respectively. For some non-existing function in iMesh such as tree-construction and ray-tracing, MeshKit also interacts with MOAB functions directly.
Local, Optimization-based Simplicial Mesh Smoothing
Energy Science and Technology Software Center (ESTSC)
1999-12-09
OPT-MS is a C software package for the improvement and untangling of simplicial meshes (triangles in 2D, tetrahedra in 3D). Overall mesh quality is improved by iterating over the mesh vertices and adjusting their position to optimize some measure of mesh quality, such as element angle or aspect ratio. Several solution techniques (including Laplacian smoothing, "Smart" Laplacian smoothing, optimization-based smoothing and several combinations thereof) and objective functions (for example, element angle, sin (angle), and aspectmore » ratio) are available to the user for both two and three-dimensional meshes. If the mesh contains invalid elements (those with negative area) a different optimization algorithm for mesh untangling is provided.« less
ERIC Educational Resources Information Center
Schaufele, Christopher; Zumoff, Nancy
Earth Algebra is an entry level college algebra course that incorporates the spirit of the National Council of Teachers of Mathematics (NCTM) Curriculum and Evaluation Standards for School Mathematics at the college level. The context of the course places mathematics at the center of one of the major current concerns of the world. Through…
ERIC Educational Resources Information Center
Cavanagh, Sean
2009-01-01
As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…
6th International Meshing Roundtable '97
White, D.
1997-09-01
The goal of the 6th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the pas~ the Roundtable has enjoyed significant participation born each of these groups from a wide variety of countries. The Roundtable will consist of technical presentations from contributed papers and abstracts, two invited speakers, and two invited panels of experts discussing topics related to the development and use of automatic mesh generation tools. In addition, this year we will feature a "Bring Your Best Mesh" competition and poster session to encourage discussion and participation from a wide variety of mesh generation tool users. The schedule and evening social events are designed to provide numerous opportunities for informal dialog. A proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quaIity will be submitted to a special issue of the International Journal of Computational Geometry and Applications. Papers and one page abstracts were sought that present original results on the meshing process. Potential topics include but are got limited to: Unstructured triangular and tetrahedral mesh generation Unstructured quadrilateral and hexahedral mesh generation Automated blocking and structured mesh generation Mixed element meshing Surface mesh generation Geometry decomposition and clean-up techniques Geometry modification techniques related to meshing Adaptive mesh refinement and mesh quality control Mesh visualization Special purpose meshing algorithms for particular applications Theoretical or novel ideas with practical potential Technical presentations from industrial researchers.
Vervisch, Luc; Domingo, Pascale; Lodato, Guido; Veynante, Denis
2010-04-15
Large-Eddy Simulation (LES) provides space-filtered quantities to compare with measurements, which usually have been obtained using a different filtering operation; hence, numerical and experimental results can be examined side-by-side in a statistical sense only. Instantaneous, space-filtered and statistically time-averaged signals feature different characteristic length-scales, which can be combined in dimensionless ratios. From two canonical manufactured turbulent solutions, a turbulent flame and a passive scalar turbulent mixing layer, the critical values of these ratios under which measured and computed variances (resolved plus sub-grid scale) can be compared without resorting to additional residual terms are first determined. It is shown that actual Direct Numerical Simulation can hardly accommodate a sufficiently large range of length-scales to perform statistical studies of LES filtered reactive scalar-fields energy budget based on sub-grid scale variances; an estimation of the minimum Reynolds number allowing for such DNS studies is given. From these developments, a reliability mesh criterion emerges for scalar LES and scaling for scalar sub-grid scale energy is discussed. (author)
On combining Laplacian and optimization-based mesh smoothing techniques
Freitag, L.A.
1997-07-01
Local mesh smoothing algorithms have been shown to be effective in repairing distorted elements in automatically generated meshes. The simplest such algorithm is Laplacian smoothing, which moves grid points to the geometric center of incident vertices. Unfortunately, this method operates heuristically and can create invalid meshes or elements of worse quality than those contained in the original mesh. In contrast, optimization-based methods are designed to maximize some measure of mesh quality and are very effective at eliminating extremal angles in the mesh. These improvements come at a higher computational cost, however. In this article the author proposes three smoothing techniques that combine a smart variant of Laplacian smoothing with an optimization-based approach. Several numerical experiments are performed that compare the mesh quality and computational cost for each of the methods in two and three dimensions. The author finds that the combined approaches are very cost effective and yield high-quality meshes.
A comparison of tetrahedral mesh improvement techniques
Freitag, L.A.; Ollivier-Gooch, C.
1996-12-01
Automatic mesh generation and adaptive refinement methods for complex three-dimensional domains have proven to be very successful tools for the efficient solution of complex applications problems. These methods can, however, produce poorly shaped elements that cause the numerical solution to be less accurate and more difficult to compute. Fortunately, the shape of the elements can be improved through several mechanisms, including face-swapping techniques that change local connectivity and optimization-based mesh smoothing methods that adjust grid point location. The authors consider several criteria for each of these two methods and compare the quality of several meshes obtained by using different combinations of swapping and smoothing. Computational experiments show that swapping is critical to the improvement of general mesh quality and that optimization-based smoothing is highly effective in eliminating very small and very large angles. The highest quality meshes are obtained by using a combination of swapping and smoothing techniques.
Conformal refinement of unstructured quadrilateral meshes
Garmella, Rao
2009-01-01
We present a multilevel adaptive refinement technique for unstructured quadrilateral meshes in which the mesh is kept conformal at all times. This means that the refined mesh, like the original, is formed of only quadrilateral elements that intersect strictly along edges or at vertices, i.e., vertices of one quadrilateral element do not lie in an edge of another quadrilateral. Elements are refined using templates based on 1:3 refinement of edges. We demonstrate that by careful design of the refinement and coarsening strategy, we can maintain high quality elements in the refined mesh. We demonstrate the method on a number of examples with dynamically changing refinement regions.
Mesh for prolapse surgery: Why the fuss?
Rajshekhar, Smita; Mukhopadhyay, Sambit; Klinge, Uwe
2015-06-01
Pelvic organ prolapse is a common gynaecological problem. Surgical techniques to repair prolapse have been constantly evolving to reduce the recurrence of prolapse and need for reoperation. Grafts made of synthetic and biological materials became popular in the last decade as they were intended to provide extra support to native tissue repairs. However, serious complications related to use of synthetic meshes have been reported and there is increasing medico-legal concern about mesh use in prolapse surgery. Some mesh products already have been withdrawn from the market and the FDA has introduced stricter surveillance of new and existing products. Large randomized studies comparing mesh with non-mesh procedures are lacking which creates uncertainty for the surgeon and their patients.The small cohorts of the RCTs available with short follow-up periods just allow the conclusion that the mesh repair can be helpful in the short to medium term but unfortunately are not able to prove safety for all patients. In particular, current clinical reports cannot define for which indication what material may be superior compared to non-mesh repair.Quality control through long-term individual and national mesh registries is needed to keep a record of all surgeons using mesh and all devices being used, monitoring their effectiveness and safety data. Meshes with better biocompatibility designed specifically for use in vaginal surgery may provide superior clinical results, where the reduction of complications may allow a wider range of indications. PMID:25952907
Some Aspects of Multigrid Methods on Non-Structured Meshes
NASA Technical Reports Server (NTRS)
Guillard, H.; Marco, N.
1996-01-01
To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.
Update on Development of Mesh Generation Algorithms in MeshKit
Jain, Rajeev; Vanderzee, Evan; Mahadevan, Vijay
2015-09-30
MeshKit uses a graph-based design for coding all its meshing algorithms, which includes the Reactor Geometry (and mesh) Generation (RGG) algorithms. This report highlights the developmental updates of all the algorithms, results and future work. Parallel versions of algorithms, documentation and performance results are reported. RGG GUI design was updated to incorporate new features requested by the users; boundary layer generation and parallel RGG support were added to the GUI. Key contributions to the release, upgrade and maintenance of other SIGMA1 libraries (CGM and MOAB) were made. Several fundamental meshing algorithms for creating a robust parallel meshing pipeline in MeshKit are under development. Results and current status of automated, open-source and high quality nuclear reactor assembly mesh generation algorithms such as trimesher, quadmesher, interval matching and multi-sweeper are reported.
KNUPP,PATRICK
2000-12-13
We investigate a well-motivated mesh untangling objective function whose optimization automatically produces non-inverted elements when possible. Examples show the procedure is highly effective on simplicial meshes and on non-simplicial (e.g., hexahedral) meshes constructed via mapping or sweeping algorithms. The current whisker-weaving (WW) algorithm in CUBIT usually produces hexahedral meshes that are unsuitable for analyses due to inverted elements. The majority of these meshes cannot be untangled using the new objective function. The most likely source of the difficulty is poor mesh topology.
FEATURE-BASED MULTIBLOCK FINITE ELEMENT MESH GENERATION
Shivanna, Kiran H.; Tadepalli, Srinivas C.; Grosland, Nicole M.
2010-01-01
Hexahedral finite element mesh development for anatomic structures and biomedical implants can be cumbersome. Moreover, using traditional meshing techniques, detailed features may be inadequately captured. In this paper, we describe methodologies to handle multi-feature datasets (i.e., feature edges and surfaces). Coupling multi-feature information with multiblock meshing techniques has enabled anatomic structures, as well as orthopaedic implants, to be readily meshed. Moreover, the projection process, node and element set creation are automated, thus reducing the user interaction during model development. To improve the mesh quality, Laplacian- and optimization-based mesh improvement algorithms have been adapted to the multi-feature datasets. PMID:21076650
The generation of hexahedral meshes for assembly geometries: A survey
TAUTGES,TIMOTHY J.
2000-02-14
The finite element method is being used today to model component assemblies in a wide variety of application areas, including structural mechanics, fluid simulations, and others. Generating hexahedral meshes for these assemblies usually requires the use of geometry decomposition, with different meshing algorithms applied to different regions. While the primary motivation for this approach remains the lack of an automatic, reliable all-hexahedral meshing algorithm, requirements in mesh quality and mesh configuration for typical analyses are also factors. For these reasons, this approach is also sometimes required when producing other types of unstructured meshes. This paper will review progress to date in automating many parts of the hex meshing process, which has halved the time to produce all-hex meshes for large assemblies. Particular issues which have been exposed due to this progress will also be discussed, along with their applicability to the general unstructured meshing problem.
Cardiovascular and lung mesh generation based on centerlines.
Marchandise, E; Geuzaine, C; Remacle, J F
2013-06-01
We present a fully automatic procedure for the mesh generation of tubular geometries such as blood vessels or airways. The procedure is implemented in the open-source Gmsh software and relies on a centerline description of the input geometry. The presented method can generate different type of meshes: isotropic tetrahedral meshes, anisotropic tetrahedral meshes, and mixed hexahedral/tetrahedral meshes. Additionally, a multiple layered arterial wall can be generated with a variable thickness. All the generated meshes rely on a mesh size field and a mesh metric that is based on centerline descriptions, namely the distance to the centerlines and a local reference system based on the tangent and the normal directions to the centerlines. Different examples show that the proposed method is very efficient and robust and leads to high quality computational meshes. PMID:23606344
Removal of line artifacts on mesh boundary in computer generated hologram by mesh phase matching.
Park, Jae-Hyeung; Yeom, Han-Ju; Kim, Hee-Jae; Zhang, HuiJun; Li, BoNi; Ji, Yeong-Min; Kim, Sang-Hoo
2015-03-23
Mesh-based computer generated hologram enables realistic and efficient representation of three-dimensional scene. However, the dark line artifacts on the boundary between neighboring meshes are frequently observed, degrading the quality of the reconstruction. In this paper, we propose a simple technique to remove the dark line artifacts by matching the phase on the boundary of neighboring meshes. The feasibility of the proposed method is confirmed by the numerical and optical reconstruction of the generated hologram. PMID:25837138
Energy Science and Technology Software Center (ESTSC)
2007-02-02
The CMG is a small, lightweight, structured mesh generation code. It features a simple text input parser that allows setup of various meshes via a small set of text commands. Mesh generation data can be output to text, the silo file format, or the API can be directly queried by applications. It can run serially or in parallel via MPI. The CMG includes the ability to specify varius initial conditions on a mesh via meshmore » tags.« less
Christon, M.; Hardin, D.; Compton, J.; Zosel, M.
1994-08-29
Building complex meshes for large-scale numerical simulations presents immense difficulties in exploiting high-performance computers. Industry and research leaders will describe the current state of the art for generating meshes for such large scientific problems. This will be followed by a panel and general audience discussion of the algorithmic and architectural issues surrounding the generation of meshes with10{sup 7} to 10{sup 9} grid points. (Note: The terms ``mesh`` and ``grid`` are used interchangeably in the literature.)
Kim, D; Kang, S; Kim, T; Suh, T; Kim, S
2014-06-01
Purpose: In this paper, we implemented the four-dimensional (4D) digital tomosynthesis (DTS) imaging based on algebraic image reconstruction technique and total-variation minimization method in order to compensate the undersampled projection data and improve the image quality. Methods: The projection data were acquired as supposed the cone-beam computed tomography system in linear accelerator by the Monte Carlo simulation and the in-house 4D digital phantom generation program. We performed 4D DTS based upon simultaneous algebraic reconstruction technique (SART) among the iterative image reconstruction technique and total-variation minimization method (TVMM). To verify the effectiveness of this reconstruction algorithm, we performed systematic simulation studies to investigate the imaging performance. Results: The 4D DTS algorithm based upon the SART and TVMM seems to give better results than that based upon the existing method, or filtered-backprojection. Conclusion: The advanced image reconstruction algorithm for the 4D DTS would be useful to validate each intra-fraction motion during radiation therapy. In addition, it will be possible to give advantage to real-time imaging for the adaptive radiation therapy. This research was supported by Leading Foreign Research Institute Recruitment Program (Grant No.2009-00420) and Basic Atomic Energy Research Institute (BAERI); (Grant No. 2009-0078390) through the National Research Foundation of Korea(NRF) funded by the Ministry of Science, ICT and Future Planning (MSIP)
Low-dispersion meshes for scattering problems
Hakula, H.
1996-12-31
For scattering problems, e.g. the Helmholtz equation, the ideal mesh in 2D is a structured mesh of equilateral triangles, since the numerical dispersion and internal reflections caused by the mesh are then minimal. However, if the scattering body does not conform to the mesh, one has to add unstructured elements to the mesh. In this paper we describe a simple modification to the Rebay`s method which leads to meshes of high quality in the context of the application. Even though the Rebay`s method is a variant of Delaunay algorithms, it does include the concept of a front. By controlling the generation of fronts in the mesh we can always choose the outer boundary of the computational domain so that the mesh will be structured far from the scattering body and the only anisotropic elements are close to the body. As a result of this, one can use the same generator both for electromagnetic and flow simulations in 2D. In multi-body configurations the meshes are intimately dependent on the relative distances between the bodies.
Choosing corners of rectangles for mapped meshing
Mitchell, S.A.
1996-12-16
Consider mapping a regular i x j quadrilateral mesh of a rectangle onto a surface. The quality of the mapped mesh of the surface depends heavily on which vertices of the surface correspond to corners of the rectangle. The authors problem is, given an n-sided surface, chose as corners four vertices such that the surface resembles a rectangle with corners at those vertices. Note that n could be quite large, and the length and width of the rectangle, i and j, are not prespecified. In general, there is either a goal number or a prescribed number of mesh edges for each bounding curve of the surface. The goals affect the quality of the mesh, and the prescribed edges may make finding a feasible set of corners difficult. The algorithm need only work for surfaces that are roughly rectangular, particular those without large reflex angles, as otherwise an unstructured meshing algorithm is used instead. The authors report on the theory and implementation of algorithms for this problem. They also given an overview of a solution to a related problem called interval assignment: given a complex of surfaces sharing curves, globally assign the number of mesh edges or intervals for each curve such that it is possible to mesh each surface according to its prescribed quadrilateral meshing algorithm, and assigned and user-prescribed boundary mesh edges and corners. They also note a practical, constructive technique that relies on interval assignment that can generate a quadrilateral mesh of a complex of surfaces such that a compatible hexahedral mesh of the enclosed volume exists.
Dynamic mesh adaption for triangular and tetrahedral grids
NASA Technical Reports Server (NTRS)
Biswas, Rupak; Strawn, Roger
1993-01-01
The following topics are discussed: requirements for dynamic mesh adaption; linked-list data structure; edge-based data structure; adaptive-grid data structure; three types of element subdivision; mesh refinement; mesh coarsening; additional constraints for coarsening; anisotropic error indicator for edges; unstructured-grid Euler solver; inviscid 3-D wing; and mesh quality for solution-adaptive grids. The discussion is presented in viewgraph form.
An Interpreted Language and System for the Visualization of Unstructured Meshes
NASA Technical Reports Server (NTRS)
Moran, Patrick J.; Gerald-Yamasaki, Michael (Technical Monitor)
1998-01-01
We present an interpreted language and system supporting the visualization of unstructured meshes and the manipulation of shapes defined in terms of mesh subsets. The language features primitives inspired by geometric modeling, mathematical morphology and algebraic topology. The adaptation of the topology ideas to an interpreted environment, along with support for programming constructs such, as user function definition, provide a flexible system for analyzing a mesh and for calculating with shapes defined in terms of the mesh. We present results demonstrating some of the capabilities of the language, based on an implementation called the Shape Calculator, for tetrahedral meshes in R^3.
Turbulent flow calculations using unstructured and adaptive meshes
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1990-01-01
A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow-field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of flow-field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with experimental data.
A Triangle Mesh Standardization Method Based on Particle Swarm Optimization
Duan, Liming; Bai, Yang; Wang, Haoyu; Shao, Hui; Zhong, Siyang
2016-01-01
To enhance the triangle quality of a reconstructed triangle mesh, a novel triangle mesh standardization method based on particle swarm optimization (PSO) is proposed. First, each vertex of the mesh and its first order vertices are fitted to a cubic curve surface by using least square method. Additionally, based on the condition that the local fitted surface is the searching region of PSO and the best average quality of the local triangles is the goal, the vertex position of the mesh is regulated. Finally, the threshold of the normal angle between the original vertex and regulated vertex is used to determine whether the vertex needs to be adjusted to preserve the detailed features of the mesh. Compared with existing methods, experimental results show that the proposed method can effectively improve the triangle quality of the mesh while preserving the geometric features and details of the original mesh. PMID:27509129
A Generic Mesh Data Structure with Parallel Applications
ERIC Educational Resources Information Center
Cochran, William Kenneth, Jr.
2009-01-01
High performance, massively-parallel multi-physics simulations are built on efficient mesh data structures. Most data structures are designed from the bottom up, focusing on the implementation of linear algebra routines. In this thesis, we explore a top-down approach to design, evaluating the various needs of many aspects of simulation, not just…
Mesh deformation based on artificial neural networks
NASA Astrophysics Data System (ADS)
Stadler, Domen; Kosel, Franc; Čelič, Damjan; Lipej, Andrej
2011-09-01
In the article a new mesh deformation algorithm based on artificial neural networks is introduced. This method is a point-to-point method, meaning that it does not use connectivity information for calculation of the mesh deformation. Two already known point-to-point methods, based on interpolation techniques, are also presented. In contrast to the two known interpolation methods, the new method does not require a summation over all boundary nodes for one displacement calculation. The consequence of this fact is a shorter computational time of mesh deformation, which is proven by different deformation tests. The quality of the deformed meshes with all three deformation methods was also compared. Finally, the generated and the deformed three-dimensional meshes were used in the computational fluid dynamics numerical analysis of a Francis water turbine. A comparison of the analysis results was made to prove the applicability of the new method in every day computation.
KNUPP,PATRICK; MITCHELL,SCOTT A.
1999-11-01
In an attempt to automatically produce high-quality all-hex meshes, we investigated a mesh improvement strategy: given an initial poor-quality all-hex mesh, we iteratively changed the element connectivity, adding and deleting elements and nodes, and optimized the node positions. We found a set of hex reconnection primitives. We improved the optimization algorithms so they can untangle a negative-Jacobian mesh, even considering Jacobians on the boundary, and subsequently optimize the condition number of elements in an untangled mesh. However, even after applying both the primitives and optimization we were unable to produce high-quality meshes in certain regions. Our experiences suggest that many boundary configurations of quadrilaterals admit no hexahedral mesh with positive Jacobians, although we have no proof of this.
Twisted Quantum Toroidal Algebras
NASA Astrophysics Data System (ADS)
Jing, Naihuan; Liu, Rongjia
2014-09-01
We construct a principally graded quantum loop algebra for the Kac-Moody algebra. As a special case a twisted analog of the quantum toroidal algebra is obtained together with the quantum Serre relations.
Algebraic vs physical N = 6 3-algebras
Cantarini, Nicoletta; Kac, Victor G.
2014-01-15
In our previous paper, we classified linearly compact algebraic simple N = 6 3-algebras. In the present paper, we classify their “physical” counterparts, which actually appear in the N = 6 supersymmetric 3-dimensional Chern-Simons theories.
Energy Science and Technology Software Center (ESTSC)
2008-01-01
Parallel Heterogeneous Dynamic unstructured Mesh (phdMesh) data structure library and integration testing code that performs dynamic load balancing of the data structure and parallel geometric proximity search on a contrived test problem. The phdMesh library is intended to be module within a finite element or finite volume library or code. The integration testing code is intended to provide a compact and highly portable performance evaluation code for parallel computing systems.
Automated hexahedral meshing of anatomic structures using deformable registration.
Grosland, Nicole M; Bafna, Ritesh; Magnotta, Vincent A
2009-02-01
This work introduces a novel method of automating the process of patient-specific finite element (FE) model development using a mapped mesh technique. The objective is to map a predefined mesh (template) of high quality directly onto a new bony surface (target) definition, thereby yielding a similar mesh with minimal user interaction. To bring the template mesh into correspondence with the target surface, a deformable registration technique based on the FE method has been adopted. The procedure has been made hierarchical allowing several levels of mesh refinement to be used, thus reducing the time required to achieve a solution. Our initial efforts have focused on the phalanx bones of the human hand. Mesh quality metrics, such as element volume and distortion were evaluated. Furthermore, the distance between the target surface and the final mapped mesh were measured. The results have satisfactorily proven the applicability of the proposed method. PMID:18688764
NASA Technical Reports Server (NTRS)
Savage, M.; Caldwell, R. J.; Wisor, G. D.; Lewicki, D. G.
1986-01-01
A computer model has been constructed to simulate the compliance and load sharing in a spur gear mesh. The model adds the effect of rim deflections to previously developed state-of-the-art gear tooth deflection models. The effects of deflections on mesh compliance and load sharing are examined. The model can treat gear meshes composed to two external gears or an external gear driving an internal gear. The model includes deflection contributions from the bending and shear in the teeth, the Hertzian contact deformations, and primary and secondary rotations of the gear rims. The model shows that rimmed gears increase mesh compliance and, in some cases, improve load sharing.
NASA Technical Reports Server (NTRS)
Savage, M.; Caldwell, R. J.; Wisor, G. D.; Lewicki, D. G.
1987-01-01
A computer model has been constructed to simulate the compliance and load sharing in a spur gear mesh. The model adds the effect of rim deflections to previously developed state-of-the-art gear tooth deflection models. The effects of deflections on mesh compliance and load sharing are examined. The model can treat gear meshes composed of two external gears or an external gear driving an internal gear. The model includes deflection contributions from the bending and shear in the teeth, the Hertzian contact deformations, and primary and secondary rotations of the gear rims. The model shows that rimmed gears increase mesh compliance and, in some cases, improve load sharing.
A finite-element mesh generator based on growing neural networks.
Triantafyllidis, D G; Labridis, D P
2002-01-01
A mesh generator for the production of high-quality finite-element meshes is being proposed. The mesh generator uses an artificial neural network, which grows during the training process in order to adapt itself to a prespecified probability distribution. The initial mesh is a constrained Delaunay triangulation of the domain to be triangulated. Two new algorithms to accelerate the location of the best matching unit are introduced. The mesh generator has been found able to produce meshes of high quality in a number of classic cases examined and is highly suited for problems where the mesh density vector can be calculated in advance. PMID:18244543
A new Rayleigh quotient minimization algorithm based on algebraic multigrid.
Lehoucq, Richard B.; Hetmaniuk, Ulrich L.
2005-01-01
Mandel and McCormick [2] introduced the RQMG method, which approximately minimizes the Rayleigh quotient over a sequence of grids. In this talk, we will present an algebraic extension. We replace the geometric mesh information with the algebraic information defined by an AMG preconditioner. At each level, we improve the smoother to accelerate the convergence. With a series of numerical experiments, we assess the efficiency of this new algorithm to compute several eigenpairs.
Parallel adaptive mesh refinement within the PUMAA3D Project
NASA Technical Reports Server (NTRS)
Freitag, Lori; Jones, Mark; Plassmann, Paul
1995-01-01
To enable the solution of large-scale applications on distributed memory architectures, we are designing and implementing parallel algorithms for the fundamental tasks of unstructured mesh computation. In this paper, we discuss efficient algorithms developed for two of these tasks: parallel adaptive mesh refinement and mesh partitioning. The algorithms are discussed in the context of two-dimensional finite element solution on triangular meshes, but are suitable for use with a variety of element types and with h- or p-refinement. Results demonstrating the scalability and efficiency of the refinement algorithm and the quality of the mesh partitioning are presented for several test problems on the Intel DELTA.
ERIC Educational Resources Information Center
National Council of Teachers of Mathematics, Inc., Reston, VA.
This is a reprint of the historical capsules dealing with algebra from the 31st Yearbook of NCTM,"Historical Topics for the Mathematics Classroom." Included are such themes as the change from a geometric to an algebraic solution of problems, the development of algebraic symbolism, the algebraic contributions of different countries, the origin and…
MEDICAL SUBJECTS HEADING (MESH)
MeSH is the National Library of Medicine's controlled vocabulary thesaurus. It consists of sets of terms naming descriptors in a hierarchical structure that permits searching at various levels of specificity. MeSH descriptors are arranged in both an alphabetic and a hierarchical ...
Figueroa-O'Farrill, Jose Miguel
2009-11-15
We phrase deformations of n-Leibniz algebras in terms of the cohomology theory of the associated Leibniz algebra. We do the same for n-Lie algebras and for the metric versions of n-Leibniz and n-Lie algebras. We place particular emphasis on the case of n=3 and explore the deformations of 3-algebras of relevance to three-dimensional superconformal Chern-Simons theories with matter.
Quantum cluster algebras and quantum nilpotent algebras
Goodearl, Kenneth R.; Yakimov, Milen T.
2014-01-01
A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197
Lattice Cleaving: A Multimaterial Tetrahedral Meshing Algorithm with Guarantees
Bronson, Jonathan; Levine, Joshua A.; Whitaker, Ross
2014-01-01
We introduce a new algorithm for generating tetrahedral meshes that conform to physical boundaries in volumetric domains consisting of multiple materials. The proposed method allows for an arbitrary number of materials, produces high-quality tetrahedral meshes with upper and lower bounds on dihedral angles, and guarantees geometric fidelity. Moreover, the method is combinatoric so its implementation enables rapid mesh construction. These meshes are structured in a way that also allows grading, to reduce element counts in regions of homogeneity. Additionally, we provide proofs showing that both element quality and geometric fidelity are bounded using this approach. PMID:24356365
A parallel algorithm for mesh smoothing
Freitag, L.; Jones, M.; Plassmann, P.
1999-07-01
Maintaining good mesh quality during the generation and refinement of unstructured meshes in finite-element applications is an important aspect in obtaining accurate discretizations and well-conditioned linear systems. In this article, the authors present a mesh-smoothing algorithm based on nonsmooth optimization techniques and a scalable implementation of this algorithm. They prove that the parallel algorithm has a provably fast runtime bound and executes correctly for a parallel random access machine (PRAM) computational model. They extend the PRAM algorithm to distributed memory computers and report results for two-and three-dimensional simplicial meshes that demonstrate the efficiency and scalability of this approach for a number of different test cases. They also examine the effect of different architectures on the parallel algorithm and present results for the IBM SP supercomputer and an ATM-connected network of SPARC Ultras.
Structured adaptive grid generation using algebraic methods
NASA Technical Reports Server (NTRS)
Yang, Jiann-Cherng; Soni, Bharat K.; Roger, R. P.; Chan, Stephen C.
1993-01-01
The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration
Performance of a streaming mesh refinement algorithm.
Thompson, David C.; Pebay, Philippe Pierre
2004-08-01
In SAND report 2004-1617, we outline a method for edge-based tetrahedral subdivision that does not rely on saving state or communication to produce compatible tetrahedralizations. This report analyzes the performance of the technique by characterizing (a) mesh quality, (b) execution time, and (c) traits of the algorithm that could affect quality or execution time differently for different meshes. It also details the method used to debug the several hundred subdivision templates that the algorithm relies upon. Mesh quality is on par with other similar refinement schemes and throughput on modern hardware can exceed 600,000 output tetrahedra per second. But if you want to understand the traits of the algorithm, you have to read the report!
NASA Technical Reports Server (NTRS)
Malek, Miroslaw; Ozden, Banu
1990-01-01
Efficient testing techniques for two-dimensional mesh interconnection networks are presented. The tests cover faults in the arbitration logic of the switches; this includes an examination of fault detection in the data paths, routing, and control circuitry, including the conflict resolution capabilities of mesh interconnection networks using topological test methods. The proposed methods are not implementation specific and can be applied to any design with a mesh topology. The topology and behavior of the network are described and definitions are presented. The fault model is defined and parallel testing methods for the entire network are given.
Mesh implants: An overview of crucial mesh parameters
Zhu, Lei-Ming; Schuster, Philipp; Klinge, Uwe
2015-01-01
Hernia repair is one of the most frequently performed surgical interventions that use mesh implants. This article evaluates crucial mesh parameters to facilitate selection of the most appropriate mesh implant, considering raw materials, mesh composition, structure parameters and mechanical parameters. A literature review was performed using the PubMed database. The most important mesh parameters in the selection of a mesh implant are the raw material, structural parameters and mechanical parameters, which should match the physiological conditions. The structural parameters, especially the porosity, are the most important predictors of the biocompatibility performance of synthetic meshes. Meshes with large pores exhibit less inflammatory infiltrate, connective tissue and scar bridging, which allows increased soft tissue ingrowth. The raw material and combination of raw materials of the used mesh, including potential coatings and textile design, strongly impact the inflammatory reaction to the mesh. Synthetic meshes made from innovative polymers combined with surface coating have been demonstrated to exhibit advantageous behavior in specialized fields. Monofilament, large-pore synthetic meshes exhibit advantages. The value of mesh classification based on mesh weight seems to be overestimated. Mechanical properties of meshes, such as anisotropy/isotropy, elasticity and tensile strength, are crucial parameters for predicting mesh performance after implantation. PMID:26523210
Urogynecologic Surgical Mesh Implants
... Boston Scientific's urogynecologic surgical mesh may contain counterfeit raw material. We are examining these allegations to determine any ... are currently not aware that the alleged counterfeit raw material contributes to adverse events associated with these products. ...
A comparison of mesh morphing methods for shape optimization.
Staten, Matthew L.; Owen, Steven James
2010-08-01
The ability to automatically morph an existing mesh to conform to geometry modifications is a necessary capability to enable rapid prototyping of design variations. This paper compares six methods for morphing hexahedral and tetrahedral meshes, including the previously published FEMWARP and LBWARP methods as well as four new methods. Element quality and performance results show that different methods are superior on different models. We recommend that designers of applications that use mesh morphing consider both the FEMWARP and a linear simplex based method.
Blacker, Teddy Dean; Staten, Matthew L.; Kerr, Robert A.; Owen, Steven James
2010-03-01
The generation of all-hexahedral finite element meshes has been an area of ongoing research for the past two decades and remains an open problem. Unconstrained plastering is a new method for generating all-hexahedral finite element meshes on arbitrary volumetric geometries. Starting from an unmeshed volume boundary, unconstrained plastering generates the interior mesh topology without the constraints of a pre-defined boundary mesh. Using advancing fronts, unconstrained plastering forms partially defined hexahedral dual sheets by decomposing the geometry into simple shapes, each of which can be meshed with simple meshing primitives. By breaking from the tradition of previous advancing-front algorithms, which start from pre-meshed boundary surfaces, unconstrained plastering demonstrates that for the tested geometries, high quality, boundary aligned, orientation insensitive, all-hexahedral meshes can be generated automatically without pre-meshing the boundary. Examples are given for meshes from both solid mechanics and geotechnical applications.
Airplane Mesh Development with Grid Density Studies
NASA Technical Reports Server (NTRS)
Cliff, Susan E.; Baker, Timothy J.; Thomas, Scott D.; Lawrence, Scott L.; Rimlinger, Mark J.
1999-01-01
Automatic Grid Generation Wish List Geometry handling, including CAD clean up and mesh generation, remains a major bottleneck in the application of CFD methods. There is a pressing need for greater automation in several aspects of the geometry preparation in order to reduce set up time and eliminate user intervention as much as possible. Starting from the CAD representation of a configuration, there may be holes or overlapping surfaces which require an intensive effort to establish cleanly abutting surface patches, and collections of many patches may need to be combined for more efficient use of the geometrical representation. Obtaining an accurate and suitable body conforming grid with an adequate distribution of points throughout the flow-field, for the flow conditions of interest, is often the most time consuming task for complex CFD applications. There is a need for a clean unambiguous definition of the CAD geometry. Ideally this would be carried out automatically by smart CAD clean up software. One could also define a standard piece-wise smooth surface representation suitable for use by computational methods and then create software to translate between the various CAD descriptions and the standard representation. Surface meshing remains a time consuming, user intensive procedure. There is a need for automated surface meshing, requiring only minimal user intervention to define the overall density of mesh points. The surface mesher should produce well shaped elements (triangles or quadrilaterals) whose size is determined initially according to the surface curvature with a minimum size for flat pieces, and later refined by the user in other regions if necessary. Present techniques for volume meshing all require some degree of user intervention. There is a need for fully automated and reliable volume mesh generation. In addition, it should be possible to create both surface and volume meshes that meet guaranteed measures of mesh quality (e.g. minimum and maximum
Learning Algebra in a Computer Algebra Environment
ERIC Educational Resources Information Center
Drijvers, Paul
2004-01-01
This article summarises a doctoral thesis entitled "Learning algebra in a computer algebra environment, design research on the understanding of the concept of parameter" (Drijvers, 2003). It describes the research questions, the theoretical framework, the methodology and the results of the study. The focus of the study is on the understanding of…
Realizations of Galilei algebras
NASA Astrophysics Data System (ADS)
Nesterenko, Maryna; Pošta, Severin; Vaneeva, Olena
2016-03-01
All inequivalent realizations of the Galilei algebras of dimensions not greater than five are constructed using the algebraic approach proposed by Shirokov. The varieties of the deformed Galilei algebras are discussed and families of one-parametric deformations are presented in explicit form. It is also shown that a number of well-known and physically interesting equations and systems are invariant with respect to the considered Galilei algebras or their deformations.
Unstructured mesh generation and adaptivity
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1995-01-01
An overview of current unstructured mesh generation and adaptivity techniques is given. Basic building blocks taken from the field of computational geometry are first described. Various practical mesh generation techniques based on these algorithms are then constructed and illustrated with examples. Issues of adaptive meshing and stretched mesh generation for anisotropic problems are treated in subsequent sections. The presentation is organized in an education manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.
NASA Technical Reports Server (NTRS)
Iachello, Franco
1995-01-01
An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.
Orientation in operator algebras
Alfsen, Erik M.; Shultz, Frederic W.
1998-01-01
A concept of orientation is relevant for the passage from Jordan structure to associative structure in operator algebras. The research reported in this paper bridges the approach of Connes for von Neumann algebras and ourselves for C*-algebras in a general theory of orientation that is of geometric nature and is related to dynamics. PMID:9618457
Developing Thinking in Algebra
ERIC Educational Resources Information Center
Mason, John; Graham, Alan; Johnson-Wilder, Sue
2005-01-01
This book is for people with an interest in algebra whether as a learner, or as a teacher, or perhaps as both. It is concerned with the "big ideas" of algebra and what it is to understand the process of thinking algebraically. The book has been structured according to a number of pedagogic principles that are exposed and discussed along the way,…
Connecting Arithmetic to Algebra
ERIC Educational Resources Information Center
Darley, Joy W.; Leapard, Barbara B.
2010-01-01
Algebraic thinking is a top priority in mathematics classrooms today. Because elementary school teachers lay the groundwork to develop students' capacity to think algebraically, it is crucial for teachers to have a conceptual understanding of the connections between arithmetic and algebra and be confident in communicating these connections. Many…
Applied Algebra Curriculum Modules.
ERIC Educational Resources Information Center
Texas State Technical Coll., Marshall.
This collection of 11 applied algebra curriculum modules can be used independently as supplemental modules for an existing algebra curriculum. They represent diverse curriculum styles that should stimulate the teacher's creativity to adapt them to other algebra concepts. The selected topics have been determined to be those most needed by students…
Profiles of Algebraic Competence
ERIC Educational Resources Information Center
Humberstone, J.; Reeve, R.A.
2008-01-01
The algebraic competence of 72 12-year-old female students was examined to identify profiles of understanding reflecting different algebraic knowledge states. Beginning algebraic competence (mapping abilities: word-to-symbol and vice versa, classifying, and solving equations) was assessed. One week later, the nature of assistance required to map…
Ternary Virasoro - Witt algebra.
Zachos, C.; Curtright, T.; Fairlie, D.; High Energy Physics; Univ. of Miami; Univ. of Durham
2008-01-01
A 3-bracket variant of the Virasoro-Witt algebra is constructed through the use of su(1,1) enveloping algebra techniques. The Leibniz rules for 3-brackets acting on other 3-brackets in the algebra are discussed and verified in various situations.
Feature-preserving surface mesh smoothing via suboptimal Delaunay triangulation.
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2013-01-01
A method of triangular surface mesh smoothing is presented to improve angle quality by extending the original optimal Delaunay triangulation (ODT) to surface meshes. The mesh quality is improved by solving a quadratic optimization problem that minimizes the approximated interpolation error between a parabolic function and its piecewise linear interpolation defined on the mesh. A suboptimal problem is derived to guarantee a unique, analytic solution that is significantly faster with little loss in accuracy as compared to the optimal one. In addition to the quality-improving capability, the proposed method has been adapted to remove noise while faithfully preserving sharp features such as edges and corners of a mesh. Numerous experiments are included to demonstrate the performance of the method. PMID:23580890
Franssen, Frits; van Andel, Esther; Swart, Arno; van der Giessen, Joke
2016-02-01
The performance of a 400-μm-mesh-size sieve (sieve400) has not previously been compared with that of a 180-μm-mesh-size sieve (sieve180). Using pork samples spiked with 0 to 10 Trichinella muscle larvae and an artificial digestion method, sieve performance was evaluated for control of Trichinella in meat-producing animals. The use of a sieve400 resulted in 12% lower larval counts, 147% more debris, and 28% longer counting times compared with the use of a sieve180. Although no false-negative results were obtained, prolonged counting times with the sieve400 may have an impact on performance in a high-throughput environment such as a slaughterhouse laboratory. Based on our results, the sieve180 remains the sieve of choice for Trichinella control in meat in slaughterhouse laboratories, according to the European Union reference method (European Commission regulation 2075/2005). Furthermore, the results of the present study contribute to the discussion of harmonization of meat inspection requirements among countries. PMID:26818995
CAD and mesh repair with Radial Basis Functions
NASA Astrophysics Data System (ADS)
Marchandise, E.; Piret, C.; Remacle, J.-F.
2012-03-01
In this paper we present a process that includes both model/mesh repair and mesh generation. The repair algorithm is based on an initial mesh that may be either an initial mesh of a dirty CAD model or STL triangulation with many errors such as gaps, overlaps and T-junctions. This initial mesh is then remeshed by computing a discrete parametrization with Radial Basis Functions (RBF's). We showed in [1] that a discrete parametrization can be computed by solving Partial Differential Equations (PDE's) on an initial correct mesh using finite elements. Paradoxically, the meshless character of the RBF's makes it an attractive numerical method for solving the PDE's for the parametrization in the case where the initial mesh contains errors or holes. In this work, we implement the Orthogonal Gradients method to be described in [2], as a RBF solution method for solving PDE's on arbitrary surfaces. Different examples show that the presented method is able to deal with errors such as gaps, overlaps, T-junctions and that the resulting meshes are of high quality. Moreover, the presented algorithm can be used as a hole-filling algorithm to repair meshes with undesirable holes. The overall procedure is implemented in the open-source mesh generator Gmsh [3].
Computer algebra and operators
NASA Technical Reports Server (NTRS)
Fateman, Richard; Grossman, Robert
1989-01-01
The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.
NASA Astrophysics Data System (ADS)
Gill, Stuart P. D.; Knebe, Alexander; Gibson, Brad K.; Flynn, Chris; Ibata, Rodrigo A.; Lewis, Geraint F.
2003-04-01
An adaptive multi grid approach to simulating the formation of structure from collisionless dark matter is described. MLAPM (Multi-Level Adaptive Particle Mesh) is one of the most efficient serial codes available on the cosmological "market" today. As part of Swinburne University's role in the development of the Square Kilometer Array, we are implementing hydrodynamics, feedback, and radiative transfer within the MLAPM adaptive mesh, in order to simulate baryonic processes relevant to the interstellar and intergalactic media at high redshift. We will outline our progress to date in applying the existing MLAPM to a study of the decay of satellite galaxies within massive host potentials.
Documentation for MeshKit - Reactor Geometry (&mesh) Generator
Jain, Rajeev; Mahadevan, Vijay
2015-09-30
This report gives documentation for using MeshKit’s Reactor Geometry (and mesh) Generator (RGG) GUI and also briefly documents other algorithms and tools available in MeshKit. RGG is a program designed to aid in modeling and meshing of complex/large hexagonal and rectilinear reactor cores. RGG uses Argonne’s SIGMA interfaces, Qt and VTK to produce an intuitive user interface. By integrating a 3D view of the reactor with the meshing tools and combining them into one user interface, RGG streamlines the task of preparing a simulation mesh and enables real-time feedback that reduces accidental scripting mistakes that could waste hours of meshing. RGG interfaces with MeshKit tools to consolidate the meshing process, meaning that going from model to mesh is as easy as a button click. This report is designed to explain RGG v 2.0 interface and provide users with the knowledge and skills to pilot RGG successfully. Brief documentation of MeshKit source code, tools and other algorithms available are also presented for developers to extend and add new algorithms to MeshKit. RGG tools work in serial and parallel and have been used to model complex reactor core models consisting of conical pins, load pads, several thousands of axially varying material properties of instrumentation pins and other interstices meshes.
Geometric approaches to mesh generation
Hoffmann, C.M.
1995-12-31
We review three approaches to mesh generation that axe based on analyzing and accounting for the geometric structure of the domain. In the first approach, due to Armstrong, the domain is partitioned into subdomains based on the medial-axis transform, a tool for analyzing spatial structures. In the second approach, due to Cox, the design history defines a geometric structure of the domain. The design primitives of that structure are meshed separately, and mesh overlap is accounted for by coupling equations. The third approach argues that mesh generation ought to be integrated into the shape design process, by meshing design features separately and resolving overlapping meshes by standard geometric computations.
Curved mesh generation and mesh refinement using Lagrangian solid mechanics
Persson, P.-O.; Peraire, J.
2008-12-31
We propose a method for generating well-shaped curved unstructured meshes using a nonlinear elasticity analogy. The geometry of the domain to be meshed is represented as an elastic solid. The undeformed geometry is the initial mesh of linear triangular or tetrahedral elements. The external loading results from prescribing a boundary displacement to be that of the curved geometry, and the final configuration is determined by solving for the equilibrium configuration. The deformations are represented using piecewise polynomials within each element of the original mesh. When the mesh is sufficiently fine to resolve the solid deformation, this method guarantees non-intersecting elements even for highly distorted or anisotropic initial meshes. We describe the method and the solution procedures, and we show a number of examples of two and three dimensional simplex meshes with curved boundaries. We also demonstrate how to use the technique for local refinement of non-curved meshes in the presence of curved boundaries.
Algebraic grid generation with corner singularities
NASA Technical Reports Server (NTRS)
Vinokur, M.; Lombard, C. K.
1983-01-01
A simple noniterative algebraic procedure is presented for generating smooth computational meshes on a quadrilateral topology. Coordinate distribution and normal derivative are provided on all boundaries, one of which may include a slope discontinuity. The boundary conditions are sufficient to guarantee continuity of global meshes formed of joined patches generated by the procedure. The method extends to 3-D. The procedure involves a synthesis of prior techniques stretching functions, cubic blending functions, and transfinite interpolation - to which is added the functional form of the corner solution. The procedure introduces the concept of generalized blending, which is implemented as an automatic scaling of the boundary derivatives for effective interpolation. Some implications of the treatment at boundaries for techniques solving elliptic PDE's are discussed in an Appendix.
Multigrid Methods for Mesh Relaxation
O'Brien, M J
2006-06-12
When generating a mesh for the initial conditions for a computer simulation, you want the mesh to be as smooth as possible. A common practice is to use equipotential mesh relaxation to smooth out a distorted computational mesh. Typically a Laplace-like equation is set up for the mesh coordinates and then one or more Jacobi iterations are performed to relax the mesh. As the zone count gets really large, the Jacobi iteration becomes less and less effective and we are stuck with our original unrelaxed mesh. This type of iteration can only damp high frequency errors and the smooth errors remain. When the zone count is large, almost everything looks smooth so relaxation cannot solve the problem. In this paper we examine a multigrid technique which effectively smooths out the mesh, independent of the number of zones.
Toward An Unstructured Mesh Database
NASA Astrophysics Data System (ADS)
Rezaei Mahdiraji, Alireza; Baumann, Peter Peter
2014-05-01
Unstructured meshes are used in several application domains such as earth sciences (e.g., seismology), medicine, oceanography, cli- mate modeling, GIS as approximate representations of physical objects. Meshes subdivide a domain into smaller geometric elements (called cells) which are glued together by incidence relationships. The subdivision of a domain allows computational manipulation of complicated physical structures. For instance, seismologists model earthquakes using elastic wave propagation solvers on hexahedral meshes. The hexahedral con- tains several hundred millions of grid points and millions of hexahedral cells. Each vertex node in the hexahedrals stores a multitude of data fields. To run simulation on such meshes, one needs to iterate over all the cells, iterate over incident cells to a given cell, retrieve coordinates of cells, assign data values to cells, etc. Although meshes are used in many application domains, to the best of our knowledge there is no database vendor that support unstructured mesh features. Currently, the main tool for querying and manipulating unstructured meshes are mesh libraries, e.g., CGAL and GRAL. Mesh li- braries are dedicated libraries which includes mesh algorithms and can be run on mesh representations. The libraries do not scale with dataset size, do not have declarative query language, and need deep C++ knowledge for query implementations. Furthermore, due to high coupling between the implementations and input file structure, the implementations are less reusable and costly to maintain. A dedicated mesh database offers the following advantages: 1) declarative querying, 2) ease of maintenance, 3) hiding mesh storage structure from applications, and 4) transparent query optimization. To design a mesh database, the first challenge is to define a suitable generic data model for unstructured meshes. We proposed ImG-Complexes data model as a generic topological mesh data model which extends incidence graph model to multi
Fast Dynamic Meshing Method Based on Delaunay Graph and Inverse Distance Weighting Interpolation
NASA Astrophysics Data System (ADS)
Wang, Yibin; Qin, Ning; Zhao, Ning
2016-06-01
A novel mesh deformation technique is developed based on the Delaunay graph mapping method and the inverse distance weighting (IDW) interpolation. The algorithm maintains the advantages of the efficiency of Delaunay-graph-mapping mesh deformation while possess the ability for better controlling the near surface mesh quality. The Delaunay graph is used to divide the mesh domain into a number of sub-domains. On each of the sub-domains, the inverse distance weighting interpolation is applied to build a much smaller sized translation matrix between the original mesh and the deformed mesh, resulting a similar efficiency for the mesh deformation as compared to the fast Delaunay graph mapping method. The paper will show how the near-wall mesh quality is controlled and improved by the new method while the computational time is compared with the original Delaunay graph mapping method.
A Richer Understanding of Algebra
ERIC Educational Resources Information Center
Foy, Michelle
2008-01-01
Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number, pre-algebra, and algebra…
Hexahedral mesh generation via the dual arrangement of surfaces
Mitchell, S.A.; Tautges, T.J.
1997-12-31
Given a general three-dimensional geometry with a prescribed quadrilateral surface mesh, the authors consider the problem of constructing a hexahedral mesh of the geometry whose boundary is exactly the prescribed surface mesh. Due to the specialized topology of hexahedra, this problem is more difficult than the analogous one for tetrahedra. Folklore has maintained that a surface mesh must have a constrained structure in order for there to exist a compatible hexahedral mesh. However, they have proof that a surface mesh need only satisfy mild parity conditions, depending on the topology of the three-dimensional geometry, for there to exist a compatible hexahedral mesh. The proof is based on the realization that a hexahedral mesh is dual to an arrangement of surfaces, and the quadrilateral surface mesh is dual to the arrangement of curves bounding these surfaces. The proof is constructive and they are currently developing an algorithm called Whisker Weaving (WW) that mirrors the proof steps. Given the bounding curves, WW builds the topological structure of an arrangement of surfaces having those curves as its boundary. WW progresses in an advancing front manner. Certain local rules are applied to avoid structures that lead to poor mesh quality. Also, after the arrangement is constructed, additional surfaces are inserted to separate features, so e.g., no two hexahedra share more than one quadrilateral face. The algorithm has generated meshes for certain non-trivial problems, but is currently unreliable. The authors are exploring strategies for consistently selecting which portion of the surface arrangement to advance based on the existence proof. This should lead us to a robust algorithm for arbitrary geometries and surface meshes.
Euler and Navier-Stokes computations for two-dimensional geometries using unstructured meshes
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1990-01-01
A general purpose unstructured mesh solver for steady-state two-dimensional inviscid and viscous flows is described. The efficiency and accuracy of the method are enhanced by the simultaneous use of adaptive meshing and an unstructured multigrid technique. A method for generating highly stretched triangulations in regions of viscous flow is outlined, and a procedure for implementing an algebraic turbulence model on unstructured meshes is described. Results are shown for external and internal inviscid flows and for turbulent viscous flow over a multi-element airfoil configuration.
Surgical mesh for ventral incisional hernia repairs: Understanding mesh design.
Rastegarpour, Ali; Cheung, Michael; Vardhan, Madhurima; Ibrahim, Mohamed M; Butler, Charles E; Levinson, Howard
2016-01-01
Surgical mesh has become an indispensable tool in hernia repair to improve outcomes and reduce costs; however, efforts are constantly being undertaken in mesh development to overcome postoperative complications. Common complications include infection, pain, adhesions, mesh extrusion and hernia recurrence. Reducing the complications of mesh implantation is of utmost importance given that hernias occur in hundreds of thousands of patients per year in the United States. In the present review, the authors present the different types of hernia meshes, discuss the key properties of mesh design, and demonstrate how each design element affects performance and complications. The present article will provide a basis for surgeons to understand which mesh to choose for patient care and why, and will explain the important technological aspects that will continue to evolve over the ensuing years. PMID:27054138
Connecting Algebra and Chemistry.
ERIC Educational Resources Information Center
O'Connor, Sean
2003-01-01
Correlates high school chemistry curriculum with high school algebra curriculum and makes the case for an integrated approach to mathematics and science instruction. Focuses on process integration. (DDR)
To mesh or not to mesh: a review of pelvic organ reconstructive surgery
Dällenbach, Patrick
2015-01-01
Pelvic organ prolapse (POP) is a major health issue with a lifetime risk of undergoing at least one surgical intervention estimated at close to 10%. In the 1990s, the risk of reoperation after primary standard vaginal procedure was estimated to be as high as 30% to 50%. In order to reduce the risk of relapse, gynecological surgeons started to use mesh implants in pelvic organ reconstructive surgery with the emergence of new complications. Recent studies have nevertheless shown that the risk of POP recurrence requiring reoperation is lower than previously estimated, being closer to 10% rather than 30%. The development of mesh surgery – actively promoted by the marketing industry – was tremendous during the past decade, and preceded any studies supporting its benefit for our patients. Randomized trials comparing the use of mesh to native tissue repair in POP surgery have now shown better anatomical but similar functional outcomes, and meshes are associated with more complications, in particular for transvaginal mesh implants. POP is not a life-threatening condition, but a functional problem that impairs quality of life for women. The old adage “primum non nocere” is particularly appropriate when dealing with this condition which requires no treatment when asymptomatic. It is currently admitted that a certain degree of POP is physiological with aging when situated above the landmark of the hymen. Treatment should be individualized and the use of mesh needs to be selective and appropriate. Mesh implants are probably an important tool in pelvic reconstructive surgery, but the ideal implant has yet to be found. The indications for its use still require caution and discernment. This review explores the reasons behind the introduction of mesh augmentation in POP surgery, and aims to clarify the risks, benefits, and the recognized indications for its use. PMID:25848324
Greg Flach, Frank Smith
2011-12-31
Mesh2d is a Fortran90 program designed to generate two-dimensional structured grids of the form [x(i),y(i,j)] where [x,y] are grid coordinates identified by indices (i,j). The x(i) coordinates alone can be used to specify a one-dimensional grid. Because the x-coordinates vary only with the i index, a two-dimensional grid is composed in part of straight vertical lines. However, the nominally horizontal y(i,j0) coordinates along index i are permitted to undulate or otherwise vary. Mesh2d also assigns an integer material type to each grid cell, mtyp(i,j), in a user-specified manner. The complete grid is specified through three separate input files defining the x(i), y(i,j), and mtyp(i,j) variations.
Energy Science and Technology Software Center (ESTSC)
2011-12-31
Mesh2d is a Fortran90 program designed to generate two-dimensional structured grids of the form [x(i),y(i,j)] where [x,y] are grid coordinates identified by indices (i,j). The x(i) coordinates alone can be used to specify a one-dimensional grid. Because the x-coordinates vary only with the i index, a two-dimensional grid is composed in part of straight vertical lines. However, the nominally horizontal y(i,j0) coordinates along index i are permitted to undulate or otherwise vary. Mesh2d also assignsmore » an integer material type to each grid cell, mtyp(i,j), in a user-specified manner. The complete grid is specified through three separate input files defining the x(i), y(i,j), and mtyp(i,j) variations.« less
SUPERIMPOSED MESH PLOTTING IN MCNP
J. HENDRICKS
2001-02-01
The capability to plot superimposed meshes has been added to MCNP{trademark}. MCNP4C featured a superimposed mesh weight window generator which enabled users to set up geometries without having to subdivide geometric cells for variance reduction. The variance reduction was performed with weight windows on a rectangular or cylindrical mesh superimposed over the physical geometry. Experience with the new capability was favorable but also indicated that a number of enhancements would be very beneficial, particularly a means of visualizing the mesh and its values. The mathematics for plotting the mesh and its values is described here along with a description of other upgrades.
NASA Technical Reports Server (NTRS)
Macneice, Peter
1995-01-01
This is an introduction to numerical Particle-Mesh techniques, which are commonly used to model plasmas, gravitational N-body systems, and both compressible and incompressible fluids. The theory behind this approach is presented, and its practical implementation, both for serial and parallel machines, is discussed. This document is based on a four-hour lecture course presented by the author at the NASA Summer School for High Performance Computational Physics, held at Goddard Space Flight Center.
Parallel Adaptive Mesh Refinement
Diachin, L; Hornung, R; Plassmann, P; WIssink, A
2005-03-04
As large-scale, parallel computers have become more widely available and numerical models and algorithms have advanced, the range of physical phenomena that can be simulated has expanded dramatically. Many important science and engineering problems exhibit solutions with localized behavior where highly-detailed salient features or large gradients appear in certain regions which are separated by much larger regions where the solution is smooth. Examples include chemically-reacting flows with radiative heat transfer, high Reynolds number flows interacting with solid objects, and combustion problems where the flame front is essentially a two-dimensional sheet occupying a small part of a three-dimensional domain. Modeling such problems numerically requires approximating the governing partial differential equations on a discrete domain, or grid. Grid spacing is an important factor in determining the accuracy and cost of a computation. A fine grid may be needed to resolve key local features while a much coarser grid may suffice elsewhere. Employing a fine grid everywhere may be inefficient at best and, at worst, may make an adequately resolved simulation impractical. Moreover, the location and resolution of fine grid required for an accurate solution is a dynamic property of a problem's transient features and may not be known a priori. Adaptive mesh refinement (AMR) is a technique that can be used with both structured and unstructured meshes to adjust local grid spacing dynamically to capture solution features with an appropriate degree of resolution. Thus, computational resources can be focused where and when they are needed most to efficiently achieve an accurate solution without incurring the cost of a globally-fine grid. Figure 1.1 shows two example computations using AMR; on the left is a structured mesh calculation of a impulsively-sheared contact surface and on the right is the fuselage and volume discretization of an RAH-66 Comanche helicopter [35]. Note the
Element Agglomeration Algebraic Multilevel Monte-Carlo Library
2015-02-19
ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizations of subsurface flow problems.
Element Agglomeration Algebraic Multilevel Monte-Carlo Library
Energy Science and Technology Software Center (ESTSC)
2015-02-19
ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizationsmore » of subsurface flow problems.« less
On Optimal Bilinear Quadrilateral Meshes
D'Azevedo, E.
1998-10-26
The novelty of this work is in presenting interesting error properties of two types of asymptotically optimal quadrilateral meshes for bilinear approximation. The first type of mesh has an error equidistributing property where the maximum interpolation error is asymptotically the same over all elements. The second type has faster than expected super-convergence property for certain saddle-shaped data functions. The super-convergent mesh may be an order of magnitude more accurate than the error equidistributing mesh. Both types of mesh are generated by a coordinate transformation of a regular mesh of squares. The coordinate transformation is derived by interpreting the Hessian matrix of a data function as a metric tensor. The insights in this work may have application in mesh design near known corner or point singularities.
On Optimal Bilinear Quadrilateral Meshes
D'Azevedo, E
2000-03-17
The novelty of this work is in presenting interesting error properties of two types of asymptotically ''optimal'' quadrilateral meshes for bilinear approximation. The first type of mesh has an error equidistributing property where the maximum interpolation error is asymptotically the same over all elements. The second type has faster than expected ''super-convergence'' property for certain saddle-shaped data functions. The ''superconvergent'' mesh may be an order of magnitude more accurate than the error equidistributing mesh. Both types of mesh are generated by a coordinate transformation of a regular mesh of squares. The coordinate transformation is derived by interpreting the Hessian matrix of a data function as a metric tensor. The insights in this work may have application in mesh design near corner or point singularities.
A novel three-dimensional mesh deformation method based on sphere relaxation
Zhou, Xuan; Li, Shuixiang
2015-10-01
In our previous work (2013) [19], we developed a disk relaxation based mesh deformation method for two-dimensional mesh deformation. In this paper, the idea of the disk relaxation is extended to the sphere relaxation for three-dimensional meshes with large deformations. We develop a node based pre-displacement procedure to apply initial movements on nodes according to their layer indices. Afterwards, the nodes are moved locally by the improved sphere relaxation algorithm to transfer boundary deformations and increase the mesh quality. A three-dimensional mesh smoothing method is also adopted to prevent the occurrence of the negative volume of elements, and further improve the mesh quality. Numerical applications in three-dimension including the wing rotation, bending beam and morphing aircraft are carried out. The results demonstrate that the sphere relaxation based approach generates the deformed mesh with high quality, especially regarding complex boundaries and large deformations.
Tetrahedral mesh improvement via optimization of the element condition number
FREITAG,LORI A.; KNUPP,PATRICK
2000-05-22
The authors present a new shape measure for tetrahedral elements that is optimal in that it gives the distance of a tetrahedron from the set of inverted elements. This measure is constructed from the condition number of the linear transformation between a unit equilateral tetrahedron and any tetrahedron with positive volume. Using this shape measure, they formulate two optimization objective functions that are differentiated by their goal: the first seeks to improve the average quality of the tetrahedral mesh; the second aims to improve the worst-quality element in the mesh. They review the optimization techniques used with each objective function and presents experimental results that demonstrate the effectiveness of the mesh improvement methods. They show that a combined optimization approach that uses both objective functions obtains the best-quality meshes for several complex geometries.
Mesh Algorithms for PDE with Sieve I: Mesh Distribution
Knepley, Matthew G.; Karpeev, Dmitry A.
2009-01-01
We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode notmore » only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.« less
Tautges, Timothy J.
2004-04-01
MOAB is a component for representing and evaluating mesh data. MOAB can store stuctured and unstructured mesh, consisting of elements in the finite element "zoo". The functional interface to MOAB is simple yet powerful, allowing the representation of many types of metadata commonly found on the mesh. MOAB is optimized for efficiency in space and time, based on access to mesh in chunks rather than through individual entities, while also versatile enough to support individual entity access. The MOAB data model consists of a mesh interface instance, mesh entities (vertices and elements), sets, and tags. Entities are addressed through handles rather than pointers, to allow the underlying representation of an entity to change without changing the handle to that entity. Sets are arbitrary groupings of mesh entities and other sets. Sets also support parent/child relationships as a relation distinct from sets containing other sets. The directed-graph provided by set parent/child relationships is useful for modeling topological relations from a geometric model or other metadata. Tags are named data which can be assigned to the mesh as a whole, individual entities, or sets. Tags are a mechanism for attaching data to individual entities and sets are a mechanism for describing relations between entities; the combination of these two mechanisms isa powerful yet simple interface for representing metadata or application-specific data. For example, sets and tags can be used together to describe geometric topology, boundary condition, and inter-processor interface groupings in a mesh. MOAB is used in several ways in various applications. MOAB serves as the underlying mesh data representation in the VERDE mesh verification code. MOAB can also be used as a mesh input mechanism, using mesh readers induded with MOAB, or as a tanslator between mesh formats, using readers and writers included with MOAB.
Energy Science and Technology Software Center (ESTSC)
2004-04-01
MOAB is a component for representing and evaluating mesh data. MOAB can store stuctured and unstructured mesh, consisting of elements in the finite element "zoo". The functional interface to MOAB is simple yet powerful, allowing the representation of many types of metadata commonly found on the mesh. MOAB is optimized for efficiency in space and time, based on access to mesh in chunks rather than through individual entities, while also versatile enough to support individualmore » entity access. The MOAB data model consists of a mesh interface instance, mesh entities (vertices and elements), sets, and tags. Entities are addressed through handles rather than pointers, to allow the underlying representation of an entity to change without changing the handle to that entity. Sets are arbitrary groupings of mesh entities and other sets. Sets also support parent/child relationships as a relation distinct from sets containing other sets. The directed-graph provided by set parent/child relationships is useful for modeling topological relations from a geometric model or other metadata. Tags are named data which can be assigned to the mesh as a whole, individual entities, or sets. Tags are a mechanism for attaching data to individual entities and sets are a mechanism for describing relations between entities; the combination of these two mechanisms isa powerful yet simple interface for representing metadata or application-specific data. For example, sets and tags can be used together to describe geometric topology, boundary condition, and inter-processor interface groupings in a mesh. MOAB is used in several ways in various applications. MOAB serves as the underlying mesh data representation in the VERDE mesh verification code. MOAB can also be used as a mesh input mechanism, using mesh readers induded with MOAB, or as a tanslator between mesh formats, using readers and writers included with MOAB.« less
ERIC Educational Resources Information Center
Merlin, Ethan M.
2013-01-01
This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…
ERIC Educational Resources Information Center
Levy, Alissa Beth
2012-01-01
The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this…
NASA Technical Reports Server (NTRS)
Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.
1982-01-01
The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.
ERIC Educational Resources Information Center
Cavanagh, Sean
2008-01-01
A popular humorist and avowed mathphobe once declared that in real life, there's no such thing as algebra. Kathie Wilson knows better. Most of the students in her 8th grade class will be thrust into algebra, the definitive course that heralds the beginning of high school mathematics, next school year. The problem: Many of them are about three…
Volume Decomposition and Feature Recognition for Hexahedral Mesh Generation
GADH,RAJIT; LU,YONG; TAUTGES,TIMOTHY J.
1999-09-27
Considerable progress has been made on automatic hexahedral mesh generation in recent years. Several automatic meshing algorithms have proven to be very reliable on certain classes of geometry. While it is always worth pursuing general algorithms viable on more general geometry, a combination of the well-established algorithms is ready to take on classes of complicated geometry. By partitioning the entire geometry into meshable pieces matched with appropriate meshing algorithm the original geometry becomes meshable and may achieve better mesh quality. Each meshable portion is recognized as a meshing feature. This paper, which is a part of the feature based meshing methodology, presents the work on shape recognition and volume decomposition to automatically decompose a CAD model into meshable volumes. There are four phases in this approach: (1) Feature Determination to extinct decomposition features, (2) Cutting Surfaces Generation to form the ''tailored'' cutting surfaces, (3) Body Decomposition to get the imprinted volumes; and (4) Meshing Algorithm Assignment to match volumes decomposed with appropriate meshing algorithms. The feature determination procedure is based on the CLoop feature recognition algorithm that is extended to be more general. Results are demonstrated over several parts with complicated topology and geometry.
Tangle-Free Finite Element Mesh Motion for Ablation Problems
NASA Technical Reports Server (NTRS)
Droba, Justin
2016-01-01
In numerical simulations involving boundaries that evolve in time, the primary challenge is updating the computational mesh to reflect the physical changes in the domain. In particular, the fundamental objective for any such \\mesh motion" scheme is to maintain mesh quality and suppress unphysical geometric anamolies and artifacts. External to a physical process of interest, mesh motion is an added component that determines the specifics of how to move the mesh given certain limited information from the main system. This paper develops a set of boundary conditions designed to eliminate tangling and internal collision within the context of PDE-based mesh motion (linear elasticity). These boundary conditions are developed for two- and three-dimensional meshes. The paper presents detailed algorithms for commonly occuring topological scenarios and explains how to apply them appropriately. Notably, the techniques discussed herein make use of none of the specifics of any particular formulation of mesh motion and thus are more broadly applicable. The two-dimensional algorithms are validated by an extensive verification procedure. Finally, many examples of diverse geometries in both two- and three-dimensions are shown to showcase the capabilities of the tangle-free boundary conditions.
Constrained CVT Meshes and a Comparison of Triangular Mesh Generators
Nguyen, Hoa; Burkardt, John; Gunzburger, Max; Ju, Lili; Saka, Yuki
2009-01-01
Mesh generation in regions in Euclidean space is a central task in computational science, and especially for commonly used numerical methods for the solution of partial differential equations, e.g., finite element and finite volume methods. We focus on the uniform Delaunay triangulation of planar regions and, in particular, on how one selects the positions of the vertices of the triangulation. We discuss a recently developed method, based on the centroidal Voronoi tessellation (CVT) concept, for effecting such triangulations and present two algorithms, including one new one, for CVT-based grid generation. We also compare several methods, including CVT-based methods, for triangulating planar domains. To this end, we define several quantitative measures of the quality of uniform grids. We then generate triangulations of several planar regions, including some having complexities that are representative of what one may encounter in practice. We subject the resulting grids to visual and quantitative comparisons and conclude that all the methods considered produce high-quality uniform grids and that the CVT-based grids are at least as good as any of the others.
Details of tetrahedral anisotropic mesh adaptation
NASA Astrophysics Data System (ADS)
Jensen, Kristian Ejlebjerg; Gorman, Gerard
2016-04-01
We have implemented tetrahedral anisotropic mesh adaptation using the local operations of coarsening, swapping, refinement and smoothing in MATLAB without the use of any for- N loops, i.e. the script is fully vectorised. In the process of doing so, we have made three observations related to details of the implementation: 1. restricting refinement to a single edge split per element not only simplifies the code, it also improves mesh quality, 2. face to edge swapping is unnecessary, and 3. optimising for the Vassilevski functional tends to give a little higher value for the mean condition number functional than optimising for the condition number functional directly. These observations have been made for a uniform and a radial shock metric field, both starting from a structured mesh in a cube. Finally, we compare two coarsening techniques and demonstrate the importance of applying smoothing in the mesh adaptation loop. The results pertain to a unit cube geometry, but we also show the effect of corners and edges by applying the implementation in a spherical geometry.
Semigroups and computer algebra in algebraic structures
NASA Astrophysics Data System (ADS)
Bijev, G.
2012-11-01
Some concepts in semigroup theory can be interpreted in several algebraic structures. A generalization fA,B,fA,B(X) = A(X')B of the complement operator (') on Boolean matrices is made, where A and B denote any rectangular Boolean matrices. While (') is an isomorphism between Boolean semilattices, the generalized complement operator is homomorphism in the general case. The map fA,B and its general inverse (fA,B)+ have quite similar properties to those in the linear algebra and are useful for solving linear equations in Boolean matrix algebras. For binary relations on a finite set, necessary and sufficient conditions for the equation αξβ = γ to have a solution ξ are proved. A generalization of Green's equivalence relations in semigroups for rectangular matrices is proposed. Relationships between them and the Moore-Penrose inverses are investigated. It is shown how any generalized Green's H-class could be constructed by given its corresponding linear subspaces and converted into a group isomorphic to a linear group. Some information about using computer algebra methods concerning this paper is given.
Perspective volume rendering on Parallel Algebraic Logic (PAL) computer
NASA Astrophysics Data System (ADS)
Li, Hongzheng; Shi, Hongchi
1998-09-01
We propose a perspective volume graphics rendering algorithm on SIMD mesh-connected computers and implement the algorithm on the Parallel Algebraic Logic computer. The algorithm is a parallel ray casting algorithm. It decomposes the 3D perspective projection into two transformations that can be implemented in the SIMD fashion to solve the data redistribution problem caused by non-regular data access patterns in the perspective projection.
toolkit computational mesh conceptual model.
Baur, David G.; Edwards, Harold Carter; Cochran, William K.; Williams, Alan B.; Sjaardema, Gregory D.
2010-03-01
The Sierra Toolkit computational mesh is a software library intended to support massively parallel multi-physics computations on dynamically changing unstructured meshes. This domain of intended use is inherently complex due to distributed memory parallelism, parallel scalability, heterogeneity of physics, heterogeneous discretization of an unstructured mesh, and runtime adaptation of the mesh. Management of this inherent complexity begins with a conceptual analysis and modeling of this domain of intended use; i.e., development of a domain model. The Sierra Toolkit computational mesh software library is designed and implemented based upon this domain model. Software developers using, maintaining, or extending the Sierra Toolkit computational mesh library must be familiar with the concepts/domain model presented in this report.
Lie algebra extensions of current algebras on S3
NASA Astrophysics Data System (ADS)
Kori, Tosiaki; Imai, Yuto
2015-06-01
An affine Kac-Moody algebra is a central extension of the Lie algebra of smooth mappings from S1 to the complexification of a Lie algebra. In this paper, we shall introduce a central extension of the Lie algebra of smooth mappings from S3 to the quaternization of a Lie algebra and investigate its root space decomposition. We think this extension of current algebra might give a mathematical tool for four-dimensional conformal field theory as Kac-Moody algebras give it for two-dimensional conformal field theory.
Leibniz algebras associated with representations of filiform Lie algebras
NASA Astrophysics Data System (ADS)
Ayupov, Sh. A.; Camacho, L. M.; Khudoyberdiyev, A. Kh.; Omirov, B. A.
2015-12-01
In this paper we investigate Leibniz algebras whose quotient Lie algebra is a naturally graded filiform Lie algebra nn,1. We introduce a Fock module for the algebra nn,1 and provide classification of Leibniz algebras L whose corresponding Lie algebra L / I is the algebra nn,1 with condition that the ideal I is a Fock nn,1-module, where I is the ideal generated by squares of elements from L. We also consider Leibniz algebras with corresponding Lie algebra nn,1 and such that the action I ×nn,1 → I gives rise to a minimal faithful representation of nn,1. The classification up to isomorphism of such Leibniz algebras is given for the case of n = 4.
PMESH: A parallel mesh generator
Hardin, D.D.
1994-10-21
The Parallel Mesh Generation (PMESH) Project is a joint LDRD effort by A Division and Engineering to develop a unique mesh generation system that can construct large calculational meshes (of up to 10{sup 9} elements) on massively parallel computers. Such a capability will remove a critical roadblock to unleashing the power of massively parallel processors (MPPs) for physical analysis. PMESH will support a variety of LLNL 3-D physics codes in the areas of electromagnetics, structural mechanics, thermal analysis, and hydrodynamics.
Multigrid for locally refined meshes
Shapira, Y.
1999-12-01
A multilevel method for the solution of finite element schemes on locally refined meshes is introduced. For isotropic diffusion problems, the condition number of the two-level method is bounded independently of the mesh size and the discontinuities in the diffusion coefficient. The curves of discontinuity need not be aligned with the coarse mesh. Indeed, numerical applications with 10 levels of local refinement yield a rapid convergence of the corresponding 10-level, multigrid V-cycle and other multigrid cycles which are more suitable for parallelism even when the discontinuities are invisible on most of the coarse meshes.
Coreflections in Algebraic Quantum Logic
NASA Astrophysics Data System (ADS)
Jacobs, Bart; Mandemaker, Jorik
2012-07-01
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.
Serial and parallel dynamic adaptation of general hybrid meshes
NASA Astrophysics Data System (ADS)
Kavouklis, Christos
termination detection algorithm of Dijkstra is employed for (i) parallel flagging of mesh edges, (ii) global numbering of newly created nodes, and (iii) deletion of nodes after coarsening. An inexpensive dynamic load balancing strategy is employed to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced, which yields savings in computation time and a simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) parallel flow feature detection, (ii) data migration and dynamic updates of local data structures, (iii) determination of the new interpartition boundary and (iv) determination of the communication pattern of processors after load balancing.
Developing Algebraic Thinking.
ERIC Educational Resources Information Center
Alejandre, Suzanne
2002-01-01
Presents a teaching experience that resulted in students getting to a point of full understanding of the kinesthetic activity and the algebra behind it. Includes a lesson plan for a traffic jam activity. (KHR)
Algebraic integrability: a survey.
Vanhaecke, Pol
2008-03-28
We give a concise introduction to the notion of algebraic integrability. Our exposition is based on examples and phenomena, rather than on detailed proofs of abstract theorems. We mainly focus on algebraic integrability in the sense of Adler-van Moerbeke, where the fibres of the momentum map are affine parts of Abelian varieties; as it turns out, most examples from classical mechanics are of this form. Two criteria are given for such systems (Kowalevski-Painlevé and Lyapunov) and each is illustrated in one example. We show in the case of a relatively simple example how one proves algebraic integrability, starting from the differential equations for the integrable vector field. For Hamiltonian systems that are algebraically integrable in the generalized sense, two examples are given, which illustrate the non-compact analogues of Abelian varieties which typically appear in such systems. PMID:17588863
Algebraic Semantics for Narrative
ERIC Educational Resources Information Center
Kahn, E.
1974-01-01
This paper uses discussion of Edmund Spenser's "The Faerie Queene" to present a theoretical framework for explaining the semantics of narrative discourse. The algebraic theory of finite automata is used. (CK)
Risk Factors for Mesh Exposure after Transvaginal Mesh Surgery
Niu, Ke; Lu, Yong-Xian; Shen, Wen-Jie; Zhang, Ying-Hui; Wang, Wen-Ying
2016-01-01
Background: Mesh exposure after surgery continues to be a clinical challenge for urogynecological surgeons. The purpose of this study was to explore the risk factors for polypropylene (PP) mesh exposure after transvaginal mesh (TVM) surgery. Methods: This study included 195 patients with advanced pelvic organ prolapse (POP), who underwent TVM from January 2004 to December 2012 at the First Affiliated Hospital of Chinese PLA General Hospital. Clinical data were evaluated including patient's demography, TVM type, concomitant procedures, operation time, blood loss, postoperative morbidity, and mesh exposure. Mesh exposure was identified through postoperative vaginal examination. Statistical analysis was performed to identify risk factors for mesh exposure. Results: Two-hundred and nine transvaginal PP meshes were placed, including 194 in the anterior wall and 15 in the posterior wall. Concomitant tension-free vaginal tape was performed in 61 cases. The mean follow-up time was 35.1 ± 23.6 months. PP mesh exposure was identified in 32 cases (16.4%), with 31 in the anterior wall and 1 in the posterior wall. Significant difference was found in operating time and concomitant procedures between exposed and nonexposed groups (F = 7.443, P = 0.007; F = 4.307, P = 0.039, respectively). Binary logistic regression revealed that the number of concomitant procedures and operation time were risk factors for mesh exposure (P = 0.001, P = 0.043). Conclusion: Concomitant procedures and increased operating time increase the risk for postoperative mesh exposure in patients undergoing TVM surgery for POP. PMID:27453227
Aprepro - Algebraic Preprocessor
Energy Science and Technology Software Center (ESTSC)
2005-08-01
Aprepro is an algebraic preprocessor that reads a file containing both general text and algebraic, string, or conditional expressions. It interprets the expressions and outputs them to the output file along witht the general text. Aprepro contains several mathematical functions, string functions, and flow control constructs. In addition, functions are included that, with some additional files, implement a units conversion system and a material database lookup system.
Geometric Algebra for Physicists
NASA Astrophysics Data System (ADS)
Doran, Chris; Lasenby, Anthony
2007-11-01
Preface; Notation; 1. Introduction; 2. Geometric algebra in two and three dimensions; 3. Classical mechanics; 4. Foundations of geometric algebra; 5. Relativity and spacetime; 6. Geometric calculus; 7. Classical electrodynamics; 8. Quantum theory and spinors; 9. Multiparticle states and quantum entanglement; 10. Geometry; 11. Further topics in calculus and group theory; 12. Lagrangian and Hamiltonian techniques; 13. Symmetry and gauge theory; 14. Gravitation; Bibliography; Index.
Covariant deformed oscillator algebras
NASA Technical Reports Server (NTRS)
Quesne, Christiane
1995-01-01
The general form and associativity conditions of deformed oscillator algebras are reviewed. It is shown how the latter can be fulfilled in terms of a solution of the Yang-Baxter equation when this solution has three distinct eigenvalues and satisfies a Birman-Wenzl-Murakami condition. As an example, an SU(sub q)(n) x SU(sub q)(m)-covariant q-bosonic algebra is discussed in some detail.
Ye, Dexin; Lu, Ling; Joannopoulos, John D.; Soljačić, Marin; Ran, Lixin
2016-01-01
A solid material possessing identical electromagnetic properties as air has yet to be found in nature. Such a medium of arbitrary shape would neither reflect nor refract light at any angle of incidence in free space. Here, we introduce nonscattering corrugated metallic wires to construct such a medium. This was accomplished by aligning the dark-state frequencies in multiple scattering channels of a single wire. Analytical solutions, full-wave simulations, and microwave measurement results on 3D printed samples show omnidirectional invisibility in any configuration. This invisible metallic mesh can improve mechanical stability, electrical conduction, and heat dissipation of a system, without disturbing the electromagnetic design. Our approach is simple, robust, and scalable to higher frequencies. PMID:26884208
Ye, Dexin; Lu, Ling; Joannopoulos, John D; Soljačić, Marin; Ran, Lixin
2016-03-01
A solid material possessing identical electromagnetic properties as air has yet to be found in nature. Such a medium of arbitrary shape would neither reflect nor refract light at any angle of incidence in free space. Here, we introduce nonscattering corrugated metallic wires to construct such a medium. This was accomplished by aligning the dark-state frequencies in multiple scattering channels of a single wire. Analytical solutions, full-wave simulations, and microwave measurement results on 3D printed samples show omnidirectional invisibility in any configuration. This invisible metallic mesh can improve mechanical stability, electrical conduction, and heat dissipation of a system, without disturbing the electromagnetic design. Our approach is simple, robust, and scalable to higher frequencies. PMID:26884208
NASA Astrophysics Data System (ADS)
Hiley, B. J.
In this chapter, we examine in detail the non-commutative symplectic algebra underlying quantum dynamics. By using this algebra, we show that it contains both the Weyl-von Neumann and the Moyal quantum algebras. The latter contains the Wigner distribution as the kernel of the density matrix. The underlying non-commutative geometry can be projected into either of two Abelian spaces, so-called `shadow phase spaces'. One of these is the phase space of Bohmian mechanics, showing that it is a fragment of the basic underlying algebra. The algebraic approach is much richer, giving rise to two fundamental dynamical time development equations which reduce to the Liouville equation and the Hamilton-Jacobi equation in the classical limit. They also include the Schrödinger equation and its wave-function, showing that these features are a partial aspect of the more general non-commutative structure. We discuss briefly the properties of this more general mathematical background from which the non-commutative symplectic algebra emerges.
DG Poisson algebra and its universal enveloping algebra
NASA Astrophysics Data System (ADS)
Lü, JiaFeng; Wang, XingTing; Zhuang, GuangBin
2016-05-01
In this paper, we introduce the notions of differential graded (DG) Poisson algebra and DG Poisson module. Let $A$ be any DG Poisson algebra. We construct the universal enveloping algebra of $A$ explicitly, which is denoted by $A^{ue}$. We show that $A^{ue}$ has a natural DG algebra structure and it satisfies certain universal property. As a consequence of the universal property, it is proved that the category of DG Poisson modules over $A$ is isomorphic to the category of DG modules over $A^{ue}$. Furthermore, we prove that the notion of universal enveloping algebra $A^{ue}$ is well-behaved under opposite algebra and tensor product of DG Poisson algebras. Practical examples of DG Poisson algebras are given throughout the paper including those arising from differential geometry and homological algebra.
Laparoscopic paracolostomy hernia mesh repair.
Virzí, Giuseppe; Giuseppe, Virzí; Scaravilli, Francesco; Francesco, Scaravilli; Ragazzi, Salvatore; Salvatore, Ragazzi; Piazza, Diego; Diego, Piazza
2007-12-01
Paracolostomy hernia is a common occurrence, representing a late complication of stoma surgery. Different surgical techniques have been proposed to repair the wall defect, but the lowest recurrence rates are associated with the use of mesh. We present the case report of a patient in which laparoscopic paracolostomy hernia mesh repair has been successfully performed. PMID:18097321
Quadrilateral finite element mesh coarsening
Staten, Matthew L; Dewey, Mark W; Benzley, Steven E
2012-10-16
Techniques for coarsening a quadrilateral mesh are described. These techniques include identifying a coarsening region within the quadrilateral mesh to be coarsened. Quadrilateral elements along a path through the coarsening region are removed. Node pairs along opposite sides of the path are identified. The node pairs along the path are then merged to collapse the path.
Composite structured mesh generation with automatic domain decomposition in complex geometries
Technology Transfer Automated Retrieval System (TEKTRAN)
This paper presents a novel automatic domain decomposition method to generate quality composite structured meshes in complex domains with arbitrary shapes, in which quality structured mesh generation still remains a challenge. The proposed decomposition algorithm is based on the analysis of an initi...
A Survey of Solver-Related Geometry and Meshing Issues
NASA Technical Reports Server (NTRS)
Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris
2016-01-01
There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.
NASA Technical Reports Server (NTRS)
DeCristofaro, Michael A.; Lansdowne, Chatwin A.; Schlesinger, Adam M.
2014-01-01
NASA has identified standardized wireless mesh networking as a key technology for future human and robotic space exploration. Wireless mesh networks enable rapid deployment, provide coverage in undeveloped regions. Mesh networks are also self-healing, resilient, and extensible, qualities not found in traditional infrastructure-based networks. Mesh networks can offer lower size, weight, and power (SWaP) than overlapped infrastructure-perapplication. To better understand the maturity, characteristics and capability of the technology, we developed an 802.11 mesh network consisting of a combination of heterogeneous commercial off-the-shelf devices and opensource firmware and software packages. Various streaming applications were operated over the mesh network, including voice and video, and performance measurements were made under different operating scenarios. During the testing several issues with the currently implemented mesh network technology were identified and outlined for future work.
Are patient specific meshes required for EIT head imaging?
Jehl, Markus; Aristovich, Kirill; Faulkner, Mayo; Holder, David
2016-06-01
Head imaging with electrical impedance tomography (EIT) is usually done with time-differential measurements, to reduce time-invariant modelling errors. Previous research suggested that more accurate head models improved image quality, but no thorough analysis has been done on the required accuracy. We propose a novel pipeline for creation of precise head meshes from magnetic resonance imaging and computed tomography scans, which was applied to four different heads. Voltages were simulated on all four heads for perturbations of different magnitude, haemorrhage and ischaemia, in five different positions and for three levels of instrumentation noise. Statistical analysis showed that reconstructions on the correct mesh were on average 25% better than on the other meshes. However, the stroke detection rates were not improved. We conclude that a generic head mesh is sufficient for monitoring patients for secondary strokes following head trauma. PMID:27206049
Free Mesh Method: fundamental conception, algorithms and accuracy study
YAGAWA, Genki
2011-01-01
The finite element method (FEM) has been commonly employed in a variety of fields as a computer simulation method to solve such problems as solid, fluid, electro-magnetic phenomena and so on. However, creation of a quality mesh for the problem domain is a prerequisite when using FEM, which becomes a major part of the cost of a simulation. It is natural that the concept of meshless method has evolved. The free mesh method (FMM) is among the typical meshless methods intended for particle-like finite element analysis of problems that are difficult to handle using global mesh generation, especially on parallel processors. FMM is an efficient node-based finite element method that employs a local mesh generation technique and a node-by-node algorithm for the finite element calculations. In this paper, FMM and its variation are reviewed focusing on their fundamental conception, algorithms and accuracy. PMID:21558752
Streaming Compression of Hexahedral Meshes
Isenburg, M; Courbet, C
2010-02-03
We describe a method for streaming compression of hexahedral meshes. Given an interleaved stream of vertices and hexahedral our coder incrementally compresses the mesh in the presented order. Our coder is extremely memory efficient when the input stream documents when vertices are referenced for the last time (i.e. when it contains topological finalization tags). Our coder then continuously releases and reuses data structures that no longer contribute to compressing the remainder of the stream. This means in practice that our coder has only a small fraction of the whole mesh in memory at any time. We can therefore compress very large meshes - even meshes that do not file in memory. Compared to traditional, non-streaming approaches that load the entire mesh and globally reorder it during compression, our algorithm trades a less compact compressed representation for significant gains in speed, memory, and I/O efficiency. For example, on the 456k hexahedra 'blade' mesh, our coder is twice as fast and uses 88 times less memory (only 3.1 MB) with the compressed file increasing about 3% in size. We also present the first scheme for predictive compression of properties associated with hexahedral cells.
21 CFR 878.3300 - Surgical mesh.
Code of Federal Regulations, 2013 CFR
2013-04-01
... GENERAL AND PLASTIC SURGERY DEVICES Prosthetic Devices § 878.3300 Surgical mesh. (a) Identification... acetabular and cement restrictor mesh used during orthopedic surgery. (b) Classification. Class II....
21 CFR 878.3300 - Surgical mesh.
Code of Federal Regulations, 2010 CFR
2010-04-01
... GENERAL AND PLASTIC SURGERY DEVICES Prosthetic Devices § 878.3300 Surgical mesh. (a) Identification... acetabular and cement restrictor mesh used during orthopedic surgery. (b) Classification. Class II....
21 CFR 878.3300 - Surgical mesh.
Code of Federal Regulations, 2012 CFR
2012-04-01
... GENERAL AND PLASTIC SURGERY DEVICES Prosthetic Devices § 878.3300 Surgical mesh. (a) Identification... acetabular and cement restrictor mesh used during orthopedic surgery. (b) Classification. Class II....
Nanowire mesh solar fuels generator
Yang, Peidong; Chan, Candace; Sun, Jianwei; Liu, Bin
2016-05-24
This disclosure provides systems, methods, and apparatus related to a nanowire mesh solar fuels generator. In one aspect, a nanowire mesh solar fuels generator includes (1) a photoanode configured to perform water oxidation and (2) a photocathode configured to perform water reduction. The photocathode is in electrical contact with the photoanode. The photoanode may include a high surface area network of photoanode nanowires. The photocathode may include a high surface area network of photocathode nanowires. In some embodiments, the nanowire mesh solar fuels generator may include an ion conductive polymer infiltrating the photoanode and the photocathode in the region where the photocathode is in electrical contact with the photoanode.
NASA Astrophysics Data System (ADS)
Lian, Y.-Y.; Hsu, K.-H.; Shao, Y.-L.; Lee, Y.-M.; Jeng, Y.-W.; Wu, J.-S.
2006-12-01
The development of a parallel three-dimensional (3-D) adaptive mesh refinement (PAMR) scheme for an unstructured tetrahedral mesh using dynamic domain decomposition on a memory-distributed machine is presented in detail. A memory-saving cell-based data structure is designed such that the resulting mesh information can be readily utilized in both node- or cell-based numerical methods. The general procedures include isotropic refinement from one parent cell into eight child cells and then followed by anisotropic refinement which effectively removes hanging nodes. A simple but effective mesh-quality control mechanism is employed to preserve the mesh quality. The resulting parallel performance of this PAMR is found to scale approximately as N for N⩽32. Two test cases, including a particle method (parallel DSMC solver for rarefied gas dynamics) and an equation-based method (parallel Poisson-Boltzmann equation solver for electrostatic field), are used to demonstrate the generality of the PAMR module. It is argued that this PAMR scheme can be applied in any numerical method if the unstructured tetrahedral mesh is adopted.
NASA Astrophysics Data System (ADS)
Roitman, Michael
2008-08-01
In this paper we prove that for any commutative (but in general non-associative) algebra A with an invariant symmetric non-degenerate bilinear form there is a graded vertex algebra V = V0 Å V2 Å V3 Å ¼, such that dim V0 = 1 and V2 contains A. We can choose V so that if A has a unit e, then 2e is the Virasoro element of V, and if G is a finite group of automorphisms of A, then G acts on V as well. In addition, the algebra V can be chosen with a non-degenerate invariant bilinear form, in which case it is simple.
Adaptive Algebraic Multigrid Methods
Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J
2004-04-09
Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.
Cu Mesh for Flexible Transparent Conductive Electrodes
Kim, Won-Kyung; Lee, Seunghun; Hee Lee, Duck; Hee Park, In; Seong Bae, Jong; Woo Lee, Tae; Kim, Ji-Young; Hun Park, Ji; Chan Cho, Yong; Ryong Cho, Chae; Jeong, Se-Young
2015-01-01
Copper electrodes with a micromesh/nanomesh structure were fabricated on a polyimide substrate using UV lithography and wet etching to produce flexible transparent conducting electrodes (TCEs). Well-defined mesh electrodes were realized through the use of high-quality Cu thin films. The films were fabricated using radio-frequency (RF) sputtering with a single-crystal Cu target—a simple but innovative approach that overcame the low oxidation resistance of ordinary Cu. Hybrid Cu mesh electrodes were fabricated by adding a capping layer of either ZnO or Al-doped ZnO. The sheet resistance and the transmittance of the electrode with an Al-doped ZnO capping layer were 6.197 ohm/sq and 90.657%, respectively, and the figure of merit was 60.502 × 10–3/ohm, which remained relatively unchanged after thermal annealing at 200 °C and 1,000 cycles of bending. This fabrication technique enables the mass production of large-area flexible TCEs, and the stability and high performance of Cu mesh hybrid electrodes in harsh environments suggests they have strong potential for application in smart displays and solar cells. PMID:26039977
Cu mesh for flexible transparent conductive electrodes.
Kim, Won-Kyung; Lee, Seunghun; Hee Lee, Duck; Hee Park, In; Seong Bae, Jong; Woo Lee, Tae; Kim, Ji-Young; Hun Park, Ji; Chan Cho, Yong; Ryong Cho, Chae; Jeong, Se-Young
2015-01-01
Copper electrodes with a micromesh/nanomesh structure were fabricated on a polyimide substrate using UV lithography and wet etching to produce flexible transparent conducting electrodes (TCEs). Well-defined mesh electrodes were realized through the use of high-quality Cu thin films. The films were fabricated using radio-frequency (RF) sputtering with a single-crystal Cu target--a simple but innovative approach that overcame the low oxidation resistance of ordinary Cu. Hybrid Cu mesh electrodes were fabricated by adding a capping layer of either ZnO or Al-doped ZnO. The sheet resistance and the transmittance of the electrode with an Al-doped ZnO capping layer were 6.197 ohm/sq and 90.657%, respectively, and the figure of merit was 60.502 × 10(-3)/ohm, which remained relatively unchanged after thermal annealing at 200 °C and 1,000 cycles of bending. This fabrication technique enables the mass production of large-area flexible TCEs, and the stability and high performance of Cu mesh hybrid electrodes in harsh environments suggests they have strong potential for application in smart displays and solar cells. PMID:26039977
Abstract Algebra for Algebra Teaching: Influencing School Mathematics Instruction
ERIC Educational Resources Information Center
Wasserman, Nicholas H.
2016-01-01
This article explores the potential for aspects of abstract algebra to be influential for the teaching of school algebra (and early algebra). Using national standards for analysis, four primary areas common in school mathematics--and their progression across elementary, middle, and secondary mathematics--where teaching may be transformed by…
Compressive VOF method with skewness correction to capture sharp interfaces on arbitrary meshes
NASA Astrophysics Data System (ADS)
Denner, Fabian; van Wachem, Berend G. M.
2014-12-01
The accurate and efficient modelling of two-phase flows is at present mostly limited to structured, unskewed meshes, due to the additional topological and numerical complexity of arbitrary, unstructured meshes. Compressive VOF methods which discretize the interface advection with algebraic differencing schemes are computationally efficient and inherently applicable to arbitrary meshes. However, compressive VOF methods evidently suffer severely from numerical diffusion on meshes with topological skewness. In this paper we present a compressive VOF method using a state-of-the-art donor-acceptor advection scheme which includes novel modifications to substantially reduce numerical diffusion on arbitrary meshes without adding computational complexity. The new methodology accurately captures evolving interfaces on any arbitrary, non-overlapping mesh and conserves mass within the limits of the applied solver tolerance. A thorough validation of the presented methods is conducted, examining the pure advection of the interface indicator function as well as the application to evolving interfaces with surface tension. Crucially, the results on equidistant Cartesian and arbitrary tetrahedral meshes are shown to be comparable and accurate.
Computer Program For Linear Algebra
NASA Technical Reports Server (NTRS)
Krogh, F. T.; Hanson, R. J.
1987-01-01
Collection of routines provided for basic vector operations. Basic Linear Algebra Subprogram (BLAS) library is collection from FORTRAN-callable routines for employing standard techniques to perform basic operations of numerical linear algebra.
NASA Technical Reports Server (NTRS)
Shahshahani, M.
1991-01-01
The performance characteristics are discussed of certain algebraic geometric codes. Algebraic geometric codes have good minimum distance properties. On many channels they outperform other comparable block codes; therefore, one would expect them eventually to replace some of the block codes used in communications systems. It is suggested that it is unlikely that they will become useful substitutes for the Reed-Solomon codes used by the Deep Space Network in the near future. However, they may be applicable to systems where the signal to noise ratio is sufficiently high so that block codes would be more suitable than convolutional or concatenated codes.
NASA Astrophysics Data System (ADS)
Bouwknegt, Peter
1988-06-01
We investigate extensions of the Virasoro algebra by a single primary field of integer or halfinteger conformal dimension Δ. We argue that for vanishing structure constant CΔΔΔ, the extended conformal algebra can only be associative for a generic c-value if Δ=1/2, 1, 3/2, 2 or 3. For the other Δ<=5 we compute the finite set of allowed c-values and identify the rational solutions. The case CΔΔΔ≠0 is also briefly discussed. I would like to thank Kareljan Schoutens for discussions and Sander Bais for a careful reading of the manuscript.
Augmentation mentoplasty using Mersilene mesh.
McCollough, E G; Hom, D B; Weigel, M T; Anderson, J R
1990-10-01
Many different materials are available for augmentation mentoplasty. However, the optimal implant material for chin implantation has yet to be found. During the past several years, a number of experienced surgeons have turned to the use of Mersilene mesh. Mersilene mesh is a non-absorbable Dacron polyester fiber that can be conformed easily into layers to achieve tailored dimensions and shape. At the McCollough Plastic Surgery Clinic PA, Birmingham, Ala, 277 patients over a 10-year period underwent chin augmentation with Mersilene mesh implants. The material provides excellent tensile strength, durability, and surgical adaptability. The overall complication rate was 3.2% (nine patients); infection rate, 2.5% (seven patients); and removal secondary to infection, 1.7% (five patients). Based on this 10-year experience, Mersilene mesh remains our material of choice for chin augmentation. PMID:2206500
Parallel Adaptive Mesh Refinement Library
NASA Technical Reports Server (NTRS)
Mac-Neice, Peter; Olson, Kevin
2005-01-01
Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.
Mersiline mesh in premaxillary augmentation.
Foda, Hossam M T
2005-01-01
Premaxillary retrusion may distort the aesthetic appearance of the columella, lip, and nasal tip. This defect is characteristically seen in, but not limited to, patients with cleft lip nasal deformity. This study investigated 60 patients presenting with premaxillary deficiencies in which Mersiline mesh was used to augment the premaxilla. All the cases had surgery using the external rhinoplasty technique. Two methods of augmentation with Mersiline mesh were used: the Mersiline roll technique, for the cases with central symmetric deficiencies, and the Mersiline packing technique, for the cases with asymmetric deficiencies. Premaxillary augmentation with Mersiline mesh proved to be simple technically, easy to perform, and not associated with any complications. Periodic follow-up evaluation for a mean period of 32 months (range, 12-98 months) showed that an adequate degree of premaxillary augmentation was maintained with no clinically detectable resorption of the mesh implant. PMID:15959688
Unstructured mesh methods for CFD
NASA Technical Reports Server (NTRS)
Peraire, J.; Morgan, K.; Peiro, J.
1990-01-01
Mesh generation methods for Computational Fluid Dynamics (CFD) are outlined. Geometric modeling is discussed. An advancing front method is described. Flow past a two engine Falcon aeroplane is studied. An algorithm and associated data structure called the alternating digital tree, which efficiently solves the geometric searching problem is described. The computation of an initial approximation to the steady state solution of a given poblem is described. Mesh generation for transient flows is described.
Unstructured mesh methods for CFD
NASA Astrophysics Data System (ADS)
Peraire, J.; Morgan, K.; Peiro, J.
Mesh generation methods for Computational Fluid Dynamics (CFD) are outlined. Geometric modeling is discussed. An advancing front method is described. Flow past a two engine Falcon aeroplane is studied. An algorithm and associated data structure called the alternating digital tree, which efficiently solves the geometric searching problem is described. The computation of an initial approximation to the steady state solution of a given poblem is described. Mesh generation for transient flows is described.
Cummings, Julian C.
2013-05-15
This project was a collaboration between researchers at the California Institute of Technology and the University of California, Irvine to investigate the utility of a global field-aligned mesh and gyrokinetic field solver for simulations of the tokamak plasma edge region. Mesh generation software from UC Irvine was tested with specific tokamak edge magnetic geometry scenarios and the quality of the meshes and the solutions to the gyrokinetic Poisson equation were evaluated.
Assessment of mesh simplification algorithm quality
NASA Astrophysics Data System (ADS)
Roy, Michael; Nicolier, Frederic; Foufou, S.; Truchetet, Frederic; Koschan, Andreas; Abidi, Mongi A.
2002-03-01
Traditionally, medical geneticists have employed visual inspection (anthroposcopy) to clinically evaluate dysmorphology. In the last 20 years, there has been an increasing trend towards quantitative assessment to render diagnosis of anomalies more objective and reliable. These methods have focused on direct anthropometry, using a combination of classical physical anthropology tools and new instruments tailor-made to describe craniofacial morphometry. These methods are painstaking and require that the patient remain still for extended periods of time. Most recently, semiautomated techniques (e.g., structured light scanning) have been developed to capture the geometry of the face in a matter of seconds. In this paper, we establish that direct anthropometry and structured light scanning yield reliable measurements, with remarkably high levels of inter-rater and intra-rater reliability, as well as validity (contrasting the two methods).
Image-driven mesh optimization
Lindstrom, P; Turk, G
2001-01-05
We describe a method of improving the appearance of a low vertex count mesh in a manner that is guided by rendered images of the original, detailed mesh. This approach is motivated by the fact that greedy simplification methods often yield meshes that are poorer than what can be represented with a given number of vertices. Our approach relies on edge swaps and vertex teleports to alter the mesh connectivity, and uses the downhill simplex method to simultaneously improve vertex positions and surface attributes. Note that this is not a simplification method--the vertex count remains the same throughout the optimization. At all stages of the optimization the changes are guided by a metric that measures the differences between rendered versions of the original model and the low vertex count mesh. This method creates meshes that are geometrically faithful to the original model. Moreover, the method takes into account more subtle aspects of a model such as surface shading or whether cracks are visible between two interpenetrating parts of the model.
Teaching Arithmetic and Algebraic Expressions
ERIC Educational Resources Information Center
Subramaniam, K.; Banerjee, Rakhi
2004-01-01
A teaching intervention study was conducted with sixth grade students to explore the interconnections between students' growing understanding of arithmetic expressions and beginning algebra. Three groups of students were chosen, with two groups receiving instruction in arithmetic and algebra, and one group in algebra without arithmetic. Students…
Assessing Elementary Algebra with STACK
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2007-01-01
This paper concerns computer aided assessment (CAA) of mathematics in which a computer algebra system (CAS) is used to help assess students' responses to elementary algebra questions. Using a methodology of documentary analysis, we examine what is taught in elementary algebra. The STACK CAA system, http://www.stack.bham.ac.uk/, which uses the CAS…
Spinors in the hyperbolic algebra
NASA Astrophysics Data System (ADS)
Ulrych, S.
2006-01-01
The three-dimensional universal complex Clifford algebra Cbar3,0 is used to represent relativistic vectors in terms of paravectors. In analogy to the Hestenes spacetime approach spinors are introduced in an algebraic form. This removes the dependance on an explicit matrix representation of the algebra.
ERIC Educational Resources Information Center
Glick, David
1995-01-01
Presents a technique that helps students concentrate more on the science and less on the mechanics of algebra while dealing with introductory physics formulas. Allows the teacher to do complex problems at a lower level and not be too concerned about the mathematical abilities of the students. (JRH)
ERIC Educational Resources Information Center
Ketterlin-Geller, Leanne R.; Jungjohann, Kathleen; Chard, David J.; Baker, Scott
2007-01-01
Much of the difficulty that students encounter in the transition from arithmetic to algebra stems from their early learning and understanding of arithmetic. Too often, students learn about the whole number system and the operations that govern that system as a set of procedures to solve addition, subtraction, multiplication, and division problems.…
Computer Algebra versus Manipulation
ERIC Educational Resources Information Center
Zand, Hossein; Crowe, David
2004-01-01
In the UK there is increasing concern about the lack of skill in algebraic manipulation that is evident in students entering mathematics courses at university level. In this note we discuss how the computer can be used to ameliorate some of the problems. We take as an example the calculations needed in three dimensional vector analysis in polar…
ERIC Educational Resources Information Center
Boiteau, Denise; Stansfield, David
This document describes mathematical programs on the basic concepts of algebra produced by Louisiana Public Broadcasting. Programs included are: (1) "Inverse Operations"; (2) "The Order of Operations"; (3) "Basic Properties" (addition and multiplication of numbers and variables); (4) "The Positive and Negative Numbers"; and (5) "Using Positive…
Thinking Visually about Algebra
ERIC Educational Resources Information Center
Baroudi, Ziad
2015-01-01
Many introductions to algebra in high school begin with teaching students to generalise linear numerical patterns. This article argues that this approach needs to be changed so that students encounter variables in the context of modelling visual patterns so that the variables have a meaning. The article presents sample classroom activities,…
ERIC Educational Resources Information Center
Kennedy, John
This text provides information and exercises on arithmetic topics which should be mastered before a student enrolls in an Elementary Algebra course. Section I describes the fundamental properties and relationships of whole numbers, focusing on basic operations, divisibility tests, exponents, order of operations, prime numbers, greatest common…
ERIC Educational Resources Information Center
Nwabueze, Kenneth K.
2004-01-01
The current emphasis on flexible modes of mathematics delivery involving new information and communication technology (ICT) at the university level is perhaps a reaction to the recent change in the objectives of education. Abstract algebra seems to be one area of mathematics virtually crying out for computer instructional support because of the…
Parallel adaptation of general three-dimensional hybrid meshes
NASA Astrophysics Data System (ADS)
Kavouklis, Christos; Kallinderis, Yannis
2010-05-01
A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.
Method and system for mesh network embedded devices
NASA Technical Reports Server (NTRS)
Wang, Ray (Inventor)
2009-01-01
A method and system for managing mesh network devices. A mesh network device with integrated features creates an N-way mesh network with a full mesh network topology or a partial mesh network topology.
Performance of a mixed-mesh Godunov-based flood inundation model
NASA Astrophysics Data System (ADS)
Kim, B.; Sanders, B. F.; Kim, H.; Famiglietti, J. S.
2011-12-01
Godunov-based finite volume models for solving the shallow-water equations, which are seeing increasing use in hydrology for flood inundation modeling, have almost exclusively adopted either structured meshes of quadrilateral cells or unstructured meshes of triangular cells but have not focused on mixing quadrilateral and triangular cells as is common with finite element models. Triangular meshing is advantageous in complex topography arising from channel junctions, meandering channels, and artificial structures because powerful Delaunay mesh generators easily accommodate internal and external boundary constraints while retaining mesh quality attributes such as area and angle properties. On the other hand, quadrilateral meshing is advantages in the absence of boundary constraints because efficient and low-overhead mesh designs such as Cartesian grids can be used. Motivated by the need for efficient and accurate modeling of flood inundation including channel flows, overbank flows, and overtopping processes, a mixed-mesh version of the BreZo flood inundation model is presented and its ease-of-use and performance in a series of laboratory and field scale test problems is examined in comparison to versions that use either triangular or quadrilateral cells exclusively. We find that mixed meshes are not as easily prepared as triangular meshes for commonly encountered study-site geometries, but execution times and memory requirements for a similar level of accuracy are reduced. The challenges of designing high quality meshes for flood modeling highlights the need for a new class of mesh generators that can scan high resolution topographic data (e.g., lidar) for critical features (e.g., channels and levees) and automate mixed-mesh generation and parameterization.
User Manual for the PROTEUS Mesh Tools
Smith, Micheal A.; Shemon, Emily R.
2015-06-01
This report describes the various mesh tools that are provided with the PROTEUS code giving both descriptions of the input and output. In many cases the examples are provided with a regression test of the mesh tools. The most important mesh tools for any user to consider using are the MT_MeshToMesh.x and the MT_RadialLattice.x codes. The former allows the conversion between most mesh types handled by PROTEUS while the second allows the merging of multiple (assembly) meshes into a radial structured grid. Note that the mesh generation process is recursive in nature and that each input specific for a given mesh tool (such as .axial or .merge) can be used as “mesh” input for any of the mesh tools discussed in this manual.
NASA Astrophysics Data System (ADS)
Zhang, Ming; Yao, JingTao
2004-04-01
The XML is a new standard for data representation and exchange on the Internet. There are studies on XML query languages as well as XML algebras in literature. However, attention has not been paid to research on XML algebras for data mining due to partially the fact that there is no widely accepted definition of XML mining tasks. This paper tries to examine the XML mining tasks and provide guidelines to design XML algebras for data mining. Some summarization and comparison have been done to existing XML algebras. We argue that by adding additional operators for mining tasks, XML algebras may work well for data mining with XML documents.
NASA Astrophysics Data System (ADS)
Baye, Daniel
2015-03-01
The Lagrange-mesh method is an approximate variational method taking the form of equations on a grid thanks to the use of a Gauss-quadrature approximation. The variational basis related to this Gauss quadrature is composed of Lagrange functions which are infinitely differentiable functions vanishing at all mesh points but one. This method is quite simple to use and, more importantly, can be very accurate with small number of mesh points for a number of problems. The accuracy may however be destroyed by singularities of the potential term. This difficulty can often be overcome by a regularization of the Lagrange functions which does not affect the simplicity and accuracy of the method. The principles of the Lagrange-mesh method are described, as well as various generalizations of the Lagrange functions and their regularization. The main existing meshes are reviewed and extensive formulas are provided which make the numerical calculations simple. They are in general based on classical orthogonal polynomials. The extensions to non-classical orthogonal polynomials and periodic functions are also presented. Applications start with the calculations of energies, wave functions and some observables for bound states in simple solvable models which can rather easily be used as exercises by the reader. The Dirac equation is also considered. Various problems in the continuum can also simply and accurately be solved with the Lagrange-mesh technique including multichannel scattering or scattering by non-local potentials. The method can be applied to three-body systems in appropriate systems of coordinates. Simple atomic, molecular and nuclear systems are taken as examples. The applications to the time-dependent Schrödinger equation, to the Gross-Pitaevskii equation and to Hartree-Fock calculations are also discussed as well as translations and rotations on a Lagrange mesh.
Single port laparoscopic mesh rectopexy
2016-01-01
Introduction Traditionally, laparoscopic mesh rectopexy is performed with four ports, in an attempt to improve cosmetic results. Following laparoscopic mesh rectopexy there is a new operative technique called single-port laparoscopic mesh rectopexy. Aim To evaluate the single-port laparoscopic mesh rectopexy technique in control of rectal prolapse and the cosmesis and body image issues of this technique. Material and methods The study was conducted in El Fayoum University Hospital between July 2013 and November 2014 in elective surgery for symptomatic rectal prolapse with single-port laparoscopic mesh rectopexy on 10 patients. Results The study included 10 patients: 3 (30%) males and 7 (70%) females. Their ages ranged between 19 years and 60 years (mean: 40.3 ±6 years), and they all underwent laparoscopic mesh rectopexy. There were no conversions to open technique, nor injuries to the rectum or bowel, and there were no mortalities. Mean operative time was 120 min (range: 90–150 min), and mean hospital stay was 2 days (range: 1–3 days). Preoperatively, incontinence was seen in 5 (50%) patients and constipation in 4 (40%). Postoperatively, improvement in these symptoms was seen in 3 (60%) patients for incontinence and in 3 (75%) for constipation. Follow-up was done for 6 months and no recurrence was found with better cosmetic appearance for all patients. Conclusions Single-port laparoscopic mesh rectopexy is a safe procedure with good results as regards operative time, improvement in bowel function, morbidity, cost, and recurrence, and with better cosmetic appearance. PMID:27350840
PLUM: Parallel Load Balancing for Unstructured Adaptive Meshes
NASA Technical Reports Server (NTRS)
Oliker, Leonid
1998-01-01
Dynamic mesh adaption on unstructured grids is a powerful tool for computing large-scale problems that require grid modifications to efficiently resolve solution features. Unfortunately, an efficient parallel implementation is difficult to achieve, primarily due to the load imbalance created by the dynamically-changing nonuniform grid. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive large-scale numerical computations in a message-passing environment. First, we present an efficient parallel implementation of a tetrahedral mesh adaption scheme. Extremely promising parallel performance is achieved for various refinement and coarsening strategies on a realistic-sized domain. Next we describe PLUM, a novel method for dynamically balancing the processor workloads in adaptive grid computations. This research includes interfacing the parallel mesh adaption procedure based on actual flow solutions to a data remapping module, and incorporating an efficient parallel mesh repartitioner. A significant runtime improvement is achieved by observing that data movement for a refinement step should be performed after the edge-marking phase but before the actual subdivision. We also present optimal and heuristic remapping cost metrics that can accurately predict the total overhead for data redistribution. Several experiments are performed to verify the effectiveness of PLUM on sequences of dynamically adapted unstructured grids. Portability is demonstrated by presenting results on the two vastly different architectures of the SP2 and the Origin2OOO. Additionally, we evaluate the performance of five state-of-the-art partitioning algorithms that can be used within PLUM. It is shown that for certain classes of unsteady adaption, globally repartitioning the computational mesh produces higher quality results than diffusive repartitioning schemes. We also demonstrate that a coarse starting mesh produces high quality load balancing, at
Feature-preserving surface mesh smoothing via suboptimal Delaunay triangulation ☆
Gao, Zhanheng; Yu, Zeyun; Holst, Michael
2012-01-01
A method of triangular surface mesh smoothing is presented to improve angle quality by extending the original optimal Delaunay triangulation (ODT) to surface meshes. The mesh quality is improved by solving a quadratic optimization problem that minimizes the approximated interpolation error between a parabolic function and its piecewise linear interpolation defined on the mesh. A suboptimal problem is derived to guarantee a unique, analytic solution that is significantly faster with little loss in accuracy as compared to the optimal one. In addition to the quality-improving capability, the proposed method has been adapted to remove noise while faithfully preserving sharp features such as edges and corners of a mesh. Numerous experiments are included to demonstrate the performance of the method. PMID:23580890
On Dunkl angular momenta algebra
NASA Astrophysics Data System (ADS)
Feigin, Misha; Hakobyan, Tigran
2015-11-01
We consider the quantum angular momentum generators, deformed by means of the Dunkl operators. Together with the reflection operators they generate a subalgebra in the rational Cherednik algebra associated with a finite real reflection group. We find all the defining relations of the algebra, which appear to be quadratic, and we show that the algebra is of Poincaré-Birkhoff-Witt (PBW) type. We show that this algebra contains the angular part of the Calogero-Moser Hamiltonian and that together with constants it generates the centre of the algebra. We also consider the gl( N ) version of the subalge-bra of the rational Cherednik algebra and show that it is a non-homogeneous quadratic algebra of PBW type as well. In this case the central generator can be identified with the usual Calogero-Moser Hamiltonian associated with the Coxeter group in the harmonic confinement.
Improvements to the Unstructured Mesh Generator MESH3D
NASA Technical Reports Server (NTRS)
Thomas, Scott D.; Baker, Timothy J.; Cliff, Susan E.
1999-01-01
The AIRPLANE process starts with an aircraft geometry stored in a CAD system. The surface is modeled with a mesh of triangles and then the flow solver produces pressures at surface points which may be integrated to find forces and moments. The biggest advantage is that the grid generation bottleneck of the CFD process is eliminated when an unstructured tetrahedral mesh is used. MESH3D is the key to turning around the first analysis of a CAD geometry in days instead of weeks. The flow solver part of AIRPLANE has proven to be robust and accurate over a decade of use at NASA. It has been extensively validated with experimental data and compares well with other Euler flow solvers. AIRPLANE has been applied to all the HSR geometries treated at Ames over the course of the HSR program in order to verify the accuracy of other flow solvers. The unstructured approach makes handling complete and complex geometries very simple because only the surface of the aircraft needs to be discretized, i.e. covered with triangles. The volume mesh is created automatically by MESH3D. AIRPLANE runs well on multiple platforms. Vectorization on the Cray Y-MP is reasonable for a code that uses indirect addressing. Massively parallel computers such as the IBM SP2, SGI Origin 2000, and the Cray T3E have been used with an MPI version of the flow solver and the code scales very well on these systems. AIRPLANE can run on a desktop computer as well. AIRPLANE has a future. The unstructured technologies developed as part of the HSR program are now targeting high Reynolds number viscous flow simulation. The pacing item in this effort is Navier-Stokes mesh generation.
Yoon, Sung-Eui; Lindstrom, Peter; Pascucci, Valerio; Manocha, Dinesh
2005-07-01
We present a novel method for computing cache-oblivious layouts of large meshes that improve the performance of interactive visualization and geometric processing algorithms. Given that the mesh is accessed in a reasonably coherent manner, we assume no particular data access patterns or cache parameters of the memory hierarchy involved in the computation. Furthermore, our formulation extends directly to computing layouts of multi-resolution and bounding volume hierarchies of large meshes. We develop a simple and practical cache-oblivious metric for estimating cache misses. Computing a coherent mesh layout is reduced to a combinatorial optimization problem. We designed and implemented an out-of-core multilevel minimization algorithm and tested its performance on unstructured meshes composed of tens to hundreds of millions of triangles. Our layouts can significantly reduce the number of cache misses. We have observed 2-20 times speedups in view-dependent rendering, collision detection, and isocontour extraction without any modification of the algorithms or runtime applications.
Self-Organizing Mesh Generation
Energy Science and Technology Software Center (ESTSC)
1991-11-01
A set of five programs which make up a self organizing mesh generation package. QMESH generates meshes having quadrilateral elements on arbitrarily shaped two-dimensional (planar or axisymmetric) bodies. It is designed for use with two-dimensional finite element analysis applications. A flexible hierarchal input scheme is used to describe bodies to QMESH as collections of regions. A mesh for each region is developed independently, with the final assembly and bandwidth minimization performed by the independent program,more » RENUM or RENUM8. RENUM is applied when four-node elements are desired. Eight node elements (with mid side nodes) may be obtained with RENUM8. QPLOT and QPLOT8 are plot programs for meshes generated by the QMESH/RENUM and QMESH/RENUM8 program pairs respectively. QPLOT and QPLOT8 automatically section the mesh into appropriately-sized sections for legible display of node and element numbers, An overall plot showing the position of the selected plot areas is produced.« less
LayTracks3D: A new approach for meshing general solids using medial axis transform
Quadros, William Roshan
2015-08-22
This study presents an extension of the all-quad meshing algorithm called LayTracks to generate high quality hex-dominant meshes of general solids. LayTracks3D uses the mapping between the Medial Axis (MA) and the boundary of the 3D domain to decompose complex 3D domains into simpler domains called Tracks. Tracks in 3D have no branches and are symmetric, non-intersecting, orthogonal to the boundary, and the shortest path from the MA to the boundary. These properties of tracks result in desired meshes with near cube shape elements at the boundary, structured mesh along the boundary normal with any irregular nodes restricted to the MA, and sharp boundary feature preservation. The algorithm has been tested on a few industrial CAD models and hex-dominant meshes are shown in the Results section. Work is underway to extend LayTracks3D to generate all-hex meshes.
Marquette, Ian
2013-07-15
We introduce the most general quartic Poisson algebra generated by a second and a fourth order integral of motion of a 2D superintegrable classical system. We obtain the corresponding quartic (associative) algebra for the quantum analog, extend Daskaloyannis construction obtained in context of quadratic algebras, and also obtain the realizations as deformed oscillator algebras for this quartic algebra. We obtain the Casimir operator and discuss how these realizations allow to obtain the finite-dimensional unitary irreducible representations of quartic algebras and obtain algebraically the degenerate energy spectrum of superintegrable systems. We apply the construction and the formula obtained for the structure function on a superintegrable system related to type I Laguerre exceptional orthogonal polynomials introduced recently.
NASA Astrophysics Data System (ADS)
Dankova, T. S.; Rosensteel, G.
1998-10-01
Mean field theory has an unexpected group theoretic mathematical foundation. Instead of representation theory which applies to most group theoretic quantum models, Hartree-Fock and Hartree-Fock-Bogoliubov have been formulated in terms of coadjoint orbits for the groups U(n) and O(2n). The general theory of mean fields is formulated for an arbitrary Lie algebra L of fermion operators. The moment map provides the correspondence between the Hilbert space of microscopic wave functions and the dual space L^* of densities. The coadjoint orbits of the group in the dual space are phase spaces on which time-dependent mean field theory is equivalent to a classical Hamiltonian dynamical system. Indeed it forms a finite-dimensional Lax system. The mean field theories for the Elliott SU(3) and symplectic Sp(3,R) algebras are constructed explicitly in the coadjoint orbit framework.
Parallel automated adaptive procedures for unstructured meshes
NASA Technical Reports Server (NTRS)
Shephard, M. S.; Flaherty, J. E.; Decougny, H. L.; Ozturan, C.; Bottasso, C. L.; Beall, M. W.
1995-01-01
Consideration is given to the techniques required to support adaptive analysis of automatically generated unstructured meshes on distributed memory MIMD parallel computers. The key areas of new development are focused on the support of effective parallel computations when the structure of the numerical discretization, the mesh, is evolving, and in fact constructed, during the computation. All the procedures presented operate in parallel on already distributed mesh information. Starting from a mesh definition in terms of a topological hierarchy, techniques to support the distribution, redistribution and communication among the mesh entities over the processors is given, and algorithms to dynamically balance processor workload based on the migration of mesh entities are given. A procedure to automatically generate meshes in parallel, starting from CAD geometric models, is given. Parallel procedures to enrich the mesh through local mesh modifications are also given. Finally, the combination of these techniques to produce a parallel automated finite element analysis procedure for rotorcraft aerodynamics calculations is discussed and demonstrated.
ERIC Educational Resources Information Center
Beigie, Darin
2014-01-01
Most people who are attracted to STEM-related fields are drawn not by a desire to take mathematics tests but to create things. The opportunity to create an algebra drawing gives students a sense of ownership and adventure that taps into the same sort of energy that leads a young person to get lost in reading a good book, building with Legos®,…
2013-05-06
AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.
Vertex Algebras, Kac-Moody Algebras, and the Monster
NASA Astrophysics Data System (ADS)
Borcherds, Richard E.
1986-05-01
It is known that the adjoint representation of any Kac-Moody algebra A can be identified with a subquotient of a certain Fock space representation constructed from the root lattice of A. I define a product on the whole of the Fock space that restricts to the Lie algebra product on this subquotient. This product (together with a infinite number of other products) is constructed using a generalization of vertex operators. I also construct an integral form for the universal enveloping algebra of any Kac-Moody algebra that can be used to define Kac-Moody groups over finite fields, some new irreducible integrable representations, and a sort of affinization of any Kac-Moody algebra. The ``Moonshine'' representation of the Monster constructed by Frenkel and others also has products like the ones constructed for Kac-Moody algebras, one of which extends the Griess product on the 196884-dimensional piece to the whole representation.
Issues in adaptive mesh refinement
Dai, William Wenlong
2009-01-01
In this paper, we present an approach for a patch-based adaptive mesh refinement (AMR) for multi-physics simulations. The approach consists of clustering, symmetry preserving, mesh continuity, flux correction, communications, and management of patches. Among the special features of this patch-based AMR are symmetry preserving, efficiency of refinement, special implementation offlux correction, and patch management in parallel computing environments. Here, higher efficiency of refinement means less unnecessarily refined cells for a given set of cells to be refined. To demonstrate the capability of the AMR framework, hydrodynamics simulations with many levels of refinement are shown in both two- and three-dimensions.
NASA Astrophysics Data System (ADS)
Palmkvist, Jakob
2014-01-01
We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D - 2 - p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.
NASA Technical Reports Server (NTRS)
Cleaveland, Rance; Luettgen, Gerald; Natarajan, V.
1999-01-01
This paper surveys the semantic ramifications of extending traditional process algebras with notions of priority that allow for some transitions to be given precedence over others. These enriched formalisms allow one to model system features such as interrupts, prioritized choice, or real-time behavior. Approaches to priority in process algebras can be classified according to whether the induced notion of preemption on transitions is global or local and whether priorities are static or dynamic. Early work in the area concentrated on global pre-emption and static priorities and led to formalisms for modeling interrupts and aspects of real-time, such as maximal progress, in centralized computing environments. More recent research has investigated localized notions of pre-emption in which the distribution of systems is taken into account, as well as dynamic priority approaches, i.e., those where priority values may change as systems evolve. The latter allows one to model behavioral phenomena such as scheduling algorithms and also enables the efficient encoding of real-time semantics. Technically, this paper studies the different models of priorities by presenting extensions of Milner's Calculus of Communicating Systems (CCS) with static and dynamic priority as well as with notions of global and local pre- emption. In each case the operational semantics of CCS is modified appropriately, behavioral theories based on strong and weak bisimulation are given, and related approaches for different process-algebraic settings are discussed.
Palmkvist, Jakob
2014-01-15
We introduce an infinite-dimensional Lie superalgebra which is an extension of the U-duality Lie algebra of maximal supergravity in D dimensions, for 3 ⩽ D ⩽ 7. The level decomposition with respect to the U-duality Lie algebra gives exactly the tensor hierarchy of representations that arises in gauge deformations of the theory described by an embedding tensor, for all positive levels p. We prove that these representations are always contained in those coming from the associated Borcherds-Kac-Moody superalgebra, and we explain why some of the latter representations are not included in the tensor hierarchy. The most remarkable feature of our Lie superalgebra is that it does not admit a triangular decomposition like a (Borcherds-)Kac-Moody (super)algebra. Instead the Hodge duality relations between level p and D − 2 − p extend to negative p, relating the representations at the first two negative levels to the supersymmetry and closure constraints of the embedding tensor.
NASA Astrophysics Data System (ADS)
Mohamed, Mamdouh S.; Hirani, Anil N.; Samtaney, Ravi
2016-05-01
A conservative discretization of incompressible Navier-Stokes equations is developed based on discrete exterior calculus (DEC). A distinguishing feature of our method is the use of an algebraic discretization of the interior product operator and a combinatorial discretization of the wedge product. The governing equations are first rewritten using the exterior calculus notation, replacing vector calculus differential operators by the exterior derivative, Hodge star and wedge product operators. The discretization is then carried out by substituting with the corresponding discrete operators based on the DEC framework. Numerical experiments for flows over surfaces reveal a second order accuracy for the developed scheme when using structured-triangular meshes, and first order accuracy for otherwise unstructured meshes. By construction, the method is conservative in that both mass and vorticity are conserved up to machine precision. The relative error in kinetic energy for inviscid flow test cases converges in a second order fashion with both the mesh size and the time step.
Novel biomedical tetrahedral mesh methods: algorithms and applications
NASA Astrophysics Data System (ADS)
Yu, Xiao; Jin, Yanfeng; Chen, Weitao; Huang, Pengfei; Gu, Lixu
2007-12-01
Tetrahedral mesh generation algorithm, as a prerequisite of many soft tissue simulation methods, becomes very important in the virtual surgery programs because of the real-time requirement. Aiming to speed up the computation in the simulation, we propose a revised Delaunay algorithm which makes a good balance of quality of tetrahedra, boundary preservation and time complexity, with many improved methods. Another mesh algorithm named Space-Disassembling is also presented in this paper, and a comparison of Space-Disassembling, traditional Delaunay algorithm and the revised Delaunay algorithm is processed based on clinical soft-tissue simulation projects, including craniofacial plastic surgery and breast reconstruction plastic surgery.
Mesh-on-lead anodes for copper electrowinning
NASA Astrophysics Data System (ADS)
Moats, Michael; Hardee, Kenneth; Brown, Carl
2003-07-01
ELTECH System Corporation has developed and patented a Mesh-on-Lead™ (MOL™) (Mesh-on-Lead and MOL are trademarks of ELTECH Systems Corporation) anode for primary copper electrowinning operations. Over the past five years, ELTECH has demonstrated the MOL concept with full-scale anodes at several premier commercial tankhouses. During these demonstrations MOL anodes exhibited numerous performance advantages relative to standard Pb-Ca-Sn anodes, including reduced power consumption due to lower oxygen evolution over-potential, improved cathode quality, minimized lead sludge generation, eliminated cobalt addition as a result of stabilized lead substrate, and improved current efficiency due to reduced short circuiting.
Compactly Generated de Morgan Lattices, Basic Algebras and Effect Algebras
NASA Astrophysics Data System (ADS)
Paseka, Jan; Riečanová, Zdenka
2010-12-01
We prove that a de Morgan lattice is compactly generated if and only if its order topology is compatible with a uniformity on L generated by some separating function family on L. Moreover, if L is complete then L is (o)-topological. Further, if a basic algebra L (hence lattice with sectional antitone involutions) is compactly generated then L is atomic. Thus all non-atomic Boolean algebras as well as non-atomic lattice effect algebras (including non-atomic MV-algebras and orthomodular lattices) are not compactly generated.
Locally finite dimensional Lie algebras
NASA Astrophysics Data System (ADS)
Hennig, Johanna
We prove that in a locally finite dimensional Lie algebra L, any maximal, locally solvable subalgebra is the stabilizer of a maximal, generalized flag in an integrable, faithful module over L. Then we prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic p which give sufficient conditions for the algebras to be of the form [K(R, *), K( R, *)] / (Z(R) ∩ [ K(R, *), K(R, *)]) for a simple, locally finite dimensional associative algebra R with involution *. Lastly, we explore the noncommutative geometry of locally simple representations of the diagonal locally finite Lie algebras sl(ninfinity), o( ninfinity), and sp(n infinity).
Quantum computation using geometric algebra
NASA Astrophysics Data System (ADS)
Matzke, Douglas James
This dissertation reports that arbitrary Boolean logic equations and operators can be represented in geometric algebra as linear equations composed entirely of orthonormal vectors using only addition and multiplication Geometric algebra is a topologically based algebraic system that naturally incorporates the inner and anticommutative outer products into a real valued geometric product, yet does not rely on complex numbers or matrices. A series of custom tools was designed and built to simplify geometric algebra expressions into a standard sum of products form, and automate the anticommutative geometric product and operations. Using this infrastructure, quantum bits (qubits), quantum registers and EPR-bits (ebits) are expressed symmetrically as geometric algebra expressions. Many known quantum computing gates, measurement operators, and especially the Bell/magic operators are also expressed as geometric products. These results demonstrate that geometric algebra can naturally and faithfully represent the central concepts, objects, and operators necessary for quantum computing, and can facilitate the design and construction of quantum computing tools.
Verburgt, Lukas M
2016-01-01
This paper provides a detailed account of the period of the complex history of British algebra and geometry between the publication of George Peacock's Treatise on Algebra in 1830 and William Rowan Hamilton's paper on quaternions of 1843. During these years, Duncan Farquharson Gregory and William Walton published several contributions on 'algebraical geometry' and 'geometrical algebra' in the Cambridge Mathematical Journal. These contributions enabled them not only to generalize Peacock's symbolical algebra on the basis of geometrical considerations, but also to initiate the attempts to question the status of Euclidean space as the arbiter of valid geometrical interpretations. At the same time, Gregory and Walton were bound by the limits of symbolical algebra that they themselves made explicit; their work was not and could not be the 'abstract algebra' and 'abstract geometry' of figures such as Hamilton and Cayley. The central argument of the paper is that an understanding of the contributions to 'algebraical geometry' and 'geometrical algebra' of the second generation of 'scientific' symbolical algebraists is essential for a satisfactory explanation of the radical transition from symbolical to abstract algebra that took place in British mathematics in the 1830s-1840s. PMID:26806075
On the cohomology of Leibniz conformal algebras
NASA Astrophysics Data System (ADS)
Zhang, Jiao
2015-04-01
We construct a new cohomology complex of Leibniz conformal algebras with coefficients in a representation instead of a module. The low-dimensional cohomology groups of this complex are computed. Meanwhile, we construct a Leibniz algebra from a Leibniz conformal algebra and prove that the category of Leibniz conformal algebras is equivalent to the category of equivalence classes of formal distribution Leibniz algebras.
Assessing Algebraic Solving Ability: A Theoretical Framework
ERIC Educational Resources Information Center
Lian, Lim Hooi; Yew, Wun Thiam
2012-01-01
Algebraic solving ability had been discussed by many educators and researchers. There exists no definite definition for algebraic solving ability as it can be viewed from different perspectives. In this paper, the nature of algebraic solving ability in terms of algebraic processes that demonstrate the ability in solving algebraic problem is…
NASA Astrophysics Data System (ADS)
Slattery, Stuart R.
2016-02-01
In this paper we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. These scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.
Slattery, Stuart R.
2015-12-02
In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothnessmore » and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.« less
Slattery, Stuart R.
2015-12-02
In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.
Hybrid mesh for nasal airflow studies.
Zubair, Mohammed; Abdullah, Mohammed Zulkifly; Ahmad, Kamarul Arifin
2013-01-01
The accuracy of the numerical result is closely related to mesh density as well as its distribution. Mesh plays a very significant role in the outcome of numerical simulation. Many nasal airflow studies have employed unstructured mesh and more recently hybrid mesh scheme has been utilized considering the complexity of anatomical architecture. The objective of this study is to compare the results of hybrid mesh with unstructured mesh and study its effect on the flow parameters inside the nasal cavity. A three-dimensional nasal cavity model is reconstructed based on computed tomographic images of a healthy Malaysian adult nose. Navier-Stokes equation for steady airflow is solved numerically to examine inspiratory nasal flow. The pressure drop obtained using the unstructured computational grid is about 22.6 Pa for a flow rate of 20 L/min, whereas the hybrid mesh resulted in 17.8 Pa for the same flow rate. The maximum velocity obtained at the nasal valve using unstructured grid is 4.18 m/s and that with hybrid mesh is around 4.76 m/s. Hybrid mesh reported lower grid convergence index (GCI) than the unstructured mesh. Significant differences between unstructured mesh and hybrid mesh are determined highlighting the usefulness of hybrid mesh for nasal airflow studies. PMID:23983811
Hybrid Mesh for Nasal Airflow Studies
Zubair, Mohammed; Abdullah, Mohammed Zulkifly; Ahmad, Kamarul Arifin
2013-01-01
The accuracy of the numerical result is closely related to mesh density as well as its distribution. Mesh plays a very significant role in the outcome of numerical simulation. Many nasal airflow studies have employed unstructured mesh and more recently hybrid mesh scheme has been utilized considering the complexity of anatomical architecture. The objective of this study is to compare the results of hybrid mesh with unstructured mesh and study its effect on the flow parameters inside the nasal cavity. A three-dimensional nasal cavity model is reconstructed based on computed tomographic images of a healthy Malaysian adult nose. Navier-Stokes equation for steady airflow is solved numerically to examine inspiratory nasal flow. The pressure drop obtained using the unstructured computational grid is about 22.6 Pa for a flow rate of 20 L/min, whereas the hybrid mesh resulted in 17.8 Pa for the same flow rate. The maximum velocity obtained at the nasal valve using unstructured grid is 4.18 m/s and that with hybrid mesh is around 4.76 m/s. Hybrid mesh reported lower grid convergence index (GCI) than the unstructured mesh. Significant differences between unstructured mesh and hybrid mesh are determined highlighting the usefulness of hybrid mesh for nasal airflow studies. PMID:23983811
NASA Astrophysics Data System (ADS)
Pitenis, Angela; Uruena, Juan Manuel; Schulze, Kyle D.; Cooper, Andrew C.; Angelini, Thomas E.; Sawyer, W. Gregory
Soft, permeable sliding interfaces in aqueous environments are ubiquitous in nature but their ability to maintain high lubricity in a poor lubricant (water) has not been well understood. Hydrogels are excellent materials for fundamental soft matter and biotribology studies due to their high water content. While mesh size controls the material and transport properties of a hydrogel, its effects on friction were only recently explored. Polyacrylamide hydrogels slid in a Gemini (self-mated) interface produced low friction under low speeds, low pressures, macroscopic contact areas, and room temperature aqueous environments. The friction coefficients at these interfaces are lowest at low speeds and are speed-independent. This behavior is due to thermal fluctuations at the interface separating the surfaces, with water shearing in this region being the main source of dissipation. We found that mesh size had an inverse correlation with friction. We further investigated a transition from this behavior at higher speeds, and found that the transition speed correlated with the mesh size and relaxation time of the polymer network. Very soft and correspondingly large mesh size Gemini hydrogels show superlubricity under specific conditions with friction being less than 0.005.
Multigrid for refined triangle meshes
Shapira, Yair
1997-02-01
A two-level preconditioning method for the solution of (locally) refined finite element schemes using triangle meshes is introduced. In the isotropic SPD case, it is shown that the condition number of the preconditioned stiffness matrix is bounded uniformly for all sufficiently regular triangulations. This is also verified numerically for an isotropic diffusion problem with highly discontinuous coefficients.
ERIC Educational Resources Information Center
Novotna, Jarmila; Hoch, Maureen
2008-01-01
Many students have difficulties with basic algebraic concepts at high school and at university. In this paper two levels of algebraic structure sense are defined: for high school algebra and for university algebra. We suggest that high school algebra structure sense components are sub-components of some university algebra structure sense…
Higher level twisted Zhu algebras
Ekeren, Jethro van
2011-05-15
The study of twisted representations of graded vertex algebras is important for understanding orbifold models in conformal field theory. In this paper, we consider the general setup of a vertex algebra V, graded by {Gamma}/Z for some subgroup {Gamma} of R containing Z, and with a Hamiltonian operator H having real (but not necessarily integer) eigenvalues. We construct the directed system of twisted level p Zhu algebras Zhu{sub p,{Gamma}}(V), and we prove the following theorems: For each p, there is a bijection between the irreducible Zhu{sub p,{Gamma}}(V)-modules and the irreducible {Gamma}-twisted positive energy V-modules, and V is ({Gamma}, H)-rational if and only if all its Zhu algebras Zhu{sub p,{Gamma}}(V) are finite dimensional and semisimple. The main novelty is the removal of the assumption of integer eigenvalues for H. We provide an explicit description of the level p Zhu algebras of a universal enveloping vertex algebra, in particular of the Virasoro vertex algebra Vir{sup c} and the universal affine Kac-Moody vertex algebra V{sup k}(g) at non-critical level. We also compute the inverse limits of these directed systems of algebras.
Mesh generation from 3D multi-material images.
Boltcheva, Dobrina; Yvinec, Mariette; Boissonnat, Jean-Daniel
2009-01-01
The problem of generating realistic computer models of objects represented by 3D segmented images is important in many biomedical applications. Labelled 3D images impose particular challenges for meshing algorithms because multi-material junctions form features such as surface pacthes, edges and corners which need to be preserved into the output mesh. In this paper, we propose a feature preserving Delaunay refinement algorithm which can be used to generate high-quality tetrahedral meshes from segmented images. The idea is to explicitly sample corners and edges from the input image and to constrain the Delaunay refinement algorithm to preserve these features in addition to the surface patches. Our experimental results on segmented medical images have shown that, within a few seconds, the algorithm outputs a tetrahedral mesh in which each material is represented as a consistent submesh without gaps and overlaps. The optimization property of the Delaunay triangulation makes these meshes suitable for the purpose of realistic visualization or finite element simulations. PMID:20426123
Optimizing the geometrical accuracy of curvilinear meshes
NASA Astrophysics Data System (ADS)
Toulorge, Thomas; Lambrechts, Jonathan; Remacle, Jean-François
2016-04-01
This paper presents a method to generate valid high order meshes with optimized geometrical accuracy. The high order meshing procedure starts with a linear mesh, that is subsequently curved without taking care of the validity of the high order elements. An optimization procedure is then used to both untangle invalid elements and optimize the geometrical accuracy of the mesh. Standard measures of the distance between curves are considered to evaluate the geometrical accuracy in planar two-dimensional meshes, but they prove computationally too costly for optimization purposes. A fast estimate of the geometrical accuracy, based on Taylor expansions of the curves, is introduced. An unconstrained optimization procedure based on this estimate is shown to yield significant improvements in the geometrical accuracy of high order meshes, as measured by the standard Hausdorff distance between the geometrical model and the mesh. Several examples illustrate the beneficial impact of this method on CFD solutions, with a particular role of the enhanced mesh boundary smoothness.
Handheld Computer Algebra Systems in the Pre-Algebra Classroom
ERIC Educational Resources Information Center
Gantz, Linda Ann Galofaro
2010-01-01
This mixed method analysis sought to investigate several aspects of student learning in pre-algebra through the use of computer algebra systems (CAS) as opposed to non-CAS learning. This research was broken into two main parts, one which compared results from both the experimental group (instruction using CAS, N = 18) and the control group…
Abstract Algebra to Secondary School Algebra: Building Bridges
ERIC Educational Resources Information Center
Christy, Donna; Sparks, Rebecca
2015-01-01
The authors have experience with secondary mathematics teacher candidates struggling to make connections between the theoretical abstract algebra course they take as college students and the algebra they will be teaching in secondary schools. As a mathematician and a mathematics educator, the authors collaborated to create and implement a…
Algebra and Algebraic Thinking in School Math: 70th YB
ERIC Educational Resources Information Center
National Council of Teachers of Mathematics, 2008
2008-01-01
Algebra is no longer just for college-bound students. After a widespread push by the National Council of Teachers of Mathematics (NCTM) and teachers across the country, algebra is now a required part of most curricula. However, students' standardized test scores are not at the level they should be. NCTM's seventieth yearbook takes a look at the…
Users manual for Opt-MS : local methods for simplicial mesh smoothing and untangling.
Freitag, L.
1999-07-20
Creating meshes containing good-quality elements is a challenging, yet critical, problem facing computational scientists today. Several researchers have shown that the size of the mesh, the shape of the elements within that mesh, and their relationship to the physical application of interest can profoundly affect the efficiency and accuracy of many numerical approximation techniques. If the application contains anisotropic physics, the mesh can be improved by considering both local characteristics of the approximate application solution and the geometry of the computational domain. If the application is isotropic, regularly shaped elements in the mesh reduce the discretization error, and the mesh can be improved a priori by considering geometric criteria only. The Opt-MS package provides several local node point smoothing techniques that improve elements in the mesh by adjusting grid point location using geometric, criteria. The package is easy to use; only three subroutine calls are required for the user to begin using the software. The package is also flexible; the user may change the technique, function, or dimension of the problem at any time during the mesh smoothing process. Opt-MS is designed to interface with C and C++ codes, ad examples for both two-and three-dimensional meshes are provided.
Lober, R.R.; Tautges, T.J.; Vaughan, C.T.
1997-03-01
Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement.
Philip, Bobby; Chartier, Dr Timothy
2012-01-01
methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.
Statecharts Via Process Algebra
NASA Technical Reports Server (NTRS)
Luttgen, Gerald; vonderBeeck, Michael; Cleaveland, Rance
1999-01-01
Statecharts is a visual language for specifying the behavior of reactive systems. The Language extends finite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded system, precisely defining its semantics has proved extremely challenging. In this paper, a simple process algebra, called Statecharts Process Language (SPL), is presented, which is expressive enough for encoding Statecharts in a structure-preserving and semantic preserving manner. It is establish that the behavioral relation bisimulation, when applied to SPL, preserves Statecharts semantics
Energy Science and Technology Software Center (ESTSC)
2013-05-06
AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumpsmore » and an anisotropy in one part.« less
Conservation properties of unstructured staggered mesh schemes
Perot, B.
2000-03-20
Classic Cartesian staggered mesh schemes have a number of attractive properties. They do not display spurious pressure modes and they have been shown to locally conserve, mass, momentum, kinetic energy, and circulation to machine precision. Recently, a number of generalizations of the staggered mesh approach have been proposed for unstructured (triangular or tetrahedral) meshes. These unstructured staggered mesh methods have been created to retain the attractive pressure aspects and mass conservation properties of the classic Cartesian mesh method. This work addresses the momentum, kinetic energy, and circulation conservation properties of unstructured staggered mesh methods. It is shown that with certain choices of the velocity interpolation, unstructured staggered mesh discretization of the divergence form of the Navier-Stokes equations can conserve kinetic energy and momentum both locally and globally. In addition, it is shown that unstructured staggered mesh discretization of the rotational form of the Navier-Stokes equations can conserve kinetic energy and circulation both locally and globally. The analysis includes viscous terms and a generalization of the concept of conservation in the presence of viscosity to include a negative definite dissipation term in the kinetic energy equation. These novel conserving unstructured staggered mesh schemes have not been previously analyzed. It is shown that they are first-order accurate on nonuniform two-dimensional unstructured meshes and second-order accurate on uniform unstructured meshes. Numerical confirmation of the conservation properties and the order of accuracy of these unstructured staggered mesh methods is presented.
Hybrid mesh generation using advancing reduction technique
Technology Transfer Automated Retrieval System (TEKTRAN)
This study presents an extension of the application of the advancing reduction technique to the hybrid mesh generation. The proposed algorithm is based on a pre-generated rectangle mesh (RM) with a certain orientation. The intersection points between the two sets of perpendicular mesh lines in RM an...
Computing The Compliances Of Gear Meshes
NASA Technical Reports Server (NTRS)
Lewicki, D. G.; Savage, M.; Caldwell, R. J.; Wisor, G. D.
1988-01-01
Computer model simulates compliance and sharing of loads in spur-gear mesh. Use of solid-body analysis as lower bound and rim analysis as upper bound for mesh compliance, reasonable approximations obtained for compliance in spur-gear mesh.
An Automatic 3D Mesh Generation Method for Domains with Multiple Materials.
Zhang, Yongjie; Hughes, Thomas J R; Bajaj, Chandrajit L
2010-01-01
This paper describes an automatic and efficient approach to construct unstructured tetrahedral and hexahedral meshes for a composite domain made up of heterogeneous materials. The boundaries of these material regions form non-manifold surfaces. In earlier papers, we developed an octree-based isocontouring method to construct unstructured 3D meshes for a single-material (homogeneous) domain with manifold boundary. In this paper, we introduce the notion of a material change edge and use it to identify the interface between two or several different materials. A novel method to calculate the minimizer point for a cell shared by more than two materials is provided, which forms a non-manifold node on the boundary. We then mesh all the material regions simultaneously and automatically while conforming to their boundaries directly from volumetric data. Both material change edges and interior edges are analyzed to construct tetrahedral meshes, and interior grid points are analyzed for proper hexahedral mesh construction. Finally, edge-contraction and smoothing methods are used to improve the quality of tetrahedral meshes, and a combination of pillowing, geometric flow and optimization techniques is used for hexahedral mesh quality improvement. The shrink set of pillowing schemes is defined automatically as the boundary of each material region. Several application results of our multi-material mesh generation method are also provided. PMID:20161555
The Algebra of Complex Numbers.
ERIC Educational Resources Information Center
LePage, Wilbur R.
This programed text is an introduction to the algebra of complex numbers for engineering students, particularly because of its relevance to important problems of applications in electrical engineering. It is designed for a person who is well experienced with the algebra of real numbers and calculus, but who has no experience with complex number…
Algebraic Squares: Complete and Incomplete.
ERIC Educational Resources Information Center
Gardella, Francis J.
2000-01-01
Illustrates ways of using algebra tiles to give students a visual model of competing squares that appear in algebra as well as in higher mathematics. Such visual representations give substance to the symbolic manipulation and give students who do not learn symbolically a way of understanding the underlying concepts of completing the square. (KHR)
ERIC Educational Resources Information Center
Buerman, Margaret
2007-01-01
Finding real-world examples for middle school algebra classes can be difficult but not impossible. As we strive to accomplish teaching our students how to solve and graph equations, we neglect to teach the big ideas of algebra. One of those big ideas is functions. This article gives three examples of functions that are found in Arches National…
Online Algebraic Tools for Teaching
ERIC Educational Resources Information Center
Kurz, Terri L.
2011-01-01
Many free online tools exist to complement algebraic instruction at the middle school level. This article presents findings that analyzed the features of algebraic tools to support learning. The findings can help teachers select appropriate tools to facilitate specific topics. (Contains 1 table and 4 figures.)
Condensing Algebra for Technical Mathematics.
ERIC Educational Resources Information Center
Greenfield, Donald R.
Twenty Algebra-Packets (A-PAKS) were developed by the investigator for technical education students at the community college level. Each packet contained a statement of rationale, learning objectives, performance activities, performance test, and performance test answer key. The A-PAKS condensed the usual sixteen weeks of algebra into a six-week…
Algebraic Thinking in Adult Education
ERIC Educational Resources Information Center
Manly, Myrna; Ginsburg, Lynda
2010-01-01
In adult education, algebraic thinking can be a sense-making tool that introduces coherence among mathematical concepts for those who previously have had trouble learning math. Further, a modeling approach to algebra connects mathematics and the real world, demonstrating the usefulness of math to those who have seen it as just an academic…
Linear Algebra and Image Processing
ERIC Educational Resources Information Center
Allali, Mohamed
2010-01-01
We use the computing technology digital image processing (DIP) to enhance the teaching of linear algebra so as to make the course more visual and interesting. Certainly, this visual approach by using technology to link linear algebra to DIP is interesting and unexpected to both students as well as many faculty. (Contains 2 tables and 11 figures.)
ERIC Educational Resources Information Center
Instructional Objectives Exchange, Los Angeles, CA.
A complete set of behavioral objectives for first-year algebra taught in any of grades 8 through 12 is presented. Three to six sample test items and answers are provided for each objective. Objectives were determined by surveying the most used secondary school algebra textbooks. Fourteen major categories are included: (1) whole numbers--operations…
Exploring Algebraic Patterns through Literature.
ERIC Educational Resources Information Center
Austin, Richard A.; Thompson, Denisse R.
1997-01-01
Presents methods for using literature to develop algebraic thinking in an environment that connects algebra to various situations. Activities are based on the book "Anno's Magic Seeds" with additional resources listed. Students express a constant function, exponential function, and a recursive function in their own words as well as writing about…
Learning Algebra from Worked Examples
ERIC Educational Resources Information Center
Lange, Karin E.; Booth, Julie L.; Newton, Kristie J.
2014-01-01
For students to be successful in algebra, they must have a truly conceptual understanding of key algebraic features as well as the procedural skills to complete a problem. One strategy to correct students' misconceptions combines the use of worked example problems in the classroom with student self-explanation. "Self-explanation" is…
Thermodynamics. [algebraic structure
NASA Technical Reports Server (NTRS)
Zeleznik, F. J.
1976-01-01
The fundamental structure of thermodynamics is purely algebraic, in the sense of atopological, and it is also independent of partitions, composite systems, the zeroth law, and entropy. The algebraic structure requires the notion of heat, but not the first law. It contains a precise definition of entropy and identifies it as a purely mathematical concept. It also permits the construction of an entropy function from heat measurements alone when appropriate conditions are satisfied. Topology is required only for a discussion of the continuity of thermodynamic properties, and then the weak topology is the relevant topology. The integrability of the differential form of the first law can be examined independently of Caratheodory's theorem and his inaccessibility axiom. Criteria are established by which one can determine when an integrating factor can be made intensive and the pseudopotential extensive and also an entropy. Finally, a realization of the first law is constructed which is suitable for all systems whether they are solids or fluids, whether they do or do not exhibit chemical reactions, and whether electromagnetic fields are or are not present.
2010-01-01
Background Randomised controlled trials with a long term follow-up (3 to 10 years) have demonstrated that mesh repair is superior to suture closure of incisional hernia with lower recurrence rates (5 to 20% versus 20 to 63%). Yet, the ideal size and material of the mesh are not defined. So far, there are few prospective studies that evaluate the influence of the mesh texture on patient's satisfaction, recurrence and complication rate. The aim of this study is to evaluate, if a non-absorbable mesh (Optilene® Mesh Elastic) will result in better health outcomes compared to a partly absorbable mesh (Ultrapro® Mesh). Methods/Design In this prospective, randomised, double blind study, eighty patients with incisional hernia after a midline laparotomy will be included. Primary objective of this study is to investigate differences in the physical functioning score from the SF-36 questionnaire 21 days after mesh insertion. Secondary objectives include the evaluation of the patients' daily activity, pain, wound complication and other surgical complications (hematomas, seromas), and safety within six months after intervention. Discussion This study investigates mainly from the patient perspective differences between meshes for treatment of incisional hernias. Whether partly absorbable meshes improve quality of life better than non-absorbable meshes is unclear and therefore, this trial will generate further evidence for a better treatment of patients. Trial registration NCT00646334 PMID:20624273
Confined helium on Lagrange meshes.
Baye, D; Dohet-Eraly, J
2015-12-21
The Lagrange-mesh method has the simplicity of a calculation on a mesh and can have the accuracy of a variational method. It is applied to the study of a confined helium atom. Two types of confinement are considered. Soft confinements by potentials are studied in perimetric coordinates. Hard confinement in impenetrable spherical cavities is studied in a system of rescaled perimetric coordinates varying in [0,1] intervals. Energies and mean values of the distances between electrons and between an electron and the helium nucleus are calculated. A high accuracy of 11 to 15 significant figures is obtained with small computing times. Pressures acting on the confined atom are also computed. For sphere radii smaller than 1, their relative accuracies are better than 10(-10). For larger radii up to 10, they progressively decrease to 10(-3), still improving the best literature results. PMID:25732054
The moving mesh code SHADOWFAX
NASA Astrophysics Data System (ADS)
Vandenbroucke, B.; De Rijcke, S.
2016-07-01
We introduce the moving mesh code SHADOWFAX, which can be used to evolve a mixture of gas, subject to the laws of hydrodynamics and gravity, and any collisionless fluid only subject to gravity, such as cold dark matter or stars. The code is written in C++ and its source code is made available to the scientific community under the GNU Affero General Public Licence. We outline the algorithm and the design of our implementation, and demonstrate its validity through the results of a set of basic test problems, which are also part of the public version. We also compare SHADOWFAX with a number of other publicly available codes using different hydrodynamical integration schemes, illustrating the advantages and disadvantages of the moving mesh technique.
Implicit solvers for unstructured meshes
NASA Technical Reports Server (NTRS)
Venkatakrishnan, V.; Mavriplis, Dimitri J.
1991-01-01
Implicit methods were developed and tested for unstructured mesh computations. The approximate system which arises from the Newton linearization of the nonlinear evolution operator is solved by using the preconditioned GMRES (Generalized Minimum Residual) technique. Three different preconditioners were studied, namely, the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over relaxation (SSOR). The preconditioners were optimized to have good vectorization properties. SSOR and ILU were also studied as iterative schemes. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also studied. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.
Progressive Compression of Volumetric Subdivision Meshes
Laney, D; Pascucci, V
2004-04-16
We present a progressive compression technique for volumetric subdivision meshes based on the slow growing refinement algorithm. The system is comprised of a wavelet transform followed by a progressive encoding of the resulting wavelet coefficients. We compare the efficiency of two wavelet transforms. The first transform is based on the smoothing rules used in the slow growing subdivision technique. The second transform is a generalization of lifted linear B-spline wavelets to the same multi-tier refinement structure. Direct coupling with a hierarchical coder produces progressive bit streams. Rate distortion metrics are evaluated for both wavelet transforms. We tested the practical performance of the scheme on synthetic data as well as data from laser indirect-drive fusion simulations with multiple fields per vertex. Both wavelet transforms result in high quality trade off curves and produce qualitatively good coarse representations.
Invariants of triangular Lie algebras
NASA Astrophysics Data System (ADS)
Boyko, Vyacheslav; Patera, Jiri; Popovych, Roman
2007-07-01
Triangular Lie algebras are the Lie algebras which can be faithfully represented by triangular matrices of any finite size over the real/complex number field. In the paper invariants ('generalized Casimir operators') are found for three classes of Lie algebras, namely those which are either strictly or non-strictly triangular, and for so-called special upper triangular Lie algebras. Algebraic algorithm of Boyko et al (2006 J. Phys. A: Math. Gen.39 5749 (Preprint math-ph/0602046)), developed further in Boyko et al (2007 J. Phys. A: Math. Theor.40 113 (Preprint math-ph/0606045)), is used to determine the invariants. A conjecture of Tremblay and Winternitz (2001 J. Phys. A: Math. Gen.34 9085), concerning the number of independent invariants and their form, is corroborated.
Unstructured mesh algorithms for aerodynamic calculations
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1992-01-01
The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.
Adaptive Mesh Refinement in CTH
Crawford, David
1999-05-04
This paper reports progress on implementing a new capability of adaptive mesh refinement into the Eulerian multimaterial shock- physics code CTH. The adaptivity is block-based with refinement and unrefinement occurring in an isotropic 2:1 manner. The code is designed to run on serial, multiprocessor and massive parallel platforms. An approximate factor of three in memory and performance improvements over comparable resolution non-adaptive calculations has-been demonstrated for a number of problems.
Mesh networked unattended ground sensors
NASA Astrophysics Data System (ADS)
Colling, Kent; Calcutt, Wade; Winston, Mark; Jones, Barry
2006-05-01
McQ has developed a family of low cost unattended ground sensors that utilize self-configured, mesh network communications for wireless sensing. Intended for use in an urban environment, the area monitored by the sensor system poses a communication challenge. A discussion into the sensor's communication performance and how it affects sensor installation and the operation of the system once deployed is presented.
A Schematic-Theoretic View of Problem Solving and Development of Algebraic Thinking
ERIC Educational Resources Information Center
Steele, Diana F.; Johanning, Debra I.
2004-01-01
This study explored the problem-solving schemas developed by 7th-grade pre-algebra students as they participated in a teaching experiment that was designed to help students develop effective schemas for solving algebraic problem situations involving contexts of (1) growth and change and (2) size and shape. This article describes the qualities and…
SHARP/PRONGHORN Interoperability: Mesh Generation
Avery Bingham; Javier Ortensi
2012-09-01
Progress toward collaboration between the SHARP and MOOSE computational frameworks has been demonstrated through sharing of mesh generation and ensuring mesh compatibility of both tools with MeshKit. MeshKit was used to build a three-dimensional, full-core very high temperature reactor (VHTR) reactor geometry with 120-degree symmetry, which was used to solve a neutron diffusion critical eigenvalue problem in PRONGHORN. PRONGHORN is an application of MOOSE that is capable of solving coupled neutron diffusion, heat conduction, and homogenized flow problems. The results were compared to a solution found on a 120-degree, reflected, three-dimensional VHTR mesh geometry generated by PRONGHORN. The ability to exchange compatible mesh geometries between the two codes is instrumental for future collaboration and interoperability. The results were found to be in good agreement between the two meshes, thus demonstrating the compatibility of the SHARP and MOOSE frameworks. This outcome makes future collaboration possible.
Automatic Mesh Coarsening for Discrete Ordinates Codes
Turner, Scott A.
1999-03-11
This paper describes the use of a ''mesh potential'' function for automatic coarsening of meshes in discrete ordinates neutral particle transport codes. For many transport calculations, a user may find it helpful to have the code determine a ''good'' neutronics mesh. The complexity of a problem involving millions of mesh cells, dozens of materials, and many energy groups makes it difficult to determine an adequate level of mesh refinement with a minimum number of cells. A method has been implemented in PARTISN (Parallel Time-dependent SN) to calculate a ''mesh potential'' in each original cell of a problem, and use this information to determine the maximum coarseness allowed in the mesh while maintaining accuracy in the solution. Results are presented for a simple x-y-z fuel/control/reflector problem.
Bioprosthetic Mesh in Abdominal Wall Reconstruction
Baumann, Donald P.; Butler, Charles E.
2012-01-01
Mesh materials have undergone a considerable evolution over the last several decades. There has been enhancement of biomechanical properties, improvement in manufacturing processes, and development of antiadhesive laminate synthetic meshes. The evolution of bioprosthetic mesh materials has markedly changed our indications and methods for complex abdominal wall reconstruction. The authors review the optimal properties of bioprosthetic mesh materials, their evolution over time, and their indications for use. The techniques to optimize outcomes are described using bioprosthetic mesh for complex abdominal wall reconstruction. Bioprosthetic mesh materials clearly have certain advantages over other implantable mesh materials in select indications. Appropriate patient selection and surgical technique are critical to the successful use of bioprosthetic materials for abdominal wall repair. PMID:23372454
Parallelization of irregularly coupled regular meshes
NASA Technical Reports Server (NTRS)
Chase, Craig; Crowley, Kay; Saltz, Joel; Reeves, Anthony
1992-01-01
Regular meshes are frequently used for modeling physical phenomena on both serial and parallel computers. One advantage of regular meshes is that efficient discretization schemes can be implemented in a straight forward manner. However, geometrically-complex objects, such as aircraft, cannot be easily described using a single regular mesh. Multiple interacting regular meshes are frequently used to describe complex geometries. Each mesh models a subregion of the physical domain. The meshes, or subdomains, can be processed in parallel, with periodic updates carried out to move information between the coupled meshes. In many cases, there are a relatively small number (one to a few dozen) subdomains, so that each subdomain may also be partitioned among several processors. We outline a composite run-time/compile-time approach for supporting these problems efficiently on distributed-memory machines. These methods are described in the context of a multiblock fluid dynamics problem developed at LaRC.
Variational Generation of Prismatic Boundary-Layer Meshes for Biomedical Computing
Dyedov, Volodymyr; Einstein, Daniel; Jiao, Xiangmin; Kuprat, Andrew; Carson, James; Pin, Facundo del
2009-01-01
SUMMARY Boundary-layer meshes are important for numerical simulations in computational fluid dynamics, including computational biofluid dynamics of air flow in lungs and blood flow in hearts. Generating boundary-layer meshes is challenging for complex biological geometries. In this paper, we propose a novel technique for generating prismatic boundary-layer meshes for such complex geometries. Our method computes a feature size of the geometry, adapts the surface mesh based on the feature size, and then generates the prismatic layers by propagating the triangulated surface using the face-offsetting method. We derive a new variational method to optimize the prismatic layers to improve the triangle shapes and edge orthogonality of the prismatic elements and also introduce simple and effective measures to guarantee the validity of the mesh. Coupled with a high-quality tetrahedral mesh generator for the interior of the domain, our method generates high-quality hybrid meshes for accurate and efficient numerical simulations. We present comparative study to demonstrate the robustness and quality of our method for complex biomedical geometries. PMID:20161102
A Robust and Scalable Software Library for Parallel Adaptive Refinement on Unstructured Meshes
NASA Technical Reports Server (NTRS)
Lou, John Z.; Norton, Charles D.; Cwik, Thomas A.
1999-01-01
The design and implementation of Pyramid, a software library for performing parallel adaptive mesh refinement (PAMR) on unstructured meshes, is described. This software library can be easily used in a variety of unstructured parallel computational applications, including parallel finite element, parallel finite volume, and parallel visualization applications using triangular or tetrahedral meshes. The library contains a suite of well-designed and efficiently implemented modules that perform operations in a typical PAMR process. Among these are mesh quality control during successive parallel adaptive refinement (typically guided by a local-error estimator), parallel load-balancing, and parallel mesh partitioning using the ParMeTiS partitioner. The Pyramid library is implemented in Fortran 90 with an interface to the Message-Passing Interface (MPI) library, supporting code efficiency, modularity, and portability. An EM waveguide filter application, adaptively refined using the Pyramid library, is illustrated.
ERIC Educational Resources Information Center
Gonzalez-Vega, Laureano
1999-01-01
Using a Computer Algebra System (CAS) to help with the teaching of an elementary course in linear algebra can be one way to introduce computer algebra, numerical analysis, data structures, and algorithms. Highlights the advantages and disadvantages of this approach to the teaching of linear algebra. (Author/MM)
Chen, J.; Safro, I.
2011-01-01
Measuring the connection strength between a pair of vertices in a graph is one of the most important concerns in many graph applications. Simple measures such as edge weights may not be sufficient for capturing the effects associated with short paths of lengths greater than one. In this paper, we consider an iterative process that smooths an associated value for nearby vertices, and we present a measure of the local connection strength (called the algebraic distance; see [D. Ron, I. Safro, and A. Brandt, Multiscale Model. Simul., 9 (2011), pp. 407-423]) based on this process. The proposed measure is attractive in that the process is simple, linear, and easily parallelized. An analysis of the convergence property of the process reveals that the local neighborhoods play an important role in determining the connectivity between vertices. We demonstrate the practical effectiveness of the proposed measure through several combinatorial optimization problems on graphs and hypergraphs.
Constraint algebra in bigravity
Soloviev, V. O.
2015-07-15
The number of degrees of freedom in bigravity theory is found for a potential of general form and also for the potential proposed by de Rham, Gabadadze, and Tolley (dRGT). This aim is pursued via constructing a Hamiltonian formalismand studying the Poisson algebra of constraints. A general potential leads to a theory featuring four first-class constraints generated by general covariance. The vanishing of the respective Hessian is a crucial property of the dRGT potential, and this leads to the appearance of two additional second-class constraints and, hence, to the exclusion of a superfluous degree of freedom—that is, the Boulware—Deser ghost. The use of a method that permits avoiding an explicit expression for the dRGT potential is a distinctive feature of the present study.
Quantum algebra of N superspace
Hatcher, Nicolas; Restuccia, A.; Stephany, J.
2007-08-15
We identify the quantum algebra of position and momentum operators for a quantum system bearing an irreducible representation of the super Poincare algebra in the N>1 and D=4 superspace, both in the case where there are no central charges in the algebra, and when they are present. This algebra is noncommutative for the position operators. We use the properties of superprojectors acting on the superfields to construct explicit position and momentum operators satisfying the algebra. They act on the projected wave functions associated to the various supermultiplets with defined superspin present in the representation. We show that the quantum algebra associated to the massive superparticle appears in our construction and is described by a supermultiplet of superspin 0. This result generalizes the construction for D=4, N=1 reported recently. For the case N=2 with central charges, we present the equivalent results when the central charge and the mass are different. For the {kappa}-symmetric case when these quantities are equal, we discuss the reduction to the physical degrees of freedom of the corresponding superparticle and the construction of the associated quantum algebra.
Automatic generation of endocardial surface meshes with 1-to-1 correspondence from cine-MR images
NASA Astrophysics Data System (ADS)
Su, Yi; Teo, S.-K.; Lim, C. W.; Zhong, L.; Tan, R. S.
2015-03-01
In this work, we develop an automatic method to generate a set of 4D 1-to-1 corresponding surface meshes of the left ventricle (LV) endocardial surface which are motion registered over the whole cardiac cycle. These 4D meshes have 1- to-1 point correspondence over the entire set, and is suitable for advanced computational processing, such as shape analysis, motion analysis and finite element modelling. The inputs to the method are the set of 3D LV endocardial surface meshes of the different frames/phases of the cardiac cycle. Each of these meshes is reconstructed independently from border-delineated MR images and they have no correspondence in terms of number of vertices/points and mesh connectivity. To generate point correspondence, the first frame of the LV mesh model is used as a template to be matched to the shape of the meshes in the subsequent phases. There are two stages in the mesh correspondence process: (1) a coarse matching phase, and (2) a fine matching phase. In the coarse matching phase, an initial rough matching between the template and the target is achieved using a radial basis function (RBF) morphing process. The feature points on the template and target meshes are automatically identified using a 16-segment nomenclature of the LV. In the fine matching phase, a progressive mesh projection process is used to conform the rough estimate to fit the exact shape of the target. In addition, an optimization-based smoothing process is used to achieve superior mesh quality and continuous point motion.
Monte Carlo design of optimal wire mesh collimator for breast tumor imaging process
NASA Astrophysics Data System (ADS)
Saad, W. H. M.; Roslan, R. E.; Mahdi, M. A.; Choong, W.-S.; Saion, E.; Saripan, M. I.
2011-08-01
This paper presents the modeling of breast tumor imaging process using wire mesh collimator gamma camera. Previous studies showed that the wire mesh collimator has a potential to improve the sensitivity of the tumor detection. In this paper, we extend our research significantly, to find an optimal configuration of the wire mesh collimator specifically for semi-compressed breast tumor detection, by looking into four major factors: weight, sensitivity, spatial resolution and tumor contrast. The numbers of layers in the wire mesh collimator is varied to optimize the collimator design. The statistical variations of the results are studied by simulating multiple realizations for each experiment using different starting random numbers. All the simulation environments are modeled using Monte Carlo N-Particle Code (MCNP). The quality of the detection is measured directly by comparing the sensitivity, spatial resolution and tumor contrast of the images produced by the wire mesh collimator and benchmarked that with a standard multihole collimator. The proposed optimal configuration of the wire mesh collimator is optimized by selecting the number of layers in wire mesh collimator, where the tumor contrast shows a relatively comparable value to the multihole collimator, when it is tested with uniformly semi-compressed breast phantom. The wire mesh collimator showed higher number of sensitivity because of its loose arrangement while the spatial resolution of wire mesh collimator does not shows much different compared to the multihole collimator. With a relatively good tumor contrast and spatial resolution, and increased in sensitivity, a new proposed wire mesh collimator gives a significant improvement in the wire mesh collimator design for breast cancer imaging process. The proposed collimator configuration is reduced to 44.09% from the total multihole collimator weight.
Full-hexahedral structured meshing for image-based computational vascular modeling.
De Santis, Gianluca; De Beule, Matthieu; Van Canneyt, Koen; Segers, Patrick; Verdonck, Pascal; Verhegghe, Benedict
2011-12-01
Image-based computational modeling offers a virtual access to spatially and temporally high resolution flow and structural mechanical data in vivo. Due to inter-subject morphological variability, mesh generation represents a critical step in modeling the patient-specific geometry and is usually performed using unstructured tetrahedral meshing algorithms. Although hexahedral structured meshes are known to provide higher accuracy and reduce the computational costs both for Finite Element Analysis and Computational Fluid Dynamics, their application in computational cardiovascular studies is challenging due to the complex 3D and branching topology of vascular territories. In this study, we propose a robust procedure for structured mesh generation, tailoring the mesh structure to the subject-specific vessel topology. The proposed methodology is based on centerline-based synthetic descriptors (i.e. centerlines, radii and centerlines' normals) which are used to solve the meshing problem following a bottom-up approach. First, topologically equivalent block-structures are placed inside and outside the lumen domain. Then, a projection operation is performed, returning a parametric volume mesh which fits the original triangulated model with sub-micrometric accuracy. Additionally, a three-layered arterial wall (resembling the intima, media and adventitia) is artificially generated, with the possibility of setting variable thickness (e.g. proximal-to-distal tapering) and material anisotropy (e.g. position-dependent collagen-fibers' orientation). This new meshing procedure, implemented using open-source software packages only, is demonstrated on two challenging human cases, being an aortic arch and an abdominal aortic aneurysm. High-quality meshes are generated in both cases, according to shape-quality metrics. By increasing the computation accuracy, the developed meshing tool has the potential to further add "confidence" to the use of computational methods in vascular
Yang, Xiaofan; Zhu, Yuanrui; Hong, Jing; Yang, Lu-Xing; Wu, Yingbo; Tang, Yuan Yan
2016-01-01
There are quite a number of different metrics of network robustness. This paper addresses the rationality of four metrics of network robustness (the algebraic connectivity, the effective resistance, the average edge betweenness, and the efficiency) by investigating the robust growth of generalized meshes (GMs). First, a heuristic growth algorithm (the Proximity-Growth algorithm) is proposed. The resulting proximity-optimal GMs are intuitively robust and hence are adopted as the benchmark. Then, a generalized mesh (GM) is grown up by stepwise optimizing a given measure of network robustness. The following findings are presented: (1) The algebraic connectivity-optimal GMs deviate quickly from the proximity-optimal GMs, yielding a number of less robust GMs. This hints that the rationality of the algebraic connectivity as a measure of network robustness is still in doubt. (2) The effective resistace-optimal GMs and the average edge betweenness-optimal GMs are in line with the proximity-optimal GMs. This partly justifies the two quantities as metrics of network robustness. (3) The efficiency-optimal GMs deviate gradually from the proximity-optimal GMs, yielding some less robust GMs. This suggests the limited utility of the efficiency as a measure of network robustness. PMID:27518448
Compatible Relaxation and Coarsening in Algebraic Multigrid
Brannick, J J; Falgout, R D
2009-09-22
We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.
Using Homemade Algebra Tiles To Develop Algebra and Prealgebra Concepts.
ERIC Educational Resources Information Center
Leitze, Annette Ricks; Kitt, Nancy A.
2000-01-01
Describes how to use homemade tiles, sketches, and the box method to reach a broader group of students for successful algebra learning. Provides a list of concepts appropriate for such an approach. (KHR)
Distance geometry and geometric algebra
NASA Astrophysics Data System (ADS)
Dress, Andreas W. M.; Havel, Timothy F.
1993-10-01
As part of his program to unify linear algebra and geometry using the language of Clifford algebra, David Hestenes has constructed a (well-known) isomorphism between the conformal group and the orthogonal group of a space two dimensions higher, thus obtaining homogeneous coordinates for conformal geometry.(1) In this paper we show that this construction is the Clifford algebra analogue of a hyperbolic model of Euclidean geometry that has actually been known since Bolyai, Lobachevsky, and Gauss, and we explore its wider invariant theoretic implications. In particular, we show that the Euclidean distance function has a very simple representation in this model, as demonstrated by J. J. Seidel.(18)
Loop Virasoro Lie conformal algebra
Wu, Henan Chen, Qiufan; Yue, Xiaoqing
2014-01-15
The Lie conformal algebra of loop Virasoro algebra, denoted by CW, is introduced in this paper. Explicitly, CW is a Lie conformal algebra with C[∂]-basis (L{sub i} | i∈Z) and λ-brackets [L{sub i} {sub λ} L{sub j}] = (−∂−2λ)L{sub i+j}. Then conformal derivations of CW are determined. Finally, rank one conformal modules and Z-graded free intermediate series modules over CW are classified.
Hopf algebras and Dyson-Schwinger equations
NASA Astrophysics Data System (ADS)
Weinzierl, Stefan
2016-06-01
In this paper I discuss Hopf algebras and Dyson-Schwinger equations. This paper starts with an introduction to Hopf algebras, followed by a review of the contribution and application of Hopf algebras to particle physics. The final part of the paper is devoted to the relation between Hopf algebras and Dyson-Schwinger equations.
PVDF as a new polymer for the construction of surgical meshes.
Klinge, U; Klosterhalfen, B; Ottinger, A P; Junge, K; Schumpelick, V
2002-08-01
Abdominal hernia repair is the most frequently performed operation in surgery. Mostly due to lowered recurrence rates mesh repairs in hernia surgery have become an integral component despite increasing mesh-related complications. Current available mesh prosthesis are made of polypropylene (PP). polyethylene-terephtalat or polytetrafluorethylene. though all of them reveal some disadvantages. The introduction of new materials seems to be advisable. Caused by supposed advantageous textile properties and tissue response two mesh modifications made of polyvinylidene fluoride (PVDF) for abdominal hernia repair were developed. In the present study the PVDF meshes were compared to a common heavy weight PP-mesh (Prolene) in regard to functional consequences and morphological tissue response. After implantation in rats as inlay for 3, 14, 21, 42 and 90 days abdominal wall mobility was recorded by three-dimensional photogrammetry. Tensile strength of the suture zone and the mesh itself were determined. Explanted tissue samples have been investigated for their histological reaction in regard to the inflammatory infiltrate. vascularisation, connective and fat tissue ingrowth. Number of granulocytes, macrophages, fibroblasts, lymphocytes and foreign giant body cells have been evaluated to reflect quality of tissue response. The cellular response was grasped by measurement of DNA strand breaks and apoptosis (TUNEL), proliferation (Ki67) and cell stress (HSP70). Analyzing the results confirmed that construction of hernia meshes made of PVDF could be an advantageous alternative to the commonly used materials due to an improved biostability. lowered bending stiffness and a minimum tissue response. PMID:12099293
Harms titanium mesh cage fracture
Klezl, Zdenek; Bookland, Markus J.; Wolinsky, Jean-Paul; Rezek, Zdenek; Gokaslan, Ziya L.
2007-01-01
Interbody fusion has become a mainstay of surgical management for lumbar fractures, tumors, spondylosis, spondylolisthesis and deformities. Over the years, it has undergone a number of metamorphoses, as novel instrumentation and approaches have arisen to reduce complications and enhance outcomes. Interbody fusion procedures are common and successful, complications are rare and most often do not involve the interbody device itself. We present here a patient who underwent an anterior L4 corpectomy with Harms cage placement and who later developed a fracture of the lumbar titanium mesh cage (TMC). This report details the presentation and management of this rare complication, as well as discusses the biomechanics underlying this rare instrumentation failure. PMID:17497187
Resource optimization scheme for multimedia-enabled wireless mesh networks.
Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md Jalil; Suh, Doug Young
2014-01-01
Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment. PMID:25111241
Multiphase Flow of Immiscible Fluids on Unstructured Moving Meshes.
Misztal, Marek K; Erleben, Kenny; Bargteil, Adam; Fursund, Jens; Christensen, Brian Bunch; Bærentzen, J Andreas; Bridson, Robert
2013-07-01
In this paper, we present a method for animating multiphase flow of immiscible fluids using unstructured moving meshes. Our underlying discretization is an unstructured tetrahedral mesh, the deformable simplicial complex (DSC), that moves with the flow in a Lagrangian manner. Mesh optimization operations improve element quality and avoid element inversion. In the context of multiphase flow, we guarantee that every element is occupied by a single fluid and, consequently, the interface between fluids is represented by a set of faces in the simplicial complex. This approach ensures that the underlying discretization matches the physics and avoids the additional book-keeping required in grid-based methods where multiple fluids may occupy the same cell. Our Lagrangian approach naturally leads us to adopt a finite element approach to simulation, in contrast to the finite volume approaches adopted by a majority of fluid simulation techniques that use tetrahedral meshes. We characterize fluid simulation as an optimization problem allowing for full coupling of the pressure and velocity fields and the incorporation of a second-order surface energy. We introduce a preconditioner based on the diagonal Schur complement and solve our optimization on the GPU. We provide the results of parameter studies as well as a performance analysis of our method, together with suggestions for performance optimization. PMID:23836703
Multiphase flow of immiscible fluids on unstructured moving meshes.
Misztal, Marek Krzysztof; Erleben, Kenny; Bargteil, Adam; Fursund, Jens; Christensen, Brian Bunch; Bærentzen, Jakob Andreas; Bridson, Robert
2014-01-01
In this paper, we present a method for animating multiphase flow of immiscible fluids using unstructured moving meshes. Our underlying discretization is an unstructured tetrahedral mesh, the deformable simplicial complex (DSC), that moves with the flow in a Lagrangian manner. Mesh optimization operations improve element quality and avoid element inversion. In the context of multiphase flow, we guarantee that every element is occupied by a single fluid and, consequently, the interface between fluids is represented by a set of faces in the simplicial complex. This approach ensures that the underlying discretization matches the physics and avoids the additional book-keeping required in grid-based methods where multiple fluids may occupy the same cell. Our Lagrangian approach naturally leads us to adopt a finite element approach to simulation, in contrast to the finite volume approaches adopted by a majority of fluid simulation techniques that use tetrahedral meshes. We characterize fluid simulation as an optimization problem allowing for full coupling of the pressure and velocity fields and the incorporation of a second-order surface energy. We introduce a preconditioner based on the diagonal Schur complement and solve our optimization on the GPU. We provide the results of parameter studies as well as a performance analysis of our method, together with suggestions for performance optimization. PMID:24201322
A LAGUERRE VORONOI BASED SCHEME FOR MESHING PARTICLE SYSTEMS
Bajaj, Chandrajit
2009-01-01
We present Laguerre Voronoi based subdivision algorithms for the quadrilateral and hexahedral meshing of particle systems within a bounded region in two and three dimensions, respectively. Particles are smooth functions over circular or spherical domains. The algorithm first breaks the bounded region containing the particles into Voronoi cells that are then subsequently decomposed into an initial quadrilateral or an initial hexahedral scaffold conforming to individual particles. The scaffolds are subsequently refined via applications of recursive subdivision (splitting and averaging rules). Our choice of averaging rules yield a particle conforming quadrilateral/hexahedral mesh, of good quality, along with being smooth and differentiable in the limit. Extensions of the basic scheme to dynamic re-meshing in the case of addition, deletion, and moving particles are also discussed. Motivating applications of the use of these static and dynamic meshes for particle systems include the mechanics of epoxy/glass composite materials, bio-molecular force field calculations, and gas hydrodynamics simulations in cosmology PMID:20454544
Resource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks
Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md. Jalil; Suh, Doug Young
2014-01-01
Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment. PMID:25111241
Mesh networking optimized for robotic teleoperation
NASA Astrophysics Data System (ADS)
Hart, Abraham; Pezeshkian, Narek; Nguyen, Hoa
2012-06-01
Mesh networks for robot teleoperation pose different challenges than those associated with traditional mesh networks. Unmanned ground vehicles (UGVs) are mobile and operate in constantly changing and uncontrollable environments. Building a mesh network to work well under these harsh conditions presents a unique challenge. The Manually Deployed Communication Relay (MDCR) mesh networking system extends the range of and provides non-line-of-sight (NLOS) communications for tactical and explosive ordnance disposal (EOD) robots currently in theater. It supports multiple mesh nodes, robots acting as nodes, and works with all Internet Protocol (IP)-based robotic systems. Under MDCR, the performance of different routing protocols and route selection metrics were compared resulting in a modified version of the Babel mesh networking protocol. This paper discusses this and other topics encountered during development and testing of the MDCR system.
Sequential products on effect algebras
NASA Astrophysics Data System (ADS)
Gudder, Stan; Greechie, Richard
2002-02-01
A sequential effect algebra (SEA) is an effect algebra on which a sequential product with natural properties is defined. The properties of sequential products on Hilbert space effect algebras are discussed. For a general SEA, relationships between sequential independence, coexistence and compatibility are given. It is shown that the sharp elements of a SEA form an orthomodular poset. The sequential center of a SEA is discussed and a characterization of when the sequential center is isomorphic to a fuzzy set system is presented. It is shown that the existence, of a sequential product is a strong restriction that eliminates many effect algebras from being SEA's. For example, there are no finite nonboolean SEA's, A measure of sharpness called the sharpness index is studied. The existence of horizontal sums of SEA's is characterized and examples of horizontal sums and tensor products are presented.
Curvature calculations with spacetime algebra
Hestenes, D.
1986-06-01
A new method for calculating the curvature tensor is developed and applied to the Scharzschild case. The method employs Clifford algebra and has definite advantages over conventional methods using differential forms or tensor analysis.
GCD, LCM, and Boolean Algebra?
ERIC Educational Resources Information Center
Cohen, Martin P.; Juraschek, William A.
1976-01-01
This article investigates the algebraic structure formed when the process of finding the greatest common divisor and the least common multiple are considered as binary operations on selected subsets of positive integers. (DT)
Cartooning in Algebra and Calculus
ERIC Educational Resources Information Center
Moseley, L. Jeneva
2014-01-01
This article discusses how teachers can create cartoons for undergraduate math classes, such as college algebra and basic calculus. The practice of cartooning for teaching can be helpful for communication with students and for students' conceptual understanding.
NASA Technical Reports Server (NTRS)
Klumpp, A. R.; Lawson, C. L.
1988-01-01
Routines provided for common scalar, vector, matrix, and quaternion operations. Computer program extends Ada programming language to include linear-algebra capabilities similar to HAS/S programming language. Designed for such avionics applications as software for Space Station.
Semiclassical states on Lie algebras
Tsobanjan, Artur
2015-03-15
The effective technique for analyzing representation-independent features of quantum systems based on the semiclassical approximation (developed elsewhere) has been successfully used in the context of the canonical (Weyl) algebra of the basic quantum observables. Here, we perform the important step of extending this effective technique to the quantization of a more general class of finite-dimensional Lie algebras. The case of a Lie algebra with a single central element (the Casimir element) is treated in detail by considering semiclassical states on the corresponding universal enveloping algebra. Restriction to an irreducible representation is performed by “effectively” fixing the Casimir condition, following the methods previously used for constrained quantum systems. We explicitly determine the conditions under which this restriction can be consistently performed alongside the semiclassical truncation.
NASA Astrophysics Data System (ADS)
Lannes, A.; Teunissen, P. J. G.
2011-05-01
The first objective of this paper is to show that some basic concepts used in global navigation satellite systems (GNSS) are similar to those introduced in Fourier synthesis for handling some phase calibration problems. In experimental astronomy, the latter are at the heart of what is called `phase closure imaging.' In both cases, the analysis of the related structures appeals to the algebraic graph theory and the algebraic number theory. For example, the estimable functions of carrier-phase ambiguities, which were introduced in GNSS to correct some rank defects of the undifferenced equations, prove to be `closure-phase ambiguities:' the so-called `closure-delay' (CD) ambiguities. The notion of closure delay thus generalizes that of double difference (DD). The other estimable functional variables involved in the phase and code undifferenced equations are the receiver and satellite pseudo-clock biases. A related application, which corresponds to the second objective of this paper, concerns the definition of the clock information to be broadcasted to the network users for their precise point positioning (PPP). It is shown that this positioning can be achieved by simply having access to the satellite pseudo-clock biases. For simplicity, the study is restricted to relatively small networks. Concerning the phase for example, these biases then include five components: a frequency-dependent satellite-clock error, a tropospheric satellite delay, an ionospheric satellite delay, an initial satellite phase, and an integer satellite ambiguity. The form of the PPP equations to be solved by the network user is then similar to that of the traditional PPP equations. As soon as the CD ambiguities are fixed and validated, an operation which can be performed in real time via appropriate decorrelation techniques, estimates of these float biases can be immediately obtained. No other ambiguity is to be fixed. The satellite pseudo-clock biases can thus be obtained in real time. This is
Unstructured Polyhedral Mesh Thermal Radiation Diffusion
Palmer, T.S.; Zika, M.R.; Madsen, N.K.
2000-07-27
Unstructured mesh particle transport and diffusion methods are gaining wider acceptance as mesh generation, scientific visualization and linear solvers improve. This paper describes an algorithm that is currently being used in the KULL code at Lawrence Livermore National Laboratory to solve the radiative transfer equations. The algorithm employs a point-centered diffusion discretization on arbitrary polyhedral meshes in 3D. We present the results of a few test problems to illustrate the capabilities of the radiation diffusion module.
Auto-adaptive finite element meshes
NASA Technical Reports Server (NTRS)
Richter, Roland; Leyland, Penelope
1995-01-01
Accurate capturing of discontinuities within compressible flow computations is achieved by coupling a suitable solver with an automatic adaptive mesh algorithm for unstructured triangular meshes. The mesh adaptation procedures developed rely on non-hierarchical dynamical local refinement/derefinement techniques, which hence enable structural optimization as well as geometrical optimization. The methods described are applied for a number of the ICASE test cases are particularly interesting for unsteady flow simulations.
Floating shock fitting via Lagrangian adaptive meshes
NASA Technical Reports Server (NTRS)
Vanrosendale, John
1995-01-01
In recent work we have formulated a new approach to compressible flow simulation, combining the advantages of shock-fitting and shock-capturing. Using a cell-centered on Roe scheme discretization on unstructured meshes, we warp the mesh while marching to steady state, so that mesh edges align with shocks and other discontinuities. This new algorithm, the Shock-fitting Lagrangian Adaptive Method (SLAM), is, in effect, a reliable shock-capturing algorithm which yields shock-fitted accuracy at convergence.
Hopf algebras and topological recursion
NASA Astrophysics Data System (ADS)
Esteves, João N.
2015-11-01
We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293-309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347-452).
Energy Science and Technology Software Center (ESTSC)
2005-04-11
The ALGEBRA program allows the user to manipulate data from a finite element analysis before it is plotted. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS II database. The ALGEBRA program evaluates user-supplied functions of the data and writes the results to an output EXODUS II database that can be read by plot programs.
Design of electrospinning mesh devices
NASA Astrophysics Data System (ADS)
Russo, Giuseppina; Peters, Gerrit W. M.; Solberg, Ramon H. M.; Vittoria, Vittoria
2012-07-01
This paper describes the features of new membranes that can act as local biomedical devices owing to their peculiar shape in the form of mesh structure. These materials are designed to provide significant effects to reduce local inflammations and improve the tissue regeneration. Lamellar Hydrotalcite loaded with Diclofenac Sodium (HTLc-DIK) was homogenously dispersed inside a polymeric matrix of Poly-caprolactone (PCL) to manufacture membranes by electrospinning technique. The experimental procedure and the criteria employed have shown to be extremely effective at increasing potentiality and related applications. The employed technique has proved to be very useful to manufacture polymeric fibers with diameters in the range of nano-micro scale. In this work a dedicated collector based on a proprietary technology of IME Technologies and Eindhoven University of Technology (TU/e) was used. It allowed to obtain devices with a macro shape of a 3D-mesh. Atomic Force Microscopy (AFM) highlights a very interesting texture of the electrospun fibers. They show a lamellar morphology that is only slightly modified by the inclusion of the interclay embedded in the devices to control the drug release phenomena.
Mesh infrastructure for coupled multiprocess geophysical simulations
Garimella, Rao V.; Perkins, William A.; Buksas, Mike W.; Berndt, Markus; Lipnikov, Konstantin; Coon, Ethan; Moulton, John D.; Painter, Scott L.
2014-01-01
We have developed a sophisticated mesh infrastructure capability to support large scale multiphysics simulations such as subsurface flow and reactive contaminant transport at storage sites as well as the analysis of the effects of a warming climate on the terrestrial arctic. These simulations involve a wide range of coupled processes including overland flow, subsurface flow, freezing and thawing of ice rich soil, accumulation, redistribution and melting of snow, biogeochemical processes involving plant matter and finally, microtopography evolution due to melting and degradation of ice wedges below the surface. In addition to supporting the usual topological and geometric queries about the mesh, the mesh infrastructure adds capabilities such as identifying columnar structures in the mesh, enabling deforming of the mesh subject to constraints and enabling the simultaneous use of meshes of different dimensionality for subsurface and surface processes. The generic mesh interface is capable of using three different open source mesh frameworks (MSTK, MOAB and STKmesh) under the hood allowing the developers to directly compare them and choose one that is best suited for the application's needs. We demonstrate the results of some simulations using these capabilities as well as present a comparison of the performance of the different mesh frameworks.
Mesh infrastructure for coupled multiprocess geophysical simulations
Garimella, Rao V.; Perkins, William A.; Buksas, Mike W.; Berndt, Markus; Lipnikov, Konstantin; Coon, Ethan; Moulton, John D.; Painter, Scott L.
2014-01-01
We have developed a sophisticated mesh infrastructure capability to support large scale multiphysics simulations such as subsurface flow and reactive contaminant transport at storage sites as well as the analysis of the effects of a warming climate on the terrestrial arctic. These simulations involve a wide range of coupled processes including overland flow, subsurface flow, freezing and thawing of ice rich soil, accumulation, redistribution and melting of snow, biogeochemical processes involving plant matter and finally, microtopography evolution due to melting and degradation of ice wedges below the surface. In addition to supporting the usual topological and geometric queries about themore » mesh, the mesh infrastructure adds capabilities such as identifying columnar structures in the mesh, enabling deforming of the mesh subject to constraints and enabling the simultaneous use of meshes of different dimensionality for subsurface and surface processes. The generic mesh interface is capable of using three different open source mesh frameworks (MSTK, MOAB and STKmesh) under the hood allowing the developers to directly compare them and choose one that is best suited for the application's needs. We demonstrate the results of some simulations using these capabilities as well as present a comparison of the performance of the different mesh frameworks.« less
RGG: Reactor geometry (and mesh) generator
Jain, R.; Tautges, T.
2012-07-01
The reactor geometry (and mesh) generator RGG takes advantage of information about repeated structures in both assembly and core lattices to simplify the creation of geometry and mesh. It is released as open source software as a part of the MeshKit mesh generation library. The methodology operates in three stages. First, assembly geometry models of various types are generated by a tool called AssyGen. Next, the assembly model or models are meshed by using MeshKit tools or the CUBIT mesh generation tool-kit, optionally based on a journal file output by AssyGen. After one or more assembly model meshes have been constructed, a tool called CoreGen uses a copy/move/merge process to arrange the model meshes into a core model. In this paper, we present the current state of tools and new features in RGG. We also discuss the parallel-enabled CoreGen, which in several cases achieves super-linear speedups since the problems fit in available RAM at higher processor counts. Several RGG applications - 1/6 VHTR model, 1/4 PWR reactor core, and a full-core model for Monju - are reported. (authors)
Mesh plug repair and groin hernia surgery.
Robbins, A W; Rutkow, I M
1998-12-01
Since the mid-1980s, dramatic progress has been made in the evolution of hernia surgery, highlighted by the increasing use of prosthetic mesh. Among the mesh-based "tension-free" hernioplasties, the use of mesh plugs has garnered a large number of spirited enthusiasts, and plug herniorrhaphy has become the fastest growing hernia repair currently employed by the American surgeon. To demonstrate the simplicity and effectiveness of mesh plugs, a 9-year experience with almost 3300 patients is reported. Technical details are discussed and presentation of a literature search serves to further emphasize the utilitarian nature of this elegantly unsophisticated surgical operation. PMID:9927981
Method of generating a surface mesh
Shepherd, Jason F.; Benzley, Steven; Grover, Benjamin T.
2008-03-04
A method and machine-readable medium provide a technique to generate and modify a quadrilateral finite element surface mesh using dual creation and modification. After generating a dual of a surface (mesh), a predetermined algorithm may be followed to generate and modify a surface mesh of quadrilateral elements. The predetermined algorithm may include the steps of generating two-dimensional cell regions in dual space, determining existing nodes in primal space, generating new nodes in the dual space, and connecting nodes to form the quadrilateral elements (faces) for the generated and modifiable surface mesh.
MOAB : a mesh-oriented database.
Tautges, Timothy James; Ernst, Corey; Stimpson, Clint; Meyers, Ray J.; Merkley, Karl
2004-04-01
A finite element mesh is used to decompose a continuous domain into a discretized representation. The finite element method solves PDEs on this mesh by modeling complex functions as a set of simple basis functions with coefficients at mesh vertices and prescribed continuity between elements. The mesh is one of the fundamental types of data linking the various tools in the FEA process (mesh generation, analysis, visualization, etc.). Thus, the representation of mesh data and operations on those data play a very important role in FEA-based simulations. MOAB is a component for representing and evaluating mesh data. MOAB can store structured and unstructured mesh, consisting of elements in the finite element 'zoo'. The functional interface to MOAB is simple yet powerful, allowing the representation of many types of metadata commonly found on the mesh. MOAB is optimized for efficiency in space and time, based on access to mesh in chunks rather than through individual entities, while also versatile enough to support individual entity access. The MOAB data model consists of a mesh interface instance, mesh entities (vertices and elements), sets, and tags. Entities are addressed through handles rather than pointers, to allow the underlying representation of an entity to change without changing the handle to that entity. Sets are arbitrary groupings of mesh entities and other sets. Sets also support parent/child relationships as a relation distinct from sets containing other sets. The directed-graph provided by set parent/child relationships is useful for modeling topological relations from a geometric model or other metadata. Tags are named data which can be assigned to the mesh as a whole, individual entities, or sets. Tags are a mechanism for attaching data to individual entities and sets are a mechanism for describing relations between entities; the combination of these two mechanisms is a powerful yet simple interface for representing metadata or application
NASA Astrophysics Data System (ADS)
Kuzmin, Dmitri; Möller, Matthias; Gurris, Marcel
Flux limiting for hyperbolic systems requires a careful generalization of the design principles and algorithms introduced in the context of scalar conservation laws. In this chapter, we develop FCT-like algebraic flux correction schemes for the Euler equations of gas dynamics. In particular, we discuss the construction of artificial viscosity operators, the choice of variables to be limited, and the transformation of antidiffusive fluxes. An a posteriori control mechanism is implemented to make the limiter failsafe. The numerical treatment of initial and boundary conditions is discussed in some detail. The initialization is performed using an FCT-constrained L 2 projection. The characteristic boundary conditions are imposed in a weak sense, and an approximate Riemann solver is used to evaluate the fluxes on the boundary. We also present an unconditionally stable semi-implicit time-stepping scheme and an iterative solver for the fully discrete problem. The results of a numerical study indicate that the nonlinearity and non-differentiability of the flux limiter do not inhibit steady state convergence even in the case of strongly varying Mach numbers. Moreover, the convergence rates improve as the pseudo-time step is increased.
Unstructured Mesh Methods for the Simulation of Hypersonic Flows
NASA Technical Reports Server (NTRS)
Peraire, Jaime; Bibb, K. L. (Technical Monitor)
2001-01-01
This report describes the research work undertaken at the Massachusetts Institute of Technology. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of hypersonic viscous flows about re-entry vehicles. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use, of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the, code which incorporates real gas effects, has been produced. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. In figures I and 2, we show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although these initial results were encouraging, it became apparent that in order to develop a fully functional capability for viscous flows, several advances in gridding, solution accuracy, robustness and efficiency were required. As part of this research we have developed: 1) automatic meshing techniques and the corresponding computer codes have been delivered to NASA and implemented into the GridEx system, 2) a finite
Nonnumeric Computer Applications to Algebra, Trigonometry and Calculus.
ERIC Educational Resources Information Center
Stoutemyer, David R.
1983-01-01
Described are computer program packages requiring little or no knowledge of computer programing for college algebra, calculus, and abstract algebra. Widely available computer algebra systems are listed. (MNS)
Virasoro algebra in the KN algebra; Bosonic string with fermionic ghosts on Riemann surfaces
Koibuchi, H. )
1991-10-10
In this paper the bosonic string model with fermionic ghosts is considered in the framework of the KN algebra. The authors' attentions are paid to representations of KN algebra and a Clifford algebra of the ghosts. The authors show that a Virasoro-like algebra is obtained from KN algebra when KN algebra has certain antilinear anti-involution, and that it is isomorphic to the usual Virasoro algebra. The authors show that there is an expected relation between a central charge of this Virasoro-like algebra and an anomaly of the combined system.
Invertible linear transformations and the Lie algebras
NASA Astrophysics Data System (ADS)
Zhang, Yufeng; Tam, Honwah; Guo, Fukui
2008-07-01
With the help of invertible linear transformations and the known Lie algebras, a way to generate new Lie algebras is given. These Lie algebras obtained have a common feature, i.e. integrable couplings of solitary hierarchies could be obtained by using them, specially, the Hamiltonian structures of them could be worked out. Some ways to construct the loop algebras of the Lie algebras are presented. It follows that some various loop algebras are given. In addition, a few new Lie algebras are explicitly constructed in terms of the classification of Lie algebras proposed by Ma Wen-Xiu, which are bases for obtaining new Lie algebras by using invertible linear transformations. Finally, some solutions of a (2 + 1)-dimensional partial-differential equation hierarchy are obtained, whose Hamiltonian form-expressions are manifested by using the quadratic-form identity.
Adaptive mesh refinement in titanium
Colella, Phillip; Wen, Tong
2005-01-21
In this paper, we evaluate Titanium's usability as a high-level parallel programming language through a case study, where we implement a subset of Chombo's functionality in Titanium. Chombo is a software package applying the Adaptive Mesh Refinement methodology to numerical Partial Differential Equations at the production level. In Chombo, the library approach is used to parallel programming (C++ and Fortran, with MPI), whereas Titanium is a Java dialect designed for high-performance scientific computing. The performance of our implementation is studied and compared with that of Chombo in solving Poisson's equation based on two grid configurations from a real application. Also provided are the counts of lines of code from both sides.
Parallel mesh management using interoperable tools.
Tautges, Timothy James; Devine, Karen Dragon
2010-10-01
This presentation included a discussion of challenges arising in parallel mesh management, as well as demonstrated solutions. They also described the broad range of software for mesh management and modification developed by the Interoperable Technologies for Advanced Petascale Simulations (ITAPS) team, and highlighted applications successfully using the ITAPS tool suite.
Conforming quadrilaterals meshes on the cubed sphere.
Taylor, Mark A.; Levy, Michael Nathan; Overfelt, James Robert
2010-08-01
The cubed sphere geometry, obtained by inscribing a cube in a sphere and mapping points between the two surfaces using a gnomonic (central) projection, is commonly used in atmospheric models because it is free of polar singularities and is well-suited for parallel computing. Global meshes on the cubed-sphere typically project uniform (square) grids from each face of the cube onto the sphere, and if refinement is desired then it is done with non-conforming meshes - overlaying the area of interest with a finer uniform mesh, which introduces so-called hanging nodes on edges along the boundary of the fine resolution area. An alternate technique is to tile each face of the cube with quadrilaterals without requiring the quads to be rectangular. These meshes allow for refinement in areas of interest with a conforming mesh, providing a smoother transition between high and low resolution portions of the grid than non-conforming refinement. The conforming meshes are demonstrated in HOMME, NCAR's High Order Method Modeling Environment, where two modifications have been made: the dependence on uniform meshes has been removed, and the ability to read arbitrary quadrilateral meshes from a previously-generated file has been added. Numerical results come from a conservative spectral element method modeling a selection of the standard shallow water test cases.
Computational results for parallel unstructured mesh computations
Jones, M.T.; Plassmann, P.E.
1994-12-31
The majority of finite element models in structural engineering are composed of unstructured meshes. These unstructured meshes are often very large and require significant computational resources; hence they are excellent candidates for massively parallel computation. Parallel solution of the sparse matrices that arise from such meshes has been studied heavily, and many good algorithms have been developed. Unfortunately, many of the other aspects of parallel unstructured mesh computation have gone largely ignored. The authors present a set of algorithms that allow the entire unstructured mesh computation process to execute in parallel -- including adaptive mesh refinement, equation reordering, mesh partitioning, and sparse linear system solution. They briefly describe these algorithms and state results regarding their running-time and performance. They then give results from the 512-processor Intel DELTA for a large-scale structural analysis problem. These results demonstrate that the new algorithms are scalable and efficient. The algorithms are able to achieve up to 2.2 gigaflops for this unstructured mesh problem.
7th International Meshing Roundtable '98
Eldred, T.J.
1998-10-01
The goal of the 7th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to the meshing process. In the past, the Roundtable has enjoyed significant participation from each of these groups from a wide variety of countries.
Structured mesh generation with smoothness controls
Technology Transfer Automated Retrieval System (TEKTRAN)
In geometrically complex domains, the RL (Ryskin and Leal) orthogonal mesh generation system may cause mesh distortion and overlapping problems when using the “weak constraint” method with specified boundary point distribution for all boundaries. To resolve these problems, an improved RL system with...
21 CFR 878.3300 - Surgical mesh.
Code of Federal Regulations, 2014 CFR
2014-04-01
... 21 Food and Drugs 8 2014-04-01 2014-04-01 false Surgical mesh. 878.3300 Section 878.3300 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES GENERAL AND PLASTIC SURGERY DEVICES Prosthetic Devices § 878.3300 Surgical mesh. (a)...
21 CFR 878.3300 - Surgical mesh.
Code of Federal Regulations, 2011 CFR
2011-04-01
... 21 Food and Drugs 8 2011-04-01 2011-04-01 false Surgical mesh. 878.3300 Section 878.3300 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES GENERAL AND PLASTIC SURGERY DEVICES Prosthetic Devices § 878.3300 Surgical mesh. (a)...
Attenuation compensation in mesh-domain OSEM SPECT reconstruction
NASA Astrophysics Data System (ADS)
Vogelsang, Levon; Lu, Yao; Yu, Bo; Krol, Andrzej; Xu, Yuesheng; Hu, Xiaofei; Feiglin, David; Lipson, Edward
2009-02-01
A new method for attenuation compensation (AC) in mesh-domain SPECT OSEM reconstruction using strip-area approximation (SAAC) is introduced and compared to single-ray AC (SRAC). SAAC uses the polygonal area of the intersection of a mesh element (ME) and a tube-of-response (TOR) for defining an effective length of photon transit and an effective attenuation coefficient. This approach to AC is compared to SRAC, which defines the effective length of photon transit as the intersection of a single ray and a ME and the effective attenuation coefficient as the mean along the ray path. Comparative quantitative and qualitative analysis demonstrated that SAAC outperformed SRAC in terms of reconstruction image accuracy and quality.
Feature recognition applications in mesh generation
Tautges, T.J.; Liu, S.S.; Lu, Y.; Kraftcheck, J.; Gadh, R.
1997-06-01
The use of feature recognition as part of an overall decomposition-based hexahedral meshing approach is described in this paper. The meshing approach consists of feature recognition, using a c-loop or hybrid c-loop method, and the use of cutting surfaces to decompose the solid model. These steps are part of an iterative process, which proceeds either until no more features can be recognized or until the model has been completely decomposed into meshable sub-volumes. This method can greatly reduce the time required to generate an all-hexahedral mesh, either through the use of more efficient meshing algorithms on more of the geometry or by reducing the amount of manual decomposition required to mesh a volume.
Modified mesh-connected parallel computers
Carlson, D.A. )
1988-10-01
The mesh-connected parallel computer is an important parallel processing organization that has been used in the past for the design of supercomputing systems. In this paper, the authors explore modifications of a mesh-connected parallel computer for the purpose of increasing the efficiency of executing important application programs. These modifications are made by adding one or more global mesh structures to the processing array. They show how our modifications allow asymptotic improvements in the efficiency of executing computations having low to medium interprocessor communication requirements (e.g., tree computations, prefix computations, finding the connected components of a graph). For computations with high interprocessor communication requirements such as sorting, they show that they offer no speedup. They also compare the modified mesh-connected parallel computer to other similar organizations including the pyramid, the X-tree, and the mesh-of-trees.
Ternary generalization of Heisenberg's algebra
NASA Astrophysics Data System (ADS)
Kerner, Richard
2015-06-01
A concise study of ternary and cubic algebras with Z3 grading is presented. We discuss some underlying ideas leading to the conclusion that the discrete symmetry group of permutations of three objects, S3, and its abelian subgroup Z3 may play an important role in quantum physics. We show then how most of important algebras with Z2 grading can be generalized with ternary composition laws combined with a Z3 grading. We investigate in particular a ternary, Z3-graded generalization of the Heisenberg algebra. It turns out that introducing a non-trivial cubic root of unity, , one can define two types of creation operators instead of one, accompanying the usual annihilation operator. The two creation operators are non-hermitian, but they are mutually conjugate. Together, the three operators form a ternary algebra, and some of their cubic combinations generate the usual Heisenberg algebra. An analogue of Hamiltonian operator is constructed by analogy with the usual harmonic oscillator, and some properties of its eigenfunctions are briefly discussed.
Beyond Dirac - a Unified Algebra
NASA Astrophysics Data System (ADS)
Lundberg, Wayne R.
2001-10-01
A introductory insight will be shared regarding a 'separation of variables' approach to understanding the relationship between QCD and the origins of cosmological and particle mass. The discussion will then build upon work presented at DFP 2000, focussing on the formal basis for using 3x3x3 matrix algebra as it underlies and extends Dirac notation. A set of restrictions are established which break the multiple symmetries of the 3x3x3 matrix algebra, yielding Standard Model QCD objects and interactions. It will be shown that the 3x3x3 matrix representation unifies the algebra of strong and weak (and by extension, electromagnetic) interactions. A direct correspondence to string theoretic objects is established by considering the string to be partitioned in thirds. Rubik's cube is used as a graphical means of handling algebraic manipulation of 3x3x3 algebra. Further, its potential utility for advancing pedagogical methods through active engagement is discussed. A simulated classroom exercize will be conducted.
An anisotropic scale-invariant unstructured mesh generator suitable for volumetric imaging data.
Kuprat, Andrew P; Einstein, Daniel R
2009-02-20
We present a boundary-fitted, scale-invariant unstructured tetrahedral mesh generation algorithm that enables registration of element size to local feature size. Given an input triangulated surface mesh, a feature size field is determined by casting rays normal to the surface and into the geometry and then performing gradient-limiting operations to enforce continuity of the resulting field. Surface mesh density is adjusted to be proportional to the feature size field and then a layered anisotropic volume mesh is generated. This mesh is "scale-invariant" in that roughly the same number of layers of mesh exist in mesh cross-sections, between a minimum scale size L(min) and a maximum scale size L(max). We illustrate how this field can be used to produce quality grids for computational fluid dynamics based simulations of challenging, topologically complex biological surfaces derived from magnetic resonance images. The algorithm is implemented in the Pacific Northwest National Laboratory (PNNL) version of the Los Alamos grid toolbox LaGriT[14]. Research funded by the National Heart and Blood Institute Award 1RO1HL073598-01A1. PMID:19784397
An anisotropic scale-invariant unstructured mesh generator suitable for volumetric imaging data
Kuprat, Andrew P.; Einstein, Daniel R.
2009-01-01
We present a boundary-fitted, scale-invariant unstructured tetrahedral mesh generation algorithm that enables registration of element size to local feature size. Given an input triangulated surface mesh, a feature size field is determined by casting rays normal to the surface and into the geometry and then performing gradient-limiting operations to enforce continuity of the resulting field. Surface mesh density is adjusted to be proportional to the feature size field and then a layered anisotropic volume mesh is generated. This mesh is “scale-invariant” in that roughly the same number of layers of mesh exist in mesh cross-sections, between a minimum scale size Lmin and a maximum scale size Lmax. We illustrate how this field can be used to produce quality grids for computational fluid dynamics based simulations of challenging, topologically complex biological surfaces derived from magnetic resonance images. The algorithm is implemented in the Pacific Northwest National Laboratory (PNNL) version of the Los Alamos grid toolbox LaGriT[14]. Research funded by the National Heart and Blood Institute Award 1RO1HL073598-01A1. PMID:19784397
PREFACE: Algebra, Geometry, and Mathematical Physics 2010
NASA Astrophysics Data System (ADS)
Stolin, A.; Abramov, V.; Fuchs, J.; Paal, E.; Shestopalov, Y.; Silvestrov, S.
2012-02-01
This proceedings volume presents results obtained by the participants of the 6th Baltic-Nordic workshop 'Algebra, Geometry, and Mathematical Physics (AGMP-6)' held at the Sven Lovén Centre for Marine Sciences in Tjärnö, Sweden on October 25-30, 2010. The Baltic-Nordic Network AGMP 'Algebra, Geometry, and Mathematical Physics' http://www.agmp.eu was created in 2005 on the initiative of two Estonian universities and two Swedish universities: Tallinn University of Technology represented by Eugen Paal (coordinator of the network), Tartu University represented by Viktor Abramov, Lund University represented by Sergei Silvestrov, and Chalmers University of Technology and the University of Gothenburg represented by Alexander Stolin. The goal was to promote international and interdisciplinary cooperation between scientists and research groups in the countries of the Baltic-Nordic region in mathematics and mathematical physics, with special emphasis on the important role played by algebra and geometry in modern physics, engineering and technologies. The main activities of the AGMP network consist of a series of regular annual international workshops, conferences and research schools. The AGMP network also constitutes an important educational forum for scientific exchange and dissimilation of research results for PhD students and Postdocs. The network has expanded since its creation, and nowadays its activities extend beyond countries in the Baltic-Nordic region to universities in other European countries and participants from elsewhere in the world. As one of the important research-dissimilation outcomes of its activities, the network has a tradition of producing high-quality research proceedings volumes after network events, publishing them with various international publishers. The PDF also contains the following: List of AGMP workshops and other AGMP activities Main topics discussed at AGMP-6 Review of AGMP-6 proceedings Acknowledgments List of Conference Participants
Automatic Mesh Generation of Hybrid Mesh on Valves in Multiple Positions in Feedline Systems
NASA Technical Reports Server (NTRS)
Ross, Douglass H.; Ito, Yasushi; Dorothy, Fredric W.; Shih, Alan M.; Peugeot, John
2010-01-01
Fluid flow simulations through a valve often require evaluation of the valve in multiple opening positions. A mesh has to be generated for the valve for each position and compounding. The problem is the fact that the valve is typically part of a larger feedline system. In this paper, we propose to develop a system to create meshes for feedline systems with parametrically controlled valve openings. Herein we outline two approaches to generate the meshes for a valve in a feedline system at multiple positions. There are two issues that must be addressed. The first is the creation of the mesh on the valve for multiple positions. The second is the generation of the mesh for the total feedline system including the valve. For generation of the mesh on the valve, we will describe the use of topology matching and mesh generation parameter transfer. For generation of the total feedline system, we will describe two solutions that we have implemented. In both cases the valve is treated as a component in the feedline system. In the first method the geometry of the valve in the feedline system is replaced with a valve at a different opening position. Geometry is created to connect the valve to the feedline system. Then topology for the valve is created and the portion of the topology for the valve is topology matched to the standard valve in a different position. The mesh generation parameters are transferred and then the volume mesh for the whole feedline system is generated. The second method enables the user to generate the volume mesh on the valve in multiple open positions external to the feedline system, to insert it into the volume mesh of the feedline system, and to reduce the amount of computer time required for mesh generation because only two small volume meshes connecting the valve to the feedline mesh need to be updated.
Algebraic Lattices in QFT Renormalization
NASA Astrophysics Data System (ADS)
Borinsky, Michael
2016-04-01
The structure of overlapping subdivergences, which appear in the perturbative expansions of quantum field theory, is analyzed using algebraic lattice theory. It is shown that for specific QFTs the sets of subdivergences of Feynman diagrams form algebraic lattices. This class of QFTs includes the standard model. In kinematic renormalization schemes, in which tadpole diagrams vanish, these lattices are semimodular. This implies that the Hopf algebra of Feynman diagrams is graded by the coradical degree or equivalently that every maximal forest has the same length in the scope of BPHZ renormalization. As an application of this framework, a formula for the counter terms in zero-dimensional QFT is given together with some examples of the enumeration of primitive or skeleton diagrams.
Algebraic Lattices in QFT Renormalization
NASA Astrophysics Data System (ADS)
Borinsky, Michael
2016-07-01
The structure of overlapping subdivergences, which appear in the perturbative expansions of quantum field theory, is analyzed using algebraic lattice theory. It is shown that for specific QFTs the sets of subdivergences of Feynman diagrams form algebraic lattices. This class of QFTs includes the standard model. In kinematic renormalization schemes, in which tadpole diagrams vanish, these lattices are semimodular. This implies that the Hopf algebra of Feynman diagrams is graded by the coradical degree or equivalently that every maximal forest has the same length in the scope of BPHZ renormalization. As an application of this framework, a formula for the counter terms in zero-dimensional QFT is given together with some examples of the enumeration of primitive or skeleton diagrams.
Moving frames and prolongation algebras
NASA Technical Reports Server (NTRS)
Estabrook, F. B.
1982-01-01
Differential ideals generated by sets of 2-forms which can be written with constant coefficients in a canonical basis of 1-forms are considered. By setting up a Cartan-Ehresmann connection, in a fiber bundle over a base space in which the 2-forms live, one finds an incomplete Lie algebra of vector fields in the fields in the fibers. Conversely, given this algebra (a prolongation algebra), one can derive the differential ideal. The two constructs are thus dual, and analysis of either derives properties of both. Such systems arise in the classical differential geometry of moving frames. Examples of this are discussed, together with examples arising more recently: the Korteweg-de Vries and Harrison-Ernst systems.
Method of modifying a volume mesh using sheet extraction
Borden, Michael J.; Shepherd, Jason F.
2007-02-20
A method and machine-readable medium provide a technique to modify a hexahedral finite element volume mesh using dual generation and sheet extraction. After generating a dual of a volume stack (mesh), a predetermined algorithm may be followed to modify the volume mesh of hexahedral elements. The predetermined algorithm may include the steps of determining a sheet of hexahedral mesh elements, generating nodes for merging, and merging the nodes to delete the sheet of hexahedral mesh elements and modify the volume mesh.
A comparison of gradient estimation methods for volume rendering on unstructured meshes.
Correa, Carlos D; Hero, Robert; Ma, Kwan-Liu
2011-03-01
This paper presents a study of gradient estimation methods for rendering unstructured-mesh volume data. Gradient estimation is necessary for rendering shaded isosurfaces and specular highlights, which provide important cues for shape and depth. Gradient estimation has been widely studied and deployed for regular-grid volume data to achieve local illumination effects, but has been, otherwise, for unstructured-mesh data. As a result, most of the unstructured-mesh volume visualizations made so far were unlit. In this paper, we present a comprehensive study of gradient estimation methods for unstructured meshes with respect to their cost and performance. Through a number of benchmarks, we discuss the effects of mesh quality and scalar function complexity in the accuracy of the reconstruction, and their impact in lighting-enabled volume rendering. Based on our study, we also propose two heuristic improvements to the gradient reconstruction process. The first heuristic improves the rendering quality with a hybrid algorithm that combines the results of the multiple reconstruction methods, based on the properties of a given mesh. The second heuristic improves the efficiency of its GPU implementation, by restricting the computation of the gradient on a fixed-size local neighborhood. PMID:21233515
Generalized Galilean algebras and Newtonian gravity
NASA Astrophysics Data System (ADS)
González, N.; Rubio, G.; Salgado, P.; Salgado, S.
2016-04-01
The non-relativistic versions of the generalized Poincaré algebras and generalized AdS-Lorentz algebras are obtained. These non-relativistic algebras are called, generalized Galilean algebras of type I and type II and denoted by GBn and GLn respectively. Using a generalized Inönü-Wigner contraction procedure we find that the generalized Galilean algebras of type I can be obtained from the generalized Galilean algebras type II. The S-expansion procedure allows us to find the GB5 algebra from the Newton Hooke algebra with central extension. The procedure developed in Ref. [1] allows us to show that the nonrelativistic limit of the five dimensional Einstein-Chern-Simons gravity is given by a modified version of the Poisson equation. The modification could be compatible with the effects of Dark Matter, which leads us to think that Dark Matter can be interpreted as a non-relativistic limit of Dark Energy.
Computer Algebra Systems in Undergraduate Instruction.
ERIC Educational Resources Information Center
Small, Don; And Others
1986-01-01
Computer algebra systems (such as MACSYMA and muMath) can carry out many of the operations of calculus, linear algebra, and differential equations. Use of them with sketching graphs of rational functions and with other topics is discussed. (MNS)
Motivating Activities that Lead to Algebra
ERIC Educational Resources Information Center
Menon, Ramakrishnan
2004-01-01
Four activities consisting of puzzles are introduced, which help students to recognize the strength of algebraic generalizations. They also assist them to comprehend algebraic concepts, and enable them to develop their individual puzzles and games.
Scalable Parallel Algebraic Multigrid Solvers
Bank, R; Lu, S; Tong, C; Vassilevski, P
2005-03-23
The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.
Computational triadic algebras of signs
Zadrozny, W.
1996-12-31
We present a finite model of Peirce`s ten classes of signs. We briefly describe Peirce`s taxonomy of signs; we prove that any finite collection of signs can be extended to a finite algebra of signs in which all interpretants are themselves being interpreted; and we argue that Peirce`s ten classes of signs can be defined using constraints on algebras of signs. The paper opens the possibility of defining multimodal cognitive agents using Peirce`s classes of signs, and is a first step towards building a computational logic of signs based on Peirce`s taxonomies.
Pillowing doublets: Refining a mesh to ensure that faces share at most one edge
Mitchell, S.A.; Tautges, T.J.
1995-11-01
Occasionally one may be confronted by a hexahedral or quadrilateral mesh containing doublets, two faces sharing two edges. In this case, no amount of smoothing will produce a mesh with agreeable element quality: in the planar case, one of these two faces will always have an angle of at least 180 degrees between the two edges. The authors describe a robust scheme for refining a hexahedral or quadrilateral mesh to separate such faces, so that any two faces share at most one edge. Note that this also ensures that two hexahedra share at most one face in the three dimensional case. The authors have implemented this algorithm and incorporated it into the CUBIT mesh generation environment developed at Sandia National Laboratories.
NASA Astrophysics Data System (ADS)
Yang, Bin; Xu, Canhua; Dai, Meng; Fu, Feng; Dong, Xiuzhen
2013-07-01
For electrical impedance tomography (EIT) of brain, the use of anatomically accurate and patient-specific finite element (FE) mesh has been shown to confer significant improvements in the quality of image reconstruction. But, given the lack of a rapid method to achieve the accurate anatomic geometry of the head, the generation of patient-specifc mesh is time-comsuming. In this paper, a modified fuzzy c-means algorithm based on non-local means method is performed to implement the segmentation of different layers in the head based on head CT images. This algorithm showed a better effect, especially an accurate recognition of the ventricles and a suitable performance dealing with noise. And the FE mesh established according to the segmentation results is validated in computational simulation. So a rapid practicable method can be provided for the generation of patient-specific FE mesh of the human head that is suitable for brain EIT.
Use of synthetic mesh for the entire abdominal wall after TRAM flap transfer.
Moscona, R A; Ramon, Y; Toledano, H; Barzilay, G
1998-03-01
Abdominal wall competence is a major concern of all plastic surgeons using the TRAM flap for breast reconstruction. Low hernia rates and adequate abdominal stability are standard expectations in abdominal wall closure. Described here is this institution's experience with the use of a large piece of synthetic mesh as a supplementary reinforcement for the entire abdominal wall in an attempt to stabilize it and achieve a superior abdominal aesthetic result. Twenty-five consecutive patients had routine reinforcement with the extended mesh technique. Mean patient follow-up was 24 months with a minimum of 1 year. No hernia or mesh-related infection were encountered and only one patient had a lower abdominal bulge. We recommend the use of a large synthetic mesh for improved strength and aesthetic quality of the abdominal wall after TRAM flap breast reconstruction. PMID:9500387
Particle-based Sampling and Meshing of Surfaces in Multimaterial Volumes
Meyer, Miriah; Whitaker, Ross; Kirby, Robert M.; Ledergerber, Christian; Pfister, Hanspeter
2009-01-01
Methods that faithfully and robustly capture the geometry of complex material interfaces in labeled volume data are important for generating realistic and accurate visualizations and simulations of real-world objects. The generation of such multimaterial models from measured data poses two unique challenges: first, the surfaces must be well-sampled with regular, efficient tessellations that are consistent across material boundaries; and second, the resulting meshes must respect the nonmanifold geometry of the multimaterial interfaces. This paper proposes a strategy for sampling and meshing multimaterial volumes using dynamic particle systems, including a novel, differentiable representation of the material junctions that allows the particle system to explicitly sample corners, edges, and surfaces of material intersections. The distributions of particles are controlled by fundamental sampling constraints, allowing Delaunay-based meshing algorithms to reliably extract watertight meshes of consistently high-quality. PMID:18989007
Evaluation of the generality and accuracy of a new mesh morphing procedure for the human femur.
Grassi, Lorenzo; Hraiech, Najah; Schileo, Enrico; Ansaloni, Mauro; Rochette, Michel; Viceconti, Marco
2011-01-01
Various papers described mesh morphing techniques for computational biomechanics, but none of them provided a quantitative assessment of generality, robustness, automation, and accuracy in predicting strains. This study aims to quantitatively evaluate the performance of a novel mesh-morphing algorithm. A mesh-morphing algorithm based on radial-basis functions and on manual selection of corresponding landmarks on template and target was developed. The periosteal geometries of 100 femurs were derived from a computed tomography scan database and used to test the algorithm generality in producing finite element (FE) morphed meshes. A published benchmark, consisting of eight femurs for which in vitro strain measurements and standard FE model strain prediction accuracy were available, was used to assess the accuracy of morphed FE models in predicting strains. Relevant parameters were identified to test the algorithm robustness to operative conditions. Time and effort needed were evaluated to define the algorithm degree of automation. Morphing was successful for 95% of the specimens, with mesh quality indicators comparable to those of standard FE meshes. Accuracy of the morphed meshes in predicting strains was good (R(2)>0.9, RMSE%<10%) and not statistically different from the standard meshes (p-value=0.1083). The algorithm was robust to inter- and intra-operator variability, target geometry refinement (p-value>0.05) and partially to the number of landmark used. Producing a morphed mesh starting from the triangularized geometry of the specimen requires on average 10 min. The proposed method is general, robust, automated, and accurate enough to be used in bone FE modelling from diagnostic data, and prospectively in applications such as statistical shape modelling. PMID:21036655
ERIC Educational Resources Information Center
Star, Jon R.; Rittle-Johnson, Bethany
2009-01-01
Competence in algebra is increasingly recognized as a critical milestone in students' middle and high school years. The transition from arithmetic to algebra is a notoriously difficult one, and improvements in algebra instruction are greatly needed (National Research Council, 2001). Algebra historically has represented students' first sustained…
Layered superhydrophobic meshes for controlled drug release.
Falde, Eric J; Freedman, Jonathan D; Herrera, Victoria L M; Yohe, Stefan T; Colson, Yolonda L; Grinstaff, Mark W
2015-09-28
Layered superhydrophobic electrospun meshes composed of poly(ε-caprolactone) (PCL) and poly(glycerol monostearate-co-ε-caprolactone) (PGC-C18) are described as a local source of chemotherapeutic delivery. Specifically, the chemotherapeutic agent SN-38 is incorporated into a central 'core' layer, between two 'shield' layers of mesh without drug. This mesh is resistant to wetting of the surface and throughout the bulk due to the pronounced hydrophobicity imparted by the high roughness of a hydrophobic polymer, PGC-C18. In serum solution, these meshes exhibit slow initial drug release over 10days corresponding to media infiltrating the shield layer, followed by steady release over >30days, as the drug-loaded core layer is wetted. This sequence of events is supported by X-ray computed tomography imaging of a contrast agent solution infiltrating the mesh. In vitro cytotoxicity data collected with Lewis Lung Carcinoma (LLC) cells are consistent with this release profile, remaining cytotoxic for over 20days, longer than the unlayered version. Finally, after subcutaneous implantation in rats, histology of meshes with and without drug demonstrated good integration and lack of adverse reaction over 28days. The drug release rates, robust superhydrophobicity, in vitro cytotoxicity of SN-38 loaded meshes, and compatibility provide key design parameters for the development of an implantable chemotherapeutic-loaded device for the prevention of local lung cancer recurrence following surgical resection. PMID:26160309
Boundary Recovery For Delaunay Tetrahedral Meshes Using Local Topological Transformations
Ghadyani, Hamid; Sullivan, John; Wu, Ziji
2009-01-01
Numerous high-quality, volume mesh-generation systems exist. However, no strategy can address all geometry situations without some element qualities being compromised. Many 3D mesh generation algorithms are based on Delaunay tetrahedralization which frequently fails to preserve the input boundary surface topology. For biomedical applications, this surface preservation can be critical as they usually contain multiple material regions of interest coherently connected. In this paper we present an algorithm as a post-processing method that optimizes local regions of compromised element quality and recovers the original boundary surface facets (triangles) regardless of the original mesh generation strategy. The algorithm carves out a small sub-volume in the vicinity of the missing boundary facet or compromised element, creating a cavity. If the task is to recover a surface boundary facet, a natural exit hole in the cavity will be present. This hole is patched with the missing boundary surface face first followed by other patches to seal the cavity. If the task was to improve a compromised region, then the cavity is already sealed. Every triangular facet of the cavity shell is classified as an active face and can be connected to another shell node creating a tetrahedron. In the process the base of the tetrahedron is removed from the active face list and potentially 3 new active faces are created. This methodology is the underpinnings of our last resort method. Each active face can be viewed as the trunk of a tree. An exhaustive breath and depth search will identify all possible tetrahedral combinations to uniquely fill the cavity. We have streamlined this recursive process reducing the time complexity by orders of magnitude. The original surfaces boundaries (internal and external) are fully restored and the quality of compromised regions improved. PMID:20305743
Spatial-Operator Algebra For Robotic Manipulators
NASA Technical Reports Server (NTRS)
Rodriguez, Guillermo; Kreutz, Kenneth K.; Milman, Mark H.
1991-01-01
Report discusses spatial-operator algebra developed in recent studies of mathematical modeling, control, and design of trajectories of robotic manipulators. Provides succinct representation of mathematically complicated interactions among multiple joints and links of manipulator, thereby relieving analyst of most of tedium of detailed algebraic manipulations. Presents analytical formulation of spatial-operator algebra, describes some specific applications, summarizes current research, and discusses implementation of spatial-operator algebra in the Ada programming language.
The weak Hopf algebras related to generalized Kac-Moody algebra
Wu Zhixiang
2006-06-15
We define a kind of quantized enveloping algebra of a generalized Kac-Moody algebra G by adding a generator J satisfying J{sup m}=J{sup m-1} for some integer m. We denote this algebra by wU{sub q}{sup {tau}}(G). This algebra is a weak Hopf algebra if and only if m=2. In general, it is a bialgebra, and contains a Hopf subalgebra. This Hopf subalgebra is isomorphic to the usually quantum envelope algebra U{sub q}(G) of a generalized Kac-Moody algebra G.
NASA Astrophysics Data System (ADS)
Zhang, Fang; Merrill, Matthew D.; Tokash, Justin C.; Saito, Tomonori; Cheng, Shaoan; Hickner, Michael A.; Logan, Bruce E.
Mesh current collectors made of stainless steel (SS) can be integrated into microbial fuel cell (MFC) cathodes constructed of a reactive carbon black and Pt catalyst mixture and a poly(dimethylsiloxane) (PDMS) diffusion layer. It is shown here that the mesh properties of these cathodes can significantly affect performance. Cathodes made from the coarsest mesh (30-mesh) achieved the highest maximum power of 1616 ± 25 mW m -2 (normalized to cathode projected surface area; 47.1 ± 0.7 W m -3 based on liquid volume), while the finest mesh (120-mesh) had the lowest power density (599 ± 57 mW m -2). Electrochemical impedance spectroscopy showed that charge transfer and diffusion resistances decreased with increasing mesh opening size. In MFC tests, the cathode performance was primarily limited by reaction kinetics, and not mass transfer. Oxygen permeability increased with mesh opening size, accounting for the decreased diffusion resistance. At higher current densities, diffusion became a limiting factor, especially for fine mesh with low oxygen transfer coefficients. These results demonstrate the critical nature of the mesh size used for constructing MFC cathodes.
Rabani, Y.
1996-12-31
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edge disjoint. Our objective is to minimize the number of colors used. This problem was raised by Aggarwal et al and Raghavan and Upfal as a model for routing in all-optical networks. It is also related to questions in circuit routing. In this paper, we improve the O (ln N) approximation result of Kleinberg and Tardos for path coloring on the N x N mesh. We give an O(1) approximation algorithm to the number of colors needed, and a poly(ln ln N) approximation algorithm to the choice of paths and colors. To the best of our knowledge, these are the first sub-logarithmic bounds for any network other than trees, rings, or trees of rings. Our results are based on developing new techniques for randomized rounding. These techniques iteratively improve a fractional solution until it approaches integrality. They are motivated by the method used by Leighton, Maggs, and Rao for packet routing.
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
Yoo, A; Hysom, D; Gunney, B
2010-12-02
In this paper, we propose a novel mesh coarsening method called brick coarsening method. The proposed method can be used in conjunction with any graph partitioners and scales to very large meshes. This method reduces problem space by decomposing the original mesh into fixed-size blocks of nodes called bricks, layered in a similar way to conventional brick laying, and then assigning each node of the original mesh to appropriate brick. Our experiments indicate that the proposed method scales to very large meshes while allowing simple RCB partitioner to produce higher-quality partitions with significantly less edge cuts. Our results further indicate that the proposed brick-coarsening method allows more complicated partitioners like PT-Scotch to scale to very large problem size while still maintaining good partitioning performance with relatively good edge-cut metric. Graph partitioning is an important problem that has many scientific and engineering applications in such areas as VLSI design, scientific computing, and resource management. Given a graph G = (V,E), where V is the set of vertices and E is the set of edges, (k-way) graph partitioning problem is to partition the vertices of the graph (V) into k disjoint groups such that each group contains roughly equal number of vertices and the number of edges connecting vertices in different groups is minimized. Graph partitioning plays a key role in large scientific computing, especially in mesh-based computations, as it is used as a tool to minimize the volume of communication and to ensure well-balanced load across computing nodes. The impact of graph partitioning on the reduction of communication can be easily seen, for example, in different iterative methods to solve a sparse system of linear equation. Here, a graph partitioning technique is applied to the matrix, which is basically a graph in which each edge is a non-zero entry in the matrix, to allocate groups of vertices to processors in such a way that many of
SUPERFISH accuracy dependence on mesh size
NASA Astrophysics Data System (ADS)
Merson, J. L.; Boicourt, G. P.
1989-02-01
The RF cavity code SUPERFISH is extensively used for the design of drift-tube linac (DTL), radio-frequency quadrupole (RFQ), and coupled-cavity linac (CCL) structures. It has been known for some time that considerably finer meshes are required near the nose of a drift tube to ensure accurate calculation of the resonant frequency and related secondary quantities. This paper discusses the results of numerical experiments designed to provide rules to set proper mesh sizes for DTL, RFQ, and CCL problems. During this work, SUPERFISH problems involving more than 100,000 mesh points were solved.
Abdominal wall reconstruction with implantable meshes.
Masden, Derek; Felder, John M; Iorio, Matthew L; Bhanot, Parag; Attinger, Christopher E
2011-01-01
Abdominal wall defects present a difficult problem for the reconstructive surgeon. Over the years, numerous implantable materials have becomes available to aid the surgeon in recreating the abdominal wall. This spectrum of implants includes permanent synthetic meshes, absorbable meshes, composite meshes and biomaterials. This review includes the pros and cons for the commercially available abdominal wall implants as well as a review of the literature regarding outcomes for each material. This review will provide the surgeon with current evidence-based information on implantable abdominal materials to be able to make a more informed decision about which implant to use. PMID:21663579
Application of mesh network radios to UGS
NASA Astrophysics Data System (ADS)
Calcutt, Wade; Jones, Barry; Roeder, Brent
2008-04-01
During the past five years McQ has been actively pursuing integrating and applying wireless mesh network radios as a communications solution for unattended ground sensor (UGS) systems. This effort has been rewarded with limited levels of success and has ultimately resulted in a corporate position regarding the use of mesh network radios for UGS systems. A discussion into the background of the effort, the challenges of implementing commercial off-the-shelf (COTS) mesh radios with UGSs, the tradeoffs involved, and an overview of the future direction is presented.
H(curl) Auxiliary Mesh Preconditioning
Kolev, T V; Pasciak, J E; Vassilevski, P S
2006-08-31
This paper analyzes a two-level preconditioning scheme for H(curl) bilinear forms. The scheme utilizes an auxiliary problem on a related mesh that is more amenable for constructing optimal order multigrid methods. More specifically, we analyze the case when the auxiliary mesh only approximately covers the original domain. The latter assumption is important since it allows for easy construction of nested multilevel spaces on regular auxiliary meshes. Numerical experiments in both two and three space dimensions illustrate the optimal performance of the method.
Engagement of Metal Debris into Gear Mesh
NASA Technical Reports Server (NTRS)
handschuh, Robert F.; Krantz, Timothy L.
2010-01-01
A series of bench-top experiments was conducted to determine the effects of metallic debris being dragged through meshing gear teeth. A test rig that is typically used to conduct contact fatigue experiments was used for these tests. Several sizes of drill material, shim stock and pieces of gear teeth were introduced and then driven through the meshing region. The level of torque required to drive the "chip" through the gear mesh was measured. From the data gathered, chip size sufficient to jam the mechanism can be determined.
Algebra? A Gate! A Barrier! A Mystery!
ERIC Educational Resources Information Center
Mathematics Educatio Dialogues, 2000
2000-01-01
This issue of Mathematics Education Dialogues focuses on the nature and the role of algebra in the K-14 curriculum. Articles on this theme include: (1) "Algebra For All? Why?" (Nel Noddings); (2) "Algebra For All: It's a Matter of Equity, Expectations, and Effectiveness" (Dorothy S. Strong and Nell B. Cobb); (3) "Don't Delay: Build and Talk about…
UCSMP Algebra. What Works Clearinghouse Intervention Report
ERIC Educational Resources Information Center
What Works Clearinghouse, 2007
2007-01-01
"University of Chicago School Mathematics Project (UCSMP) Algebra," designed to increase students' skills in algebra, is appropriate for students in grades 7-10, depending on the students' incoming knowledge. This one-year course highlights applications, uses statistics and geometry to develop the algebra of linear equations and inequalities, and…
Graphing Calculator Use in Algebra Teaching
ERIC Educational Resources Information Center
Dewey, Brenda L.; Singletary, Ted J.; Kinzel, Margaret T.
2009-01-01
This study examines graphing calculator technology availability, characteristics of teachers who use it, teacher attitudes, and how use reflects changes to algebra curriculum and instructional practices. Algebra I and Algebra II teachers in 75 high school and junior high/middle schools in a diverse region of a northwestern state were surveyed.…
New family of Maxwell like algebras
NASA Astrophysics Data System (ADS)
Concha, P. K.; Durka, R.; Merino, N.; Rodríguez, E. K.
2016-08-01
We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.
Build an Early Foundation for Algebra Success
ERIC Educational Resources Information Center
Knuth, Eric; Stephens, Ana; Blanton, Maria; Gardiner, Angela
2016-01-01
Research tells us that success in algebra is a factor in many other important student outcomes. Emerging research also suggests that students who are started on an algebra curriculum in the earlier grades may have greater success in the subject in secondary school. What's needed is a consistent, algebra-infused mathematics curriculum all…
A Balancing Act: Making Sense of Algebra
ERIC Educational Resources Information Center
Gavin, M. Katherine; Sheffield, Linda Jensen
2015-01-01
For most students, algebra seems like a totally different subject than the number topics they studied in elementary school. In reality, the procedures followed in arithmetic are actually based on the properties and laws of algebra. Algebra should be a logical next step for students in extending the proficiencies they developed with number topics…
Difficulties in Initial Algebra Learning in Indonesia
ERIC Educational Resources Information Center
Jupri, Al; Drijvers, Paul; van den Heuvel-Panhuizen, Marja
2014-01-01
Within mathematics curricula, algebra has been widely recognized as one of the most difficult topics, which leads to learning difficulties worldwide. In Indonesia, algebra performance is an important issue. In the Trends in International Mathematics and Science Study (TIMSS) 2007, Indonesian students' achievement in the algebra domain was…
Teaching Strategies to Improve Algebra Learning
ERIC Educational Resources Information Center
Zbiek, Rose Mary; Larson, Matthew R.
2015-01-01
Improving student learning is the primary goal of every teacher of algebra. Teachers seek strategies to help all students learn important algebra content and develop mathematical practices. The new Institute of Education Sciences[IES] practice guide, "Teaching Strategies for Improving Algebra Knowledge in Middle and High School Students"…
Lessons for Algebraic Thinking. Grades K-2.
ERIC Educational Resources Information Center
von Rotz, Leyani; Burns, Marilyn
Algebra is one of the top priorities of mathematics instruction for the elementary and middle grades. This book is designed to help K-2 teachers meet the challenge of making algebra an integral part of their mathematics instruction and realize both what to teach and how to teach central algebraic concepts. Classroom-tested lessons help teachers…
Unifying the Algebra for All Movement
ERIC Educational Resources Information Center
Eddy, Colleen M.; Quebec Fuentes, Sarah; Ward, Elizabeth K.; Parker, Yolanda A.; Cooper, Sandi; Jasper, William A.; Mallam, Winifred A.; Sorto, M. Alejandra; Wilkerson, Trena L.
2015-01-01
There exists an increased focus on school mathematics, especially first-year algebra, due to recent efforts for all students to be college and career ready. In addition, there are calls, policies, and legislation advocating for all students to study algebra epitomized by four rationales of the "Algebra for All" movement. In light of this…
ERIC Educational Resources Information Center
Evans, Judith L.; Schaeffer, Sheldon
1996-01-01
This issue of the Coordinator's Notebook focuses on the quality of Early Childhood Care and Development (ECCD) programs. The bulk of the issue is devoted to an article "Quality in ECCD: Everyone's Concern" (Judith Evans), which reviews the need for a definition of high quality in ECCD programs and discusses how diverse stakeholders define quality.…
Adaptive radial basis function mesh deformation using data reduction
NASA Astrophysics Data System (ADS)
Gillebaart, T.; Blom, D. S.; van Zuijlen, A. H.; Bijl, H.
2016-09-01
Radial Basis Function (RBF) mesh deformation is one of the most robust mesh deformation methods available. Using the greedy (data reduction) method in combination with an explicit boundary correction, results in an efficient method as shown in literature. However, to ensure the method remains robust, two issues are addressed: 1) how to ensure that the set of control points remains an accurate representation of the geometry in time and 2) how to use/automate the explicit boundary correction, while ensuring a high mesh quality. In this paper, we propose an adaptive RBF mesh deformation method, which ensures the set of control points always represents the geometry/displacement up to a certain (user-specified) criteria, by keeping track of the boundary error throughout the simulation and re-selecting when needed. Opposed to the unit displacement and prescribed displacement selection methods, the adaptive method is more robust, user-independent and efficient, for the cases considered. Secondly, the analysis of a single high aspect ratio cell is used to formulate an equation for the correction radius needed, depending on the characteristics of the correction function used, maximum aspect ratio, minimum first cell height and boundary error. Based on the analysis two new radial basis correction functions are derived and proposed. This proposed automated procedure is verified while varying the correction function, Reynolds number (and thus first cell height and aspect ratio) and boundary error. Finally, the parallel efficiency is studied for the two adaptive methods, unit displacement and prescribed displacement for both the CPU as well as the memory formulation with a 2D oscillating and translating airfoil with oscillating flap, a 3D flexible locally deforming tube and deforming wind turbine blade. Generally, the memory formulation requires less work (due to the large amount of work required for evaluating RBF's), but the parallel efficiency reduces due to the limited
Effects on Diagnostic Parameters After Removing Additional Synchronous Gear Meshes
NASA Technical Reports Server (NTRS)
Decker, Harry J.
2003-01-01
Gear cracks are typically difficult to diagnose with sufficient time before catastrophic damage occurs. Significant damage must be present before algorithms appear to be able to detect the damage. Frequently there are multiple gear meshes on a single shaft. Since they are all synchronous with the shaft frequency, the commonly used synchronous averaging technique is ineffective in removing other gear mesh effects. Carefully applying a filter to these extraneous gear mesh frequencies can reduce the overall vibration signal and increase the accuracy of commonly used vibration metrics. The vibration signals from three seeded fault tests were analyzed using this filtering procedure. Both the filtered and unfiltered vibration signals were then analyzed using commonly used fault detection metrics and compared. The tests were conducted on aerospace quality spur gears in a test rig. The tests were conducted at speeds ranging from 2500 to 5000 revolutions per minute and torques from 184 to 228 percent of design load. The inability to detect these cracks with high confidence results from the high loading which is causing fast fracture as opposed to stable crack growth. The results indicate that these techniques do not currently produce an indication of damage that significantly exceeds experimental scatter.
Weaving Geometry and Algebra Together
ERIC Educational Resources Information Center
Cetner, Michelle
2015-01-01
When thinking about student reasoning and sense making, teachers must consider the nature of tasks given to students along with how to plan to use the tasks in the classroom. Students should be presented with tasks in a way that encourages them to draw connections between algebraic and geometric concepts. This article focuses on the idea that it…
Inequalities, Assessment and Computer Algebra
ERIC Educational Resources Information Center
Sangwin, Christopher J.
2015-01-01
The goal of this paper is to examine single variable real inequalities that arise as tutorial problems and to examine the extent to which current computer algebra systems (CAS) can (1) automatically solve such problems and (2) determine whether students' own answers to such problems are correct. We review how inequalities arise in…
ERIC Educational Resources Information Center
Bosse, Michael J.; Ries, Heather; Chandler, Kayla
2012-01-01
Secondary school mathematics teachers often need to answer the "Why do we do that?" question in such a way that avoids confusion and evokes student interest. Understanding the properties of number systems can provide an avenue to better grasp algebraic structures, which in turn builds students' conceptual knowledge of secondary mathematics. This…
Implementing Change in College Algebra
ERIC Educational Resources Information Center
Haver, William E.
2007-01-01
In this paper, departments are urged to consider implementing the type of changes proposed in Beyond Crossroads in College Algebra. The author of this paper is chair of the Curriculum Renewal Across the First Two Years (CRAFTY) Committee of the Mathematical Association of America. The committee has members from two-year colleges, four-year…
Algebraic Activities Aid Discovery Lessons
ERIC Educational Resources Information Center
Wallace-Gomez, Patricia
2013-01-01
After a unit on the rules for positive and negative numbers and the order of operations for evaluating algebraic expressions, many students believe that they understand these principles well enough, but they really do not. They clearly need more practice, but not more of the same kind of drill. Wallace-Gomez provides three graphing activities that…
Fuzzy-algebra uncertainty assessment
Cooper, J.A.; Cooper, D.K.
1994-12-01
A significant number of analytical problems (for example, abnormal-environment safety analysis) depend on data that are partly or mostly subjective. Since fuzzy algebra depends on subjective operands, we have been investigating its applicability to these forms of assessment, particularly for portraying uncertainty in the results of PRA (probabilistic risk analysis) and in risk-analysis-aided decision-making. Since analysis results can be a major contributor to a safety-measure decision process, risk management depends on relating uncertainty to only known (not assumed) information. The uncertainties due to abnormal environments are even more challenging than those in normal-environment safety assessments; and therefore require an even more judicious approach. Fuzzy algebra matches these requirements well. One of the most useful aspects of this work is that we have shown the potential for significant differences (especially in perceived margin relative to a decision threshold) between fuzzy assessment and probabilistic assessment based on subtle factors inherent in the choice of probability distribution models. We have also shown the relation of fuzzy algebra assessment to ``bounds`` analysis, as well as a description of how analyses can migrate from bounds analysis to fuzzy-algebra analysis, and to probabilistic analysis as information about the process to be analyzed is obtained. Instructive examples are used to illustrate the points.
Entropy algebras and Birkhoff factorization
NASA Astrophysics Data System (ADS)
Marcolli, Matilde; Tedeschi, Nicolas
2015-11-01
We develop notions of Rota-Baxter structures and associated Birkhoff factorizations, in the context of min-plus semirings and their thermodynamic deformations, including deformations arising from quantum information measures such as the von Neumann entropy. We consider examples related to Manin's renormalization and computation program, to Markov random fields and to counting functions and zeta functions of algebraic varieties.
Algebra for All. Research Brief
ERIC Educational Resources Information Center
Bleyaert, Barbara
2009-01-01
The call for "algebra for all" is not a recent phenomenon. Concerns about the inadequacy of math (and science) preparation in America's high schools have been a steady drumbeat since the 1957 launch of Sputnik; a call for raising standards and the number of math (and science) courses required for graduation has been a part of countless national…
ERIC Educational Resources Information Center
Oishi, Lindsay
2011-01-01
"Solve for x." While many people first encountered this enigmatic instruction in high school, the last 20 years have seen a strong push to get students to take algebra in eighth grade or even before. Today, concerns about the economy highlight a familiar worry: American eighth-graders trailed their peers in five Asian countries on the 2007 TIMSS…
Exploring Algebraic Misconceptions with Technology
ERIC Educational Resources Information Center
Sakow, Matthew; Karaman, Ruveyda
2015-01-01
Many students struggle with algebra, from simplifying expressions to solving systems of equations. Students also have misconceptions about the meaning of variables. In response to the question "Can x + y + z ever equal x + p + z?" during a student interview, the student claimed, "Never . . . because p has to have a different value…
An Introduction to Algebraic Multigrid
Falgout, R D
2006-04-25
Algebraic multigrid (AMG) solves linear systems based on multigrid principles, but in a way that only depends on the coefficients in the underlying matrix. The author begins with a basic introduction to AMG methods, and then describes some more recent advances and theoretical developments
Elementary Algebra Connections to Precalculus
ERIC Educational Resources Information Center
Lopez-Boada, Roberto; Daire, Sandra Arguelles
2013-01-01
This article examines the attitudes of some precalculus students to solve trigonometric and logarithmic equations and systems using the concepts of elementary algebra. With the goal of enticing the students to search for and use connections among mathematical topics, they are asked to solve equations or systems specifically designed to allow…
Adventures in Flipping College Algebra
ERIC Educational Resources Information Center
Van Sickle, Jenna
2015-01-01
This paper outlines the experience of a university professor who implemented flipped learning in two sections of college algebra courses for two semesters. It details how the courses were flipped, what technology was used, advantages, challenges, and results. It explains what students do outside of class, what they do inside class, and discusses…
Kinds of Knowledge in Algebra.
ERIC Educational Resources Information Center
Lewis, Clayton
Solving equations in elementary algebra requires knowledge of the permitted operations, and knowledge of what operation to use at a given point in the solution process. While just these kinds of knowledge would be adequate for an ideal solver, human solvers appear to need and use other kinds of knowledge. First, many errors seem to indicate that…
Algebra, Home Mortgages, and Recessions
ERIC Educational Resources Information Center
Mariner, Jean A. Miller; Miller, Richard A.
2009-01-01
The current financial crisis and recession in the United States present an opportunity to discuss relevant applications of some topics in typical first-and second-year algebra and precalculus courses. Real-world applications of percent change, exponential functions, and sums of finite geometric sequences can help students understand the problems…
Algebra from Chips and Chopsticks
ERIC Educational Resources Information Center
Yun, Jeong Oak; Flores, Alfinio
2012-01-01
Students can use geometric representations of numbers as a way to explore algebraic ideas. With the help of these representations, students can think about the relations among the numbers, express them using their own words, and represent them with letters. The activities discussed here can stimulate students to try to find various ways of solving…
Celestial mechanics with geometric algebra
NASA Technical Reports Server (NTRS)
Hestenes, D.
1983-01-01
Geometric algebra is introduced as a general tool for Celestial Mechanics. A general method for handling finite rotations and rotational kinematics is presented. The constants of Kepler motion are derived and manipulated in a new way. A new spinor formulation of perturbation theory is developed.
Algebraic methods in system theory
NASA Technical Reports Server (NTRS)
Brockett, R. W.; Willems, J. C.; Willsky, A. S.
1975-01-01
Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.
Principals + Algebra (- Fear) = Instructional Leadership
ERIC Educational Resources Information Center
Carver, Cynthia L.
2010-01-01
Recent state legislation in Michigan mandates that all graduating seniors successfully pass algebra I and II. Numerous initiatives have been enacted to help mathematics teachers meet this challenge, yet school principals have had little preparation for the necessary curricular and instructional changes. To address this unmet need, university-based…
Experts Question California's Algebra Edict
ERIC Educational Resources Information Center
Cavanagh, Sean
2008-01-01
Business leaders from important sectors of the American economy have been urging schools to set higher standards in math and science--and California officials, in mandating that 8th graders be tested in introductory algebra, have responded with one of the highest such standards in the land. Still, many California educators and school…
Numerical simulation of H2/air detonation using unstructured mesh
NASA Astrophysics Data System (ADS)
Togashi, Fumiya; Löhner, Rainald; Tsuboi, Nobuyuki
2009-06-01
To explore the capability of unstructured mesh to simulate detonation wave propagation phenomena, numerical simulation of H2/air detonation using unstructured mesh was conducted. The unstructured mesh has several adv- antages such as easy mesh adaptation and flexibility to the complicated configurations. To examine the resolution dependency of the unstructured mesh, several simulations varying the mesh size were conducted and compared with a computed result using a structured mesh. The results show that the unstructured mesh solution captures the detailed structure of detonation wave, as well as the structured mesh solution. To capture the detailed detonation cell structure, the unstructured mesh simulations required at least twice, ideally 5times the resolution of structured mesh solution.
Simulation of nonpoint source contamination based on adaptive mesh refinement
NASA Astrophysics Data System (ADS)
Kourakos, G.; Harter, T.
2014-12-01
Contamination of groundwater aquifers from nonpoint sources is a worldwide problem. Typical agricultural groundwater basins receive contamination from a large array (in the order of ~10^5-6) of spatially and temporally heterogeneous sources such as fields, crops, dairies etc, while the received contaminants emerge at significantly uncertain time lags to a large array of discharge surfaces such as public supply, domestic and irrigation wells and streams. To support decision making in such complex regimes several approaches have been developed, which can be grouped into 3 categories: i) Index methods, ii)regression methods and iii) physically based methods. Among the three, physically based methods are considered more accurate, but at the cost of computational demand. In this work we present a physically based simulation framework which exploits the latest hardware and software developments to simulate large (>>1,000 km2) groundwater basins. First we simulate groundwater flow using a sufficiently detailed mesh to capture the spatial heterogeneity. To achieve optimal mesh quality we combine adaptive mesh refinement with the nonlinear solution for unconfined flow. Starting from a coarse grid the mesh is refined iteratively in the parts of the domain where the flow heterogeneity appears higher resulting in optimal grid. Secondly we simulate the nonpoint source pollution based on the detailed velocity field computed from the previous step. In our approach we use the streamline model where the 3D transport problem is decomposed into multiple 1D transport problems. The proposed framework is applied to simulate nonpoint source pollution in the Central Valley aquifer system, California.
The linear algebraic method for electron-molecule collisions
Collins, L.A.; Schneider, B.I.
1995-09-01
In order to find numerical solutions to many problems in physics, chemistry and engineering it is necessary to place the equations of motion (classical or quantal) of the variables of dynamical interest on a discrete mesh. The formulation of scattering theory in quantum mechanics is no exception and leads to partial differential or integral equations which may only be solved on digital computers. Typical approaches introduce a numerical grid or basis set expansion of the scattering wavefunction in order to reduce `the problem to the solution of a set of algebraic equations. Often it is more convenient to deal with the scattering matrix or phase amplitude rather than the wavefunction but the essential features of the numerics are unchanged. In this section we will formulate the Linear Algebraic Method (LAM) for electron-atom/molecule scattering for a simple, one-dimensional radial potential. This will illustrate the basic approach and enable the uninitiated reader to follow the subsequent discussion of the general, multi-channel, electron-molecule formulation without undue difficulty. We begin by writing the Schroedinger equation for the s-wave scattering of a structureless particle by a short-range, local potential.
Grid adaptation using chimera composite overlapping meshes
NASA Technical Reports Server (NTRS)
Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen
1994-01-01
The objective of this paper is to perform grid adaptation using composite overlapping meshes in regions of large gradient to accurately capture the salient features during computation. The chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using trilinear interpolation. Application to the Euler equations for shock reflections and to shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well-resolved.
Grid adaptation using Chimera composite overlapping meshes
NASA Technical Reports Server (NTRS)
Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen
1993-01-01
The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.
A mesh gradient technique for numerical optimization
NASA Technical Reports Server (NTRS)
Willis, E. A., Jr.
1973-01-01
A class of successive-improvement optimization methods in which directions of descent are defined in the state space along each trial trajectory are considered. The given problem is first decomposed into two discrete levels by imposing mesh points. Level 1 consists of running optimal subarcs between each successive pair of mesh points. For normal systems, these optimal two-point boundary value problems can be solved by following a routine prescription if the mesh spacing is sufficiently close. A spacing criterion is given. Under appropriate conditions, the criterion value depends only on the coordinates of the mesh points, and its gradient with respect to those coordinates may be defined by interpreting the adjoint variables as partial derivatives of the criterion value function. In level 2, the gradient data is used to generate improvement steps or search directions in the state space which satisfy the boundary values and constraints of the given problem.
LR: Compact connectivity representation for triangle meshes
Gurung, T; Luffel, M; Lindstrom, P; Rossignac, J
2011-01-28
We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.
Grid adaption using Chimera composite overlapping meshes
NASA Technical Reports Server (NTRS)
Kao, Kai-Hsiung; Liou, Meng-Sing; Chow, Chuen-Yen
1993-01-01
The objective of this paper is to perform grid adaptation using composite over-lapping meshes in regions of large gradient to capture the salient features accurately during computation. The Chimera grid scheme, a multiple overset mesh technique, is used in combination with a Navier-Stokes solver. The numerical solution is first converged to a steady state based on an initial coarse mesh. Solution-adaptive enhancement is then performed by using a secondary fine grid system which oversets on top of the base grid in the high-gradient region, but without requiring the mesh boundaries to join in any special way. Communications through boundary interfaces between those separated grids are carried out using tri-linear interpolation. Applications to the Euler equations for shock reflections and to a shock wave/boundary layer interaction problem are tested. With the present method, the salient features are well resolved.
Efficiently Sorting Zoo-Mesh Data Sets
Cook, R; Max, N; Silva, C; Williams, P
2001-03-26
The authors describe the SXMPVO algorithm for performing a visibility ordering zoo-meshed polyhedra. The algorithm runs in practice in linear time and the visibility ordering which it produces is exact.
Octree based automatic meshing from CSG models
NASA Technical Reports Server (NTRS)
Perucchio, Renato
1987-01-01
Finite element meshes derived automatically from solid models through recursive spatial subdivision schemes (octrees) can be made to inherit the hierarchical structure and the spatial addressability intrinsic to the underlying grid. These two properties, together with the geometric regularity that can also be built into the mesh, make octree based meshes ideally suited for efficient analysis and self-adaptive remeshing and reanalysis. The element decomposition of the octal cells that intersect the boundary of the domain is emphasized. The problem, central to octree based meshing, is solved by combining template mapping and element extraction into a procedure that utilizes both constructive solid geometry and boundary respresentation techniques. Boundary cells that are not intersected by the edge of the domain boundary are easily mapped to predefined element topology. Cells containing edges (and vertices) are first transformed into a planar polyhedron and then triangulated via element extractors. The modeling environments required for the derivation of planar polyhedra and for element extraction are analyzed.
An efficient parallel algorithm for mesh smoothing
Freitag, L.; Plassmann, P.; Jones, M.
1995-12-31
Automatic mesh generation and adaptive refinement methods have proven to be very successful tools for the efficient solution of complex finite element applications. A problem with these methods is that they can produce poorly shaped elements; such elements are undesirable because they introduce numerical difficulties in the solution process. However, the shape of the elements can be improved through the determination of new geometric locations for mesh vertices by using a mesh smoothing algorithm. In this paper the authors present a new parallel algorithm for mesh smoothing that has a fast parallel runtime both in theory and in practice. The authors present an efficient implementation of the algorithm that uses non-smooth optimization techniques to find the new location of each vertex. Finally, they present experimental results obtained on the IBM SP system demonstrating the efficiency of this approach.
The Exocenter of a Generalized Effect Algebra
NASA Astrophysics Data System (ADS)
Foulis, David J.; Pulmannová, Sylvia
2011-12-01
Elements of the exocenter of a generalized effect algebra (GEA) correspond to decompositions of the GEA as a direct sum and thus the exocenter is a generalization to GEAs of the center of an effect algebra. The exocenter of a GEA is shown to be a boolean algebra, and the notion of a hull mapping for an effect algebra is generalized to a hull system for a GEA. We study Dedekind orthocompleteness of GEAs and extend to GEAs the notion of a centrally orthocomplete effect algebra.
Array algebra estimation in signal processing
NASA Astrophysics Data System (ADS)
Rauhala, U. A.
A general theory of linear estimators called array algebra estimation is interpreted in some terms of multidimensional digital signal processing, mathematical statistics, and numerical analysis. The theory has emerged during the past decade from the new field of a unified vector, matrix and tensor algebra called array algebra. The broad concepts of array algebra and its estimation theory cover several modern computerized sciences and technologies converting their established notations and terminology into one common language. Some concepts of digital signal processing are adopted into this language after a review of the principles of array algebra estimation and its predecessors in mathematical surveying sciences.
Refining quadrilateral and brick element meshes
Schneiders, R.; Debye, J.
1995-12-31
We consider the problem of refining unstructured quadrilateral and brick element meshes. We present an algorithm which is a generalization of an algorithm developed by Cheng et. al. for structured quadrilateral element meshes. The problem is solved for the two-dimensional case. Concerning three dimensions we present a solution for some special cases and a general solution that introduces tetrahedral and pyramidal transition elements.
MHD simulations on an unstructured mesh
Strauss, H.R.; Park, W.; Belova, E.; Fu, G.Y.; Longcope, D.W.; Sugiyama, L.E.
1998-12-31
Two reasons for using an unstructured computational mesh are adaptivity, and alignment with arbitrarily shaped boundaries. Two codes which use finite element discretization on an unstructured mesh are described. FEM3D solves 2D and 3D RMHD using an adaptive grid. MH3D++, which incorporates methods of FEM3D into the MH3D generalized MHD code, can be used with shaped boundaries, which might be 3D.
Implantation of the eSVS Mesh.
Emery, Robert W; Solien, Eric; Jamieson, Stuart W
2012-01-01
The eSVS Mesh (Kipps Bay Medical, Minneapolis, MN USA) Mesh (Kipps Bay Medical, Minneapolis, MN USA) is a new concept in improving saphenous vein graft patency for coronary bypass grafting. This is a nitinol-based external support device that maintains external support of the graft and prevents detrimental expansion when exposed to arterial pressure. The implanting technique is critical to outcomes and is described in this article. Clinical testing in the United States is pending. PMID:22576039
Adaptive Mesh Refinement for Microelectronic Device Design
NASA Technical Reports Server (NTRS)
Cwik, Tom; Lou, John; Norton, Charles
1999-01-01
Finite element and finite volume methods are used in a variety of design simulations when it is necessary to compute fields throughout regions that contain varying materials or geometry. Convergence of the simulation can be assessed by uniformly increasing the mesh density until an observable quantity stabilizes. Depending on the electrical size of the problem, uniform refinement of the mesh may be computationally infeasible due to memory limitations. Similarly, depending on the geometric complexity of the object being modeled, uniform refinement can be inefficient since regions that do not need refinement add to the computational expense. In either case, convergence to the correct (measured) solution is not guaranteed. Adaptive mesh refinement methods attempt to selectively refine the region of the mesh that is estimated to contain proportionally higher solution errors. The refinement may be obtained by decreasing the element size (h-refinement), by increasing the order of the element (p-refinement) or by a combination of the two (h-p refinement). A successful adaptive strategy refines the mesh to produce an accurate solution measured against the correct fields without undue computational expense. This is accomplished by the use of a) reliable a posteriori error estimates, b) hierarchal elements, and c) automatic adaptive mesh generation. Adaptive methods are also useful when problems with multi-scale field variations are encountered. These occur in active electronic devices that have thin doped layers and also when mixed physics is used in the calculation. The mesh needs to be fine at and near the thin layer to capture rapid field or charge variations, but can coarsen away from these layers where field variations smoothen and charge densities are uniform. This poster will present an adaptive mesh refinement package that runs on parallel computers and is applied to specific microelectronic device simulations. Passive sensors that operate in the infrared portion of
Quadrilateral/hexahedral finite element mesh coarsening
Staten, Matthew L; Dewey, Mark W; Scott, Michael A; Benzley, Steven E
2012-10-16
A technique for coarsening a finite element mesh ("FEM") is described. This technique includes identifying a coarsening region within the FEM to be coarsened. Perimeter chords running along perimeter boundaries of the coarsening region are identified. The perimeter chords are redirected to create an adaptive chord separating the coarsening region from a remainder of the FEM. The adaptive chord runs through mesh elements residing along the perimeter boundaries of the coarsening region. The adaptive chord is then extracted to coarsen the FEM.
Arbitrary Lagrangian Eulerian Adaptive Mesh Refinement
Koniges, A.; Eder, D.; Masters, N.; Fisher, A.; Anderson, R.; Gunney, B.; Wang, P.; Benson, D.; Dixit, P.
2009-09-29
This is a simulation code involving an ALE (arbitrary Lagrangian-Eulerian) hydrocode with AMR (adaptive mesh refinement) and pluggable physics packages for material strength, heat conduction, radiation diffusion, and laser ray tracing developed a LLNL, UCSD, and Berkeley Lab. The code is an extension of the open source SAMRAI (Structured Adaptive Mesh Refinement Application Interface) code/library. The code can be used in laser facilities such as the National Ignition Facility. The code is alsi being applied to slurry flow (landslides).
Early- Versus Late-Onset Prosthetic Mesh Infection: More than Time Alone.
Kong, Wencheng; Wang, Jian; Mao, Qi; Ren, Lele; Zhang, Shaoyi; Yao, Danhua; Guo, Mingxiao; Li, Yousheng
2015-12-01
Prosthetic mesh used for ventral incisional hernia makes hernia repair surgery simple, effective, and safe. The mesh infection is a formidable complication and bimodal distribution. The differences between early- and late-onset are unknown. This is a cohort study of patients undergoing ventral incisional hernia (VIH) repair from January 2003 to September 2013. Data of specific risk variables were collected from electronic medical record systems in Jinling Hospital. And, the quality of lives was evaluated by WHO Quality of Life-BREF. A total of 102 VIH repair patients were analyzed and followed including the noninfection group and early- and late-onset group. There were significant differences between the early- and late-onset group in clinical manifestation, descriptive analysis of the study population, and postoperative quality of lives. These differences might imply the different pathophysiologic process of early- and late-onset mesh infection. Permanent prosthetic mesh should be used with caution, and the study of intraperitoneal onlay mesh is still needed in long-term follow-up. PMID:27011528
NASA Astrophysics Data System (ADS)
Denner, Fabian; van Wachem, Berend G. M.
2015-10-01
Total variation diminishing (TVD) schemes are a widely applied group of monotonicity-preserving advection differencing schemes for partial differential equations in numerical heat transfer and computational fluid dynamics. These schemes are typically designed for one-dimensional problems or multidimensional problems on structured equidistant quadrilateral meshes. Practical applications, however, often involve complex geometries that cannot be represented by Cartesian meshes and, therefore, necessitate the application of unstructured meshes, which require a more sophisticated discretisation to account for their additional topological complexity. In principle, TVD schemes are applicable to unstructured meshes, however, not all the data required for TVD differencing is readily available on unstructured meshes, and the solution suffers from considerable numerical diffusion as a result of mesh skewness. In this article we analyse TVD differencing on unstructured three-dimensional meshes, focusing on the non-linearity of TVD differencing and the extrapolation of the virtual upwind node. Furthermore, we propose a novel monotonicity-preserving correction method for TVD schemes that significantly reduces numerical diffusion caused by mesh skewness. The presented numerical experiments demonstrate the importance of accounting for the non-linearity introduced by TVD differencing and of imposing carefully chosen limits on the extrapolated virtual upwind node, as well as the efficacy of the proposed method to correct mesh skewness.
Mesh geometry impact on Micromegas performance with an Exchangeable Mesh prototype
NASA Astrophysics Data System (ADS)
Kuger, F.; Bianco, M.; Iengo, P.; Sekhniaidze, G.; Veenhof, R.; Wotschack, J.
2016-07-01
The reconstruction precision of gaseous detectors is limited by losses of primary electrons during signal formation. In addition to common gas related losses, like attachment, Micromegas suffer from electron absorption during its transition through the micro mesh. This study aims for a deepened understanding of electron losses and their dependency on the mesh geometry. It combines experimental results obtained with a novel designed Exchangeable Mesh Micromegas (ExMe) and advanced microscopic-tracking simulations (ANSYS and Garfield++) of electron drift and mesh transition.
Hybrid Surface Mesh Adaptation for Climate Modeling
Khamayseh, Ahmed K; de Almeida, Valmor F; Hansen, Glen
2008-01-01
Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision (h adaptation) with a primary goal of resolving the local length scales of interest. A second, less-popular method of spatial adaptivity is called "mesh motion" (r adaptation); the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning (rh adaptation). By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is produced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.
Hybrid Surface Mesh Adaptation for Climate Modeling
Ahmed Khamayseh; Valmor de Almeida; Glen Hansen
2008-10-01
Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision (h adaptation) with a primary goal of resolving the local length scales of interest. A second, less-popular method of spatial adaptivity is called “mesh motion” (r adaptation); the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning (rh adaptation). By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is produced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.
How to model wireless mesh networks topology
NASA Astrophysics Data System (ADS)
Sanni, M. L.; Hashim, A. A.; Anwar, F.; Ahmed, G. S. M.; Ali, S.
2013-12-01
The specification of network connectivity model or topology is the beginning of design and analysis in Computer Network researches. Wireless Mesh Networks is an autonomic network that is dynamically self-organised, self-configured while the mesh nodes establish automatic connectivity with the adjacent nodes in the relay network of wireless backbone routers. Researches in Wireless Mesh Networks range from node deployment to internetworking issues with sensor, Internet and cellular networks. These researches require modelling of relationships and interactions among nodes including technical characteristics of the links while satisfying the architectural requirements of the physical network. However, the existing topology generators model geographic topologies which constitute different architectures, thus may not be suitable in Wireless Mesh Networks scenarios. The existing methods of topology generation are explored, analysed and parameters for their characterisation are identified. Furthermore, an algorithm for the design of Wireless Mesh Networks topology based on square grid model is proposed in this paper. The performance of the topology generated is also evaluated. This research is particularly important in the generation of a close-to-real topology for ensuring relevance of design to the intended network and validity of results obtained in Wireless Mesh Networks researches.
Automatic scheme selection for toolkit hex meshing
WHITE,DAVID R.; TAUTGES,TIMOTHY J.
2000-02-17
Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50% of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment.
Automatic Scheme Selection for Toolkit Hex Meshing
TAUTGES,TIMOTHY J.; WHITE,DAVID R.
1999-09-27
Current hexahedral mesh generation techniques rely on a set of meshing tools, which when combined with geometry decomposition leads to an adequate mesh generation process. Of these tools, sweeping tends to be the workhorse algorithm, accounting for at least 50% of most meshing applications. Constraints which must be met for a volume to be sweepable are derived, and it is proven that these constraints are necessary but not sufficient conditions for sweepability. This paper also describes a new algorithm for detecting extruded or sweepable geometries. This algorithm, based on these constraints, uses topological and local geometric information, and is more robust than feature recognition-based algorithms. A method for computing sweep dependencies in volume assemblies is also given. The auto sweep detect and sweep grouping algorithms have been used to reduce interactive user time required to generate all-hexahedral meshes by filtering out non-sweepable volumes needing further decomposition and by allowing concurrent meshing of independent sweep groups. Parts of the auto sweep detect algorithm have also been used to identify independent sweep paths, for use in volume-based interval assignment.
Discrete differential geometry: The nonplanar quadrilateral mesh
NASA Astrophysics Data System (ADS)
Twining, Carole J.; Marsland, Stephen
2012-06-01
We consider the problem of constructing a discrete differential geometry defined on nonplanar quadrilateral meshes. Physical models on discrete nonflat spaces are of inherent interest, as well as being used in applications such as computation for electromagnetism, fluid mechanics, and image analysis. However, the majority of analysis has focused on triangulated meshes. We consider two approaches: discretizing the tensor calculus, and a discrete mesh version of differential forms. While these two approaches are equivalent in the continuum, we show that this is not true in the discrete case. Nevertheless, we show that it is possible to construct mesh versions of the Levi-Civita connection (and hence the tensorial covariant derivative and the associated covariant exterior derivative), the torsion, and the curvature. We show how discrete analogs of the usual vector integral theorems are constructed in such a way that the appropriate conservation laws hold exactly on the mesh, rather than only as approximations to the continuum limit. We demonstrate the success of our method by constructing a mesh version of classical electromagnetism and discuss how our formalism could be used to deal with other physical models, such as fluids.
Discrete differential geometry: the nonplanar quadrilateral mesh.
Twining, Carole J; Marsland, Stephen
2012-06-01
We consider the problem of constructing a discrete differential geometry defined on nonplanar quadrilateral meshes. Physical models on discrete nonflat spaces are of inherent interest, as well as being used in applications such as computation for electromagnetism, fluid mechanics, and image analysis. However, the majority of analysis has focused on triangulated meshes. We consider two approaches: discretizing the tensor calculus, and a discrete mesh version of differential forms. While these two approaches are equivalent in the continuum, we show that this is not true in the discrete case. Nevertheless, we show that it is possible to construct mesh versions of the Levi-Civita connection (and hence the tensorial covariant derivative and the associated covariant exterior derivative), the torsion, and the curvature. We show how discrete analogs of the usual vector integral theorems are constructed in such a way that the appropriate conservation laws hold exactly on the mesh, rather than only as approximations to the continuum limit. We demonstrate the success of our method by constructing a mesh version of classical electromagnetism and discuss how our formalism could be used to deal with other physical models, such as fluids. PMID:23005244
Filiform Lie algebras of order 3
Navarro, R. M.
2014-04-15
The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases.
Atomic effect algebras with compression bases
Caragheorgheopol, Dan; Tkadlec, Josef
2011-01-15
Compression base effect algebras were recently introduced by Gudder [Demonstr. Math. 39, 43 (2006)]. They generalize sequential effect algebras [Rep. Math. Phys. 49, 87 (2002)] and compressible effect algebras [Rep. Math. Phys. 54, 93 (2004)]. The present paper focuses on atomic compression base effect algebras and the consequences of atoms being foci (so-called projections) of the compressions in the compression base. Part of our work generalizes results obtained in atomic sequential effect algebras by Tkadlec [Int. J. Theor. Phys. 47, 185 (2008)]. The notion of projection-atomicity is introduced and studied, and several conditions that force a compression base effect algebra or the set of its projections to be Boolean are found. Finally, we apply some of these results to sequential effect algebras and strengthen a previously established result concerning a sufficient condition for them to be Boolean.
Atomic effect algebras with compression bases
NASA Astrophysics Data System (ADS)
Caragheorgheopol, Dan; Tkadlec, Josef
2011-01-01
Compression base effect algebras were recently introduced by Gudder [Demonstr. Math. 39, 43 (2006)]. They generalize sequential effect algebras [Rep. Math. Phys. 49, 87 (2002)] and compressible effect algebras [Rep. Math. Phys. 54, 93 (2004)]. The present paper focuses on atomic compression base effect algebras and the consequences of atoms being foci (so-called projections) of the compressions in the compression base. Part of our work generalizes results obtained in atomic sequential effect algebras by Tkadlec [Int. J. Theor. Phys. 47, 185 (2008)]. The notion of projection-atomicity is introduced and studied, and several conditions that force a compression base effect algebra or the set of its projections to be Boolean are found. Finally, we apply some of these results to sequential effect algebras and strengthen a previously established result concerning a sufficient condition for them to be Boolean.
The design and application of upwind schemes on unstructured meshes
NASA Technical Reports Server (NTRS)
Barth, Timothy J.; Jespersen, Dennis C.
1989-01-01
Solution and mesh generation algorithms for solving the Euler equations on unstructured meshes consisting of triangle and quadrilateral control volumes are presented. Cell-centered and mesh-vertex upwind finite-volume schemes are developed which utilize multi-dimensional monotone linear reconstruction procedures. These algorithms differ from existing algorithms (even on structured meshes). Numerical results in two dimensions are presented.
LayTracks3D: A new approach for meshing general solids using medial axis transform
Quadros, William Roshan
2015-08-22
This study presents an extension of the all-quad meshing algorithm called LayTracks to generate high quality hex-dominant meshes of general solids. LayTracks3D uses the mapping between the Medial Axis (MA) and the boundary of the 3D domain to decompose complex 3D domains into simpler domains called Tracks. Tracks in 3D have no branches and are symmetric, non-intersecting, orthogonal to the boundary, and the shortest path from the MA to the boundary. These properties of tracks result in desired meshes with near cube shape elements at the boundary, structured mesh along the boundary normal with any irregular nodes restricted to themore » MA, and sharp boundary feature preservation. The algorithm has been tested on a few industrial CAD models and hex-dominant meshes are shown in the Results section. Work is underway to extend LayTracks3D to generate all-hex meshes.« less
Positive Contrast MRI Techniques for Visualization of Iron-Loaded Hernia Mesh Implants in Patients
Ciritsis, Alexander; Truhn, Daniel; Hansen, Nienke L.; Otto, Jens; Kuhl, Christiane K.; Kraemer, Nils A.
2016-01-01
Object In MRI, implants and devices can be delineated via susceptibility artefacts. To discriminate susceptibility voids from proton-free structures, different positive contrast techniques were implemented. The purpose of this study was to evaluate a pulse sequence-based positive contrast technique (PCSI) and a post-processing susceptibility gradient mapping algorithm (SGM) for visualization of iron loaded mesh implants in patients. Material and Methods Five patients with iron-loaded MR-visible inguinal hernia mesh implants were examined at 1.5 Tesla. A gradient echo sequence (GRE; parameters: TR: 8.3ms; TE: 4.3ms; NSA:2; FA:20°; FOV:350mm²) and a PCSI sequence (parameters: TR: 25ms; TE: 4.6ms; NSA:4; FA:20°; FOV:350mm²) with on-resonant proton suppression were performed. SGM maps were calculated using two algorithms. Image quality and mesh delineation were independently evaluated by three radiologists. Results On GRE, the iron-loaded meshes generated distinct susceptibility-induced signal voids. PCSI exhibited susceptibility differences including the meshes as hyperintense signals. SGM exhibited susceptibility differences with positive contrast. Visually, the different algorithms presented no significant differences. Overall, the diagnostic value was rated best in GRE whereas PCSI and SGM were barely “sufficient”. Conclusion Both “positive contrast” techniques depicted implanted meshes with hyperintense signal. SGM comes without additional acquisition time and can therefore be utilized in every patient. PMID:27192201
50 CFR 622.208 - Minimum mesh size applicable to rock shrimp off Georgia and Florida.
Code of Federal Regulations, 2013 CFR
2013-10-01
... mesh size applicable to rock shrimp off Georgia and Florida. (a) The minimum mesh size for the cod end...), stretched mesh. This minimum mesh size is required in at least the last 40 meshes forward of the cod...
Method of modifying a volume mesh using sheet insertion
Borden, Michael J.; Shepherd, Jason F.
2006-08-29
A method and machine-readable medium provide a technique to modify a hexahedral finite element volume mesh using dual generation and sheet insertion. After generating a dual of a volume stack (mesh), a predetermined algorithm may be followed to modify (refine) the volume mesh of hexahedral elements. The predetermined algorithm may include the steps of locating a sheet of hexahedral mesh elements, determining a plurality of hexahedral elements within the sheet to refine, shrinking the plurality of elements, and inserting a new sheet of hexahedral elements adjacently to modify the volume mesh. Additionally, another predetermined algorithm using mesh cutting may be followed to modify a volume mesh.
Facial expression reconstruction on the basis of selected vertices of triangle mesh
NASA Astrophysics Data System (ADS)
Peszor, Damian; Wojciechowska, Marzena
2016-06-01
Facial expression reconstruction is an important issue in the field of computer graphics. While it is relatively easy to create an animation based on meshes constructed through video recordings, this kind of high-quality data is often not transferred to another model because of lack of intermediary, anthropometry-based way to do so. However, if a high-quality mesh is sampled with sufficient density, it is possible to use obtained feature points to encode the shape of surrounding vertices in a way that can be easily transferred to another mesh with corresponding feature points. In this paper we present a method used for obtaining information for the purpose of reconstructing changes in facial surface on the basis of selected feature points.
Effect of a concave grid mesh in a carbon nanotube-based field emission X-ray source
Kim, Hyun Suk; Castro, Edward Joseph D.; Lee, Choong Hun
2014-10-15
Highlights: • Successful design using a concave grid mesh for the focusing electron. • Much better X-ray image due to the concave grid mesh. • Higher anode current efficiency using the concave grid mesh versus a flat grid mesh. - Abstract: This study introduces a simple approach to improve the X-ray image quality produced by the carbon nanotube (CNT) field emitter X-ray source by altering the geometrical shape of the grid mesh from the conventional flat shape to a concave one in a typical triode structure. The concave shape of the grid electrode increases the effective number of the grid cells in the mesh, which exerted an electric field in the direction of the emitted electrons, thereby increasing the emission current reaching the anode. Furthermore, the curved mesh (concave grid mesh), which was responsible for the extraction of electrons from the field emitter, exhibited a focusing effect on the electron beam trajectory thereby, reducing the focal spot size impinging on the anode and resulted in a better spatial resolution of the X-ray images produced.
Hecke-Clifford Algebras and Spin Hecke Algebras IV: Odd Double Affine Type
NASA Astrophysics Data System (ADS)
Khongsap, Ta; Wang, Weiqiang
2009-01-01
We introduce an odd double affine Hecke algebra (DaHa) generated by a classical Weyl group W and two skew-polynomial subalgebras of anticommuting generators. This algebra is shown to be Morita equivalent to another new DaHa which are generated by W and two polynomial-Clifford subalgebras. There is yet a third algebra containing a spin Weyl group algebra which is Morita (super)equivalent to the above two algebras. We establish the PBW properties and construct Verma-type representations via Dunkl operators for these algebras.
Energy Science and Technology Software Center (ESTSC)
2003-06-03
The ALGEBRA II program allows the user to manipulate data from a finite element analysis before it is plotted by evaluating algebraic expressions. The equation variables are dependent on the input database variable names. The finite element output data is in the form of variable values (e.g., stress, strain, and velocity components) in an EXODUS II database which can be read by plot programs. Code is written in a portable form as possible. Fortran codemore » is written in ANSI Standard FORTRAN-77. Machine-specific routines are limited in number and are grouped together to minimize the time required to adapt them to a new system. SEACAS codes has been ported to several Unix systems.« less
Propped Cantilever Mesh Convergence Study Using Hexahedral Elements
Chi-Fung Tso; David Molitoris; Spencer Snow; Alex Norman
2001-10-01
The Task Group on Computational Modelling for Explicit Analyses in the ASME Boiler and Pressure Vessel Code committee was set up in August 2008 to develop a quantitative finite element modelling guidance document for the explicit dynamic analysis of energy-limited events. This guidance document will be referenced in the ASME Boiler and Pressure Vessel Code Section III Division 3 and NRC Regulatory Guide 7.6 as a means by which the quality of a finite element model may be judged. In energy limited events, which the guidance document will address, ductile metallic materials will suffer significant plastic strains to take full advantage of their energy absorption capacity. Accuracy of the analyses in predicting large strains is therefore essential. One of the issues that this guidance document will address is the issue of the quality of a finite element mesh, and in particular, mesh refinement to obtain a convergent solution. That is, for a given structure under a given loading using a given type of element, what is the required mesh density to achieve sufficiently accurate results. One portion of the guidance document will be devoted to a series of element convergence studies that can aid designers in establishing the mesh refinement requirements necessary to achieve accurate results for a variety of different elements types in regions of high plastic strain. These convergence studies will also aid reviewers in evaluating the quality of a finite element model and the apparent accuracy of its results. The first convergence study consists of an elegantly simple problem of a cantilevering beam, simply supported at one end and built in at the other, loaded by a uniformly-distributed load that is ramped up over a finite time to a constant value. Three different loads were defined, with the smallest load to cause stresses that are entirely elastic and the largest load to cause large plastic deformations. Material properties, loading rates and boundary conditions were also
MESH Pakistan: Prospects and Challenges
ERIC Educational Resources Information Center
Leask, Marilyn; Jumani, Nabi Bux
2015-01-01
The Organisation for Economic Co-operation and Development periodically surveys teaching and learning issues (the TALIS surveys) in the most developed countries. In their 2009 report, they commented that although teacher quality is the fundamental component in high performing systems, the education sector has been slow to develop systemic…
SIDDIQUI, Nazema Y.; GRIMES, Cara L.; Casiano, Elizabeth R.; ABED, Husam T.; JEPPSON, Peter C.; OLIVERA, Cedric K.; SANSES, Tatiana V.; STEINBERG, Adam C.; SOUTH, Mary M.; BALK, Ethan M.; SUNG, Vivian W.
2015-01-01
Objective To systematically review outcomes after mesh sacrocolpopexy compared with native tissue vaginal repairs in women with apical prolapse. Data Sources We searched MEDLINE, EMBASE, the Cochrane Central Register of Controlled Trials, and ClinicalTrials.gov through June 4, 2012. Methods of Study Selection For anatomic and functional analyses, we included studies comparing mesh sacrocolpopexy compared with native tissue vaginal repairs with at least 6 months follow-up. The primary outcome was anatomic “success” after surgery. Secondary outcomes were reoperation and symptom outcomes. We included large case series and comparative studies with shorter follow-up to increase power for adverse event analyses. Tabulation, Integration, and Results Evidence quality was assessed with the Grades for Recommendation, Assessment, Development and Evaluation system. Meta-analyses were performed when at least three studies reported the same outcome. We included 13 comparative studies for anatomic success, reoperation, and symptom outcomes. Moderate-quality evidence supports improved anatomic outcomes after mesh sacrocolpopexy; very low–quality evidence shows no differences in reoperation between sacrocolpopexy and native tissue vaginal repairs. Evidence was insufficient regarding which procedures result in improved bladder or bowel symptoms. Low-quality evidence showed no differences in postoperative sexual function. Adverse event data were compiled and meta-analyzed from 79 studies. When including larger noncomparative studies, ileus or small bowel obstruction (2.7% vs. 0.2%, p < 0.01), mesh or suture complications (4.2% vs. 0.4%, p < 0.01), and thromboembolic phenomena (0.6% vs. 0.1%, p = 0.03) were more common after mesh sacrocolpopexy compared to native tissue vaginal repairs. Conclusion When anatomic durability is a priority, we suggest that mesh sacrocolpopexy may be the preferred surgical option. When minimizing adverse events or reoperation is the priority, there
Raut, Samarth S; Liu, Peng; Finol, Ender A
2015-07-16
In this work, we present a computationally efficient image-derived volume mesh generation approach for vasculatures that implements spatially varying patient-specific wall thickness with a novel inward extrusion of the wall surface mesh. Multi-domain vascular meshes with arbitrary numbers, locations, and patterns of both iliac bifurcations and thrombi can be obtained without the need to specify features or landmark points as input. In addition, the mesh output is coordinate-frame independent and independent of the image grid resolution with high dimensional accuracy and mesh quality, devoid of errors typically found in off-the-shelf image-based model generation workflows. The absence of deformable template models or Cartesian grid-based methods enables the present approach to be sufficiently robust to handle aneurysmatic geometries with highly irregular shapes, arterial branches nearly parallel to the image plane, and variable wall thickness. The assessment of the methodology was based on i) estimation of the surface reconstruction accuracy, ii) validation of the output mesh using an aneurysm phantom, and iii) benchmarking the volume mesh quality against other frameworks. For the phantom image dataset (pixel size 0.105 mm; slice spacing 0.7 mm; and mean wall thickness 1.401±0.120 mm), the average wall thickness in the mesh was 1.459±0.123 mm. The absolute error in average wall thickness was 0.060±0.036 mm, or about 8.6% of the largest image grid spacing (0.7 mm) and 4.36% of the actual mean wall thickness. Mesh quality metrics and the ability to reproduce regional variations of wall thickness were found superior to similar alternative frameworks. PMID:25976018
Raut, Samarth S.; Liu, Peng; Finol, Ender A.
2015-01-01
In this work, we present a computationally efficient image-derived volume mesh generation approach for vasculatures that implements spatially varying patient-specific wall thickness with a novel inward extrusion of the wall surface mesh. Multi-domain vascular meshes with arbitrary numbers, locations, and patterns of both iliac bifurcations and thrombi can be obtained without the need to specify features or landmark points as input. In addition, the mesh output is coordinate-frame independent and independent of the image grid resolution with high dimensional accuracy and mesh quality, devoid of errors typically found in off-the-shelf image-based model generation workflows. The absence of deformable template models or Cartesian grid-based methods enables the present approach to be robust by handling aneurysmatic geometries with highly irregular shapes, arterial branches nearly parallel to the image plane, and variable wall thickness. The assessment of the methodology was based on i) estimation of the surface reconstruction accuracy, ii) validation of the output mesh using an aneurysm phantom, and iii) benchmarking the volume mesh quality against other frameworks. For the phantom image dataset (pixel size 0.105 mm; slice spacing 0.7 mm; mean wall thickness 1.401 ± 0.120 mm), the average wall thickness in the mesh was 1.459 ± 0.123 mm. The absolute error in average wall thickness was 0.060 ± 0.036 mm, or about 8.6% of the largest image grid spacing (0.7 mm) and 4.36% of the actual mean wall thickness. Mesh quality metrics and the ability to reproduce regional variations of wall thickness were found superior to similar alternative frameworks. PMID:25976018
Single axioms for Boolean algebra.
McCune, W.
2000-06-30
Explicit single axioms are presented for Boolean algebra in terms of (1) the Sheffer stroke; (2) disjunction and negation; (3) disjunction, conjunction, and negation; and (4) disjunction, conjunction, negation, 0, and 1. It was previously known that single axioms exist for these systems, but the procedures to generate them are exponential, producing huge equations. Automated deduction techniques were applied to find axioms of lengths 105, 131, 111, and 127, respectively, each with six variables.
The algebras of large N matrix mechanics
Halpern, M.B.; Schwartz, C.
1999-09-16
Extending early work, we formulate the large N matrix mechanics of general bosonic, fermionic and supersymmetric matrix models, including Matrix theory: The Hamiltonian framework of large N matrix mechanics provides a natural setting in which to study the algebras of the large N limit, including (reduced) Lie algebras, (reduced) supersymmetry algebras and free algebras. We find in particular a broad array of new free algebras which we call symmetric Cuntz algebras, interacting symmetric Cuntz algebras, symmetric Bose/Fermi/Cuntz algebras and symmetric Cuntz superalgebras, and we discuss the role of these algebras in solving the large N theory. Most important, the interacting Cuntz algebras are associated to a set of new (hidden!) local quantities which are generically conserved only at large N. A number of other new large N phenomena are also observed, including the intrinsic nonlocality of the (reduced) trace class operators of the theory and a closely related large N field identification phenomenon which is associated to another set (this time nonlocal) of new conserved quantities at large N.
Alternative algebraic approaches in quantum chemistry
Mezey, Paul G.
2015-01-22
Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed.
Atlas-Based Automatic Generation of Subject-Specific Finite Element Tongue Meshes.
Bijar, Ahmad; Rohan, Pierre-Yves; Perrier, Pascal; Payan, Yohan
2016-01-01
Generation of subject-specific 3D finite element (FE) models requires the processing of numerous medical images in order to precisely extract geometrical information about subject-specific anatomy. This processing remains extremely challenging. To overcome this difficulty, we present an automatic atlas-based method that generates subject-specific FE meshes via a 3D registration guided by Magnetic Resonance images. The method extracts a 3D transformation by registering the atlas' volume image to the subject's one, and establishes a one-to-one correspondence between the two volumes. The 3D transformation field deforms the atlas' mesh to generate the subject-specific FE mesh. To preserve the quality of the subject-specific mesh, a diffeomorphic non-rigid registration based on B-spline free-form deformations is used, which guarantees a non-folding and one-to-one transformation. Two evaluations of the method are provided. First, a publicly available CT-database is used to assess the capability to accurately capture the complexity of each subject-specific Lung's geometry. Second, FE tongue meshes are generated for two healthy volunteers and two patients suffering from tongue cancer using MR images. It is shown that the method generates an appropriate representation of the subject-specific geometry while preserving the quality of the FE meshes for subsequent FE analysis. To demonstrate the importance of our method in a clinical context, a subject-specific mesh is used to simulate tongue's biomechanical response to the activation of an important tongue muscle, before and after cancer surgery. PMID:26577253
A nanobursa mesh: a graded electrospun nanofiber mesh with metal nanoparticles on carbon nanotubes
NASA Astrophysics Data System (ADS)
Senturk-Ozer, Semra; Chen, Tao; Degirmenbasi, Nebahat; Gevgilili, Halil; Podkolzin, Simon G.; Kalyon, Dilhan M.
2014-07-01
A new type of material, a ``nanobursa'' mesh (from ``bursa'' meaning ``sac or pouch''), is introduced. This material consists of sequential layers of porous polymeric nanofibers encapsulating carbon nanotubes, which are functionalized with different metal nanoparticles in each layer. The nanobursa mesh is fabricated via a novel combination of twin-screw extrusion and electrospinning. Use of this hybrid process at industrially-relevant rates is demonstrated by producing a nanobursa mesh with graded layers of Pd, Co, Ag, and Pt nanoparticles. The potential use of the fabricated nanobursa mesh is illustrated by modeling of catalytic hydrocarbon oxidation.A new type of material, a ``nanobursa'' mesh (from ``bursa'' meaning ``sac or pouch''), is introduced. This material consists of sequential layers of porous polymeric nanofibers encapsulating carbon nanotubes, which are functionalized with different metal nanoparticles in each layer. The nanobursa mesh is fabricated via a novel combination of twin-screw extrusion and electrospinning. Use of this hybrid process at industrially-relevant rates is demonstrated by producing a nanobursa mesh with graded layers of Pd, Co, Ag, and Pt nanoparticles. The potential use of the fabricated nanobursa mesh is illustrated by modeling of catalytic hydrocarbon oxidation. Electronic supplementary information (ESI) available: Experimental methods and computational details. See DOI: 10.1039/c4nr01145g
Computer algebra and transport theory.
Warsa, J. S.
2004-01-01
Modern symbolic algebra computer software augments and complements more traditional approaches to transport theory applications in several ways. The first area is in the development and enhancement of numerical solution methods for solving the Boltzmann transport equation. Typically, special purpose computer codes are designed and written to solve specific transport problems in particular ways. Different aspects of the code are often written from scratch and the pitfalls of developing complex computer codes are numerous and well known. Software such as MAPLE and MATLAB can be used to prototype, analyze, verify and determine the suitability of numerical solution methods before a full-scale transport application is written. Once it is written, the relevant pieces of the full-scale code can be verified using the same tools I that were developed for prototyping. Another area is in the analysis of numerical solution methods or the calculation of theoretical results that might otherwise be difficult or intractable. Algebraic manipulations are done easily and without error and the software also provides a framework for any additional numerical calculations that might be needed to complete the analysis. We will discuss several applications in which we have extensively used MAPLE and MATLAB in our work. All of them involve numerical solutions of the S{sub N} transport equation. These applications encompass both of the two main areas in which we have found computer algebra software essential.
BLAS- BASIC LINEAR ALGEBRA SUBPROGRAMS
NASA Technical Reports Server (NTRS)
Krogh, F. T.
1994-01-01
The Basic Linear Algebra Subprogram (BLAS) library is a collection of FORTRAN callable routines for employing standard techniques in performing the basic operations of numerical linear algebra. The BLAS library was developed to provide a portable and efficient source of basic operations for designers of programs involving linear algebraic computations. The subprograms available in the library cover the operations of dot product, multiplication of a scalar and a vector, vector plus a scalar times a vector, Givens transformation, modified Givens transformation, copy, swap, Euclidean norm, sum of magnitudes, and location of the largest magnitude element. Since these subprograms are to be used in an ANSI FORTRAN context, the cases of single precision, double precision, and complex data are provided for. All of the subprograms have been thoroughly tested and produce consistent results even when transported from machine to machine. BLAS contains Assembler versions and FORTRAN test code for any of the following compilers: Lahey F77L, Microsoft FORTRAN, or IBM Professional FORTRAN. It requires the Microsoft Macro Assembler and a math co-processor. The PC implementation allows individual arrays of over 64K. The BLAS library was developed in 1979. The PC version was made available in 1986 and updated in 1988.
Lobos, Claudio; González, Eugenio
2015-12-01
This article introduces a meshing technique focused on fast and real-time simulation in a biomedical context. We describe in details our algorithm, which starts from a basic Octree regarding the constraints imposed by the simulation, and then, mixed-element patterns are applied over transitions between coarse and fine regions. The use of surface patterns, also composed by mixed elements, allows us to better represent curved domains decreasing the odds of creating invalid elements by adding as few nodes as possible. In contrast with other meshing techniques, we let the user define regions of greater refinement, and as a consequence of that refinement, we add as few nodes as possible to produce a mesh that is topologically correct. Therefore, our meshing technique gives more control on the number of nodes of the final mesh. We show several examples where the quality of the final mesh is acceptable, even without using quality filters. We believe that this new meshing technique is in the correct direction toward real-time simulation in the biomedical field. PMID:26011778
Conservative interpolation between general spherical meshes
NASA Astrophysics Data System (ADS)
Kritsikis, E.; Aechtner, M.; Meurdesoif, Y.; Dubos, T.
2015-06-01
An efficient, local, explicit, second-order, conservative interpolation algorithm between spherical meshes is presented. The cells composing the source and target meshes may be either spherical polygons or longitude-latitude quadrilaterals. Second-order accuracy is obtained by piecewise-linear finite volume reconstruction over the source mesh. Global conservation is achieved through the introduction of a supermesh, whose cells are all possible intersections of source and target cells. Areas and intersections are computed exactly to yield a geometrically exact method. The main efficiency bottleneck caused by the construction of the supermesh is overcome by adopting tree-based data structures and algorithms, from which the mesh connectivity can also be deduced efficiently. The theoretical second-order accuracy is verified using a smooth test function and pairs of meshes commonly used for atmospheric modelling. Experiments confirm that the most expensive operations, especially the supermesh construction, have O(NlogN) computational cost. The method presented is meant to be incorporated in pre- or post-processing atmospheric modelling pipelines, or directly into models for flexible input/output. It could also serve as a basis for conservative coupling between model components, e.g. atmosphere and ocean.
Light weight meshes in incisional hernia repair
Schumpelick, Volker; Klinge, Uwe; Rosch, Raphael; Junge, Karsten
2006-01-01
Incisional hernias remain one of the most common surgical complications with a long-term incidence of 10–20%. Increasing evidence of impaired wound healing in these patients supports routine use of an open prefascial, retromuscular mesh repair. Basic pathophysiologic principles dictate that for a successful long-term outcome and prevention of recurrence, a wide overlap underneath healthy tissue is required. Particularly in the neighborhood of osseous structures, only retromuscular placement allows sufficient subduction of the mesh by healthy tissue of at least 5 cm in all directions. Preparation must take into account the special anatomic features of the abdominal wall, especially in the area of the Linea alba and Linea semilunaris. Polypropylene is the material widely used for open mesh repair. New developments have led to low-weight, large-pore polypropylene prostheses, which are adjusted to the physiological requirements of the abdominal wall and permit proper tissue integration. These meshes provide the possibility of forming a scar net instead of a stiff scar plate and therefore help to avoid former known mesh complications. PMID:21187980
Mesh insertion as an aid for pleurodesis.
Sugarmann, W M; Widmann, W D; Mysh, D; Sattari, R
1996-12-01
With the application of video-assisted thoracic surgery (VATS) for the treatment of pneumothorax, there has been an increase in the failure rate of treatment because of inadequate pleurodesis. We sought to determine whether mesh insertion into the pleural cavity with or without pleural abrasion results in predictable pleurodesis appropriate for clinical trial as an adjunct to VATS treatment of pneumothorax. There have been no prior studies on the use of absorbable or nonabsorbable mesh in the thoracic cavity. The effects of intra-thoracic absorbable polyglactin (Vicryl) and non-absorbable polypropylene (Marlex) mesh were studied in rats. Polyglactin without abrasion caused filmy adhesions in 5/5, 1/7, and 0/5 rats studied at 1, 2, and 3 months. Polypropylene incites an extensive and dense pleural reaction not suitable for clinical use becaues it induces a fibrothorax. Pleural abrasion alone caused variable adhesions studied at 3-4 months (4/6 none, 1/6 filmy, 1/6 firm). Polyglactin plus pleural abrasion resulted in appropriate firm adhesions in 7/8 rats studied at 3-4 months with 1/8 showing filmy adhesions. Polyglactin alone results in transient filmy adhesions. Pleural abrasion alone results in inadequate pleural symphysis. However, when absorbable mesh insertion is coupled with pleural abrasion, appropriate pleurodesis is predictably achieved. Clinical application of polyglactin mesh insertion with pleural abrasion as an adjunct in the VATS treatment of pneumothorax has begun and has been successful. PMID:10064371
Floating shock fitting via Lagrangian adaptive meshes
NASA Technical Reports Server (NTRS)
Vanrosendale, John
1994-01-01
In recent works we have formulated a new approach to compressible flow simulation, combining the advantages of shock-fitting and shock-capturing. Using a cell-centered Roe scheme discretization on unstructured meshes, we warp the mesh while marching to steady state, so that mesh edges align with shocks and other discontinuities. This new algorithm, the Shock-fitting Lagrangian Adaptive Method (SLAM) is, in effect, a reliable shock-capturing algorithm which yields shock-fitted accuracy at convergence. Shock-capturing algorithms like this, which warp the mesh to yield shock-fitted accuracy, are new and relatively untried. However, their potential is clear. In the context of sonic booms, accurate calculation of near-field sonic boom signatures is critical to the design of the High Speed Civil Transport (HSCT). SLAM should allow computation of accurate N-wave pressure signatures on comparatively coarse meshes, significantly enhancing our ability to design low-boom configurations for high-speed aircraft.
JTpack90: A parallel, object-based, Fortran 90 linear algebra package
Turner, J.A.; Kothe, D.B.; Ferrell, R.C.
1997-03-01
The authors have developed an object-based linear algebra package, currently with emphasis on sparse Krylov methods, driven primarily by needs of the Los Alamos National Laboratory parallel unstructured-mesh casting simulation tool Telluride. Support for a number of sparse storage formats, methods, and preconditioners have been implemented, driven primarily by application needs. They describe the object-based Fortran 90 approach, which enhances maintainability, performance, and extensibility, the parallelization approach using a new portable gather/scatter library (PGSLib), current capabilities and future plans, and present preliminary performance results on a variety of platforms.
Mesh Surgery for Anterior Vaginal Wall Prolapse: A Meta-analysis.
Juliato, Cássia Raquel Teatin; Santos Júnior, Luiz Carlos do; Haddad, Jorge Milhem; Castro, Rodrigo Aquino; Lima, Marcelo; Castro, Edilson Benedito de
2016-07-01
Purpose Pelvic organ prolapse (POP) is a major health issue worldwide, affecting 6-8% of women. The most affected site is the anterior vaginal wall. Multiple procedures and surgical techniques have been used, with or without the use of vaginal meshes, due to common treatment failure, reoperations, and complication rates in some studies. Methods Systematic review of the literature and meta-analysis regarding the use of vaginal mesh in anterior vaginal wall prolapse was performed. A total of 115 papers were retrieved after using the medical subject headings (MESH) terms: 'anterior pelvic organ prolapse OR cystocele AND surgery AND (mesh or colporrhaphy)' in the PubMed database. Exclusion criteria were: follow-up shorter than 1 year, use of biological or absorbable meshes, and inclusion of other vaginal wall prolapses. Studies were put in a data chart by two independent editors; results found in at least two studies were grouped for analysis. Results After the review of the titles by two independent editors, 70 studies were discarded, and after abstract assessment, 18 trials were eligible for full text screening. For final screening and meta-analysis, after applying the Jadad score (> 2), 12 studies were included. Objective cure was greater in the mesh surgery group (odds ratio [OR] = 1,28 [1,07-1,53]), which also had greater blood loss (mean deviation [MD] = 45,98 [9,72-82,25]), longer surgery time (MD = 15,08 [0,48-29,67]), but less prolapse recurrence (OR = 0,22 [01,3-0,38]). Dyspareunia, symptom resolution and reoperation rates were not statistically different between groups. Quality of life (QOL) assessment through the pelvic organ prolapse/urinary incontinence sexual questionnaire (PISQ-12), the pelvic floor distress inventory (PFDI-20), the pelvic floor impact questionnaire (PFIQ-7), and the perceived quality of life scale (PQOL) was not significantly different. Conclusions Anterior vaginal prolapse mesh surgery has greater anatomic
Walendziak, Andrzej
2015-01-01
The notions of an ideal and a fuzzy ideal in BN-algebras are introduced. The properties and characterizations of them are investigated. The concepts of normal ideals and normal congruences of a BN-algebra are also studied, the properties of them are displayed, and a one-to-one correspondence between them is presented. Conditions for a fuzzy set to be a fuzzy ideal are given. The relationships between ideals and fuzzy ideals of a BN-algebra are established. The homomorphic properties of fuzzy ideals of a BN-algebra are provided. Finally, characterizations of Noetherian BN-algebras and Artinian BN-algebras via fuzzy ideals are obtained. PMID:26125050
Lax operator algebras and integrable systems
NASA Astrophysics Data System (ADS)
Sheinman, O. K.
2016-02-01
A new class of infinite-dimensional Lie algebras, called Lax operator algebras, is presented, along with a related unifying approach to finite-dimensional integrable systems with a spectral parameter on a Riemann surface such as the Calogero-Moser and Hitchin systems. In particular, the approach includes (non-twisted) Kac-Moody algebras and integrable systems with a rational spectral parameter. The presentation is based on quite simple ideas about the use of gradings of semisimple Lie algebras and their interaction with the Riemann-Roch theorem. The basic properties of Lax operator algebras and the basic facts about the theory of the integrable systems in question are treated (and proved) from this general point of view. In particular, the existence of commutative hierarchies and their Hamiltonian properties are considered. The paper concludes with an application of Lax operator algebras to prequantization of finite-dimensional integrable systems. Bibliography: 51 titles.
Algebra: A Challenge at the Crossroads of Policy and Practice
ERIC Educational Resources Information Center
Stein, Mary Kay; Kaufman, Julia Heath; Sherman, Milan; Hillen, Amy F.
2011-01-01
The authors review what is known about early and universal algebra, including who is getting access to algebra and student outcomes associated with algebra course taking in general and specifically with universal algebra policies. The findings indicate that increasing numbers of students, some of whom are underprepared, are taking algebra earlier.…
NASA Lewis Meshed VSAT Workshop meeting summary
NASA Technical Reports Server (NTRS)
Ivancic, William
1993-01-01
NASA Lewis Research Center's Space Electronics Division (SED) hosted a workshop to address specific topics related to future meshed very small-aperture terminal (VSAT) satellite communications networks. The ideas generated by this workshop will help to identify potential markets and focus technology development within the commercial satellite communications industry and NASA. The workshop resulted in recommendations concerning these principal points of interest: the window of opportunity for a meshed VSAT system; system availability; ground terminal antenna sizes; recommended multifrequency for time division multiple access (TDMA) uplink; a packet switch design concept for narrowband; and fault tolerance design concepts. This report presents a summary of group presentations and discussion associated with the technological, economic, and operational issues of meshed VSAT architectures that utilize processing satellites.
GRChombo: Numerical relativity with adaptive mesh refinement
NASA Astrophysics Data System (ADS)
Clough, Katy; Figueras, Pau; Finkel, Hal; Kunesch, Markus; Lim, Eugene A.; Tunyasuvunakool, Saran
2015-12-01
In this work, we introduce {\\mathtt{GRChombo}}: a new numerical relativity code which incorporates full adaptive mesh refinement (AMR) using block structured Berger-Rigoutsos grid generation. The code supports non-trivial 'many-boxes-in-many-boxes' mesh hierarchies and massive parallelism through the message passing interface. {\\mathtt{GRChombo}} evolves the Einstein equation using the standard BSSN formalism, with an option to turn on CCZ4 constraint damping if required. The AMR capability permits the study of a range of new physics which has previously been computationally infeasible in a full 3 + 1 setting, while also significantly simplifying the process of setting up the mesh for these problems. We show that {\\mathtt{GRChombo}} can stably and accurately evolve standard spacetimes such as binary black hole mergers and scalar collapses into black holes, demonstrate the performance characteristics of our code, and discuss various physics problems which stand to benefit from the AMR technique.
Coverings of topological semi-abelian algebras
NASA Astrophysics Data System (ADS)
Mucuk, Osman; Demir, Serap
2016-08-01
In this work, we study on a category of topological semi-abelian algebras which are topological models of given an algebraic theory T whose category of models is semi-abelian; and investigate some results on the coverings of topological models of such theories yielding semi-abelian categories. We also consider the internal groupoid structure in the semi-abelian category of T-algebras, and give a criteria for the lifting of internal groupoid structure to the covering groupoids.
Stability of algebraically unstable dispersive flows
NASA Astrophysics Data System (ADS)
King, Kristina; Zaretzky, Paula; Weinstein, Steven; Cromer, Michael; Barlow, Nathaniel
2015-11-01
A widely unexplored type of hydrodynamic instability is examined - large-time algebraic growth. Such growth occurs on the threshold of (exponentially) neutral stability. A methodology is provided for predicting the algebraic growth rate of an initial disturbance, when applied to a class of partial differential equations describing wave propagation in dispersive media. There are several morphological differences between algebraically growing disturbances and the exponentially growing wave packets inherent to classical linear stability analysis, and these are elucidated in this study.