Results 1  10
of
164
Finite element exterior calculus, homological techniques, and applications
 ACTA NUMERICA
, 2006
"... ..."
Overlapping Schwarz Methods On Unstructured Meshes Using NonMatching Coarse Grids
 Numer. Math
, 1996
"... . We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may ..."
Abstract

Cited by 49 (17 self)
 Add to MetaCart
. We consider two level overlapping Schwarz domain decomposition methods for solving the finite element problems that arise from discretizations of elliptic problems on general unstructured meshes in two and three dimensions. Standard finite element interpolation from the coarse to the fine grid may be used. Our theory requires no assumption on the substructures which constitute the whole domain, so each substructure can be of arbitrary shape and of different size. The global coarse mesh is allowed to be nonnested to the fine grid on which the discrete problem is to be solved and both the coarse meshes and the fine meshes need not be quasiuniform. In addition, the domains defined by the fine and coarse grid need not be identical. The one important constraint is that the closure of the coarse grid must cover any portion of the fine grid boundary for which Neumann boundary conditions are given. In this general setting, our algorithms have the same optimal convergence rate of the usual ...
A posteriori error estimates for nonlinear problems. Finite element discretizations of elliptic equations
 475 (1994) MR 94j:65136
"... Abstract. Using the abstract framework of [9] we analyze a residual a posteriori error estimator for spacetime finite element discretizations of quasilinear parabolic pdes. The estimator gives global upper and local lower bounds on the error of the numerical solution. The finite element discretizat ..."
Abstract

Cited by 48 (2 self)
 Add to MetaCart
Abstract. Using the abstract framework of [9] we analyze a residual a posteriori error estimator for spacetime finite element discretizations of quasilinear parabolic pdes. The estimator gives global upper and local lower bounds on the error of the numerical solution. The finite element discretizations in particular cover the socalled θscheme, which includes the implicit and explicit Euler methods and the CrankNicholson scheme. 1.
The Adaptive Multilevel Finite Element Solution of the PoissonBoltzmann Equation on Massively Parallel Computers
 J. COMPUT. CHEM
, 2000
"... Using new methods for the parallel solution of elliptic partial differential equations, the teraflops computing power of massively parallel computers can be leveraged to perform electrostatic calculations on large biological systems. This paper describes the adaptive multilevel finite element soluti ..."
Abstract

Cited by 43 (14 self)
 Add to MetaCart
Using new methods for the parallel solution of elliptic partial differential equations, the teraflops computing power of massively parallel computers can be leveraged to perform electrostatic calculations on large biological systems. This paper describes the adaptive multilevel finite element solution of the PoissonBoltzmann equation for a microtubule on the NPACI IBM Blue Horizon supercomputer. The microtubule system is 40 nm in length and 24 nm in diameter, consists of roughly 600,000 atoms, and has a net charge of1800 e. PoissonBoltzmann calculations are performed for several processor configurations and the algorithm shows excellent parallel scaling.
Adaptive numerical treatment of elliptic systems on manifolds
 Advances in Computational Mathematics, 15(1):139
, 2001
"... ABSTRACT. Adaptive multilevel finite element methods are developed and analyzed for certain elliptic systems arising in geometric analysis and general relativity. This class of nonlinear elliptic systems of tensor equations on manifolds is first reviewed, and then adaptive multilevel finite element ..."
Abstract

Cited by 41 (24 self)
 Add to MetaCart
ABSTRACT. Adaptive multilevel finite element methods are developed and analyzed for certain elliptic systems arising in geometric analysis and general relativity. This class of nonlinear elliptic systems of tensor equations on manifolds is first reviewed, and then adaptive multilevel finite element methods for approximating solutions to this class of problems are considered in some detail. Two a posteriori error indicators are derived, based on local residuals and on global linearized adjoint or dual problems. The design of Manifold Code (MC) is then discussed; MC is an adaptive multilevel finite element software package for 2 and 3manifolds developed over several years at Caltech and UC San Diego. It employs a posteriori error estimation, adaptive simplex subdivision, unstructured algebraic multilevel methods, global inexact Newton methods, and numerical continuation methods for the numerical solution of nonlinear covariant elliptic systems on 2 and 3manifolds. Some of the more interesting features of MC are described in detail, including some new ideas for topology and geometry representation in simplex meshes, and an unusual partition of unitybased method for exploiting parallel computers. A short example is then given which involves the Hamiltonian and momentum constraints in the Einstein equations, a representative nonlinear 4component covariant elliptic system on a Riemannian 3manifold which arises in general relativity. A number of operator properties and solvability results recently established are first summarized, making possible two quasioptimal a priori error estimates for Galerkin approximations which are then derived. These two results complete the theoretical framework for effective use of adaptive multilevel finite element methods. A sample calculation using the MC software is then presented.
Error Estimation for Anisotropic Tetrahedral and Triangular Finite Element Meshes
, 1997
"... Some boundary value problems yield anisotropic solutions, e.g. solutions with boundary layers. If such problems are to be solved with the finite element method (FEM), anisotropically refined meshes can be advantageous. In order to construct these meshes or to control the error one aims at reliable e ..."
Abstract

Cited by 38 (6 self)
 Add to MetaCart
Some boundary value problems yield anisotropic solutions, e.g. solutions with boundary layers. If such problems are to be solved with the finite element method (FEM), anisotropically refined meshes can be advantageous. In order to construct these meshes or to control the error one aims at reliable error estimators. For isotropic meshes many estimators are known, but they either fail when used on anisotropic meshes, or they were not applied yet. For rectangular (or cuboidal) anisotropic meshes a modified error estimator had already been found. We are investigating error estimators on anisotropic tetrahedral or triangular meshes because such grids offer greater geometrical flexibility. For the Poisson equation a residual error estimator, a local Dirichlet problem error estimator, and an L 2 error estimator are derived, respectively. Additionally a residual error estimator is presented for a singularly perturbed reaction diffusion equation. It is important that the anisotropic mesh corres...
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 twolevel additive Schwarz preconditioner for nonconforming plate elements
 Numer. Math
, 1994
"... Abstract. Twolevel additive Schwarz preconditioners are developed for the nonconforming P1 finite element approximation of scalar secondorder symmetric positive definite elliptic boundary value problems, the Morley finite element approximation of the biharmonic equation, and the divergencefree no ..."
Abstract

Cited by 35 (5 self)
 Add to MetaCart
Abstract. Twolevel additive Schwarz preconditioners are developed for the nonconforming P1 finite element approximation of scalar secondorder symmetric positive definite elliptic boundary value problems, the Morley finite element approximation of the biharmonic equation, and the divergencefree nonconforming P1 finite element approximation of the stationary Stokes equations. The condition numbers of the preconditioned systems are shown to be bounded independent of mesh sizes and the number of subdomains in the case of generous overlap. 1.
Each averaging technique yields reliable a posteriori error control in FEM on unstructured grids
 Part II: Higher order FEM, Math. Comp., posted on February 4, 2002, PII S
"... Abstract. Averaging techniques are popular tools in adaptive finite element methods for the numerical treatment of second order partial differential equations since they provide efficient a posteriori error estimates by a simple postprocessing. In this paper, their reliablility is shown for conformi ..."
Abstract

Cited by 35 (8 self)
 Add to MetaCart
Abstract. Averaging techniques are popular tools in adaptive finite element methods for the numerical treatment of second order partial differential equations since they provide efficient a posteriori error estimates by a simple postprocessing. In this paper, their reliablility is shown for conforming, nonconforming, and mixed low order finite element methods in a model situation: the Laplace equation with mixed boundary conditions. Emphasis is on possibly unstructured grids, nonsmoothness of exact solutions, and a wide class of averaging techniques. Theoretical and numerical evidence supports that the reliability is up to the smoothness of given righthand sides. 1.
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 35 (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...