Scribd
Upload
8 views3 pages

CM Handout Lab

F

Uploaded by

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

CM Handout Lab

F

Uploaded by

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

School of Engineering & Technology

Vivekananda Institute of Professional Studies –


Technical Campus

BTECH COMPUTER SCIENCE AND ENGINEERING

BATCH – 2022-26
SEMESTER – III

● SUBJECT NAME: COMPUTATIONAL METHODS LAB

● FACULTY COORDINATOR: BHARTI SETH

● FACULTY NAMES: BHARTI SETH

● SUBJECT CODE: ES 251

● CREDITS: 1

1 | Page
1. COURSE OBJECTIVES:
To understand numerical methods to find roots of functions and first-
order unconstrained minimization of functions.
To introduce concept of interpolation methods and numerical
integration.
To understand numerical methods to solve systems of algebraic
equations and curve fitting by splines.
To understand numerical methods for the solution of Ordinary and
partial differential equations.
2. COURSE OUTCOMES
CO 1 Ability to develop mathematical models of low-level engineering
problems
CO 2 Ability to apply interpolation methods and numerical integration.
CO 3 Ability to solve simultaneous linear equations and curve fitting by
splines
CO 4 Ability to numerically solve ordinary differential equations that are
initial value or boundary value problems
3. CO-PO MAPPING

4. LIST OF EXPERIMENTS
Implementation to be done on C/C++
1.
a) Write a program to print all odd positive integers less than 100,
omitting those divisible by 7.
b) Write a program to determine the number of integers between 1 and
2000 that are not divisible by 2, 3 or 5 but are divisible by 7.

2 | Page
c) Write a program to add and multiply any two matrices.
2. Write a program to find a root of the equation 𝒙𝟑 − 𝟐𝒙 − 𝟏 = 𝟎 using
Bisection method. Run the program for the initial interval provided by the
user.
𝟐
3. Write a program to solve for a root of the equation 𝒆−𝒙 = 𝒄𝒐𝒔 𝒙 + 𝟏 using
Newton-Raphson method in the interval [0 4]. Run the program for the
initial approximations 0 and 1.
4. Write a program to solve for a root of the equation 𝒙𝟓 + 𝒙𝟑 + 𝟑 = 𝟎 using
Secant method. Run the program for the initial approximations -1 and 1.
5. Write a program to predict this year's rainfall using the Lagrange
Interpolation method. Use the annual rainfall data for the last 10 years in
your city. Is the answer obtained reasonable?
6. Using 21 equally spaced nodes on the interval [-5 5], find the interpolating
𝟏
polynomial 𝒑(𝒙) of degree 20 for the function 𝒇(𝒙) = 𝟏+𝒙𝟐 . Print the values

of 𝒑(𝒙) and 𝒇(𝒙) at 41 equally spaced points, including the nodes. What do
you observe?
7. Write a program to verify that 59 subintervals are required to evaluate
𝟏 𝟐 𝟏
∫𝟎 𝒆−𝒙 𝒅𝒙 with atmost error of 𝟐 ∗ 𝟏𝟎−𝟒 for the composite Trapezoidal Rule.

8. Write a program to calculate a point of minima for a given function and an


interval. The search should continue until a pre-assigned error bound is
reached but not beyond 100 in each case. Run the program for f(x) =|ln x|
on [0.5, 4].
9. Write a program to solve 𝒙′ = 𝟏𝟎𝟎(𝒔𝒊𝒏 𝒕 − 𝒙) with initial value x(0)=0
using fourth order Runge-Kutta method on the interval [0 3] with step sizes
0.015, 0.020, 0.025, 0.030. Observe the numerical instability.
10. Write a program to find the largest and smallest eigen value of the matrix
−𝟓𝟕 𝟏𝟗𝟐 𝟏𝟒𝟖
[ 𝟐𝟎 −𝟓𝟑 −𝟒𝟒]using Power method.
−𝟒𝟖 𝟏𝟒𝟒 𝟏𝟏𝟓
11. Write a program for Fibonacci Search Algorithm. Run the code for 𝒇(𝒙) =
𝒙𝟐 + 𝒔𝒊𝒏 (𝟓𝟑 𝒙) to find the minima of the function near origin.

3 | Page

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy