Numerical Techniques Exam Questions
Uploaded by
Prathamesh HendreNumerical Techniques Exam Questions
Uploaded by
Prathamesh HendreCommon questions
Powered by AIEuler's modified method provides a more accurate solution than basic Euler's method by incorporating an additional prediction step. After computing the initial slope as in the basic method, it recalibrates using this prediction to refine the estimate. For dy/dx = -y with y(0)=1, and step size h=0.1, it involves two steps: predicting y(0.1') = y(0) + h(-y(0)) and correcting y(0.1) = y(0) + (h/2)(-y(0) - y(0.1')), minimizing the local truncation error inherent in the simple Euler's scheme.
Newton's Divided Difference formula is a tool for constructing an interpolating polynomial given a set of data points. It incrementally builds the polynomial based on the idea of successive differences. For a function f at points x_0, x_1, ..., x_n, the divided differences [f(x_0), f(x_1), ...] are recursively calculated and used in the polynomial expression P_n(x) = f(x_0) + (x-x_0)[f(x_0, x_1)] + ... . This method efficiently evaluates function values for unrecorded points leveraging inherent recursive relationships.
The trapezoidal rule is a numerical method used to approximate definite integrals by dividing the area under a curve into trapezoids. It improves accuracy over basic rectangle methods by considering the average of function values at interval endpoints. When applied to evaluate the integral of f(x) from x = 0 to x = 6 using given data for f(x) at each integer, it calculates the integral as approximated rectangle areas: (1/2)(b-a)(f(a)+f(b)), for each interval from (0 to 1), (1 to 2), etc., summing the areas produces the approximation.
Euler's method approximates the solution of a differential equation by using a stepwise process, where the slope at a point is used to estimate the position at the next step. For the differential equation dy/dx = -y with y(0) = 1, applying Euler's method with a step size h = 0.1 gives an approximation for y(0.1). The process involves computing y(0.1) = y(0) + h*f(x_0, y_0) = 1 + 0.1*(-1) = 0.9 according to the calculation process.
Newton's Forward Interpolation Formula is used to estimate the value of a function at a given point using known data points by constructing a polynomial. The formula is particularly useful when data points are equidistant. When applying it to estimate the population in 1895, given census data from 1891 and succeeding decades, the formula constructs a polynomial from known yearly populations and uses it to estimate the population at a non-tabulated year, utilizing forward differences recursively.
Runge-Kutta methods are iterative techniques used to solve ordinary differential equations, particularly initial value problems. They provide higher accuracy through computation of intermediate slopes to refine estimates within a single step. These methods, especially the fourth-order Runge-Kutta, offer significant accuracy improvements over Euler's method by granting a more robust approximation using multiple function evaluations per step, albeit with increased computational demand. Compared to Euler's method, which uses a single slope evaluation, Runge-Kutta's multi-step process ensures better accuracy and stability in stiff problems.
Approximating 625.483 to three significant figures gives 625. The percentage error is calculated as the absolute difference between the actual and approximated values divided by the actual value, then multiplied by 100. This results in an approximate percentage error of ((625.483 - 625)/625.483)*100 = 0.077% error, reflecting the inaccuracy introduced by the rounding process.
The method of false position, or regula falsi, combines aspects of bisection and secant methods to find roots. It uses a linear interpolant between current interval endpoints, iteratively updating the interval where the sign change occurs. For a polynomial f(x), the process calculates x-intercept of the line connecting f(a) and f(b), updating a or b depending on whether f(x_intercept) changes the sign. While generally convergent, it may become inefficient; hence, adjustments like modifying endpoints more aggressively or hybrid methods can improve efficiency for consistent progress.
Lagrange's interpolation is used to find a polynomial that passes through a given set of data points. It constructs the polynomial as a linear combination of basis polynomials. Each basis polynomial is zero at all given data points except one. For a cubic polynomial with data points (x_i, f(x_i)), the polynomial is P(x) = Σ(y_i * L_i(x)), where L_i(x) = π(x-x_j)/(x_i-x_j), j ≠ i, ensuring the polynomial fits exactly through each point. This method is useful for smoothly approximating functions represented by discrete points.
Simpson's 1/3 rule is derived by approximating the integrand by a quadratic polynomial and then integrating. It improves the precision of the approximation of an integral by considering parabolic segments instead of rectangles or trapezoids. The rule is given by (b-a)/6 [f(a) + 4f((a+b)/2) + f(b)] for each subinterval of equal length. The method is more accurate, especially with smooth integrands, as it minimizes the error over each segment by using additional function evaluations at midpoints.