Results 1  10
of
691
Surface Parameterization: a Tutorial and Survey
 In Advances in Multiresolution for Geometric Modelling, Mathematics and Visualization
, 2005
"... Summary. This paper provides a tutorial and survey of methods for parameterizing surfaces with a view to applications in geometric modelling and computer graphics. We gather various concepts from differential geometry which are relevant to surface mapping and use them to understand the strengths and ..."
Abstract

Cited by 169 (4 self)
 Add to MetaCart
Summary. This paper provides a tutorial and survey of methods for parameterizing surfaces with a view to applications in geometric modelling and computer graphics. We gather various concepts from differential geometry which are relevant to surface mapping and use them to understand the strengths and weaknesses of the many methods for parameterizing piecewise linear surfaces and their relationship to one another. 1
Adaptive wavelet methods for elliptic operator equations— convergence rates
 Math. Comput
, 2001
"... Abstract. This paper is concerned with the construction and analysis of waveletbased adaptive algorithms for the numerical solution of elliptic equations. These algorithms approximate the solution u of the equation by a linear combination of N wavelets. Therefore, a benchmark for their performance ..."
Abstract

Cited by 108 (30 self)
 Add to MetaCart
Abstract. This paper is concerned with the construction and analysis of waveletbased adaptive algorithms for the numerical solution of elliptic equations. These algorithms approximate the solution u of the equation by a linear combination of N wavelets. Therefore, a benchmark for their performance is provided by the rate of best approximation to u by an arbitrary linear combination of N wavelets (so called Nterm approximation), which would be obtained by keeping the N largest wavelet coefficients of the real solution (which of course is unknown). The main result of the paper is the construction of an adaptive scheme which produces an approximation to u with error O(N −s)in the energy norm, whenever such a rate is possible by Nterm approximation. The range of s>0 for which this holds is only limited by the approximation properties of the wavelets together with their ability to compress the elliptic operator. Moreover, it is shown that the number of arithmetic operations needed to compute the approximate solution stays proportional to N. The adaptive algorithm applies to a wide class of elliptic problems and wavelet bases. The analysis in this paper puts forward new techniques for treating elliptic problems as well as the linear systems of equations that arise from the wavelet discretization. 1.
A FeedBack Approach to Error Control in Finite Element Methods: Basic Analysis and Examples
 EastWest J. Numer. Math
, 1996
"... this paper. ..."
GALERKIN FINITE ELEMENT APPROXIMATIONS OF STOCHASTIC ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
, 2004
"... We describe and analyze two numerical methods for a linear elliptic problem with stochastic coefficients and homogeneous Dirichlet boundary conditions. Here the aim of the computations is to approximate statistical moments of the solution, and, in particular, we give a priori error estimates for the ..."
Abstract

Cited by 77 (5 self)
 Add to MetaCart
We describe and analyze two numerical methods for a linear elliptic problem with stochastic coefficients and homogeneous Dirichlet boundary conditions. Here the aim of the computations is to approximate statistical moments of the solution, and, in particular, we give a priori error estimates for the computation of the expected value of the solution. The first method generates independent identically distributed approximations of the solution by sampling the coefficients of the equation and using a standard Galerkin finite element variational formulation. The Monte Carlo method then uses these approximations to compute corresponding sample averages. The second method is based on a finite dimensional approximation of the stochastic coefficients, turning the original stochastic problem into a deterministic parametric elliptic problem. A Galerkin finite element method, of either the h or pversion, then approximates the corresponding deterministic solution, yielding approximations of the desired statistics. We present a priori error estimates and include a comparison of the computational work required by each numerical approximation to achieve a given accuracy. This comparison suggests intuitive conditions for an optimal selection of the numerical approximation.
Finite element exterior calculus, homological techniques, and applications
 ACTA NUMERICA
, 2006
"... ..."
Hierarchical Bases and the Finite Element Method
, 1997
"... CONTENTS 1 Introduction 1 2 Preliminaries 3 3 Fundamental TwoLevel Estimates 7 4 A Posteriori Error Estimates 16 5 TwoLevel Iterative Methods 23 6 Multilevel Cauchy Inequalities 30 7 Multilevel Iterative Methods 34 References 41 1. Introduction In this work we present a brief introduction to hie ..."
Abstract

Cited by 61 (3 self)
 Add to MetaCart
CONTENTS 1 Introduction 1 2 Preliminaries 3 3 Fundamental TwoLevel Estimates 7 4 A Posteriori Error Estimates 16 5 TwoLevel Iterative Methods 23 6 Multilevel Cauchy Inequalities 30 7 Multilevel Iterative Methods 34 References 41 1. Introduction In this work we present a brief introduction to hierarchical bases, and the important part they play in contemporary finite element calculations. In particular, we examine their role in a posteriori error estimation, and in the Department of Mathematics, University of California at San Diego, La Jolla, CA 92093. The work of this author was supported by the Office of Naval Research under contract N0001489J1440. 2 Randolph E. Bank formulation of iterative methods for solving the large sparse sets of linear equations arising from the finite element discretization. Our goal is that the development should be largely selfcontained, but at the same time accessible and interest
Identifying Vector Field Singularities Using a Discrete Hodge Decomposition
, 2002
"... this paper we use a slightly more general definition of the spaces S h respectively S # h , namely we include functions which are only defined at vertices respectively at edge midpoints. For example, the (total) Gau curvature is defined solely at vertices. Here for a given vector field # we will hav ..."
Abstract

Cited by 51 (4 self)
 Add to MetaCart
this paper we use a slightly more general definition of the spaces S h respectively S # h , namely we include functions which are only defined at vertices respectively at edge midpoints. For example, the (total) Gau curvature is defined solely at vertices. Here for a given vector field # we will have div h # S h (respectively div # h # S # h ) to be defined solely at a vertex. The motivation of this generalization is twofold: first, a simplified notation of many statements, and, second, the fact that for visualization purposes one often extends these pointbased values over the surface. For example, barycentric interpolation allows to color the interior of triangles based on the discrete Gauss curvature at its vertices. Caution should be taken if integral entities are derived
Convergence of the mimetic finite difference method for diffusion problems on polyhedral meshes
 SIAM J. Numer. Anal
, 2007
"... The stability and convergence properties of the mimetic finite difference method for diffusiontype problems on polyhedral meshes are analyzed. The optimal convergence rates for the scalar and vector variables in the mixed formulation of the problem are proved. 1 ..."
Abstract

Cited by 49 (10 self)
 Add to MetaCart
The stability and convergence properties of the mimetic finite difference method for diffusiontype problems on polyhedral meshes are analyzed. The optimal convergence rates for the scalar and vector variables in the mixed formulation of the problem are proved. 1
On the Approximation Power of Bivariate Splines
 Advances in Comp. Math. 9
, 1996
"... . We show how to construct stable quasiinterpolation schemes in the bivariate spline spaces S r d (4) with d 3r+2 which achieve optimal approximation order. In addition to treating the usual max norm, we also give results in the Lp norms, and show that the methods also approximate derivatives to ..."
Abstract

Cited by 48 (32 self)
 Add to MetaCart
. We show how to construct stable quasiinterpolation schemes in the bivariate spline spaces S r d (4) with d 3r+2 which achieve optimal approximation order. In addition to treating the usual max norm, we also give results in the Lp norms, and show that the methods also approximate derivatives to optimal order. We pay special attention to the approximation constants, and show that they depend only on the the smallest angle in the underlying triangulation and the nature of the boundary of the domain. AMS(MOS) Subject Classifications: 41A15, 41A63, 41A25, 65D10 Keywords and phrases: Bivariate Splines, Approximation Order by Splines, Stable Approximation Schemes, Super Splines. x1. Introduction Let\Omega be a bounded polygonal domain in IR 2 . Given a finite triangulation 4 of \Omega\Gamma we are interested in spaces of splines of smoothness r and degree d of the form S r d (4) := fs 2 C r(\Omega\Gamma : sj T 2 P d ; for all T 2 4g; where P d denotes the space of polynomials of...
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.