Integral calculus

The integral calculus is the second of the ideas of the Infinitesimal calculus .

Primitives

That is to say f \, a function defined on an interval I \, . A function F \, is a primitive of f \, on the interval I \, if F \, is derivable on I \, and so for all x \, of I \, , F' (X) = F (X) \, . If f \, is a continuous function on an interval I \, , then it exists at least a function F \, derivable on I \, such as f \, is the derivative of F \, on I \, . F \, is then a primitive of f \, on I \, .

For example, if f \, is defined on \ R \, by f \ colonist X \ mapsto 6x, then the function F \, definite on \ R \, by F \ colonist X \ mapsto 3x^2 \, admits for derived f \, , and thus F \, is a primitive of f \, on \ R \, .

If F \, is a primitive of f \, on I \, , then for any constant k \, , the function G \, definite on \ R by G \ colonist X \ mapsto F (X) + K \, is also a primitive of f \, on I \, because the derivative of a constant application is the null function. One deduces from it that if f \, admits a primitive on I \, then it admits an infinity of it.

Together primitives of a function on an interval

Two primitives different from the same function f \, differ only from one constant. Indeed if F \, and G \, are two primitives of f \, then F' = G' = F \, thus (F - G) '= 0 \, . I \, being an interval, we deduce from it that there exists C \, a constant defined on such as F - G = C \, is F = G + C \,

That is to say f \, a function defined on an interval I \, . If f \, admits a primitive F \, on I \, , then the whole of the primitives of f \, on I \, is the whole of the functions G \, of the form:

G: I \ rightarrow \ R \,
x \ mapsto F (X) + K \,
where k \, is a real constant. It is noticed that the primitives of the null function are the constant functions.

That is to say I \, an interval, a \, a reality of I \, and b \, an unspecified reality. There exists one and only one primitive F \, , of a function f \, continues on I \, , such as F (a)=b \, . F \, is called the primitive of f \, on I \, checking the initial condition: F (a) = B \, .

For example to find the primitive of f (X) = 7x - 3 \, checking the initial condition F (1) =1 \, .

One calculates initially the general form of the primitive F (X) = {7 \ over 2} x^2-3x+k \, .

Then one solves the equation {7 \ over 2} *1^2-3*1+k=1 \, and one obtains k= {1 \ over 2} \, and thus the required primitive is F (X) = {7 \ over 2} x^2-3x+ {1 \ over 2} \, .

Integral

Definition of the integral starting from the concept of primitive

That is to say f \, a function defined on an interval I \, and admitting primitives on I \, . Are a \, and b \, in I \, . That is to say F \, a primitive of f \, on I \, . We call integral of a \, with b \, of f \, , the number:

F (b) - F (a) \,
who does not depend on the choice of the primitive of f \, , since the primitives of f \, on the interval I \, differ from a constant function. We note this number:
\ int_a^b F (T) dt \,
who is read “integral a \, with b \, of f \, ”, and we can also note it
\ left_a^b \,
who is read “F \, . taken between a \, . and b \, . ”

In the notation with the symbol? , t \, play the part of a dummy variable, and we have

\ int_a^b F (T) dt= \ int_a^b F (X) dx= \ ldots \, ,
moreover the number represented by this integral does not depend on t \, .

Let us notice if f \, is continuous on I \, , that the application G \, definite on I \, :

G: X \ mapsto \ int_a^x F (T) dt=F (X) - F (a) \,
is not other than the primitive of f \, which is cancelled in a \, and this function G \, is thus the only derivable function on I \, such G'=f \, and G (a) = 0 \, .

We thus have

\ int_a^a F (T) dt=F (A) - F (a)=0 \,

Properties of the integral

Linearity of the integral

If f \, and g \, are two functions defined on an interval I \, and admitting primitives on I \, , then the function f+g \, admits also primitives on I \, and for all a \, and all b \, of I \, , one a:

\ int_a^b (F (T) +g (T)) dt= \ int_a^b F (T) dt + \ int_a^b G (T) dt \,
Moreover, if \ lambda \, is an unspecified reality then the function \ lambda \, F \, admits primitives on I \, and:
\ int_a^b \ lambda F (T) dt= \ lambda \ int_a^b F (T) dt \,

Relation of Chasles

Are a \, and b \, two realities of the interval I \, . If f \, a function defined on I \, and admitting primitives on I \, , then for all a \, , b \, and c \, in I \,

\ int_a^c F (X) dx= \ int_a^b F (X) dx+ \ int_b^c F (X) dx \, (relation of Chasles)
Indeed if F \, is a primitive of f \, on I \, then:
F (b) - F (a) = (F (c) - F (a)) + (F (b) - F (c)) \, .
By taking a = B \, in the relation of Chasles, we obtain:
\ int_a^c F (X) dx=- \ int_c^a F (X) dx \,
indeed
0= \ int_a^a F (X) dx= \ int_a^c F (X) dx+ \ int_c^a F (X) dx \,

Positivity of the integral

That is to say f \, a function defined on the interval I \, which admits primitives on I \, , and if a \, and b \, is two realities in I \, such as a < B \, .

So for any reality x \, of \ left B \ right \, , f (X) \ geq 0 \, then

\ int_a^b F (X) dx \ geq 0 \,
Indeed under this condition, any primitive of f \, on the interval I \, is increasing.

Consequences:

Growth of the integral

If f \, and g \, admit primitives on I \, and so for all x \, in \ left B \ right \, , f (X) \ Leq G (X) \, then

\ int_a^b F (X) dx \ Leq \ int_a^b G (X) dx \,
(it is enough to pose h=g \ - F \, and to use the positivity and the linearity of the integral)

Inequality of the average

If there exists m \, and M \, of realities such as for all x \, in \ left B \ right \, , m \ Leq F (X) \ Leq M \, , then

m (Ba) \ Leq \ int_a^b F (X) dx \ Leq M (Ba) \,

If there exists a reality M \, such as for all x \, in \ left B \ right \, , \ left|F (X) \ right| \ Leq M \, , then

\ left|\ int_a^b F (X) dx \ right|\ Leq M (B - a) \,

If there exists a reality M \, such as for all x \, in I \, , \ left |F (X) \ right| \ Leq M \, , then for all a \, and all b \, in I \, ,

\ left|\ int_a^b F (X) dx \ right|\ Leq M|B - has|\,

simple Form of the first theorem of the average

If f \, is continuous on I \, , then for all a \, and all b \, in I \, , it exists a reality c \, ranging between a \, and b \, such as:

\ int_a^b F (X) dx=f (c) (B - a) \,

Median value of a function

If f \, admits primitives on an interval I \, , if a \, and b \, are in I \, such as a \, <b \, , we call median value f \, on \ left B \ right \, , the number:

\ frac {1} {Ba} \ int_a^b F (X) dx \,

Parity

That is to say f \, a function which admits primitives on an interval I \, centered into 0. If a \, is a reality, such as a \, and -a \, belong to I \, , then:

  • if f \, are even, \ int_ {- has} ^ {has} F (X) dx= 2 \ int_0^ {has} F (X) dx \,
  • if f \, is odd, \ int_ {- has} ^ {has} F (X) dx=0 \,

Integral and surface

A particular case:

Are a \, and b \, two realities such as a < B \, . Either f \, a constant function on \ left B \ right \, and or c \, such as

for any reality x \, of \ left B \ right \, , f (X) \, =c \,
Then the integral of a \, with b \, of f \, is equal to c (B \, -a) \, and represents the algebraic surface of the rectangle of tops (has, 0) \, , (B, 0) \, , (B, c) \, and (has, c) \, .

Theorem:

Are a \, and b \, two realities such as a < B \, . Either f \, a function continues on \ left B \ right \, . That is to say (x_0 \, , x_1 \, ,…, x_n) \, a strictly increasing succession of points sharing the segment \ left B \ right \, in n \, intervals length

\ frac {Ba} {N} \,
We then have for all i \, ranging between 0 \, and n \, ,
x_i=a+i. \ frac {Ba} {N} \,
Then the sum
\ frac {Ba} {N} \ sum_ {i=0} ^ {n-1} F \ left (a+i \ frac {Ba} {N} \ right) \,
tends towards \ int_a^b F (T) dt \, when n \, tends towards + \ infty \, .

Graphic interpretation:

This sum (called sum of Riemann) graphically represents the algebraic sum of the surfaces of the rectangles of left and is an approximate value of \ int_a^b F (T) dt \, .

If f \, is a continuous positive function on \ left B \ right \, and if \ mathcal C \, is the curve representative of f \, in the plan brought back to an orthogonal reference mark (O \, ; i \, , j) \, , \ int_a^b F (T) dt \, is the measurement of the surface of the plan delimited by \ mathcal C \, , the x-axis O \, x \, and the lines of equations x \, =a \, and x \, =b \, . The unit of surface being the surface of the rectangle O \, I \, K \, J \, .

Methods of calculating of an integral

Direct calculation using the usual primitives

Integration by parts

Theorem:

That is to say I \, an interval. Are f \, and g \, two functions derivable on I \, such as the functions f' \, g \, and f \, g' \, are continuous on I \, . That is to say a \, a reality in I \, . Then, for any reality x \, in I \,

\ int_a^x f^ {\ premium} \ left (T \ right) G \ left (T \ right) dt= \ left T \ right) G \ left (T \ right) \ right_a^x - \ int_a^x F \ left (T \ right) g^ {\ premium} \ left (T \ right) dt \,

In particular:

Theorem:

Are a \, and b \, two realities such as a < B \, . Are f \, and g \, two functions derivable on \ left B \ right \, and such as the functions f' \, , g \, , f \, and g' \, are continuous on \ left B \ right \, . Then:

\ int _ {has} ^ {B} f^ {\ premium} \ left (T \ right) G \ left (T \ right) dt= \ left F \ left (T \ right) G \ left (T \ right) \ right _ {has} ^ {B} - \ int _ {has} ^ {B} F \ left (T \ right) g^ {\ premium} \ left (T \ right) dt \,

One can generalize this formula with the functions of class C^ {k+1}

\ int_ {has} ^ {B} f^ {k+1} (X) G (X) \, dx = \ left \ sum_ {n=0} ^ {K} (- 1) ^ {N} f^ {kN} (X) g^ {N} (X) \ right_ {has} ^ {B} + (- 1) ^ {k+1} \ int_ {has} ^ {B} F (X) g^ {k+1} (X) \, dx

Integration by the method of the residues

See also: Remainder theorem

Approximate numerical calculation of an integral

One considers here the case of a function f \, definite on \ left B \ right \, . One defines the “step” of approximation h \, in the following way: h = \ frac {Ba} {N} \, ; where n \, determines the precision of the approximation. One defines also x_i = has +ih \, .

Method of the rectangles

The method of the rectangles returns to an approximation of f \, by a function in staircase, with n \, “steps” length h \, . The approximate value R \, of the integral is worth then:

R = H \ sum_ {I = 0} ^ {N - 1} F (x_i) \, .

Method of the trapezoids

See also: Method of the trapezoids

One uses a function continues closely connected per pieces approaching the function to be integrated and equal to this one on the points of the subdivision in N \, equal subintervals of the interval of integration \ left has, B \ right \, to obtain an approximation of the value of his integral on \ left has, B \ right \, .

By replacing by trapezoids the rectangles used previously, one obtains:

R = H \ left \ frac {F (a)+f (b)} {2} + \ sum_ {i=1} ^ {n-1} F (x_i) \ right \, .

One can determine the precision of this approximation by using the following formula:

\ left| I - R \ right| \ Leq \ frac {M (B - a)^3} {12n^2} \, where M \, is the upper limit of the absolute value of derived from order 2 of f \, on \, and I \, the exact value of the integral.

Method of Simpson

See also: Method of Simpson

One now uses parabolas which one makes pass by three consecutive points of cutting in 2n \, segments of the interval of integration of f \, .

One is based on the following exact result where P \, is a polynomial function of degree two:

If a \, , b \, and c \, are three realities such as c = \ frac {(b+a)} {2} \, , then \ int_ {has} ^ {B} P (X) \, dx = \ frac {(Ba)}{6} \ begin {pmatrix} F (a)+4f (c)+f (b) \ end {pmatrix} \, One then obtains an approximate value of I \, with the following formula:

R = \ frac {H} {6} \ left F (a) + F (b) + 4 \ sum_ {i=0} ^ {n-1} F (x_ {2i+1}) + 2 \ sum_ {i=1} ^ {n-1} F (x_ {2i}) \ right \, where H = \ frac {Ba} {N} and x_k = has + K \ frac h2

One can also determine the precision of the method here, with the following formula:

\ left| I - R \ right| \ Leq \ frac {M (B - a)^5} {2880n^4} \, where M \, is the upper limit of the absolute value of derived from order 4 of f \, on \, and I \, the exact value of the integral.

Method of Gauss-Legendre

See also: Methods of squaring of Gauss

One also uses in numerical analysis a method based on orthogonality of the Polynômes of Legendre. for the scalar product \ left \ langle F|G \ right \ rangle = \ int_ {- 1} ^ {+1} F (X) G (X) \, dx \,

It is called method of Gauss-Legendre, and makes it possible to calculate with a high degree of accuracy the integrals of sufficiently regular functions on a segment \ left has, B \ right \,

It is enough to carry out an application closely connected of \ left has, B \ right \, on \ left -1, +1 \ right \, , and to notice that

\ int_ {has} ^ {B} F (X) \, dx = \ frac {(Ba)}{2} \ int_ {- 1} ^ {+1} F \ begin {pmatrix} \ frac {b+a} {2} + \ frac {Ba} {2} X \ end {pmatrix} \, dx \ approx \ frac {B - has} {2} \ sum_ {K = 1} ^ {N} {m \ left ({x_k} \ right)} F (\ frac {B - has} {2} x_k + \ frac {B + has} {2}) \,

where x_k \, is the roots of the polynomial of Legendre of degree n \,

and where m \ left ({x_k} \ right) \, is the weights of these roots, which are such as the equality

\ int_ {- 1} ^ {+1} F \ begin {pmatrix} X \ end {pmatrix} \, dx = \ sum_ {K = 1} ^ {N} {m \ left ({x_k} \ right) F (x_k)}\, is ensured for any polynomial function of degree lower or equal to 2n-1 \,

The first polynomials are

P_0 (X) =1 \,

P_1 (X) =x \,

P_2 (X) =1-3x^2 \,

An excellent precision is guaranteed as soon as N \ Ge 3 \, . Tables make it possible to obtain the values of the points and their weights.

Example

See too

Random links:Pact of Umar | Rupestral engravings of the area of Figuig | Toshihiko Koga | Johannes Widmann | Emmanuel Martinez | Jean-François_de_Galaup,_comte_de_La_Pérouse