Mathematical Models and Algorithms Explained
Translated by
ScribdTranslationsMathematical Models and Algorithms Explained
Translated by
ScribdTranslationsGeneral objective
Apply a mathematical model oriented to the distribution of POA to apply the knowledge of the
subject analysis of algorithms.
Theoretical Framework.
Amodelmathematician is defined as adescriptionfrom the point of view of themathematicsof a
fact or phenomenon of the real world, from the size of thepopulation, even physical phenomena such as
thespeed, acceleration ordensity. Theobjectivethe mathematical model is to understand broadly the
phenomenon and maybe predict itsbehaviorin the future.
Theprocessto develop a mathematical model is as follows:
1. Find a real-world problem
2. Formulate a mathematical model regarding the problem, identifyingvariables(dependents and
independent) and establishinghypothesissimple enough to be about
waymathematics.
3. Apply the knowledgemathematicianswhat is possessed to reach mathematical conclusions.
4. Compare thedataobtained as predictions with real data. If the data are different, then
restart the process.
It is important to mention that a mathematical model is not completely accurate withproblemsof the
real life, in fact, is an idealization.
There is a great amount offunctionsthat represent relationships observed in the real world; which
They will be analyzed in the following paragraphs, both algebraically and graphically.
The usefulness of these models lies in that they help to study how they behave.
thestructurescomplex in the face of those situations that cannot be easily seen in the realm
real.
Similarly, regarding the type of intended outcome, there are two basic classifications:
- qualitative models, which can use graphs and do not seek an exact outcome, but rather
what they are trying to detect, for example, thetrendto a system to increase or decrease a certain
value
quantitative models, which, on the contrary, need to come up with a precise number, for which they rely on
in mathematical formulas of varying complexity.
ALGORITHM
We can find many complete or formal definitions ofalgorithmin the texts of algorithmics
yprogramming, all of them very similar:
• Finite sequence of instructions, rules or steps that precisely describe the operations
A computer must perform in order to carry out a task in a more finite time. [Donald E.]
Knuth, 1968
• Description of a behavior scheme expressed through a finite repertoire of
actions and basic information, identified, well understood and realizable a priori.
This repertoire is called lexicon [Pierre Scholl, 1988]
• AalgorithmIt is a finite set of defined steps, structured in time and formulated
based on a finite set of unambiguous rules, which provide a procedure to give the
solution or indicate the lack of it to a problem in a determined time.
Otazu, 2004
Characteristics:
The fundamental characteristics that must be met by everythingalgorithmson
• Be defined: Without ambiguity, each step of the algorithm must indicate the action to be taken without
interpretation criteria.
• Being finite: A specific and countable number of steps must make up the algorithm, which
it should be completed upon finishing them.
• Have zero or more entries: Data is provided to an algorithm as input (or these are
generated in some way) to carry out the operations it encompasses.
• Having one or more outputs: It must always return a result; an algorithm that is useless does not help.
It does something and we never know what it was. Returning a result should not be considered as
only "seeing them" in printed form or on screen, as happens with computers. There are
many other programmable mechanisms that do not have an output of
results in this way. By output of results, it must be understood as any means or channel through which
it is possible to appreciate the effects of the actions ofalgorithm.
• Effectiveness: The time and effort for each step taken must be precise, notusing nothing
more or less than what is required for and in its execution.
Means of expression of an algorithm
Algorithms can be expressed in many ways, including tolanguage
natural, pseudocode, flowchartsy programming languagesamong others. The descriptions in
natural language tends to be ambiguous and extensive. Using pseudocode and flowcharts avoids
many ambiguities of natural language. Such expressions are more structured ways to
represent algorithms; nevertheless, they remain independent of a programming language
specific.
The description of an algorithm is usually done at three levels:
High-level description. The problem is established, a mathematical model is selected, and it is explained.
algorithm verbally, possibly with illustrations and omitting details.
Formal description. Pseudocode is used to describe the sequence of steps that find the
solution.
Implementation. The algorithm is shown expressed in a specific programming language or some
an object capable of carrying out instructions.
Read everything in:Definición
de modelo matemático - Qué es, Significado y
Concept [Link]
Read everything at:Definition
of mathematical model - What it is, Meaning and
Concept [Link]
[Link]
[Link]
[Link]