Graduate
  1. Real Analysis  1.1. Set Theory and Logic  1.1.1. Sets and Operations  1.1.2. Relations and Functions  1.1.3. Logic and Quantifiers  1.1.4. Cardinality of Sets  1.2. Metric Spaces  1.2.1. Open and Closed Sets  1.2.2. Convergence of Sequences  1.2.3. Continuous Functions in Metric Spaces  1.2.4. Compactness and Completeness in Metric Spaces in Real Analysis  1.3. Sequence and Series  1.3.1. Convergence of Sequences  1.3.2. Infinite Series  1.3.3. Uniform Convergence  1.3.4. Power Series  1.4. Differentiation  1.4.1. Mean Value Theorems  1.4.2. Taylor Series  1.4.3. Functions of Several Variables  1.4.4. Partial Derivatives  1.5. Integration  1.5.1. Riemann and Lebesgue Integration  1.5.2. Improper Integrals  1.5.3. Measure Theory  1.5.4. Fubini’s Theorem  1.6. Functional Analysis  1.6.1. Banach Spaces  1.6.2. Hilbert Spaces  1.6.3. Operators on Spaces  1.6.4. Spectral Theory
  2. Abstract Algebra  2.1. Groups  2.1.1. Definitions and Examples in Groups in Abstract Algebra  2.1.2. Group Homomorphisms  2.1.3. Normal Subgroups  2.1.4. Sylow Theorems  2.2. Rings and Fields  2.2.1. Ideals and Factor Rings  2.2.2. Field Extensions  2.2.3. Galois Theory  2.2.4. Polynomial Rings  2.3. Modules  2.3.1. Module Homomorphisms  2.3.2. Free Modules  2.3.3. Tensor Products  2.3.4. Exact Sequences  2.4. Linear Algebra  2.4.1. Vector Spaces  2.4.2. Eigenvalues and Eigenvectors  2.4.3. Inner Product Spaces  2.4.4. Diagonalization
  3. Topology  3.1. General Topology  3.1.1. Open and Closed Sets  3.1.2. Compactness and Connectedness  3.1.3. Continuous Maps  3.1.4. Separation Axioms  3.2. Algebraic Topology  3.2.1. Fundamental Groups  3.2.2. Homotopy and Homology  3.2.3. Simplicial Complexes  3.2.4. Exact Sequences in Homology  3.3. Differential Topology  3.3.1. Manifolds  3.3.2. Smooth Functions  3.3.3. Tangent and Cotangent Spaces  3.3.4. Vector Bundles
  4. Differential Equations  4.1. Ordinary Differential Equations  4.1.1. First-Order Equations  4.1.2. Second-Order Linear Equations  4.1.3. Systems of Differential Equations  4.1.4. Stability Analysis  4.2. Partial Differential Equations  4.2.1. Classification of PDEs  4.2.2. Fourier Series  4.2.3. Green's Functions  4.2.4. Method of Characteristics  4.3. Dynamical Systems  4.3.1. Stability Theory  4.3.2. Limit Cycles  4.3.3. Chaos Theory  4.3.4. Bifurcation Theory
  5. Probability and Statistics  5.1. Probability Theory  5.1.1. Random Variables  5.1.2. Probability Distributions  5.1.3. Law of Large Numbers  5.1.4. Central Limit Theorem  5.2. Statistical Inference  5.2.1. Hypothesis Testing  5.2.2. Confidence Intervals  5.2.3. Bayesian Methods  5.2.4. Maximum Likelihood Estimation  5.3. Stochastic Processes  5.3.1. Markov Chains  5.3.2. Brownian Motion  5.3.3. Poisson Processes  5.3.4. Martingales
  6. Numerical Analysis  6.1. Numerical Solutions of Equations  6.1.1. Root Finding  6.1.2. Iterative Methods  6.1.3. Convergence Analysis  6.1.4. Error Bounds in Numerical Solutions of Equations  6.2. Numerical Linear Algebra  6.2.1. Matrix Factorizations  6.2.2. Eigenvalue Computations  6.2.3. Sparse Matrices  6.2.4. Preconditioning Techniques  6.3. Numerical Integration and Differentiation  6.3.1. Quadrature Methods  6.3.2. Finite Differences  6.3.3. Error Analysis in Numerical Integration and Differentiation  6.3.4. Adaptive Methods
  7. Complex Analysis  7.1. Complex Numbers  7.1.1. Polar Form  7.1.2. Complex Conjugates  7.1.3. Exponential Form  7.1.4. Roots of Unity  7.2. Analytic Functions  7.2.1. Cauchy-Riemann Equations  7.2.2. Power Series  7.2.3. Conformal Mappings  7.2.4. Harmonic Functions  7.3. Integration in the Complex Plane  7.3.1. Cauchy’s Theorem  7.3.2. Residue Theorem  7.3.3. Contour Integration  7.3.4. Integral Transforms
  8. Mathematical Logic and Foundations  8.1. Propositional Logic  8.1.1. Truth Tables  8.1.2. Logical Equivalences  8.1.3. Proof Techniques in Propositional Logic  8.1.4. Resolution  8.2. Predicate Logic  8.2.1. Quantifiers in Predicate Logic  8.2.2. Formal Systems in Predicate Logic  8.2.3. Completeness and Soundness  8.2.4. Model Theory  8.3. Set Theory  8.3.1. Cardinality and Ordinality  8.3.2. Axiomatic Systems  8.3.3. Zermelo-Fraenkel Set Theory  8.3.4. Forcing
  9. Optimization  9.1. Linear Programming  9.1.1. Simplex Method  9.1.2. Duality in Linear Programming  9.1.3. Sensitivity Analysis  9.1.4. Interior Point Methods  9.2. Nonlinear Programming  9.2.1. Gradient Descent  9.2.2. Lagrange Multipliers  9.2.3. Convex Optimization  9.2.4. Quadratic Programming  9.3. Combinatorial Optimization  9.3.1. Graph Algorithms  9.3.2. Integer Programming  9.3.3. Network Flows  9.3.4. Approximation Algorithms
  10. Discrete Mathematics  10.1. Graph Theory  10.1.1. Graph Representations  10.1.2. Planarity and Coloring  10.1.3. Shortest Path Algorithms  10.1.4. Network Flows  10.2. Combinatorics  10.2.1. Permutations and Combinations  10.2.2. Generating Functions  10.2.3. Recurrence Relations  10.2.4. Inclusion-Exclusion Principle  10.3. Cryptography  10.3.1. Number Theory Applications in Cryptography  10.3.2. Symmetric and Asymmetric Cryptography  10.3.3. RSA and Elliptic Curve Cryptography  10.3.4. Post-Quantum Cryptography

Graduate → Numerical Analysis → Numerical Integration and Differentiation ↓


Error Analysis in Numerical Integration and Differentiation


Numerical analysis is a branch of mathematics that deals with algorithms and numerical approximations for solving mathematical problems. When it comes to integration and differentiation, exact calculations are often impossible or impractical, and for this reason, we use numerical methods. However, these methods come with an inherent challenge: error analysis. First, we must ask, what is error analysis? Simply put, error analysis evaluates the accuracy and limitations of numerical solutions.

This discussion will introduce you to the essential elements of error analysis in numerical integration and differentiation, and show how it can affect the reliability of scientific and engineering calculations.

Introduction to numerical error

Numerical errors can arise from a variety of sources, including:

  • Truncation error: resulting from approximations of exact mathematical procedures.
  • Rounding error: This error arises due to the limited number of digits through which computers represent real numbers.

Often, the emphasis is on truncation error in numerical integration and differentiation because round-off errors are specific to hardware or software limitations.

Numerical integration

Understanding truncation error

Consider the task of evaluating an integral numerically. In many cases, we use approximations such as the trapezoidal rule or Simpson's rule. Each of these rules has an associated truncation error.

Trapezoidal rule

The trapezoidal rule approximates the integral of a function using the formula:

[ int_{a}^{b} f(x) , dx approx frac{b-a}{2} left( f(a) + f(b) right) ]

The error of this approximation can be expressed as:

[ E_{T} = -frac{(b-a)^3}{12} f''(xi) ]

where ( f''(xi) ) is the second derivative of ( f ) evaluated at some point ( xi ) in the interval ([a, b]).

Visual example: trapezoidal rule

AXB

The area under the curve is approximated by the trapezoid (in grey). The true integral is the area under the curve in blue, which illustrates the concept of truncation error.

Simpson's rule

Simpson's rule provides a more accurate estimate using parabolic segments:

[ int_{a}^{b} f(x) , dx approx frac{b-a}{6} left( f(a) + 4fleft(frac{a+b}{2}right) + f(b) right) ]

The truncation error is given as:

[ E_{S} = -frac{(b-a)^5}{2880} f^{(4)}(xi) ]

Example calculation

Suppose you want to numerically integrate the function ( f(x) = sin(x) ) from ( x = 0 ) to ( x = pi ) using both methods.

Use of trapezoidal rule:

[ int_{0}^{pi} sin(x) , dx approx frac{pi - 0}{2} left(sin(0) + sin(pi)right) = frac{pi}{2} (0 + 0) = 0 ] [ E_{T} approx -frac{pi^3}{12} (-sin(xi)) approx 0 ]

Use of Simpson's rule:

[ int_{0}^{pi} sin(x) , dx approx frac{pi}{6} left(0 + 4 sinleft(frac{pi}{2}right) + 0right) = frac{pi}{6} times 4 = frac{2pi}{3} ] [ E_{S} approx -frac{pi^5}{2880} cos(xi) approx 0 ]

The actual integral is 2. The approximation using Simpson's rule is close to the exact value, and has small truncation error.

Numerical differentiation

Types of differentiation

In numerical differentiation, the objective is to calculate the derivative using discrete data points rather than a continuous function. Common methods include forward difference, backward difference, and central difference.

Forward difference

This technique uses the following approximation formula for the first derivative:

[ f'(x) approx frac{f(x + h) - f(x)}{h} ]

The truncation error can be represented as:

[ E_{F} approx -frac{h}{2} f''(xi) ]

Visual example: forward difference

XX + H

The green line shows the slope (i.e., the derivative at the point (x)). Forward differencing estimates the slope based on a future point (x + h).

Central difference

A more accurate method is the central difference, which uses the points on both sides:

[ f'(x) approx frac{f(x + h) - f(x - h)}{2h} ]

The truncation error is given as:

[ E_{C} approx -frac{h^2}{6} f^{(3)}(xi) ]

Example calculation

Let us evaluate the derivative of ( f(x) = x^2 ) at ( x = 1 ) with ( h = 0.1 ).

Using forward difference:

[ f'(1) approx frac{f(1.1) - f(1)}{0.1} = frac{1.21 - 1}{0.1} = 2.1 ] [ E_{F} approx -frac{0.1}{2} times 2 = -0.1 ]

Use of central difference:

[ f'(1) approx frac{f(1.1) - f(0.9)}{0.2} = frac{1.21 - 0.81}{0.2} = 2 ] [ E_{C} approx -frac{(0.1)^2}{6} times 0 = 0 ]

The exact derivative is ( f'(x) = 2x ), so at ( x = 1 ) is 2. Central difference provided an exact result, while forward difference had a small error due to the reduction.

Conclusion

Error analysis is an important component of numerical integration and differentiation. It provides valuable information about the limitations and possible improvements of numerical methods. Understanding the sources and types of errors allows mathematicians and engineers to optimize algorithms and choose the right methods for specific applications. By reducing error, we can increase the accuracy of numerical calculations important for scientific research and technological innovation.


Graduate → 6.3.3


U
username
0%
completed in Graduate

← Prev (6.3.2)
Finite Differences
Next (6.3.4) →
Adaptive Methods

Comments 



Error Analysis in Numerical Integration and Differentiation

https://www.buddymath.com/g/6.3.3?bmal=en