Scribd
Upload
5 views3 pages

MSS 224 Group Assignment

The document compares direct and iterative techniques, highlighting that direct techniques yield exact solutions in finite steps while iterative techniques rely on successive approximations. It also contrasts numerical and analytical methods, noting that numerical methods provide approximate solutions and are preferable for complex problems, whereas analytical methods yield exact solutions but can be time-consuming. Additionally, desirable properties of numerical methods include accuracy, stability, convergence, efficiency, and robustness.

Uploaded by

patrickmafuru12
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views3 pages

MSS 224 Group Assignment

The document compares direct and iterative techniques, highlighting that direct techniques yield exact solutions in finite steps while iterative techniques rely on successive approximations. It also contrasts numerical and analytical methods, noting that numerical methods provide approximate solutions and are preferable for complex problems, whereas analytical methods yield exact solutions but can be time-consuming. Additionally, desirable properties of numerical methods include accuracy, stability, convergence, efficiency, and robustness.

Uploaded by

patrickmafuru12
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

QUESTIONS

1. Compare the following(Give at least five points):

i) Direct versus iterative techniques

ii) Numerical versus analytical methods

2. Describe desirable properties of numerical methods

1. (i) (a) Direct technique this is technique that give the exact values of all the roots in a finite number of
steps. Example solving quadratic equation, synthetic division. WHILE Iteration technique this is method
based on the idea of successive approximations. Example Bisection, Newton-Raphson Method.

(b)Direct technique require no knowledge of initial approximation of a root of equation f(x)=0 WHILE
Iteration technique require knowledge of initial approximation of a root of equation f(x)

(c) Direct technique can be high for large problems WHILE Iteration technique can be lower for large
problems but may require more iteration.

(d) Direct technique Used when exact solutions are needed WHILE Iteration technique used when
exact methods are impractical or costly

(e) Direct technique usually require more memory but fewer computations WHILE Iteration technique
require less memory but more computations.

(ii) (I) Numerical methods use exact algorithms to present numerical solutions to mathematical
problems. WHILE

Analytic methods use exact theorems to present formulas that can be used to present numerical
solutions to mathematical problems with or without the use of numerical methods.

(II) Analytical method gives exact solutions, more time consuming and sometimes impossible.
WHEREAS Numerical method give approximate solution with allowable tolerance, less time and possible
for most cases

(III)Analytical Method When a problem is solved by means of analytical method its solution may be
exact. WHILE
Numerical method When a problem is solved by mean of numerical method its solution may give an
approximate number to a solution.

(IV) Analytical methods are preferable when exact solutions are readily available, as they provide
insight into the underlying mathematics WHILE

Numerical methods are chosen when dealing with complex physical systems, real-world data, or
simulations where approximations are acceptable or necessary.

(V) Analytical method generally exact, unless approximations are introduced WHILE

Numerical method subject to numerical errors such as truncation and rounding errors

2. (a) Accuracy

A good numerical method should produce results that closely approximate the true or exact solution.

The accuracy depends on the method's order and the number of computational steps.

Errors in numerical methods include truncation errors (from approximations) and round-off errors (from
finite precision arithmetic).

Example: In numerical integration, increasing the number of subintervals improves accuracy.

(b)Stability

Stability ensures that small changes in input (such as round-off errors) do not cause significant
deviations in results.

Unstable numerical methods can produce wildly incorrect answers due to error propagation.

Example: In solving differential equations numerically, an unstable method may lead to increasing errors
over iterations, making the solution meaningless.

(c)Convergence

A numerical method should provide progressively better approximations to the exact solution as
computations proceed.

If a method does not converge, it cannot reliably approximate the solution.

Example: The Newton-Raphson method for solving equations converges quickly if the initial guess is
close to the root but may diverge otherwise.

(d) Efficiency

The method should require minimal computational resources (time and memory) to produce results.
An efficient method balances computational cost and accuracy.

Example: Direct matrix inversion is computationally expensive, while iterative solvers like the Gauss-
Seidel method may be more efficient for large systems.

(e)Robustness

A robust numerical method performs well for a wide range of problems without failure.

It should not be sensitive to small changes in input or problem parameters.

Example: The Runge-Kutta method is more robust than Euler’s method for solving differential equations
since it maintains accuracy over various step sizes.

REFERENCES

Burden, R. L., & Faires, J. D. (2011). Numerical Analysis (9th ed.). Brooks/Cole.

Chapra, S. C., & Canale, R. P. (2014). Numerical Methods for Engineers (7th ed.). McGraw-Hill.

Kincaid, D., & Cheney, W. (2009). Numerical Mathematics and Computing (6th ed.). Brooks/Cole.

You might also like