Study guide

1.5 Numerical Methods, Root-Finding, and Numerical Integration

FE Other Disciplines Fundamentals of Engineering

Track your progress as you read

Finished sections get a check mark.

1 Introduction & Exam Strategy

About the FE Other Disciplines Exam How to Use This Study Guide

2 Chapter 1: Mathematics

1.1 Analytic Geometry, Trigonometry, and Vector Operations 1.2 Differential and Integral Calculus 1.3 Ordinary Differential Equations and Laplace Transforms 1.4 Linear Algebra, Matrices, and Systems of Equations 1.5 Numerical Methods, Root-Finding, and Numerical Integration

3 Chapter 2: Probability and Statistics

2.1 Probability Distributions, PMFs, and PDFs 2.2 Expected Value, Mean, Variance, and Descriptive Statistics 2.3 Estimation, Confidence Intervals, and Sample Sizes 2.4 Hypothesis Testing, Goodness of Fit, and Linear Regression

4 Chapter 3: Chemistry

3.1 Stoichiometry, Chemical Reactions, and Solutions 3.2 Chemical Equilibrium, Acids/Bases, and Ideal Gas Laws 3.3 Oxidation-Reduction, Electrochemistry, and Corrosion Basics

5 Chapter 4: Instrumentation and Controls

4.1 Sensors, Transducers, and Signal Conditioning 4.2 Data Sampling, Accuracy/Precision, and A/D Conversion 4.3 Logic Diagrams, Boolean Algebra, and Control Logic

6 Chapter 5: Engineering Ethics and Societal Impacts

5.1 NCEES Model Rules of Professional Conduct and Codes of Ethics 5.2 Public Protection, Licensure Boards, and Professional Liability 5.3 Societal Impacts: Sustainability, Life-Cycle Analysis, and Public Safety

7 Chapter 6: Safety, Health, and Environment

6.1 OSHA Regulations, Industrial Hygiene, and PPE 6.2 Hazard Assessment, Risk Management, and Environmental Rules 6.3 Gas Detection and Monitoring 6.4 Electrical Safety 6.5 Confined Space Entry and Ventilation Rates

8 Chapter 7: Engineering Economics

7.1 Time Value of Money, Interest Formulas, and Cash Flow Diagrams 7.2 Capital Budgeting: Present Worth, Annual Worth, IRR, and B/C Ratio 7.3 Depreciation Methods, Income Taxes, and Breakeven Analysis 7.4 Cost Analysis, Uncertainty, Expected Value, and Decision Trees

9 Chapter 8: Statics

8.1 Statics Equilibrium, Free-Body Diagrams, and Force Systems 8.2 Distributed Loads, Resultants, and Equivalent Force-Couple Systems 8.3 Internal Forces in Rigid Bodies: Trusses, Frames, Machines, and Friction 8.4 Three-Dimensional Equilibrium, Cables, and Pulley Systems 8.5 Area Properties: Centroids, Moments of Inertia, and Radius of Gyration 8.6 Weight, Mass, and Force Units: slug, lbm, lbf, and g_c

10 Chapter 9: Dynamics

9.1 Kinematics of Particles and Rigid Bodies 9.2 Newton's Second Law for Particles and Rigid Bodies 9.3 Angular Motion, Torque, and Mass Moment of Inertia 9.4 Work-Energy Principle, Power, and Efficiency 9.5 Impulse-Momentum, Impact, and Coefficient of Restitution 9.6 Dynamic Friction and Vibrations: Natural Frequency and Damping

11 Chapter 10: Strength of Materials

10.1 Stress Types, Axial Stress-Strain, and Thermal Deformation 10.2 Torsion of Circular Shafts, Polar Moment, and Angle of Twist 10.3 Shear and Moment Diagrams 10.4 Flexural Bending Stress and Transverse Shear Stress 10.5 Stress Transformations, Principal Stresses, and Mohr's Circle 10.6 Beam Deflections and Combined Axial/Bending Loading 10.7 Column Buckling (Euler Formula) and Yield/Failure Criteria

12 Chapter 11: Materials

11.1 Crystal Structure, Phase Diagrams, and Material Processing 11.2 Mechanical Properties, Fatigue, Fracture, and Corrosion 11.3 Thermal Properties of Materials 11.4 Electrical and Chemical Properties of Materials 11.5 Material Selection for Engineering Design

13 Chapter 12: Fluid Mechanics

12.1 Fluid Properties, Hydrostatic Pressure, and Manometry 12.2 Dimensionless Numbers and Flow Regimes 12.3 Continuity Equation, Bernoulli Equation, and Energy Equation 12.4 Impulse-Momentum Equation and Forces on Control Volumes 12.5 Flow in Pipes, Friction Factors (Moody Diagram), and Head Losses 12.6 Turbomachinery: Pumps, Turbines, Fans, and Compressors 12.7 Open-Channel Flow, Manning's Equation, and Drag 12.8 Fluid Transport Systems and Flow Measurement 12.9 Ideal Gas Law, Gas Mixtures, and the Real Gas Law

14 Chapter 13: Basic Electrical Engineering

13.1 Electrical Fundamentals, Ohm's Law, and DC Circuits 13.2 AC Circuits, Phasors, Impedance, and Three-Phase Power 13.3 Magnetic Fields, Induction, Transformers, and Motor Efficiency 13.4 Electrical Measuring Devices: Voltmeter, Ammeter, and Wattmeter

15 Chapter 14: Thermodynamics and Heat Transfer

14.1 First & Second Laws of Thermodynamics and Pure Substance Properties 14.2 Thermodynamic Processes and Property Diagrams (T-s, P-h, P-v) 14.3 Heat Transfer: Conduction, Convection, and Radiation 14.4 Ideal Gas Processes and Power/Refrigeration Cycles 14.5 Mass and Energy Balances on Control Volumes 14.6 Combustion and Combustion Products 14.7 Psychrometrics: Relative Humidity, Wet-Bulb Temperature, and the Psychrometric Chart

1.5 Numerical Methods, Root-Finding, and Numerical Integration

Key Takeaways Explain This Topic AI

The Bisection method is a guaranteed bracketing algorithm that halves the interval size each iteration, requiring f ( a ) f ( b ) < 0 f(a)f(b) < 0 f ( a ) f ( b ) < 0 .

Newton-Raphson method achieves rapid quadratic convergence using x n + 1 = x n − f ( x n ) f ′ ( x n ) x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} x n + 1 ​ = x n ​ − f ′ ( x n ​ ) f ( x n ​ ) ​ , but fails if f ′ ( x n ) = 0 f'(x_n) = 0 f ′ ( x n ​ ) = 0 or near inflection points.

Trapezoidal Rule approximates definite integrals using linear interpolations with global truncation error proportional to step size squared O ( h 2 ) O(h^2) O ( h 2 ) .

Simpson's 1/3 Rule uses parabolic interpolations over an even number of subintervals n n n , achieving higher accuracy with error O ( h 4 ) O(h^4) O ( h 4 ) .

Euler's method provides a simple first-order numerical solution for ODE initial value problems y n + 1 = y n + h f ( x n , y n ) y_{n+1} = y_n + h f(x_n, y_n) y n + 1 ​ = y n ​ + h f ( x n ​ , y n ​ ) with cumulative global error O ( h ) O(h) O ( h ) .

Last updated: August 2026

1.5 Numerical Methods, Root-Finding, and Numerical Integration

Engineering systems frequently involve non-linear equations, complicated experimental datasets, or differential equations lacking analytical closed-form solutions. Numerical methods provide approximate algorithms to solve such mathematical models within specified tolerances.

1. Numerical Root-Finding Algorithms

Root-finding algorithms locate values of x x x for which f ( x ) = 0 f(x) = 0 f ( x ) = 0 .

Bisection Method (Bracketing Method)

Requires an initial interval [ a 0 , b 0 ] [a_0, b_0] [ a 0 ​ , b 0 ​ ] where f ( a 0 ) f(a_0) f ( a 0 ​ ) and f ( b 0 ) f(b_0) f ( b 0 ​ ) have opposite signs ( f ( a 0 ) ⋅ f ( b 0 ) < 0 f(a_0) \cdot f(b_0) < 0 f ( a 0 ​ ) ⋅ f ( b 0 ​ ) < 0 ). By the Intermediate Value Theorem, a root exists in [ a 0 , b 0 ] [a_0, b_0] [ a 0 ​ , b 0 ​ ] .

Midpoint calculation: c k = a k + b k 2 c_k = \frac{a_k + b_k}{2} c k ​ = 2 a k ​ + b k ​ ​ .

Evaluate f ( c k ) f(c_k) f ( c k ​ ) :

If f ( a k ) ⋅ f ( c k ) < 0 f(a_k) \cdot f(c_k) < 0 f ( a k ​ ) ⋅ f ( c k ​ ) < 0 , the root lies in [ a k , c k ] ⟹ b k + 1 = c k , a k + 1 = a k [a_k, c_k] \implies b_{k+1} = c_k, a_{k+1} = a_k [ a k ​ , c k ​ ] ⟹ b k + 1 ​ = c k ​ , a k + 1 ​ = a k ​ .

If f ( c k ) ⋅ f ( b k ) < 0 f(c_k) \cdot f(b_k) < 0 f ( c k ​ ) ⋅ f ( b k ​ ) < 0 , the root lies in [ c k , b k ] ⟹ a k + 1 = c k , b k + 1 = b k [c_k, b_k] \implies a_{k+1} = c_k, b_{k+1} = b_k [ c k ​ , b k ​ ] ⟹ a k + 1 ​ = c k ​ , b k + 1 ​ = b k ​ .

Maximum absolute error bound after n n n iterations: E n ≤ b 0 − a 0 2 n E_n \le \frac{b_0 - a_0}{2^n} E n ​ ≤ 2 n b 0 ​ − a 0 ​ ​

Newton-Raphson Method (Open Method)

Uses the tangent line at current guess x n x_n x n ​ to find the next approximation x n + 1 x_{n+1} x n + 1 ​ : x n + 1 = x n − f ( x n ) f ′ ( x n ) x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} x n + 1 ​ = x n ​ − f ′ ( x n ​ ) f ( x n ​ ) ​

Convergence & Limitations

Convergence Rate: Quadratic convergence ( E n + 1 ∝ E n 2 E_{n+1} \propto E_n^2 E n + 1 ​ ∝ E n 2 ​ ) near simple roots.

Failure Modes: Fails if f ′ ( x n ) = 0 f'(x_n) = 0 f ′ ( x n ​ ) = 0 (horizontal tangent), oscillates near local extrema, or diverges if initial guess x 0 x_0 x 0 ​ is too far from the root.

Secant Method

Replaces derivative f ′ ( x n ) f'(x_n) f ′ ( x n ​ ) in Newton-Raphson with a backward finite difference approximation using two points x n x_n x n ​ and x n − 1 x_{n-1} x n − 1 ​ : x n + 1 = x n − f ( x n ) x n − x n − 1 f ( x n ) − f ( x n − 1 ) x_{n+1} = x_n - f(x_n) \frac{x_n - x_{n-1}}{f(x_n) - f(x_{n-1})} x n + 1 ​ = x n ​ − f ( x n ​ ) f ( x n ​ ) − f ( x n − 1 ​ ) x n ​ − x n − 1 ​ ​

2. Numerical Integration (Quadrature)

Numerical integration estimates definite integrals I = ∫ a b f ( x ) d x I = \int_a^b f(x) dx I = ∫ a b ​ f ( x ) d x over n n n subintervals of equal width h = b − a n h = \frac{b - a}{n} h = n b − a ​ with grid points x i = a + i h x_i = a + i h x i ​ = a + ih .

Trapezoidal Rule

Approximates f ( x ) f(x) f ( x ) as linear segments between grid points: I t r a p = h 2 [ f ( x 0 ) + 2 f ( x 1 ) + 2 f ( x 2 ) + ⋯ + 2 f ( x n − 1 ) + f ( x n ) ] I_{trap} = \frac{h}{2} \left[ f(x_0) + 2 f(x_1) + 2 f(x_2) + \cdots + 2 f(x_{n-1}) + f(x_n) \right] I t r a p ​ = 2 h ​ [ f ( x 0 ​ ) + 2 f ( x 1 ​ ) + 2 f ( x 2 ​ ) + ⋯ + 2 f ( x n − 1 ​ ) + f ( x n ​ ) ] I t r a p = h 2 [ f ( x 0 ) + 2 ∑ i = 1 n − 1 f ( x i ) + f ( x n ) ] I_{trap} = \frac{h}{2} \left[ f(x_0) + 2 \sum_{i=1}^{n-1} f(x_i) + f(x_n) \right] I t r a p ​ = 2 h ​ [ f ( x 0 ​ ) + 2 i = 1 ∑ n − 1 ​ f ( x i ​ ) + f ( x n ​ ) ]

Global Truncation Error: E T = − ( b − a ) h 2 12 f ′ ′ ( ξ ) E_T = -\frac{(b - a) h^2}{12} f''(\xi) E T ​ = − 12 ( b − a ) h 2 ​ f ′′ ( ξ ) , where a ≤ ξ ≤ b a \le \xi \le b a ≤ ξ ≤ b . Error is O ( h 2 ) O(h^2) O ( h 2 ) .

Simpson's 1/3 Rule

Approximates f ( x ) f(x) f ( x ) using parabolic arcs across pairs of subintervals. Strict Requirement: The number of subintervals n n n must be an even integer . I s i m p = h 3 [ f ( x 0 ) + 4 f ( x 1 ) + 2 f ( x 2 ) + 4 f ( x 3 ) + 2 f ( x 4 ) + ⋯ + 4 f ( x n − 1 ) + f ( x n ) ] I_{simp} = \frac{h}{3} \left[ f(x_0) + 4 f(x_1) + 2 f(x_2) + 4 f(x_3) + 2 f(x_4) + \cdots + 4 f(x_{n-1}) + f(x_n) \right] I s im p ​ = 3 h ​ [ f ( x 0 ​ ) + 4 f ( x 1 ​ ) + 2 f ( x 2 ​ ) + 4 f ( x 3 ​ ) + 2 f ( x 4 ​ ) + ⋯ + 4 f ( x n − 1 ​ ) + f ( x n ​ ) ] I s i m p = h 3 [ f ( x 0 ) + 4 ∑ i odd f ( x i ) + 2 ∑ i even f ( x i ) + f ( x n ) ] I_{simp} = \frac{h}{3} \left[ f(x_0) + 4 \sum_{i \text{ odd}} f(x_i) + 2 \sum_{i \text{ even}} f(x_i) + f(x_n) \right] I s im p ​ = 3 h ​ [ f ( x 0 ​ ) + 4 i odd ∑ ​ f ( x i ​ ) + 2 i even ∑ ​ f ( x i ​ ) + f ( x n ​ ) ]

Global Truncation Error: E S = − ( b − a ) h 4 180 f ( 4 ) ( ξ ) E_S = -\frac{(b - a) h^4}{180} f^{(4)}(\xi) E S ​ = − 180 ( b − a ) h 4 ​ f ( 4 ) ( ξ ) . Error is O ( h 4 ) O(h^4) O ( h 4 ) .

Exact for polynomials up to degree 3!

3. Numerical Solution of Initial Value ODEs

For first-order initial value problem d y d x = f ( x , y ) \frac{dy}{dx} = f(x,y) d x d y ​ = f ( x , y ) with y ( x 0 ) = y 0 y(x_0) = y_0 y ( x 0 ​ ) = y 0 ​ and step size h h h :

Euler's Method (Explicit First-Order) y n + 1 = y n + h ⋅ f ( x n , y n ) y_{n+1} = y_n + h \cdot f(x_n, y_n) y n + 1 ​ = y n ​ + h ⋅ f ( x n ​ , y n ​ )

Local Error: O ( h 2 ) O(h^2) O ( h 2 ) , Global Error: O ( h ) O(h) O ( h ) (First-order accurate).

Improved Euler Method (Heun's Method - Predictor-Corrector)

Predictor: y n + 1 ∗ = y n + h ⋅ f ( x n , y n ) y_{n+1}^* = y_n + h \cdot f(x_n, y_n) y n + 1 ∗ ​ = y n ​ + h ⋅ f ( x n ​ , y n ​ )

Corrector: y n + 1 = y n + h 2 [ f ( x n , y n ) + f ( x n + 1 , y n + 1 ∗ ) ] y_{n+1} = y_n + \frac{h}{2} \left[ f(x_n, y_n) + f(x_{n+1}, y_{n+1}^*) \right] y n + 1 ​ = y n ​ + 2 h ​ [ f ( x n ​ , y n ​ ) + f ( x n + 1 ​ , y n + 1 ∗ ​ ) ]

Global Error: O ( h 2 ) O(h^2) O ( h 2 ) (Second-order accurate).

4. Linear Interpolation Formula

For a tabular dataset where y 1 = f ( x 1 ) y_1 = f(x_1) y 1 ​ = f ( x 1 ​ ) and y 2 = f ( x 2 ) y_2 = f(x_2) y 2 ​ = f ( x 2 ​ ) , the interpolated value y y y at x x x ( x 1 ≤ x ≤ x 2 x_1 \le x \le x_2 x 1 ​ ≤ x ≤ x 2 ​ ) is: y = y 1 + ( y 2 − y 1 x 2 − x 1 ) ( x − x 1 ) y = y_1 + \left( \frac{y_2 - y_1}{x_2 - x_1} \right) (x - x_1) y = y 1 ​ + ( x 2 ​ − x 1 ​ y 2 ​ − y 1 ​ ​ ) ( x − x 1 ​ )

  • 5. Worked Engineering Problems
  • Worked Example 1: Newton-Raphson Iteration

Problem: Solve f ( x ) = x 3 − 2 x − 5 = 0 f(x) = x^3 - 2x - 5 = 0 f ( x ) = x 3 − 2 x − 5 = 0 using two iterations of Newton-Raphson starting with x 0 = 2.0 x_0 = 2.0 x 0 ​ = 2.0 .

Solution:

Step 1: Compute derivative f ′ ( x ) f'(x) f ′ ( x ) . f ′ ( x ) = 3 x 2 − 2 f'(x) = 3x^2 - 2 f ′ ( x ) = 3 x 2 − 2

Step 2: First Iteration ( n = 0 n=0 n = 0 ). f ( x 0 ) = f ( 2.0 ) = 2 3 − 2 ( 2 ) − 5 = 8 − 4 − 5 = − 1.0 f(x_0) = f(2.0) = 2^3 - 2(2) - 5 = 8 - 4 - 5 = -1.0 f ( x 0 ​ ) = f ( 2.0 ) = 2 3 − 2 ( 2 ) − 5 = 8 − 4 − 5 = − 1.0 f ′ ( x 0 ) = f ′ ( 2.0 ) = 3 ( 2.0 ) 2 − 2 = 12 − 2 = 10.0 f'(x_0) = f'(2.0) = 3(2.0)^2 - 2 = 12 - 2 = 10.0 f ′ ( x 0 ​ ) = f ′ ( 2.0 ) = 3 ( 2.0 ) 2 − 2 = 12 − 2 = 10.0 x 1 = x 0 − f ( x 0 ) f ′ ( x 0 ) = 2.0 − − 1.0 10.0 = 2.0 + 0.1 = 2.10 x_1 = x_0 - \frac{f(x_0)}{f'(x_0)} = 2.0 - \frac{-1.0}{10.0} = 2.0 + 0.1 = 2.10 x 1 ​ = x 0 ​ − f ′ ( x 0 ​ ) f ( x 0 ​ ) ​ = 2.0 − 10.0 − 1.0 ​ = 2.0 + 0.1 = 2.10

Step 3: Second Iteration ( n = 1 n=1 n = 1 ). f ( x 1 ) = f ( 2.10 ) = ( 2.10 ) 3 − 2 ( 2.10 ) − 5 = 9.261 − 4.20 − 5 = 0.061 f(x_1) = f(2.10) = (2.10)^3 - 2(2.10) - 5 = 9.261 - 4.20 - 5 = 0.061 f ( x 1 ​ ) = f ( 2.10 ) = ( 2.10 ) 3 − 2 ( 2.10 ) − 5 = 9.261 − 4.20 − 5 = 0.061 f ′ ( x 1 ) = f ′ ( 2.10 ) = 3 ( 2.10 ) 2 − 2 = 3 ( 4.41 ) − 2 = 13.23 − 2 = 11.23 f'(x_1) = f'(2.10) = 3(2.10)^2 - 2 = 3(4.41) - 2 = 13.23 - 2 = 11.23 f ′ ( x 1 ​ ) = f ′ ( 2.10 ) = 3 ( 2.10 ) 2 − 2 = 3 ( 4.41 ) − 2 = 13.23 − 2 = 11.23 x 2 = 2.10 − 0.061 11.23 = 2.10 − 0.00543 = 2.09457 x_2 = 2.10 - \frac{0.061}{11.23} = 2.10 - 0.00543 = 2.09457 x 2 ​ = 2.10 − 11.23 0.061 ​ = 2.10 − 0.00543 = 2.09457

Worked Example 2: Numerical Integration Comparison

Problem: Estimate I = ∫ 0 4 ( x 3 + 2 ) d x I = \int_0^4 (x^3 + 2) dx I = ∫ 0 4 ​ ( x 3 + 2 ) d x using (a) Trapezoidal Rule with n = 4 n=4 n = 4 subintervals ( h = 1 h=1 h = 1 ) and (b) Simpson's 1/3 Rule with n = 4 n=4 n = 4 ( h = 1 h=1 h = 1 ). Compare both against the exact analytical solution.

Solution:

Grid points & Function evaluations ( h = 1 h = 1 h = 1 ):

  • x 0 = 0 ⟹ f ( 0 ) = 0 3 + 2 = 2 x_0 = 0 \implies f(0) = 0^3 + 2 = 2 x 0 ​ = 0 ⟹ f ( 0 ) = 0 3 + 2 = 2
  • x 1 = 1 ⟹ f ( 1 ) = 1 3 + 2 = 3 x_1 = 1 \implies f(1) = 1^3 + 2 = 3 x 1 ​ = 1 ⟹ f ( 1 ) = 1 3 + 2 = 3
  • x 2 = 2 ⟹ f ( 2 ) = 2 3 + 2 = 10 x_2 = 2 \implies f(2) = 2^3 + 2 = 10 x 2 ​ = 2 ⟹ f ( 2 ) = 2 3 + 2 = 10
  • x 3 = 3 ⟹ f ( 3 ) = 3 3 + 2 = 29 x_3 = 3 \implies f(3) = 3^3 + 2 = 29 x 3 ​ = 3 ⟹ f ( 3 ) = 3 3 + 2 = 29
  • x 4 = 4 ⟹ f ( 4 ) = 4 3 + 2 = 66 x_4 = 4 \implies f(4) = 4^3 + 2 = 66 x 4 ​ = 4 ⟹ f ( 4 ) = 4 3 + 2 = 66

(a) Trapezoidal Rule: I t r a p = 1 2 [ f ( 0 ) + 2 ( f ( 1 ) + f ( 2 ) + f ( 3 ) ) + f ( 4 ) ] I_{trap} = \frac{1}{2} \left[ f(0) + 2(f(1) + f(2) + f(3)) + f(4) \right] I t r a p ​ = 2 1 ​ [ f ( 0 ) + 2 ( f ( 1 ) + f ( 2 ) + f ( 3 )) + f ( 4 ) ] I t r a p = 1 2 [ 2 + 2 ( 3 + 10 + 29 ) + 66 ] = 1 2 [ 2 + 2 ( 42 ) + 66 ] = 1 2 [ 2 + 84 + 66 ] = 152 2 = 76.0 I_{trap} = \frac{1}{2} \left[ 2 + 2(3 + 10 + 29) + 66 \right] = \frac{1}{2} \left[ 2 + 2(42) + 66 \right] = \frac{1}{2} [2 + 84 + 66] = \frac{152}{2} = 76.0 I t r a p ​ = 2 1 ​ [ 2 + 2 ( 3 + 10 + 29 ) + 66 ] = 2 1 ​ [ 2 + 2 ( 42 ) + 66 ] = 2 1 ​ [ 2 + 84 + 66 ] = 2 152 ​ = 76.0

(b) Simpson's 1/3 Rule: I s i m p = 1 3 [ f ( 0 ) + 4 ( f ( 1 ) + f ( 3 ) ) + 2 ( f ( 2 ) ) + f ( 4 ) ] I_{simp} = \frac{1}{3} \left[ f(0) + 4(f(1) + f(3)) + 2(f(2)) + f(4) \right] I s im p ​ = 3 1 ​ [ f ( 0 ) + 4 ( f ( 1 ) + f ( 3 )) + 2 ( f ( 2 )) + f ( 4 ) ] I s i m p = 1 3 [ 2 + 4 ( 3 + 29 ) + 2 ( 10 ) + 66 ] = 1 3 [ 2 + 4 ( 32 ) + 20 + 66 ] = 1 3 [ 2 + 128 + 20 + 66 ] = 216 3 = 72.0 I_{simp} = \frac{1}{3} \left[ 2 + 4(3 + 29) + 2(10) + 66 \right] = \frac{1}{3} \left[ 2 + 4(32) + 20 + 66 \right] = \frac{1}{3} [2 + 128 + 20 + 66] = \frac{216}{3} = 72.0 I s im p ​ = 3 1 ​ [ 2 + 4 ( 3 + 29 ) + 2 ( 10 ) + 66 ] = 3 1 ​ [ 2 + 4 ( 32 ) + 20 + 66 ] = 3 1 ​ [ 2 + 128 + 20 + 66 ] = 3 216 ​ = 72.0

(c) Exact Analytical Integral: I e x a c t = [ x 4 4 + 2 x ] 0 4 = ( 256 4 + 8 ) − 0 = 64 + 8 = 72.0 I_{exact} = \left[ \frac{x^4}{4} + 2x \right]_0^4 = \left(\frac{256}{4} + 8\right) - 0 = 64 + 8 = 72.0 I e x a c t ​ = [ 4 x 4 ​ + 2 x ] 0 4 ​ = ( 4 256 ​ + 8 ) − 0 = 64 + 8 = 72.0

Notice: Simpson's 1/3 Rule yields the exact value (72.0) because its truncation error is zero for cubic polynomials!

Loading diagram... Numerical Method Selection & Convergence Comparison