Results 1  10
of
143
Reduced basis approximation and a posteriori error estimation for parametrized partial differential equations. Version 1.0, Copyright MIT
, 2006
"... reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial differential equations. The essential ingredients are (primaldual) Galerkin projection onto a lowdimensional space associated with a smooth “parametric ..."
Abstract

Cited by 205 (38 self)
 Add to MetaCart
reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial differential equations. The essential ingredients are (primaldual) Galerkin projection onto a lowdimensional space associated with a smooth “parametric manifold”—dimension reduction; efficient and effective greedy sampling methods for identification of optimal and numerically stable approximations—rapid convergence; a posteriori error estimation procedures—rigorous and sharp bounds for the linearfunctional outputs of interest; and OfflineOnline computational decomposition strategies—minimum marginal cost for high performance in the realtime/embedded (e.g., parameterestimation, con
GoalOriented Error Estimation and Adaptivity for the Finite Element Method
 Comput. Math. Appl
, 1999
"... this paper, we study a new approach in a posteriori error estimation, in which the numerical error of finite element approximations is estimated in terms of quantities of interest rather than the classical energy norm. These socalled quantities of interest are characterized by linear functionals on ..."
Abstract

Cited by 75 (9 self)
 Add to MetaCart
(Show Context)
this paper, we study a new approach in a posteriori error estimation, in which the numerical error of finite element approximations is estimated in terms of quantities of interest rather than the classical energy norm. These socalled quantities of interest are characterized by linear functionals on the space of functions to where the solution belongs. We present here the theory with respect to a class of elliptic boundaryvalue problems, and in particular, show how to obtain accurate estimates as well as upper and lowerbounds on the error. We also study the new concept of goaloriented adaptivity, which embodies mesh adaptation procedures designed to control error in specific quantities. Numerical experiments confirm that such procedures greatly accelerate the attainment of local features of the solution to preset accuracies as compared to traditional adaptive schemes based on energy norm error estimates.
A finite element method for domain decomposition with nonmatching grids
 ESAIM: Mathematical Modeling and Numerical Analysis
"... Abstract. In this note, we propose and analyse a method for handling interfaces between nonmatching grids based on an approach suggested by Nitsche (1971) for the approximation of Dirichlet boundary conditions. The exposition is limited to selfadjoint elliptic problems, using Poisson’s equation a ..."
Abstract

Cited by 72 (11 self)
 Add to MetaCart
(Show Context)
Abstract. In this note, we propose and analyse a method for handling interfaces between nonmatching grids based on an approach suggested by Nitsche (1971) for the approximation of Dirichlet boundary conditions. The exposition is limited to selfadjoint elliptic problems, using Poisson’s equation as a model. A priori and a posteriori error estimates are given. Some numerical results are included.
A Posteriori Finite Element Bounds for LinearFunctional Outputs of Elliptic Partial Differential Equations
 Computer Methods in Applied Mechanics and Engineering
, 1997
"... We present a domain decomposition finite element technique for efficiently generating lower and upper bounds to outputs which are linear functionals of the solutions to symmetric or nonsymmetric second order elliptic linear partial differential equations in two space dimensions. The method is base ..."
Abstract

Cited by 63 (9 self)
 Add to MetaCart
(Show Context)
We present a domain decomposition finite element technique for efficiently generating lower and upper bounds to outputs which are linear functionals of the solutions to symmetric or nonsymmetric second order elliptic linear partial differential equations in two space dimensions. The method is based upon the construction of an augmented Lagrangian, in which the objective is a quadratic "energy" reformulation of the desired output, and the constraints are the finite element equilibrium equations and intersubdomain continuity requirements. The bounds on the output for a suitably fine "truthmesh" discretization are then derived by appealing to a dual maxmin relaxation evaluated for optimally chosen adjoint and hybridflux candidate Lagrange multipliers generated by a Kelement coarser "workingmesh" approximation. Independent of the form of the original partial differential equation, the computation on the truth mesh is reduced to K decoupled subdomainlocal, symmetric Neumann pro...
Adaptive Finite Element Methods For Optimal Control Of Partial Differential Equations: Basic Concept
 SIAM J. Contr. Optim
, 1998
"... A new approach to error control and mesh adaptivity is described for the discretization of optimal control problems governed by elliptic partial differential equations. The Lagrangian formalism yields the firstorder necessary optimality condition in form of an indefinite boundary value problem whic ..."
Abstract

Cited by 61 (4 self)
 Add to MetaCart
A new approach to error control and mesh adaptivity is described for the discretization of optimal control problems governed by elliptic partial differential equations. The Lagrangian formalism yields the firstorder necessary optimality condition in form of an indefinite boundary value problem which is approximated by an adaptive Galerkin finite element method. The mesh design in the resulting reduced models is controlled by residualbased a posteriori error estimates. These are derived by duality arguments employing the cost functional of the optimization problem for controlling the discretization error. In this case, the computed state and costate variables can be used as sensitivity factors multiplying the local cellresiduals in the error estimators. This results in a generic and simple algorithm for mesh adaptation within the optimization process. This method is developed and tested for simple boundary control problems in semiconductor models.
An Adaptive Finite Element Method for Large Scale Image Processing
 INTERNATIONAL CONFERENCE ON SCALESPACE THEORIES IN COMPUTER VISION
, 1999
"... Nonlinear diffusion methods have proved to be powerful methods in the processing of 2D and 3D images. They allow a denoising and smoothing of image intensities while retaining and enhancing edges. As time evolves in the corresponding process, a scale of successively coarser image details is generate ..."
Abstract

Cited by 47 (19 self)
 Add to MetaCart
(Show Context)
Nonlinear diffusion methods have proved to be powerful methods in the processing of 2D and 3D images. They allow a denoising and smoothing of image intensities while retaining and enhancing edges. As time evolves in the corresponding process, a scale of successively coarser image details is generated. Certain features, however, remain highly resolved and sharp. On the other hand, compression is an important topic in image processing as well. Here a method is presented which combines the two aspects in an efficient way. It is based on a semi–implicit Finite Element implementation of nonlinear diffusion. Error indicators guide a successive coarsening process. This leads to locally coarse grids in areas of resulting smooth image intensity, while enhanced edges are still resolved on fine grid levels. Special emphasis has been put on algorithmical aspects such as storage requirements and efficiency. Furthermore, a new nonlinear anisotropic diffusion method for vector field visualization is presented.
Bounds for LinearFunctional Outputs of Coercive Partial Differential Equations: Local Indicators and Adaptive Refinement
, 1997
"... this paper we focus on three new developments. First, we introduce a modified energy objective, and hence modified Lagrangian, that permits both more transparent interpretation and more ready generalization. Second, we demonstrate that the bound gap  the difference between the upper and lower bou ..."
Abstract

Cited by 44 (9 self)
 Add to MetaCart
this paper we focus on three new developments. First, we introduce a modified energy objective, and hence modified Lagrangian, that permits both more transparent interpretation and more ready generalization. Second, we demonstrate that the bound gap  the difference between the upper and lower bounds for the desired output  can be represented as the sum of positive contributions  local indicators  associated with the elements TH of TH . Third, based on these local boundgap error indicators, we develop adaptive strategies by which to reduce the bound gap  and hence improve our validated prediction for the output of interest  through optimal refinement of TH . The resulting method is applied to an illustrative problem in linear elasticity.
A posteriori error estimation techniques in practical finite element analysis
, 2005
"... In this paper we review the basic concepts to obtain a posteriori error estimates for the finite element solution of an elliptic linear model problem. We give the basic ideas to establish global error estimates for the energy norm as well as goaloriented error estimates. While we show how these er ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
In this paper we review the basic concepts to obtain a posteriori error estimates for the finite element solution of an elliptic linear model problem. We give the basic ideas to establish global error estimates for the energy norm as well as goaloriented error estimates. While we show how these error estimation techniques are employed for our simple model problem, the emphasis of the paper is on assessing whether these procedures are ready for use in practical linear finite element analysis. We conclude that the actually practical error estimation techniques do not provide mathematically proven bounds on the error and need to be used with care. The more accurate estimation procedures also do not provide proven bounds that, in general, can be computed efficiently. We also briefly comment upon the state of error estimations
A posteriori error estimates for vertex centered finite volume approximations of convectiondiffusionreaction equations
 M2AN Math. Model. Numer. Anal
, 2000
"... This paper is devoted to the study of a posteriori error estimates for the scalar nonlinear convectiondiffusionreaction equation c t +r (uf(c)) r (Drc)+c = 0. The estimates for the error between the exact solution and an upwind finite volume approximation to the solution are derived in the L¹ ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
This paper is devoted to the study of a posteriori error estimates for the scalar nonlinear convectiondiffusionreaction equation c t +r (uf(c)) r (Drc)+c = 0. The estimates for the error between the exact solution and an upwind finite volume approximation to the solution are derived in the L¹norm, independent of the diffusion parameter D. The resulting a posteriori error estimate is used to define an grid adaptive solution algorithm for the finite volume scheme. Finally numerical
Adaptive Multilevel Methods for Edge Element Discretizations of Maxwell's Equations
, 1997
"... . The focus of this paper is on the efficient solution of boundary value problems involving the doublecurl operator. Those arise in the computation of electromagnetic fields in various settings, for instance when solving the electric or magnetic wave equation with implicit timestepping, when tackl ..."
Abstract

Cited by 32 (12 self)
 Add to MetaCart
. The focus of this paper is on the efficient solution of boundary value problems involving the doublecurl operator. Those arise in the computation of electromagnetic fields in various settings, for instance when solving the electric or magnetic wave equation with implicit timestepping, when tackling timeharmonic problems or in the context of eddycurrent computations. Their discretization is based on on N'ed'elec's H(curl;\Omega\Gamma7131/59948 edge elements on unstructured grids. In order to capture local effects and to guarantee a prescribed accuracy of the approximate solution adaptive refinement of the grid controlled by a posteriori error estimators is employed. The hierarchy of meshes created through adaptive refinement forms the foundation for the fast iterative solution of the resulting linear systems by a multigrid method. The guiding principle underlying the design of both the error estimators and the multigrid method is the separate treatment of the kernel of the cu...