Greedy bisection generates optimally adapted triangulations

Details Greedy bisection generates optimally adapted triangulations Greedy bisection generates optimally adapted triangulations

2011-01-07

arxiv.org/abs/1101.1452v1

Mathematics

Numerical Analysis

24 pages

Scientific paper

We study the properties of a simple greedy algorithm for the generation of data-adapted anisotropic triangulations. Given a function f, the algorithm produces nested triangulations and corresponding piecewise polynomial approximations of f. The refinement procedure picks the triangle which maximizes the local Lp approximation error, and bisect it in a direction which is chosen so to minimize this error at the next step. We study the approximation error in the Lp norm when the algorithm is applied to C2 functions with piecewise linear approximations. We prove that as the algorithm progresses, the triangles tend to adopt an optimal aspect ratio which is dictated by the local hessian of f. For convex functions, we also prove that the adaptive triangulations satisfy a convergence bound which is known to be asymptotically optimal among all possible triangulations.

Affiliated with

Also associated with

No associations

Rating

Greedy bisection generates optimally adapted triangulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Greedy bisection generates optimally adapted triangulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy bisection generates optimally adapted triangulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484234