[图书][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 …
[图书][B] Optimal quadratic programming algorithms: with applications to variational inequalities
Z Dostál - 2009 - books.google.com
Solving optimization problems in complex systems often requires the implementation of
advanced mathematical techniques. Quadratic programming (QP) is one technique that …
advanced mathematical techniques. Quadratic programming (QP) is one technique that …
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 …
Convergence of algebraic multigrid based on smoothed aggregation
P Van\vek, M Brezina, J Mandel - Numerische Mathematik, 2001 - Springer
We prove an abstract convergence estimate for the Algebraic Multigrid Method with
prolongator defined by a disaggregation followed by a smoothing. The method input is the …
prolongator defined by a disaggregation followed by a smoothing. The method input is the …
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 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 …
The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems
The FETI algorithms are a family of numerically scalable domain decomposition methods.
They have been designed in the early 1990s for solving iteratively and on parallel machines …
They have been designed in the early 1990s for solving iteratively and on parallel machines …