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

Maksymilian Dryja; Olof Widlund

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

Maksymilian Dryja, Olof Widlund

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter

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 language	English (US)
Title of host publication	Domain Decomposition Methods in Science and Engineering XVI
Editors	Olof Widlund, David Keyes
Pages	357-364
Number of pages	8
State	Published - 2007

Publication series

Name	Lecture Notes in Computational Science and Engineering
Volume	55
ISSN (Print)	1439-7358

ASJC Scopus subject areas

Modeling and Simulation
General Engineering
Discrete Mathematics and Combinatorics
Control and Optimization
Computational Mathematics

Cite this

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. ed. / Olof Widlund; David Keyes. 2007. p. 357-364 (Lecture Notes in Computational Science and Engineering; Vol. 55).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

@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",

series = "Lecture Notes in Computational Science and Engineering",

pages = "357--364",

editor = "Olof Widlund and David Keyes",

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

AN - SCOPUS:84880354232

SN - 9783540344681

T3 - Lecture Notes in Computational Science and Engineering

SP - 357

EP - 364

BT - Domain Decomposition Methods in Science and Engineering XVI

A2 - Widlund, Olof

A2 - Keyes, David

ER -

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

Abstract

Publication series

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this