TITLE

A Remark on Newest Vertex Bisection in Any Space Dimension

AUTHOR(S)
Gallistl, Dietmar; Schedensack, Mira; Stevenson, Rob P.
PUB. DATE
July 2014
SOURCE
Computational Methods in Applied Mathematics;2014, Vol. 14 Issue 3, p317
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
No abstract available.
ACCESSION #
100858013

 

Related Articles

  • Quasi-optimal complexity of adaptive finite element method for linear elasticity problems in two dimensions. Liu, Chunmei; Zhong, Liuqiang; Shu, Shi; Xiao, Yingxiong // Applied Mathematics & Mechanics;Feb2016, Vol. 37 Issue 2, p151 

    This paper introduces an adaptive finite element method (AFEM) using the newest vertex bisection and marking exclusively according to the error estimator without special treatment of oscillation. By the combination of the global lower bound and the localized upper bound of the posteriori error...

  • Convergence rates for adaptive finite elements. GASPOZ, FERNANDO D.; MORIN, PEDRO // IMA Journal of Numerical Analysis;Oct2009, Vol. 29 Issue 4, p917 

    In this article, we prove that it is possible to construct, using newest vertex bisection, meshes that equidistribute the error in the H1-norm whenever the function to be approximated can be decomposed as a sum of a regular part plus a singular part with singularities around a finite number of...

  • An Adaptive Mesh-Refining Algorithm Allowing for an H1 Stable L2 Projection onto Courant Finite Element Spaces. Carstensen, Carsten // Constructive Approximation;2004, Vol. 20 Issue 4, p549 

    Suppose $\cal{S}^1({\cal T})\subset H^1(\Omega)$ is the $P_1$-finite element space of $\cal{T}$-piecewise affine functions based on a regular triangulation $\cal{T}$ of a two-dimensional surface $\Omega$ into triangles. The $L^2$ projection $\Pi$ onto $\cal{S}^1(\cal{T})$ is $H^1$ stable if...

  • A COARSENING ALGORITHM ON ADAPTIVE GRIDS BY NEWEST VERTEX BISECTION AND ITS APPLICATIONS. Long Chen; Chensong Zhang // Journal of Computational Mathematics;Nov2010, Vol. 28 Issue 6, p767 

    In this paper, an efficient and easy-to-implement coarsening algorithm is proposed for adaptive grids obtained using the newest vertex bisection method in two dimemsions. The new coarsening algorithm does not require storing the binary refinement tree explicitly. Instead, the structure is...

  • Instance Optimality of the Adaptive Maximum Strategy. Diening, Lars; Kreuzer, Christian; Stevenson, Rob // Foundations of Computational Mathematics;Feb2016, Vol. 16 Issue 1, p33 

    In this paper, we prove that the standard adaptive finite element method with a (modified) maximum marking strategy is instance optimal for the total error, being the square root of the squared energy error plus the squared oscillation. This result will be derived in the model setting of...

  • Representational pseudoneglect in line bisection. Darling, Stephen; Logie, Robert; Della Sala, Sergio // Psychonomic Bulletin & Review;Oct2012, Vol. 19 Issue 5, p879 

    'Representational pseudoneglect' refers to a bias toward the left side of space that occurs when visual information is remembered. Recently a number of demonstrations of such representational pseudoneglect have appeared. In the present article, we report an experiment in which we adopted the...

  • Dimensionally regularized one-loop tensor integralswith massless internal particles. Kurihara, Y. // European Physical Journal C -- Particles & Fields;Jan2006, Vol. 45 Issue 2, p427 

    A set of one-loop vertex and box tensor integrals with massless internal particles has been obtained directly without any reduction method to scalar integrals. The results with one or two massive external lines for the vertex integral and zero or one massive external lines for the box integral...

  • Kähler metrics of negative holomorphic bisectional curvature on Kodaira surfaces. To, Wing-Keung; Yeung, Sai-Kee // Bulletin of the London Mathematical Society;Jun2011, Vol. 43 Issue 3, p507 

    We construct a Kähler metric of negative holomorphic bisectional curvature on any compact complex surface that admits a Kodaira fibration. This is achieved by considering the curvature of the Weil–Petersson metric on an associated Teichmüller space of punctured Riemann surfaces.

  • Local Multilevel Method on Adaptively Refined Meshes for Elliptic Problems with Smooth Complex Coefficients. Li, Shishun; Shao, Xinping; Si, Zhiyong // Numerical Mathematics: Theory, Methods & Applications;Aug2015, Vol. 8 Issue 3, p336 

    In this paper, a local multilevel algorithm is investigated for solving linear systems arising from adaptive finite element approximations of second order elliptic problems with smooth complex coefficients. It is shown that the abstract theory for local multilevel algorithm can also be applied...

  • Conductivity of the disordered Anderson model. Pokorný, Vladislav; Janisˇ, Václav // AIP Conference Proceedings;Sep2012, Vol. 1485 Issue 1, p307 

    We propose a renormalization scheme of the Kubo formula for the electrical conductivity with multiple backscatterings contributing to the electron-hole irreducible vertex. The asymptotic limit to high spatial dimensions is used to determine this vertex via a symmetrized Bethe-Salpeter equation...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics