Skip to main content
Log in

An algorithm for coarsening unstructured meshes

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

We develop and analyze a procedure for creating a hierarchical basis of continuous piecewise linear polynomials on an arbitrary, unstructured, nonuniform triangular mesh. Using these hierarchical basis functions, we are able to define and analyze corresponding iterative methods for solving the linear systems arising from finite element discretizations of elliptic partial differential equations. We show that such iterative methods perform as well as those developed for the usual case of structured, locally refined meshes. In particular, we show that the generalized condition numbers for such iterative methods are of order \(J^2\), where \(J\) is the number of hierarchical basis levels.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received December 5, 1994

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bank, R., Xu, J. An algorithm for coarsening unstructured meshes . Numer. Math. 73, 1–36 (1996). https://doi.org/10.1007/s002110050181

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110050181

Navigation