1 of 7

What's hot

A1 2 linear fxns
A1 2 linear fxns
vhiggins1

Lecture 15 section 5.4 graph of sin & cos
Lecture 15 section 5.4 graph of sin & cos
njit-ronbrown

oct15/09dmciprecal30s
oct15/09dmciprecal30s
RyanWatt

9.3 graphing general rational functions
9.3 graphing general rational functions
hisema01

March 4 and 5, 2009
March 4 and 5, 2009
Mr. Smith

Exercise #13 notes ~ equations
Exercise #13 notes ~ equations
Kelly Scallion

What's hot(20)

4.5 sec and csc worked 3rd
4.5 sec and csc worked 3rd

A1 2 linear fxns
A1 2 linear fxns

Transformations: Slots
Transformations: Slots

EM integrations
EM integrations

Pre-Cal 40S February 17, 2009
Pre-Cal 40S February 17, 2009

Graphing day 1 worked
Graphing day 1 worked

Lecture 15 section 5.4 graph of sin & cos
Lecture 15 section 5.4 graph of sin & cos

Day 1a examples
Day 1a examples

oct15/09dmciprecal30s
oct15/09dmciprecal30s

Math12 lesson5
Math12 lesson5

9.3 graphing general rational functions
9.3 graphing general rational functions

March 4 and 5, 2009
March 4 and 5, 2009

Lesson 11 plane areas area by integration
Lesson 11 plane areas area by integration

19 - Scala. Eliminators into dependent types (induction)
19 - Scala. Eliminators into dependent types (induction)

Eliminators into dependent types
Eliminators into dependent types

De Bruijn Sequences for Fun and Profit
De Bruijn Sequences for Fun and Profit

Cyrus beck line clipping algorithm
Cyrus beck line clipping algorithm

Linear programming in computational geometry
Linear programming in computational geometry

Exercise #13 notes ~ equations
Exercise #13 notes ~ equations

Ch 7 c volumes
Ch 7 c volumes

Similar to Numerical

Similar to Numerical(20)

Newton cotes integration method
Newton cotes integration method

Areas and Definite Integrals.ppt
Areas and Definite Integrals.ppt

Trapezoidal rule
Trapezoidal rule

5 4 Notes
5 4 Notes

Test
Test

5. AREAS AND VOLUMES (SUR) 3140601 GTU
5. AREAS AND VOLUMES (SUR) 3140601 GTU

Chapter 4 Integration
Chapter 4 Integration

NUMERICAL METHOD'S
NUMERICAL METHOD'S

chapter 3 , foley.pptxhuujjjjjjjkjmmmm. Ibibhvucufucuvivihohi
chapter 3 , foley.pptxhuujjjjjjjkjmmmm. Ibibhvucufucuvivihohi

Raices de ecuaciones pdf
Raices de ecuaciones pdf

Graphics6 bresenham circlesandpolygons
Graphics6 bresenham circlesandpolygons

Graphics6 bresenham circlesandpolygons
Graphics6 bresenham circlesandpolygons

Chap6_Sec1.ppt
Chap6_Sec1.ppt

Rasterisation of a circle by the bresenham algorithm
Rasterisation of a circle by the bresenham algorithm

Rasterisation of a circle by the bresenham algorithm
Rasterisation of a circle by the bresenham algorithm

CD504 CGM_Lab Manual_004e08d3838702ed11fc6d03cc82f7be.pdf
CD504 CGM_Lab Manual_004e08d3838702ed11fc6d03cc82f7be.pdf

Applications of integration
Applications of integration

unit-3.ppt
unit-3.ppt

Computer graphics lab manual
Computer graphics lab manual

MA101-Lecturenotes(2019-20)-Module 13 (1).pdf
MA101-Lecturenotes(2019-20)-Module 13 (1).pdf

Numerical

• 2. The basic working principle of the trapezoidal method c program is that trapezoidal method splits the area under the curve into a number of trapeziums. Then, area of each trapezium is calculated, and all the individual areas are summed up to give the total area under the curve which is the value of definite integral. In the figure, area under the curve between the points x0 and xn is to be determined. In order to determine the area, we divide the total interval (xn– x0) into ‘n’ small interval each of length ‘h’: h=(xn– x0)/n After that, the C source code for trapezoidal method uses the following formula to calculate the value of definite integral:
• 3. Steps • 1. take n that is number of intervals • 2. calculate h=(b-a)/n , a is lower limit and b is upper limit • 3. find x0=a, x1=a+h, x2=a+2.h , ….. • 4. using y=f(x), Find y0,y1,y2…. • 5.
• 4. Example: • ⌠1 4 (x2 +2X)dx with n=6 • ANSWER: • n=6, h=(b-a)/n=3/6=0.5 • • ⌠1 4 (x2 +2X)dx=h/2[(3+24)+ 2*(5.25+8+11.25+15+19.25)]=36.125 • X 1 1.5 2 2.5 3 3.5 4 Y 3 5.25 8 11.25 15 19.25 24
• 5. Simpson’s 1/3rd Rule: • Simpson’s Rule is a Numerical technique to find the definite integral of a function within a given interval. • The function is divided into many sub-intervals and each interval is approximated by a quadratic curve. And the area is then calculated to find the integral. The more is the number of sub-intervals used, the better is the approximation. • NOTE: The no. of sub-intervals should be EVEN.
• 6. Integral = *((y0 + yn ) +4(y1 + y3 + ……….+ yn-1 ) + 2(y2 + y4 +……….+ yn-2 ))
Current LanguageEnglish
Español
Portugues
Français
Deutsche