[图书][B] Domain decomposition methods-algorithms and theory
A Toselli, O Widlund - 2006 - books.google.com
This book offers a comprehensive presentation of some of the most successful and popular
domain decomposition preconditioners for finite and spectral element approximations of …
domain decomposition preconditioners for finite and spectral element approximations of …
FETI‐DP: a dual–primal unified FETI method—part I: A faster alternative to the two‐level FETI method
C Farhat, M Lesoinne, P LeTallec… - … journal for numerical …, 2001 - Wiley Online Library
The FETI method and its two‐level extension (FETI‐2) are two numerically scalable domain
decomposition methods with Lagrange multipliers for the iterative solution of second‐order …
decomposition methods with Lagrange multipliers for the iterative solution of second‐order …
[图书][B] Lecture notes in computational science and engineering
TJ Barth, M Griebel, DE Keyes, RM Nieminen, D Roose… - 2005 - Springer
The FEniCS Project set out in 2003 with an idea to automate the solution of mathematical
models based on differential equations. Initially, the FEniCS Project consisted of two …
models based on differential equations. Initially, the FEniCS Project consisted of two …
[图书][B] Domain decomposition methods for the numerical solution of partial differential equations
TPA Mathew - 2008 - Springer
These notes serve as an introduction to a subject of study in computational mathematics
referred to as domain decomposition methods. It concerns divide and conquer methods for …
referred to as domain decomposition methods. It concerns divide and conquer methods for …
A scalable dual‐primal domain decomposition method
We blend dual and primal domain decomposition approaches to construct a fast iterative
method for the solution of large-scale systems of equations arising from the finite element …
method for the solution of large-scale systems of equations arising from the finite element …
An algebraic theory for primal and dual substructuring methods by constraints
FETI and BDD are two widely used substructuring methods for the solution of large sparse
systems of linear algebraic equations arising from discretization of elliptic boundary value …
systems of linear algebraic equations arising from discretization of elliptic boundary value …
FETI‐DP, BDDC, and block Cholesky methods
J Li, OB Widlund - … journal for numerical methods in engineering, 2006 - Wiley Online Library
Abstract The FETI‐DP and BDDC algorithms are reformulated using Block Cholesky
factorizations, an approach which can provide a useful framework for the design of domain …
factorizations, an approach which can provide a useful framework for the design of domain …
Non-overlapping domain decomposition methods in structural mechanics
P Gosselet, C Rey - Archives of computational methods in engineering, 2006 - Springer
The modern design of industrial structures leads to very complex simulations characterized
by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization …
by nonlinearities, high heterogeneities, tortuous geometries... Whatever the modelization …
Dual‐primal FETI methods for linear elasticity
A Klawonn, OB Widlund - … on Pure and Applied Mathematics: A …, 2006 - Wiley Online Library
Dual‐primal FETI methods are nonoverlapping domain decomposition methods where
some of the continuity constraints across subdomain boundaries are required to hold …
some of the continuity constraints across subdomain boundaries are required to hold …
FETI and Neumann‐Neumann iterative substructuring methods: connections and new results
A Klawonn, O Widlund - … on Pure and Applied Mathematics: A …, 2001 - Wiley Online Library
Abstract The FETI and Neumann‐Neumann families of algorithms are among the best
known and most severely tested domain decomposition methods for elliptic partial …
known and most severely tested domain decomposition methods for elliptic partial …