Results 1  10
of
66
Finite element exterior calculus, homological techniques, and applications
 ACTA NUMERICA
, 2006
"... ..."
Feti And NeumannNeumann Iterative Substructuring Methods: Connections And New Results
 Comm. Pure Appl. Math
, 1999
"... The FETI and NeumannNeumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common but there are also differences. The ..."
Abstract

Cited by 60 (17 self)
 Add to MetaCart
The FETI and NeumannNeumann families of algorithms are among the best known and most severely tested domain decomposition methods for elliptic partial differential equations. They are iterative substructuring methods and have many algorithmic components in common but there are also differences. The purpose of this paper is to further unify the theory for these two families of methods and to introduce a new family of FETI algorithms. Bounds on the rate of convergence, which are uniform with respect to the coefficients of a family of elliptic problems with heterogeneous coefficients, are established for these new algorithms. The theory for a variant of the NeumannNeumann algorithm is also redeveloped stressing similarities to that for the FETI methods.
Multilevel Schwarz Methods For Elliptic Problems With Discontinuous Coefficients In Three Dimensions
 NUMER. MATH
, 1994
"... Multilevel Schwarz methods are developed for a conforming finite element approximation of second order elliptic problems. We focus on problems in three dimensions with possibly large jumps in the coefficients across the interface separating the subregions. We establish a condition number estimate fo ..."
Abstract

Cited by 54 (13 self)
 Add to MetaCart
Multilevel Schwarz methods are developed for a conforming finite element approximation of second order elliptic problems. We focus on problems in three dimensions with possibly large jumps in the coefficients across the interface separating the subregions. We establish a condition number estimate for the iterative operator, which is independent of the coefficients, and grows at most as the square of the number of levels. We also characterize a class of distributions of the coefficients, called quasimonotone, for which the weighted L²projection is stable and for which we can use the standard piecewise linear functions as a coarse space. In this case, we obtain optimal methods, i.e. bounds which are independent of the number of levels and subregions. We also design and analyze multilevel methods with new coarse spaces given by simple explicit formulas. We consider nonuniform meshes and conclude by an analysis of multilevel iterative substructuring methods.
DualPrimal Feti Methods For ThreeDimensional Elliptic Problems With Heterogeneous Coefficients
 SIAM J. Numer. Anal
, 2001
"... In this paper, certain iterative substructuring methods with Lagrange multipliers are considered for elliptic problems in three dimensions. The algorithms belong to the family of dualprimal FETI methods which have recently been introduced and analyzed successfully for elliptic problems in the plane ..."
Abstract

Cited by 54 (10 self)
 Add to MetaCart
In this paper, certain iterative substructuring methods with Lagrange multipliers are considered for elliptic problems in three dimensions. The algorithms belong to the family of dualprimal FETI methods which have recently been introduced and analyzed successfully for elliptic problems in the plane. The family of algorithms for three dimensions is extended and a full analysis is provided for the new algorithms. Particular attention is paid to finding algorithms with a small primal subspace since that subspace represents the only global part of the dualprimal preconditioner. It is shown that the condition numbers of several of the dualprimal FETI methods can be bounded polylogarithmically as a function of the dimension of the individual subregion problems and that the bounds are otherwise independent of the number of subdomains, the mesh size, and jumps in the coefficients. These results closely parallel those for other successful iterative substructuring methods of primal as well as dual type.
Convergence of a Balancing Domain Decomposition by Constraints and Energy Minimization
, 2002
"... A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The preconditioner is formulated as an Additive Schwarz method and analyzed by building on existing results for Balancing Domain Decomposition. The main result is a bound on the c ..."
Abstract

Cited by 45 (10 self)
 Add to MetaCart
A convergence theory is presented for a substructuring preconditioner based on constrained energy minimization concepts. The preconditioner is formulated as an Additive Schwarz method and analyzed by building on existing results for Balancing Domain Decomposition. The main result is a bound on the condition number based on inequalities involving the matrices of the preconditioner. Estimates of the usual form C(1 + log²(H/h)) are obtained under the standard assumptions of substructuring theory. Computational results demonstrating the performance of method are included.
Some Nonoverlapping Domain Decomposition Methods
, 1998
"... . The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for solving secondorder elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuringtype methods and the Neumann ..."
Abstract

Cited by 36 (6 self)
 Add to MetaCart
. The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for solving secondorder elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuringtype methods and the NeumannNeumanntype methods. The basic framework used for analysis is the parallel subspace correction method or additive Schwarz method, and other technical tools include localglobal and globallocal techniques. The analyses for both two and threedimensional cases are carried out simultaneously. Some internal relationships between various algorithms are observed and several new variants of the algorithms are also derived. Key words. nonoverlapping domain decomposition, Schur complement, localglobal and globallocal techniques, jumps in coe#cients, substructuring, NeumannNeumann, balancing methods AMS subject classifications. 65N30, 65N55, 65F10 PII. S0036144596306800 1. Introduction. T...
An Algebraic Theory for Primal and Dual Substructuring Methods by Constraints
, 2004
"... FETI and BDD are two widely used substructuring methods for the solution of large sparse systems of linear algebraic equations arizing from discretization of elliptic boundary value problems. The two most advanced variants of these methods are the FETIDP and the BDDC methods, whose formulation does ..."
Abstract

Cited by 36 (10 self)
 Add to MetaCart
FETI and BDD are two widely used substructuring methods for the solution of large sparse systems of linear algebraic equations arizing from discretization of elliptic boundary value problems. The two most advanced variants of these methods are the FETIDP and the BDDC methods, whose formulation does not require any information beyond the algebraic system of equations in a substructure form. We formulate the FETIDP and the BDDC methods in common framework as methods based on general constraints between the substructures, and provide a simplified algebraic convergence theory. The basic implementation blocks including transfer operators are common to both methods. It is shown that commonly used properties of the transfer operators in fact determine the operators uniquely. Identical algebraic condition number bounds for both methods are given in terms of a single inequality, and, under natural additional assumptions, it is proved that the eigenvalues of the preconditioned problems are the same. The algebraic bounds imply the usual polylogarithmic bounds for finite elements, independent of coefficient jumps between substructures. Computational experiments confirm the theory.
A nonoverlapping domain decomposition method for Maxwell’s equations in three dimensions
 SIAM J. Numer. Anal
"... Abstract. We propose a substructuring preconditioner for solving threedimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with muc ..."
Abstract

Cited by 35 (10 self)
 Add to MetaCart
Abstract. We propose a substructuring preconditioner for solving threedimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with much simpler coarse solvers. Though the condition number of the preconditioned system may not have a good bound, we are able to show that the convergence rate of the PCG method with such substructuring preconditioner is nearly optimal, and also robust with respect to the (possibly large) jumps of the coefficient in the elliptic equation. 1.
A NeumannNeumann Domain Decomposition Algorithm for Solving Plate and Shell Problems
 SIAM J. NUMER. ANAL
, 1997
"... We present a new NeumannNeumann type preconditioner of large scale linear systems arising from plate and shell problems. The advantage of the new method is a smaller coarse space than those of earlier method of the authors; this improves parallel scalability. A new abstract framework for NeumannNe ..."
Abstract

Cited by 33 (8 self)
 Add to MetaCart
We present a new NeumannNeumann type preconditioner of large scale linear systems arising from plate and shell problems. The advantage of the new method is a smaller coarse space than those of earlier method of the authors; this improves parallel scalability. A new abstract framework for NeumannNeumann preconditioners is used to prove almost optimal convergence properties of the method. The convergence estimates are independent of the number of subdomains, coefficient jumps between subdomains, and depend only polylogarithmically on the number of elements per subdomain. We formulate and prove an approximate parametric variational principle for ReissnerMindlin elements as the plate thickness approaches zero, which makes the results applicable to a large class of nonlocking elements in everyday engineering use. The theoretical results are confirmed by computational experiments on model problems as well as examples from real world engineering practice.
Algebraic theory of multiplicative Schwarz methods
 NUMER. MATH.
, 2001
"... The convergence of multiplicative Schwarztype methods for solving linear systems when the coefficient matrix is either a nonsingular Mmatrix or a symmetric positive definite matrix is studied using classical and new results from the theory of splittings. The effect on convergence of algorithmic ..."
Abstract

Cited by 26 (19 self)
 Add to MetaCart
The convergence of multiplicative Schwarztype methods for solving linear systems when the coefficient matrix is either a nonsingular Mmatrix or a symmetric positive definite matrix is studied using classical and new results from the theory of splittings. The effect on convergence of algorithmic parameters such as the number of subdomains, the amount of overlap, the result of inexact local solves and of “coarse grid” corrections (global coarse solves) is analyzed in an algebraic setting. Results on algebraic additive Schwarz are also included.