The document discusses numerical methods for finding roots of equations and integrating functions. It covers root-finding algorithms like the bisection method, Regula Falsi method, modified Regula Falsi, and secant method. These algorithms iteratively find roots by narrowing the interval that contains the root. The document also discusses numerical integration techniques like the trapezoidal rule to approximate the area under a curve without having a closed-form solution. It notes the tradeoffs between different root-finding algorithms in terms of speed, accuracy, and ability to guarantee convergence.
Here we focuses on Fixed-Point Iterative Technique for solving nonlinear Equations in Numerical Analysis. It is one of the opened-iterative techniques for finding roots called Fixed-Point of Non-linear Equations.
A short presentation on the topic Numerical Integration for Civil Engineering students.
This presentation consist of small introduction about Simpson's Rule, Trapezoidal Rule, Gaussian Quadrature and some basic Civil Engineering problems based of above methods of Numerical Integration.
Mathematics (from Greek μάθημα máthēma, “knowledge, study, learning”) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics
Here we focuses on Fixed-Point Iterative Technique for solving nonlinear Equations in Numerical Analysis. It is one of the opened-iterative techniques for finding roots called Fixed-Point of Non-linear Equations.
A short presentation on the topic Numerical Integration for Civil Engineering students.
This presentation consist of small introduction about Simpson's Rule, Trapezoidal Rule, Gaussian Quadrature and some basic Civil Engineering problems based of above methods of Numerical Integration.
Mathematics (from Greek μάθημα máthēma, “knowledge, study, learning”) is the study of topics such as quantity (numbers), structure, space, and change. There is a range of views among mathematicians and philosophers as to the exact scope and definition of mathematics
I am Leonard K. I am a Differential Equations Homework Solver at mathhomeworksolver.com. I hold a Master's in Mathematics From California, USA. I have been helping students with their homework for the past 8 years. I solve homework related to Differential Equations.
Visit mathhomeworksolver.com or email support@mathhomeworksolver.com. You can also call on +1 678 648 4277 for any assistance with Differential Equations Homework.
I am Duncan V. I am a Single Variable Calculus Assignment Solver at mathhomeworksolver.com. I hold a Master's in Mathematics, from Manchester, United Kingdom. I have been helping students with their assignments for the past 12 years. I solved assignments related to Single Variable Calculus.
Visit mathhomeworksolver.com or email support@mathhomeworksolver.com. You can also call on +1 678 648 4277 for any assistance with Single Variable Calculus Assignment.
I am Manuela B. I am a Differential Equations Assignment Expert at mathsassignmenthelp.com. I hold a Master's in Mathematics from, the University of Warwick. I have been helping students with their assignments for the past 13 years. I solve assignments related to Differential Equations.
Visit mathsassignmenthelp.com or email info@mathsassignmenthelp.com.
You can also call on +1 678 648 4277 for any assistance with Differential Equations Assignment.
I am Piers L. I am a Calculus Homework Solver at mathhomeworksolver.com. I hold a Master's in Mathematics From, the University of Adelaide. I have been helping students with their homework for the past 7 years. I solve homework related to Calculus.
Visit mathhomeworksolver.com or email support@mathhomeworksolver.com. You can also call on +1 678 648 4277 for any assistance with Calculus Homework.
I am Manuela B. I am a Calculus Assignment Expert at mathsassignmenthelp.com. I hold a Master's in Mathematics from, the University of Warwick Profession. I have been helping students with their assignments for the past 8 years. I solve assignments related to Calculus.
Visit mathsassignmenthelp.com or email info@mathsassignmenthelp.com.
You can also call on +1 678 648 4277 for any assistance with Calculus Assignment.
I am Harvey L. I am a Computation and System Biology Assignment Expert at nursingassignmenthelp.com. I hold a Ph.D. in Biology, from Bond University, Australia. I have been helping students with their assignments for the past 14 years. I solve assignments related to Computation and System Biology.
Visit nursingassignmenthelp.com or email info@nursingassignmenthelp.com.
You can also call on +1 678 648 4277 for any assistance with Computation and System Biology Assignments.
I am Arcady N. I am a Single Variable Calculus Assignment Expert at mathsassignmenthelp.com. I hold a Master's in Mathematics from, Queen’s University. I have been helping students with their assignments for the past 12 years. I solve assignments related to Single Variable Calculus.
Visit mathsassignmenthelp.com or email info@mathsassignmenthelp.com.
You can also call on +1 678 648 4277 for any assistance with Single Variable Calculus Assignment.
Numerical Method Analysis: Algebraic and Transcendental Equations (Non-Linear)Minhas Kamal
Numerical Method Analysis- Solution of Algebraic and Transcendental Equations (Non-Linear Equation). Algorithms- Bisection Method, False Position Method, Newton-Raphson Method, Secant Method, Successive Approximation Method.
Visit here for getting code implementation- https://github.com/MinhasKamal/AlgorithmImplementations/blob/master/numericalMethods/equationSolving/NonLinearEquationSolvingProcess.c
Created in 2nd year of Bachelor of Science in Software Engineering (BSSE) course at Institute of Information Technology, University of Dhaka (IIT, DU).
A New Double Numerical Integration Formula Based On The First Order DerivativeIRJESJOURNAL
ABSTRACT: A new double numerical integration formula based on the value of integrated function and first order derivative of the integrable function was proposed. Different from the traditional mechanical quadrature formula, contibuted integral function and first order derivative of the integral function. Four nodes are selected appropriately in the integral interval. Used the value of function and first order derivative, constructed a new numerical integration formula that achieve seven order algebraic precision. Then analysed the algebraic precision、 remainder、stypticity and stability of the formula. Then generalized the formula into double integral. In the end, according to the two typical examples vertified the formula’s validity and fesibility. This formula enrich the content of numerical calculation. Provided a new method for solving double numerical integrations.
Fortran is a general-purpose programming language, mainly intended for mathematical computations in
science applications
this chapter is the third chapter
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Ethnobotany and Ethnopharmacology:
Ethnobotany in herbal drug evaluation,
Impact of Ethnobotany in traditional medicine,
New development in herbals,
Bio-prospecting tools for drug discovery,
Role of Ethnopharmacology in drug evaluation,
Reverse Pharmacology.
The Indian economy is classified into different sectors to simplify the analysis and understanding of economic activities. For Class 10, it's essential to grasp the sectors of the Indian economy, understand their characteristics, and recognize their importance. This guide will provide detailed notes on the Sectors of the Indian Economy Class 10, using specific long-tail keywords to enhance comprehension.
For more information, visit-www.vavaclasses.com
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
How to Split Bills in the Odoo 17 POS ModuleCeline George
Bills have a main role in point of sale procedure. It will help to track sales, handling payments and giving receipts to customers. Bill splitting also has an important role in POS. For example, If some friends come together for dinner and if they want to divide the bill then it is possible by POS bill splitting. This slide will show how to split bills in odoo 17 POS.
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
3. What computers can’t do
• Solve (by reasoning) general mathematical
problems they can only repetitively
apply arithmetic primitives to input.
• Solve problems exactly.
• Represent all numbers. Only a finite subset
of the numbers between 0 and 1 can be
represented.
4. Finding roots / solving equations
• General solution exists for equations such as
ax2 + bx + c = 0
The quadratic formula provides a quick
answer to all quadratic equations.
However, no exact general solution (formula)
exists for equations with exponents greater
than 4.
5. Finding roots…
• Even if “exact” procedures existed, we are
stuck with the problem that a computer can
only represent a finite number of values…
thus, we cannot “validate” our answer
because it will not come out exactly
• However we can say how accurate our
solution is as compared to the “exact”
solution
6. Finding roots, continued
• Transcendental equations: involving
geometric functions (sin, cos), log, exp. These
equations cannot be reduced to solution of a
polynomial.
• Convergence: we might imagine a
“reasonable” procedure for finding solutions,
but can we guarantee it terminates?
7. Problem-dependent decisions
• Approximation: since we cannot have exactness,
we specify our tolerance to error
• Convergence: we also specify how long we are
willing to wait for a solution
• Method: we choose a method easy to implement
and yet powerful enough and general
• Put a human in the loop: since no general
procedure can find roots of complex equations, we
let a human specify a neighbourhood of a solution
8. Practical approach hand calculations
• Choose method and initial guess wisely
• Good idea to start with a crude graph. If
you are looking for a single root you only
need one positive and one negative value
• If even a crude graph is difficult, generate a
table of values and plot graph from that.
9. Practical approach - example
• Example
e-x = sin(πx/2)
• Solve for x.
• Graph functions - the crossover points are
solutions
• This is equivalent to finding the roots of the
difference function:
f(x)= e-x - sin(πx/2)
11. Solution, continued
• One crossover point at about 0.5, another at
about 2.0 (there are very many of them …)
• Compute values of both functions at 0.5
• Decrement/increment slightly – watch the
sign of the difference-function!!
• If there is an improvement continue, until
you get closer.
• Stop when you are “close enough”
13. Bisection Method
• The Bisection Method slightly modifies
“educated guess” approach of hand
calculation method.
• Suppose we know a function has a root
between a and b. (…and the function is
continuous, … and there is only one root)
14. Bisection Method
• Keep in mind general approach in
Computer Science: for complex problems
we try to find a uniform simple systematic
calculation
• How can we express the hand calculation of
the preceding in this way?
• Hint: use an approach similar to the binary
search…
15. Bisection method…
• Check if solution lies between a and b…
F(a)*F(b) < 0 ?
• Try the midpoint m: compute F(m)
• If |F(m)| < tol select m as your approximate solution
• Otherwise, if F(m) is of opposite sign to F(a) that is if
F(a)*F(m) < 0, then b = m.
• Else a = m.
16. Bisection method…
• This method converges to any pre-specified
tolerance when a single root exists on a
continuous function
• Example Exercise: write a function that
finds the square root of any positive number
that does not require programmer to specify
estimates
17. Square root program
• If the input c < 1, the root lies between c
and 1.
• Else, the root lies between 1 and c.
• The (positive) square root function is
continuous and has a single solution.
c = x2
6
4
Example:
F(x) = x2 - 4
2
0
-2
-4
-6
0
0.5
1
1.5
2
2.5
3
F(x) = x2 - c
18. double Sqrt(double c, double tol)
{
double a,b, mid, f;
// set initial boundaries of interval
if (c < 1) { a = c; b = 1}
6
else { a = 1; b = c}
4
do {
2
mid = ( a + b ) / 2.0;
0
0
f = mid * mid - c;
-2
-4
if ( f < 0 )
-6
a = mid;
else
b = mid;
} while( fabs( f ) > tol );
return mid;
}
0.5
1
1.5
2
2.5
3
19. Program 13-1 (text; bisection)
•
•
•
•
•
Echos inputs
Computes values at endpoints
Checks whether a root exists
If root exists, employs bisection method
Convergence criterion: Root is found if size of
current interval < ε (predefined tolerance)
Note difference with the algorithm on the previous
slide!!!
• If root found within number of iterations, prints
results, else prints failure…
20. Problem with Bisection
• Although it is guaranteed to converge under its
assumptions,
• Although we can predict in advance the number of
iterations required for desired accuracy
(b - a)/2n <ε −> n > log( (b - a ) / ε )
• Too slow! Computer Graphics uses square roots to
compute distances, can’t spend 15-30 iterations on
every one!
• We want more like 1 or 2, equivalent to ordinary
math operation.
21. Improvement to Bisection
• Regula Falsi, or Method of False Position.
• Use the shape of the curve as a cue
• Use a straight line between y values to
select interior point
• As curve segments become small, this
closely approximates the root
24. Method of false position
• Pro: as the interval becomes small, the
interior point generally becomes much
closer to root
• Con 1: if fa and fb become too close –
overflow errors can occur
• Con 2: can’t predict number of iterations to
reach a give precision
• Con 3: can be less precise than bisection –
no strict precision guarantee
25. fa
a
b
fb
Problem with Regula Falsi -- if the graph is convex down, the
interpolated point will repeatedly appear in the larger
segment….
26. Therefore a problem arises if we use the size of the
current interval as a criterion that the root is found
fb
a
fa
fx
x
b
If we use the criterion abs(fx) < ε, this is not
a problem. But this criterion can’t be always
used (e.g. if function is very steep close to the
root…)
27. Another problem with Regular Falsi:
if the function grows too fast
very slow convergence
28. Modified Regula Falsi
• Because Regula Falsi can be fatally slow
some of the time (which is too often)
• Want to clip interval from both ends
• Trick: drop the line from fa or fb to some
fraction of its height, artificially change
slope to cut off more of other side
• The root will flip between left and right
interval
29. Modified Regula Falsi
• If the root is in the left segment [a, interior]
– Draw line between (a, fa*0.5) and (interior, finterior)
• Else (in the right segment [interior, b])
-- Draw line between (interior, finterior) and (b, fb*0.5)
fb
a
interior2
interior3
fa
interior1
b
30. Secant Method
Exactly like Regula Falsi, except:
• No need to check for sign.
• Begin with a, b, as usual
• Compute interior point as usual
• NEW: set a to b, and b to interior point
• Loop until desired tolerance.
31. Secant method
• No animation ready yet: Intuition
• It automatically flips back and forth,
solving problem with unmodified regula
falsi
• Sometimes, both fa and fb are positive, but
it quickly tracks secant lines to root
33. Root finding algorithms
The algorithms have the following declarations:
double bisection(double c, int iterations, double tol);
double regula(double c, int iterations, double tol);
double regulaMod(double c, int iterations, double tol);
double secant(double c, int iterations, double tol);
i.e., they have the same kinds of inputs
34. Called function
All functions call this function: func(x, c) = x2 - c
double func(double x, double c)
{
return x * x - c;
}
* Note that the root of this function is the square root of c.
The functions call it as follows:
func( current_x, square_of_x );
35. Initializations
All functions implementing the root-finding algorithm have the
same initialization:
double a, b;
if ( c < 1 )
{ a = c ; b= 1;}
else
{ a = 1; b = c;};
double fa = func( a, c);
double fb = func( b, c);
The next slides illustrate the differences between algorithms.
36. Code
• Earlier code gave “square root” example
with logic of bisection method.
• Following programs, to fit on a slide, have
no debug output, and have the same
initializations (as on the next slide)
37. double bisection(double c, int iterations, double tol)
for ( int i = 0; i < iterations; i++)
{
double x = ( a + b ) / 2;
double fx = func( x, c );
if ( fabs( fx ) < tol )
return x;
if ( fa * fx < 0 ) {
b = x;
fb = fx;
}
BISECTION METHOD
else {
This is the heart of the
a = x;
algorithm. Compute the
fa = fx;
}
midpoint and the value of
}
the function there; iterate
return -1;
half with root
…
on
38. double regula (double c, int iterations, double tol)…
for ( int i = 0; i < iterations; i++)
{
double x = ( fa*b - fb*a ) / ( fa - fb );
double fx = func( x, c );
if ( fabs( fx ) < tol )
return x;
if ( fa * fx < 0 ) {
b = x;
fb = fx; }
REGULA FALSI
else {
The main change from
a = x;
bisection is computing
fa = fx; }
an interior point that
}
more closely
return -1;
approximates the
root….
39. double regulaMod (double c, int iterations, double tol)…
for ( int i = 0; i < iterations; i++)
{
double x = ( fa*b - fb*a ) / ( fa - fb );
double fx = func( x, c );
if ( fabs( fx ) < tol )
return x;
if ( fa * fx < 0 ) {
b = x;
fb = fx;
fa *= RELAX }
MODIFIED REGULA FALSI
else {
a = x;
The only change from
fa = fx;
ordinary regula is the
fb *= RELAX }
RELAXation factor
}
return -1;
40. double secant(double c, int iterations, double tol)…
for ( int i = 0; i < iterations; i++)
{
double x = ( fa*b - fb*a ) / ( fa - fb );
double fx = func( x, c );
if ( fabs( fx ) < tol )
return x;
a = b;
SECANT METHOD
fa = fb;
The change from ordinary
b = x;
regula is that the sign check is
fb = fx;
}
dropped and points are just “shifted
return -1;
over”
41. Actual performance
• Actual code includes other output
commands
• Used 4 methods to compute roots of 4, 100,
1000000, 0.25
• Maximum allowable iterations 1000
• Tolerance = 1e-15
• RELAXation factor = 0.8
43. Important differences from text
• Assumed all methods would be used to find
square root of k between [1, c] or [c,1] by
finding root of x2 – c.
• All used closeness of fx to 0 as convergence
criteria. Text uses different criteria for
different algorithms
44. double bisection(double c, int iterations, double tol) …
for ( int i = 0; i < iterations; i++)
{
double x = ( a + b ) / 2;
double fx = func( x, c );
if ( fabs( fx ) < tol )
return x;
if ( fa * fx < 0 ) {
b = x;
Example….
fb = fx;
}
else {
All four code examples
a = x;
used the closeness of fx
fa = fx;
}
zero as convergence
}
return -1;
criterion.
to
45. Convergence criterion…
• Closeness of fx to zero not always a good
criterion, consider a very flat function may
be close to zero a considerable distance
before the root
46. Other convergence criteria
• Width of the interval [a,b]. If this interval
contains the root, guaranteed that the root is
within this much accuracy
• However, interval does not necessarily
contain the root (secant method)
• Text uses the width of the interval as the
convergence criteria in the Bisection
Method
47. Convergence criteria…
• Fractional size of search interval:
(cur_a – cur_b) / ( a – b)
• Used in modified falsi in text
• Indicates that further search may not be
productive. Does not guarantee small value
of fx.
48. Numerical Integration
• In NA, take visual view of integration as
area under the curve
• Many integrals that occur in science or
engineering practice do not have a closed
form solution – must be solved using
numerical integration
49. Trapezoidal Rule
• The area under the curve from
[a, fa] to [b, fb] is initially approximated by
a trapezoid:
I1 = ( b – a ) * ( fa + fb ) / 2
51. fc
I2 = ( b – a )/2 * ( fa + 2*fc + fb ) / 2
(Note that interior sides count twice, since they belong to 2 traps.)
52. Further development…
I2 = ( b – a ) / 2 * ( fa + 2*fc + fb ) / 2
= ( b – a ) /2 * ( f a + fb + 2* fc ) / 2
= ( b – a ) / 2* ( fa + fb ) /2 + (b – a) / 2* fc
= I1 /2 + (b – a)/2 * fc
Notice that (b-a)/2 is the new interval width and fc is the value
of the function at all new interior points. If we call dk the new
interval width at step k, and cut intervals by half:
Ik = Ik-1/2 + dk Σ (all new interior f-values)
53. Trapezoidal algorithm
• Compute first trapezoid: I = (fa + fb ) * (b – a) /2
• New I = Old I / 2, length of interval by 2
• Compute sum of function value at all new
interior points, times new interval length
• Add this to New I.
• Continue until no significant difference
54. Simpson’s rule
•
•
•
•
.. Another approach
Rather than use straight line of best fit,
Use parabola of best fit (curves)
Converges more quickly