Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a40c99528bbaa594

Jump to content

// Workers AI · dad joke modeWhat did superconvergence say to its date? You converge perfectly with me.

From Wikipedia, the free encyclopedia

In numerical analysis, a superconvergent or supraconvergent method is one which converges faster than generally expected (superconvergence or supraconvergence). For example, in the finite element method approximation to Poisson's equation in two dimensions, using piecewise linear elements, the average error in the gradient is first order. However under certain conditions it's possible to recover the gradient at certain locations within each element to second order.

References

[edit]
  • Barbeiro, S.; Ferreira, J. A.; Grigorieff, R. D. (2005), "Supraconvergence of a finite difference scheme for solutions in Hs(0, L)", IMA J Numer Anal, 25 (4): 797–811, CiteSeerX 10.1.1.108.7189, doi:10.1093/imanum/dri018 {{citation}}: Cite uses deprecated parameter |citeseerx= (help)
  • Ferreira, J. A.; Grigorieff, R. D. (1998), "On the supraconvergence of elliptic finite difference methods" (PDF), Applied Numerical Mathematics, 28: 275–292, doi:10.1016/S0168-9274(98)00048-8, hdl:10316/4663
  • Levine, N. D. (1985), "Superconvergent Recovery of the Gradient from Piecewise Linear Finite-element Approximations" (PDF), IMA J Numer Anal, 5 (4): 407–427, doi:10.1093/imanum/5.4.407