Skip to main content

Meshes

  • Chapter
  • First Online:
Finite Elements I

Part of the book series: Texts in Applied Mathematics ((TAM,volume 72))

  • 2930 Accesses

Abstract

We study how to build a mesh of a bounded domain, i.e., a finite collection of cells forming a partition of the domain. Building a mesh is the first important task to realize when one wants to approximate some PDEs posed in the domain. The viewpoint we adopt in this book is that each mesh cell is the image of a reference cell by some smooth diffeomorphism that we call geometric mapping. We show how to construct the geometric mapping and we present various important notions concerning meshes. We also discuss mesh-related data structures and mesh generators.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 69.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexandre Ern .

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ern, A., Guermond, JL. (2021). Meshes. In: Finite Elements I. Texts in Applied Mathematics, vol 72. Springer, Cham. https://doi.org/10.1007/978-3-030-56341-7_8

Download citation

Publish with us

Policies and ethics