Office of Academic Resources
Chulalongkorn University
Chulalongkorn University

Home / Help

TitleGrid Generation and Adaptive Algorithms [electronic resource] / edited by Marshall W. Bern, Joseph E. Flaherty, Mitchell Luskin
ImprintNew York, NY : Springer New York : Imprint: Springer, 1999
Connect tohttp://dx.doi.org/10.1007/978-1-4612-1556-1
Descript IX, 189 p. online resource

SUMMARY

This IMA Volume in Mathematics and its Applications GRID GENERATION AND ADAPTIVE ALGORITHMS is based on the proceedings of a workshop with the same title. The workยญ shop was an integral part of the 1996-97 IMA program on "MATHEMATยญ ICS IN HIGH-PERFORMANCE COMPUTING. " I would like to thank Marshall Bern (Xerox, Palo Alto Research Cenยญ ter), Joseph E. Flaherty (Department of Computer Science, Rensselaer Polytechnic Institute), and Mitchell Luskin (School of Mathematics, Uniยญ versity of Minnesota), for their excellent work as organizers of the meeting and for editing the proceedings. I also take this opportunity to thank the National Science Foundaยญ tion (NSF), Department of Energy (DOE), and the Army Research Office (ARO), whose financial support made the workshop possible. Willard Miller, Jr. , Professor and Director v PREFACE Scientific and engineering computation has become so complex that traditional numerical computation on uniform meshes is generally not posยญ sible or too expensive. Mesh generation must reflect both the domain geometry and the expected solution characteristics. Meshes should, furยญ thermore, be related to the solution through computable estimates of disยญ cretization errors. This, suggests an automatic and adaptive process where an initial mesh is enriched with the goal of computing a solution with prescribed accuracy specifications in an optimal manner. While automatic mesh generation procedures and adaptive strategies are becoming available, major computational challenges remain. Three-dimensional mesh generaยญ tion is still far from automatic


CONTENT

hp-finite element procedures on non-uniform geometric meshes: Adaptivity and constrained approximation -- Tetrahedral bisection and adaptive finite elements -- Resolution of boundary layers on triangular meshes -- A general concept of adaptivity in finite element methods with applications to problems in fluid and structural mechanics -- A solution based H1 norm triangular mesh quality indicator -- Experiments with repartitioning and load balancing adaptive meshes -- Distributed octree data structures and local refinement method for the parallel solution of three-dimensional conservation laws -- Adaptive finite element methods for elastostatic contact problems -- The full domain partition approach to parallel adaptive refinement -- Adaptive solution of phase change problems over unstructured tetrahedral meshes


Mathematics Algorithms Combinatorics Mathematics Combinatorics Algorithm Analysis and Problem Complexity



Location



Office of Academic Resources, Chulalongkorn University, Phayathai Rd. Pathumwan Bangkok 10330 Thailand

Contact Us

Tel. 0-2218-2929,
0-2218-2927 (Library Service)
0-2218-2903 (Administrative Division)
Fax. 0-2215-3617, 0-2218-2907

Social Network

  line

facebook   instragram