Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation

Details Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation

2007-09-26

arxiv.org/abs/0709.4046v1

Mathematics

Numerical Analysis

18 pages

Scientific paper

We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a Lax-Richtmyer type equivalence theorem -- a consistent method is convergent if and only if it is stable. We define consistency as convergence on a dense subspace and stability as discrete well-posedness. In some applications convergence is harder to prove than consistency or stability since convergence requires knowledge of the solution. An equivalence theorem can be useful in such settings. We give concrete instances of equivalence theorems for polynomial interpolation, numerical differentiation, numerical integration using quadrature rules and Monte Carlo integration.

Affiliated with

Also associated with

No associations

Rating

Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation 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 Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equivalence Theorems in Numerical Analysis : Integration, Differentiation and Interpolation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-694142