Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation

Maksymilian Dryja, Olof Widlund

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We design and analyze Neumann-Neumann (N-N) algorithms for elliptic problems imposed in the 2-D polygonal region Ω with discontinuous coefficients on fine triangulation. We first discuss the two-level N-N algorithm and then we extend it to three levels.

Original languageEnglish (US)
Title of host publicationDomain Decomposition Methods in Science and Engineering XVI
Pages357-364
Number of pages8
Volume55
StatePublished - 2007

Publication series

NameLecture Notes in Computational Science and Engineering
Volume55
ISSN (Print)14397358

Fingerprint

Discontinuous Coefficients
Triangulation
Elliptic Problems
Finite Element
Design

ASJC Scopus subject areas

  • Engineering(all)
  • Computational Mathematics
  • Modeling and Simulation
  • Control and Optimization
  • Discrete Mathematics and Combinatorics

Cite this

Dryja, M., & Widlund, O. (2007). Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation. In Domain Decomposition Methods in Science and Engineering XVI (Vol. 55, pp. 357-364). (Lecture Notes in Computational Science and Engineering; Vol. 55).

Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation. / Dryja, Maksymilian; Widlund, Olof.

Domain Decomposition Methods in Science and Engineering XVI. Vol. 55 2007. p. 357-364 (Lecture Notes in Computational Science and Engineering; Vol. 55).

Research output: Chapter in Book/Report/Conference proceedingChapter

Dryja, M & Widlund, O 2007, Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation. in Domain Decomposition Methods in Science and Engineering XVI. vol. 55, Lecture Notes in Computational Science and Engineering, vol. 55, pp. 357-364.
Dryja M, Widlund O. Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation. In Domain Decomposition Methods in Science and Engineering XVI. Vol. 55. 2007. p. 357-364. (Lecture Notes in Computational Science and Engineering).
Dryja, Maksymilian ; Widlund, Olof. / Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation. Domain Decomposition Methods in Science and Engineering XVI. Vol. 55 2007. pp. 357-364 (Lecture Notes in Computational Science and Engineering).
@inbook{c542ef21e66f496ebfccf16b5e0bbf1e,
title = "Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation",
abstract = "We design and analyze Neumann-Neumann (N-N) algorithms for elliptic problems imposed in the 2-D polygonal region Ω with discontinuous coefficients on fine triangulation. We first discuss the two-level N-N algorithm and then we extend it to three levels.",
author = "Maksymilian Dryja and Olof Widlund",
year = "2007",
language = "English (US)",
isbn = "9783540344681",
volume = "55",
series = "Lecture Notes in Computational Science and Engineering",
pages = "357--364",
booktitle = "Domain Decomposition Methods in Science and Engineering XVI",

}

TY - CHAP

T1 - Neumann-Neumann Algorithms (Two and Three Levels) for Finite Element Elliptic Problems with Discontinuous Coefficients on Fine Triangulation

AU - Dryja, Maksymilian

AU - Widlund, Olof

PY - 2007

Y1 - 2007

N2 - We design and analyze Neumann-Neumann (N-N) algorithms for elliptic problems imposed in the 2-D polygonal region Ω with discontinuous coefficients on fine triangulation. We first discuss the two-level N-N algorithm and then we extend it to three levels.

AB - We design and analyze Neumann-Neumann (N-N) algorithms for elliptic problems imposed in the 2-D polygonal region Ω with discontinuous coefficients on fine triangulation. We first discuss the two-level N-N algorithm and then we extend it to three levels.

UR - http://www.scopus.com/inward/record.url?scp=84880354232&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880354232&partnerID=8YFLogxK

M3 - Chapter

SN - 9783540344681

VL - 55

T3 - Lecture Notes in Computational Science and Engineering

SP - 357

EP - 364

BT - Domain Decomposition Methods in Science and Engineering XVI

ER -