• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A fast and efficient algorithm to compute BPX- and overlapping preconditioner for adaptive 3D-FEM

Eibner, Tino 17 September 2008 (has links) (PDF)
In this paper we consider the well-known BPX-preconditioner in conjunction with adaptive FEM. We present an algorithm which enables us to compute the preconditioner with optimal complexity by a total of only O(DoF) additional memory. Furthermore, we show how to combine the BPX-preconditioner with an overlapping Additive-Schwarz-preconditioner to obtain a preconditioner for finite element spaces with arbitrary polynomial degree distributions. Numerical examples illustrate the efficiency of the algorithms.
2

A fast and efficient algorithm to compute BPX- and overlapping preconditioner for adaptive 3D-FEM

Eibner, Tino 17 September 2008 (has links)
In this paper we consider the well-known BPX-preconditioner in conjunction with adaptive FEM. We present an algorithm which enables us to compute the preconditioner with optimal complexity by a total of only O(DoF) additional memory. Furthermore, we show how to combine the BPX-preconditioner with an overlapping Additive-Schwarz-preconditioner to obtain a preconditioner for finite element spaces with arbitrary polynomial degree distributions. Numerical examples illustrate the efficiency of the algorithms.

Page generated in 0.0856 seconds