Modeling the research process and its algorithmization. Construction of modeling algorithms: formalization and algorithmization of processes. Description of the mathematical model

MOSCOW TECHNOLOGICAL INSTITUTE
Computer modelling
Buzhinsky V.A. ktn
assistant professor

Moscow
2014

Basic concepts of CM
Model is an artificially created object that reproduces in a certain
the form of a real object - the original.
Computer model - representation of information about the system being modeled
computer means.
A system is a set of interconnected elements that have properties
different from the properties of individual elements.
An element is an object that has properties that are important for modeling purposes.
In a computer model, the properties of an element are represented by the values ​​of the characteristics of the element.
The relationship between elements is described using quantities and algorithms, in particular
computational formulas.

Currently, a computer model is most often understood as:
a conventional image of an object or some system of objects (or processes),
described using interconnected computer tables, flow charts,
diagrams, graphs, drawings, animations, hypertexts, etc.
and displaying the structure and relationships between the elements of the object.
We will call computer models of this type structural-functional;
separate program, set of programs, software package,
allowing, using a sequence of calculations and graphical
display their results reproduce (simulate) processes
functioning of an object, system of objects, subject to impact on the object
various (usually random) factors. We will use such models further
called simulation models.
Computer modeling is a method for solving an analysis problem or
synthesis of a complex system based on the use of its computer model.
The essence of computer modeling lies in obtaining quantitative and
qualitative results from the existing model.

Topic No. 1. Basic concepts of computer modeling.
Topic No. 2. Construction of modeling algorithms: formalization and
algorithmization of processes.
Topic No. 3. Universality of mathematical models.
Topic No. 4. Mathematical models of complex systems.
Topic No. 5. Continuous-deterministic, discrete-deterministic, discrete-probabilistic and continuous-probabilistic models.

Webinar No. 2
Construction of modeling algorithms:
formalization and algorithmization of processes
1. Formalization of the model
2. Algorithmization of the process

Throughout its history, humanity has used various
methods and tools for creating information models. These methods
constantly improved. Yes, first information models
were created in the form of rock paintings. Currently information
models are usually built and studied using modern
computer technologies.
When studying a new object, it is usually first constructed
descriptive information model using natural languages
and drawings. Such a model can display objects, processes and phenomena
qualitatively, i.e. without using quantitative characteristics. For example,
Copernicus' heliocentric model of the world in natural language
was formulated as follows:
The Earth revolves around the Sun and the Moon revolves around the Earth;
all planets revolve around the sun.

Formal languages ​​are used to build formal
information models. Mathematics is the most widely
the formal language used. Using mathematical
mathematical models are built using concepts and formulas.
In the natural sciences (physics, chemistry, etc.) they build
formal models of phenomena and processes. Often used for this
universal mathematical language of algebraic formulas (for assignment No. 3).
However, in some cases specialized
formal languages ​​(in chemistry - the language of chemical formulas, in music - musical notation
literacy, etc.) (?).

1. student question. Formalization
models
The process of building information models using
formal languages ​​is called formalization.
In the process of studying formal models, it is often carried out
their visualization. (?)
Flowcharts are used to visualize algorithms,
spatial relationships between objects - drawings, models
electrical circuits - electrical circuits. When visualizing formal
models using animation can display the dynamics of the process,
graphs of changes in values, etc. are constructed.
Currently, widespread
computer interactive visual models. In such models the researcher
can change the initial conditions and parameters of processes and observe
changes in the behavior of the model.

The first stage of any research is the formulation of a problem that
determined by a given goal.
The problem is formulated in ordinary language. By the nature of the production everything
tasks can be divided into two main groups. To the first group you can
include tasks in which it is necessary to investigate how changes
characteristics of an object under some influence on it, “what will happen,
If?…". The second group of tasks: what impact should be made on
object so that its parameters satisfy some given
condition, “how to do so that?..”.
The second stage is object analysis. The result of object analysis is its identification
components (elementary objects) and determining the connections between them.
The third stage is the development of an information model of the object. Construction
The model must be related to the purpose of the modeling. Each object has
a large number of different properties. In the process of building the model
the main, most essential properties are highlighted that
fit the purpose
Everything that was mentioned above is formalization, i.e. replacement
of a real object or process by its formal description, i.e. his
information model.

10.

Having built an information model, a person uses it instead
original object to study the properties of this object, predict
his behavior, etc. Before building any complex structure,
for example, a bridge, designers make its drawings and carry out calculations
strength, permissible loads. So instead of a real bridge
they deal with its model description in the form of drawings,
mathematical formulas.
Formalization is a process
selection and translation
internal structure of an object in
certain information
structure - form.

11.

12.

According to the degree of formalization, information models are divided into
figurative-sign and symbolic.
Iconic models can be divided into the following groups:
mathematical models represented by mathematical formulas,
displaying the relationship between various parameters of an object, system or
process;
special models presented in special languages ​​(sheet music,
chemical formulas, etc.);
algorithmic models representing a process in the form of a program,
written in a special language.

13.

Sequence of commands to control the object,
the implementation of which leads to the achievement of a predetermined
goals is called a control algorithm.
Origin of the concept "algorithm".
The word "algorithm" comes from the name mathematician
medieval East Muhammad al-Khwarizmi (787-850). They were
methods for performing arithmetic calculations with
multi-digit numbers. Later in Europe these techniques were called
algorithms, from the Latin spelling of the name al-Khwarizmi. In our time
the concept of an algorithm is not limited to arithmetic
calculations.

14.

An algorithm is a clear and precise instruction to perform
a certain sequence of actions,
aimed at achieving a specified goal or
solving the problem.
Algorithm as applied to computing
machine - an exact instruction, i.e. a set of operations and
rules for their alternation, with the help of which, starting
with some initial data, you can solve any
problem of fixed type.

15.

Properties of algorithms:
Discreteness - the algorithm must be divided into steps (separate
completed actions).
Certainty - the performer should not have
ambiguities in understanding the steps of the algorithm (the performer does not
must make independent decisions).
Efficiency (finity) - the algorithm should lead to
the final result in a finite number of steps.
Understandability - the algorithm must be understandable to the performer.
Efficiency - from the possible algorithms, the one selected
an algorithm that contains fewer steps or takes less time to complete
requires less time.

16.

Types of algorithms
Types of algorithms as logical-mathematical tools in
depending on the purpose, initial conditions problem, ways to solve it,
definitions of the performer's actions are divided as follows
way:
mechanical algorithms, otherwise deterministic;
flexible algorithms, otherwise probabilistic and heuristic.
A mechanical algorithm specifies certain actions,
designating them in a unique and reliable sequence,
thereby providing an unambiguous required or sought
result if those process or task conditions are met for
which the algorithm was developed.
A heuristic algorithm is an algorithm in which
achieving the final result of the action program is definitely not
predetermined, just as the entire sequence is not indicated
actions of the performer. These algorithms use
universal logical procedures and methods of decision making,
based on analogies, associations and experience, solutions to similar
tasks.

17.

In the process of algorithmization, the original algorithm is divided into separate
related parts called steps, or partial algorithms.
There are four main types of private algorithms:
linear algorithm;
branching algorithm;
cyclic algorithm;
auxiliary, or subordinate, algorithm.
Linear algorithm - a set of instructions executed
sequentially one after another in time.
A branching algorithm is an algorithm containing at least one
condition, as a result of checking which the computer provides a transition to
one of two possible steps.
Cyclic algorithm - an algorithm that involves repetitions
the same action on new initial data. Necessary
note that the cyclic algorithm is easily implemented using two
previously discussed types of algorithms.
Auxiliary, or subordinate, algorithm - an algorithm previously
developed and entirely used in the algorithmization of a specific
tasks.

18.

At all stages of preparation for algorithmization of a problem, it is widely used
structural representation of the algorithm in the form of block diagrams.
Block diagram - graphic image algorithm in the form of a diagram
blocks of graphic symbols connected to each other using arrows (transition lines), each of which corresponds to one step
algorithm. Inside the block there is a description of the actions performed in it.

19.

Ways to describe algorithms
Selecting tools and methods for writing an algorithm
depends primarily on the purpose (nature) of the
algorithm, as well as who (what) will
executor of the algorithm.
The algorithms are written as:
verbal rules
block diagrams,
programs.

20.

The verbal way of describing algorithms is essentially ordinary language, but
with a careful selection of words and phrases that do not allow unnecessary words,
ambiguity and repetition. The language is supplemented with ordinary mathematical
notations and some special conventions.
The algorithm is described as a sequence of steps. Every step of the way
the composition of the actions to be performed and the direction of further
calculations. Moreover, if the current step does not indicate which step should
executed next, then the transition to the next step is carried out.
Example. Create an algorithm for finding the largest number out of three given ones
numbers a, b, c.
Compare a and b. If a>b, then take a as the maximum t, otherwise (a<=b) в
take b as the maximum.
Compare t and c. If t>c, then go to step 3. Otherwise (t maximum c (t=c).
Take t as the result.
Disadvantages of the verbal way of describing algorithms:
lack of visibility,
insufficient accuracy.

21.

Graphic method of description
algorithms are the way
presentation of the algorithm with
using generally accepted
graphic figures, each of
which is described by one or
several steps of the algorithm.
Inside the block is written
description of commands or conditions.
To indicate
execution sequences
blocks use communication lines
(connection lines).
There are certain
rules for describing algorithms in
in the form of block diagrams. (?)

22.

Description of algorithms using programs - an algorithm written on
programming language is called a program.
Verbal and graphic forms of recording the algorithm are intended for
person. An algorithm designed to be executed on a computer
written in a programming language (a language understandable by a computer). Now
Several hundred programming languages ​​are known. The most popular:
C, Pascal, BASIC, etc.
Example. Create an algorithm for finding the largest number out of three
given numbers a, b, c.
program MaxFromThree;
var
a, b, c, result: Real;
begin
Write("Enter a, b, c");
ReadLn(a, b, c);
if a>b then result:= a else result:= b;
if c>result then result:= c;
WriteLn("The maximum of three numbers is:", result:9:2)
end.
(?)

23.

Example 1
Given a one-dimensional array, calculate the arithmetic mean. (?)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
The solution of the problem
Program test;
Var i,summ:Integer;
array: array of Integer;
Begin
summ:=0;
for i:=1 to 5 do
begin
Write("Enter array element: ");
ReadLn(array[i]);
summ:=summ+massiv[i];
end;
Write("the arithmetic mean of the array is: ", summ/5);
WriteLn;
End.
(?)

24.

Example 2
Construct an algorithm for the process of throwing a body at an angle to the horizontal
(?)

25.

V.V. Vasiliev, L.A. Simak, A.M. Rybnikov. Mathematical and
computer modeling of processes and systems in the environment
MATLAB/SIMULINK. Textbook for undergraduate and graduate students. 2008
year. 91 pp.
Computer simulation of physical problems in
Microsoft Visual Basic. Textbook Author: Alekseev D.V.
SOLON-PRESS, 2009
Author: Orlova I.V., Polovnikov V.A.
Publisher: University textbook
Year: 2008

26.

Anfilatov, V. S. System analysis in management [Text]: textbook / V. S.
Anfilatov, A. A. Emelyanov, A. A. Kukushkin; edited by A. A. Emelyanova. – M.:
Finance and Statistics, 2002. – 368 p.
Venikov, V.A.. Theory of similarity and modeling [Text] / V.A. Venikov, G.V.
Venikov. - M.: Higher school, 1984. - 439 p.
Evsyukov, V. N. Analysis automatic systems[Text]: educational and methodological
guide for implementation practical tasks/ V. N. Evsyukov, A. M. Chernousova. –
2nd ed., Spanish – Orenburg: IPK GOU OSU, 2007. - 179 p.
Zarubin, V. S. Mathematical modeling in technology [Text]: textbook. for universities /
Ed. V. S. Zarubina, A. P. Krischenko. - M.: Publishing house of MSTU named after N.E. Bauman, 2001. –
496 pp.
Kolesov, Yu. B. Modeling of systems. Dynamic and hybrid systems [Text]:
uch. allowance / Yu.B. Kolesov, Yu.B. Senichenkov. - St. Petersburg. : BHV-Petersburg, 2006. - 224 p.
Kolesov, Yu.B. Systems modeling. Object-oriented approach [Text]:
Uch. allowance / Yu.B. Kolesov, Yu.B. Senichenkov. - St. Petersburg. : BHV-Petersburg, 2006. - 192 p.
Norenkov, I. P. Fundamentals of computer-aided design [Text]: textbook for
universities / I. P. Norenkov. – M.: Publishing house of MSTU im. N.E. Bauman, 2000. – 360 p.
Skurikhin, V.I. Mathematical modeling [Text] / V. I. Skurikhin, V. V.
Shifrin, V.V. Dubrovsky. - K.: Technology, 1983. – 270 p.
Chernousova, A. M. Software automated systems
design and management: tutorial[Text] / A. M. Chernousova, V.
N. Sherstobitova. - Orenburg: OSU, 2006. - 301 p.

To model any object specified using a mathematical model, as well as in the form of a sequence of procedures that simulate individual elementary processes, it is necessary to construct an appropriate modeling algorithm. The structure of a calculation program compiled in relation to the type of computer depends on the type of algorithm and the characteristics of the computer. The modeling algorithm must be written in a form that would primarily reflect the features of its construction without unnecessary minor details.

The creation of a modeling algorithm is a research stage when all issues of choosing a mathematical apparatus for research have already been resolved.

It is necessary to record the algorithm regardless of the characteristics of the computer. The ways to present a modeling algorithm are as follows: recording algorithms using operator diagrams; recording in programming languages; use of application software methods.

In relation to simulation modeling, this is called: operator diagrams of modeling algorithms (OSMA); programming languages; universal simulation models.

OSMA contains a sequence of operators, each of which represents a fairly large group of elementary operations. This entry does not contain detailed calculation schemes, but rather fully reflects the logical structure of the modeling algorithm. OSMA does not take into account the specifics of the command system. This happens when the program is built.

Requirements for operators: the operator must have a clear meaning related to the nature of the process being modeled; any operator can be expressed as a sequence of elementary operations.

The operators that make up the modeling algorithm are divided into main, auxiliary and service.

The main operators include operators used to simulate individual elementary acts of the process under study and the interaction between them. They implement the relationships of the mathematical model that describe the processes of functioning of real elements of the system, taking into account the influence of the external environment.

Auxiliary operators are not intended to simulate elementary acts of a process. They calculate those parameters and characteristics that are necessary for the work of the main operators.

Service operators are not bound by the relations of the mathematical model. They ensure the interaction of main and auxiliary operators, synchronize the operation of the algorithm, record the values ​​that are the results of the simulation, as well as process them.

When constructing a modeling algorithm, the main operators are first outlined to simulate the processes of functioning of individual elements of the system. They must be linked to each other in accordance with the formalized scheme of the process under study. Having determined which operators are necessary to ensure the operation of the main operators, auxiliary operators are introduced into the operator diagram to calculate the values ​​of these parameters.

Basic and auxiliary operators must cover all relations of the mathematical model, constituting the main part of the modeling algorithm. Then the service operators are introduced. The dynamics of the functioning of the system under study are considered and the interaction between the various phases of the process is taken into account, and the acquisition of information during modeling is analyzed.

To depict the operator diagram of modeling algorithms, it is convenient to use arithmetic and logical operators.

Arithmetic operators perform operations related to calculations. Denoted by A14 - arithmetic operator No. 14.

The property of an arithmetic operator is that after performing the operations it depicts, the action is transferred to another operator. - transfer of control from A14 to A16 (graphically indicated by an arrow).

Logical operators are designed to check the validity of specified conditions and develop signs indicating the result of the check.

The property of a logical operator is that after its implementation, control is transferred to one of the two operators of the algorithm, depending on the value of the attribute generated by the logical operator. It is denoted as Pi, and graphically as a circle or diamond, inside which the condition is symbolically written.

Image of control transfer - P352212. If the condition is met, then control is transferred to operator No. 22, if not, then to operator No. 12.

For operators of all classes, the designation of transfer of control to the operator immediately following him is omitted.

Transfer of control to this operator from other operators it is designated 16.14A18. Operator A18 receives control from operators No. 16 and No. 14..

The notation for the operator indicating the end of calculations is I.

Example. Consider the solution to the equation x2+px+q= 0,

Let's introduce the operators:

A1 -- calculation p/2;

A2 -- calculation p2/4-q;

A3-- calculation;

P4 -- checking condition D0;

A5 -- determination of real roots x12=-(р/2)R;

A6 -- determination of imaginary roots x12=-(р/2)jR;

I - end of calculations and output (x1,x2).

Operator diagram of the algorithm

A1 A2 A3 P46 A57 A6, 5Я7.

The operator diagram of the algorithm can be replaced with a drawing of the algorithm, the appearance of which is shown in Fig. 4.1.

Operator diagrams of algorithms allow you to move from a schematic representation of an algorithm to its recording in the form of a formula.

You can consider other examples of constructing operator schemes for modeling algorithms.

As independent task It is proposed to develop operator schemes for modeling algorithms to obtain random variables using the method of inverse functions, the method of stepwise approximation, to obtain the normal distribution law using limit theorems.

The most important types of operators are as follows. Computational operators(counting operators) describe an arbitrarily complex and cumbersome group of operators if it satisfies the requirements for algorithm operators (preparedness of source data, transfer of control to only one operator in the operator schemes of the modeling algorithm). Denoted by Ai.

Operators for generating implementations of random processes solve the transformation problem random numbers standard form in the implementation of random processes with given properties. Denoted by i.

Operators for the formation of non-random quantities form various constants and non-random functions of time. Denoted by Fi.

Counters count the quantities of different objects that have specified properties. They are designated Ki.

    formalization and algorithmization of systems functioning processes.

Methodology for the development and machine implementation of system models. Construction of conceptual models of systems and their formalization. Algorithmization of system models and their machine implementation. Obtaining and interpreting system modeling results.

Methodology for the development and machine implementation of system models.

Modeling using computer technology (computers, AVM, GVK) allows you to study the mechanism of phenomena occurring in a real object at high or low speeds, when it is difficult to perform full-scale experiments with an object

(or impossible) to track the changes occurring

for a short time, or when obtaining reliable results requires a long experiment.

The essence of machine modeling of a system is to conduct an experiment on a computer with a model, which is a certain software complex that formally and (or) algorithmically describes the behavior of system elements S in the process of its functioning, i.e. in their interaction with each other and the external environment E.

User requirements for the model. Let us formulate the basic requirements for the model M S.

1. The completeness of the model should provide the user with the opportunity

obtaining the required set of characteristics estimates

systems with the required accuracy and reliability.

2. The flexibility of the model should allow reproduction

various situations when varying the structure, algorithms

and system parameters.

3. Duration of development and implementation of a large system model

should be as minimal as possible, taking into account restrictions

with available resources.

4. The structure of the model should be block-based, i.e. allow

possibility of replacing, adding and excluding some parts

without reworking the entire model.

5. Information support should provide an opportunity

effective operation of the model with a database of systems of a certain

6. Software and hardware must provide efficient (in terms of speed and memory) machine implementation

models and convenient communication with it by the user.

7. Targeted activities must be implemented

(planned) machine experiments with a system model using

analytical-simulation approach in the presence of limited computing resources.

When simulating a system

S the characteristics of its functioning process are determined

model based M, built based on the existing initial

information about the modeling object. When receiving new information

about the object, its model is revised and clarified

taking into account new information.

Computer modeling of systems can be used

in the following cases: a) to study the system S before it is designed, in order to determine the sensitivity of the characteristic to changes in the structure, algorithms and parameters of the modeling object and the external environment; b) at the system design stage S for analysis and synthesis of various system options and selection among competing options that would satisfy a given criterion for assessing the effectiveness of the system under accepted restrictions; c) after completion of the design and implementation of the system, i.e. during its operation, to obtain information that complements the results of full-scale tests (operation) of the real system, and to obtain forecasts of the evolution (development) of the system over time.

System modeling stages:

    building a conceptual model of the system and its formalization;

    algorithmization of the system model and its machine implementation;

    obtaining and interpreting system simulation results.

Let's list these sub-stages:

1.1-statement of the problem of machine modeling of the system (goals, tasks for the system being created, a) recognition of the existence of the problem and the need for machine modeling;

b) choosing a method for solving a problem, taking into account available resources; c) determining the scale of the task and the possibility of dividing it into subtasks.);

1.2 - analysis of the system modeling problem (selection of evaluation criteria, selection of endogenous and exogenous variables, selection of methods, performing preliminary analyzes of the 2nd and 3rd stages);

1.3 - determination of requirements for initial information about the modeling object

and organization of its collection (carried out: a) selection of necessary information about the system S and external environment E; b) preparation of a priori data; c) analysis of available experimental data; d) selection of methods and means of preliminary processing of information about the system);

1.4 - putting forward hypotheses and making assumptions (about the functioning of the system, about the processes being studied);

1.5 - determination of model parameters and variables (input variables, output variables, model parameters, etc.);

1.6 - establishing the main content of the model (structure, algorithms of its behavior);

1.7 - justification of criteria for assessing the effectiveness of the system;

1.8 - definition of approximation procedures;

1.9 - description of the conceptual model of the system (a) the conceptual model is described in abstract terms and concepts; b) a description of the model is given using standard mathematical schemes; c) hypotheses and assumptions are finally accepted; d) the choice of procedure for approximating real processes when constructing is justified

1.10 - checking the reliability of the conceptual model;

1.11 - preparation of technical documentation for the first stage (a) detailed statement of the problem of system modeling S; b) analysis of the system modeling problem; c) criteria for assessing the effectiveness of the system; d) parameters and variables of the system model; e) hypotheses and assumptions adopted when constructing the model; f) description of the model in abstract terms and concepts; g) description of the expected results of system modeling S.);

2.1 - construction logic circuit models (building a system diagram, for example, using a block principle with all functional blocks);

2.2 - obtaining mathematical relationships (setting all functions that describe the system);

2.3 - checking the reliability of the system model; (checked: a) possibility

solving the problem; b) accuracy of reflection of the plan in logical

scheme; c) completeness of the logical diagram of the model; d) correctness

mathematical relations used)

2.4 - selection of tools for modeling (the final choice of a computer, AVM or GVM for the modeling process, taking into account that they will be accessible and quickly produce results);

2.5 - drawing up a plan for performing programming work (defining tasks and deadlines for their implementation, a) choosing a programming language (system) for the model is also taken into account; b) indication of the type of computer and devices necessary for modeling; c) assessment of the approximate amount of required RAM and external memory; d) estimated computer time costs for modeling; e) the estimated time spent on programming and debugging the program on a computer.);

2.6 - specification and construction of a program diagram (drawing up a logical block diagram),

2.7 - verification and verification of the reliability of the program scheme (Program verification - proof that the behavior of the program complies with the specification for the program);

2.8 - programming the model;

2.9 - checking the reliability of the program (must be carried out: a) by transferring the program back to the original circuit; b) testing individual parts of the program when solving various test problems; c) combining all parts of the program and testing it as a whole on a test example of modeling a variant of the system S) ;

2.10 - preparation of technical documentation for the second stage (a) logical diagram of the model and its description; b) an adequate program diagram and accepted notation; c) full text of the program; d) a list of input and output quantities with explanations; e) instructions for working with the program; f) assessment of computer time costs for modeling, indicating the required computer resources);

3.1 - cladding of a machine experiment with a system model (an experiment plan with initial parameters and all conditions is drawn up, the simulation time is determined);

3.2 - determination of requirements for computing facilities (what kind of computers are needed and how long they will work);

3.3 - carrying out working calculations (usually include: a) preparing sets of initial data for input into a computer; b) checking the source data prepared for input; c) carrying out calculations on a computer; d) obtaining output data, i.e. simulation results.);

3.4 - analysis of system modeling results (analysis of system output data and their further processing);

3.5 - presentation of modeling results (various visual representations in the form of graphs, tables, diagrams);

3.6 - interpretation of modeling results (transition from information obtained as a result of a machine experiment with a model to a real system);

3.7 - summing up the results of the simulation and issuing recommendations (the main results are determined, the hypotheses are tested);

3.8 - preparation of technical documentation for the third stage (a) plan for conducting a machine experiment; b) sets of initial data for modeling; c) results of system modeling; d) analysis and evaluation of modeling results; e) conclusions based on the obtained modeling results; indicating ways to further improve the machine model and possible areas of its application).

Thus, the system modeling process S boils down to the implementation of the listed sub-stages, grouped in the form of three stages.

At the stage of constructing a conceptual model Mx and its formalization, a study of the modeled object is carried out from the point of view of identifying the main components of the process of its functioning, the necessary approximations are determined and a generalized diagram of the system model is obtained S, which is converted into a machine model Mm at the second stage of modeling by sequential algorithmization and programming of the model.

The last third stage of modeling the system comes down to carrying out working calculations on a computer according to the received plan using selected software and hardware, obtaining and interpreting the results of modeling the system S, taking into account the influence of the external environment E.

Construction of conceptual models of systems and their formalization.

At the first stage of machine modeling - construction conceptual model Mx system S and its formalization - formulated model and its formal scheme is built, i.e., the main the purpose of this stage is the transition from a meaningful description

object to its mathematical model, in other words, the process of formalization.

It is most rational to build a model of the system’s functioning according to the block principle.

In this case, three autonomous groups of blocks of such a model can be distinguished. The blocks of the first group represent a simulator of environmental influences E to system 5; blocks of the second group are the actual model of the process of functioning of the system under study S; blocks of the third group - auxiliary

and serve for the machine implementation of blocks of the first two groups, as well as for recording and processing simulation results.

Conceptual model - subprocesses of the system are displayed, processes that can not be considered are removed from the block system (they do not affect the operation of the model).

Read more about the drawing. The transition from a description of a system to its model in this interpretation comes down to excluding from consideration some minor elements of the description (elements

j_ 8,39 - 41,43 - 47). It is assumed that they do not have a significant impact on the course of processes studied using

models. Part of the elements (14,15, 28, 29, 42) replaced by passive connections h, reflecting the internal properties of the system (Fig. 3.2, b). Some of the elements (1 - 4. 10. 11, 24L 25)- replaced by input factors X and environmental influences v – Combined replacements are also possible: elements 9, 18, 19, 32, 33 replaced by passive connection A2 and environmental influences E.

Elements 22,23.36.37 reflect the impact of the system on the external environment y.

Mathematical models of processes. After moving from description

modeled system S to her model Mv built on a block basis

principle, it is necessary to build mathematical models of processes,

occurring in different blocks. Mathematical model

represents a set of relationships (for example, equations,

logical conditions, operators) defining characteristics

process of system functioning S depending on the

system structure, behavior algorithms, system parameters,

environmental influences E, initial conditions and time.

Algorithmization of system models and their machine implementation.

At the second stage of modeling - the stage of model algorithmization

and its machine implementation - a mathematical model formed

at the first stage, embodied in a specific machine

model. Practical implementation of the system.

Construction of modeling algorithms.

System operation process S can be considered as a sequential change in its states z=z(z1(t), z2(t),..., zk(t)) in k-dimensional space. Obviously, the task of modeling the process of functioning of the system under study S is the construction of functions z, on the basis of which it is possible to carry out calculations of interest

characteristics of the system functioning process.

To do this, the relationships connecting the functions must be described z (states) with variables, parameters and time, as well as initial conditions.

The considered principle of constructing modeling algorithms is called principle At. This is the most universal principle that allows us to determine the sequential states of the system functioning process S at specified intervals

At. But from the point of view of computer time costs, it sometimes turns out to be uneconomical.

When considering the functioning processes of some systems, you can find that they are characterized by two types of states:

1) special, inherent in the process of functioning of the system only

at some points in time (moments of input input

or control actions, environmental disturbances, etc.);

2) non-singular, in which the process remains the rest of the time.

Special states are also characterized by the fact that the functions of states zi(t) and moments of time change abruptly, and between special states the change in coordinates zi(t) occurs smoothly and continuously or does not occur at all. So

Thus, following when modeling the system S only from its special states at those moments in time when these states occur can one obtain the information necessary for constructing functions z(t). Obviously, for the described type of systems, modeling algorithms can be constructed using the “principle of special states.” Let us denote the jump-like (relay) change of state z How bz, and the “principle of special states” - as principle bz.

For example, for a queuing system (Q-schemes) as special states, states can be selected at the moments of receipt of requests for service in device P and at the moments of termination of servicing of requests by channels TO, when the state of the system,

estimated by the number of applications contained in it, changes abruptly.

A convenient form of representing the logical structure of models of processes of functioning of systems and computer programs is a diagram. At various stages of modeling, generalized and detailed logical diagrams of modeling algorithms, as well as program diagrams, are compiled.

Generalized (enlarged) diagram of the modeling algorithm specifies the general procedure for modeling a system without any further details. The generalized diagram shows what needs to be done at the next modeling step, for example, accessing the random number sensor.

Detailed diagram of the modeling algorithm contains clarifications that are missing in the generalized scheme. A detailed diagram shows not only what should be done at the next step of system modeling, but also how to do it.

Logical diagram of the modeling algorithm represents the logical structure of the system functioning process model S. A logic diagram specifies a time-ordered sequence of logical operations associated with solving a modeling problem.

Program outline displays the order of software implementation of the modeling algorithm using specific mathematical software. A program diagram is an interpretation of the logical diagram of a modeling algorithm by a program developer based on a specific algorithmic language.

Obtaining and interpreting system modeling results.

At the third stage of modeling - the stage of obtaining and interpreting modeling results - the computer is used to carry out working calculations using a compiled and debugged program.

The results of these calculations allow us to analyze and formulate conclusions about the characteristics of the process of functioning of the simulated system S.

During a machine experiment, the behavior of the model under study is studied. M process of system functioning S at a given time interval.

Often simpler evaluation criteria are used, for example the probability of a certain state of the system at a given point in time t*, absence of failures and failures in the system over the interval, etc. When interpreting the simulation results, various statistical characteristics are calculated that need to be calculated.

Sovetov B.Ya., Yakovlev S.A.

Systems modeling. 4th ed. – M.: Higher School, 2005. – P. 84-106.

The second stage of modeling is the stage of model algorithmization and its machine implementation. This stage is a stage aimed at implementing ideas and mathematical schemes in the form of a machine model M systems functioning process S.

System operation process S can be considered as a sequential change of its states in k-dimensional space. The task of modeling the process of functioning of the system under study S is the construction of functions z, on the basis of which it is possible to calculate the characteristics of interest in the process of system functioning. This requires relationships connecting the functions z with variables, parameters and time, as well as initial conditions at the moment of time t=t 0 .

There are two types of system states:

  • 1) special, inherent in the process of functioning of the system only at certain points in time;
  • 2) non-singular, in which the process remains the rest of the time. In this case the state function z i (t) can change abruptly, and between special ones - smoothly.

Modeling algorithms can be built according to the “principle of special states”. Let us denote the jump-like (relay) change of state z How z, and the “principle of special states” - as principle z.

« Principle z" makes it possible for a number of systems to significantly reduce the cost of computer time for the implementation of modeling algorithms. mathematical modeling model statistical

A convenient form of representing the logical structure of models of processes of functioning of systems and computer programs is a diagram. At various stages of modeling, the following schemes of modeling algorithms and programs are compiled:

Generalized (enlarged) diagram of the modeling algorithm specifies the general procedure for modeling a system without any further details.

Detailed diagram of the modeling algorithm contains clarifications that are missing in the generalized scheme.

Logical diagram of the modeling algorithm represents the logical structure of the system functioning process model S.

Program outline displays the order of software implementation of the modeling algorithm using specific mathematical software. A program diagram is an interpretation of the logical diagram of a modeling algorithm by a program developer based on a specific algorithmic language.

Stages of algorithmization of the model and its machine implementation:

  • 1. Construction of a logical diagram of the model.
  • 2. Obtaining mathematical relationships.
  • 3. Checking the reliability of the system model.
  • 4. Selection of tools for modeling.
  • 5. Drawing up a plan for performing programming work.
  • 6. Specification and construction of the program diagram.
  • 7. Verification and verification of the reliability of the program scheme.
  • 8. Carrying out model programming.
  • 9. Checking the reliability of the program.
  • 10. Drawing up technical documentation for the second stage.

Send your good work in the knowledge base is simple. Use the form below

Students, graduate students, young scientists who use the knowledge base in their studies and work will be very grateful to you.

Posted on http://www.allbest.ru/

Posted on http://www.allbest.ru/

Introduction

1. Analytical review existing methods and means of solving the problem

1.1 Concept and types of modeling

1.2 Numerical calculation methods

1.3 General concept of the finite element method

2. Algorithmic analysis of the problem

2.1 Problem statement

2.2 Description of the mathematical model

2.3 Graphic diagram algorithm

3. Software implementation of the task

3.1 Deviations and tolerances of cylindrical pipe threads

3.2 Implementation of deviations and tolerances of cylindrical pipe threads in the Compass software

3.3 Implementation of the task in the C# programming language

3.4 Implementation of a structural model in ANSYS package

3.5 Study of the obtained results

Conclusion

List of used literature

Introduction

IN modern world Increasingly, there is a need to predict the behavior of physical, chemical, biological and other systems. One of the ways to solve the problem is to use a fairly new and relevant scientific direction - computer modeling, a characteristic feature of which is high visualization of the stages of calculations.

This work is devoted to the study of computer modeling in solving applied problems. Such models are used to obtain new information about the modeled object for an approximate assessment of the behavior of systems. In practice, such models are actively used in various fields of science and production: physics, chemistry, astrophysics, mechanics, biology, economics, meteorology, sociology, other sciences, as well as in applied and technical problems in various fields of radio electronics, mechanical engineering, automotive industry and others. The reasons for this are obvious: and this is the opportunity to quickly create a model and quickly make changes to the source data, enter and adjust Extra options models. Examples include studying the behavior of buildings, parts and structures under mechanical load, predicting the strength of structures and mechanisms, modeling transport systems, designing materials and its behavior, designing Vehicle, weather forecasting, work emulation electronic devices, simulated crash tests, testing the strength and adequacy of pipelines, thermal and hydraulic systems.

Purpose course work is the study of computer modeling algorithms, such as the finite element method, the boundary difference method, the finite difference method with further application in practice for calculation threaded connections for strength; Development of an algorithm for solving a given problem with subsequent implementation in the form software product; ensure the required calculation accuracy and evaluate the adequacy of the model using different software products.

1 . Analytical review of existing methods and means for solving the problem

1.1 Concept and types of modelsAndroving

Research problems solved by modeling various physical systems can be divided into four groups:

1) Direct problems, in the solution of which the system under study is specified by the parameters of its elements and the parameters of the initial mode, structure or equations. It is required to determine the response of the system to the forces (disturbances) acting on it.

2) Inverse problems, in which, based on a known reaction of a system, it is required to find the forces (perturbations) that caused this reaction and force the system under consideration to arrive at a given state.

3) Inverse problems that require determining the parameters of the system based on the known course of the process, described by differential equations and the values ​​of forces and reactions to these forces (disturbances).

4) Inductive problems, the solution of which is aimed at drawing up or clarifying equations that describe processes occurring in a system whose properties (disturbances and reactions to them) are known.

Depending on the nature of the processes being studied in the system, all types of modeling can be divided into the following groups:

Deterministic;

Stochastic.

Deterministic modeling represents deterministic processes, i.e. processes in which the absence of any random influences is assumed.

Stochastic modeling depicts probabilistic processes and events. In this case, a number of realizations of a random process are analyzed and the average characteristics are estimated, i.e. a set of homogeneous implementations.

Depending on the behavior of the object over time, modeling is classified into one of two types:

Static;

Dynamic.

Static modeling serves to describe the behavior of an object at any point in time, and dynamic modeling reflects the behavior of an object over time.

Depending on the form of representation of the object (system), we can distinguish

Physical modeling;

Math modeling.

Physical modeling differs from observation of a real system (full-scale experiment) in that research is carried out on models that preserve the nature of phenomena and have a physical similarity. An example is a model of an aircraft being studied in a wind tunnel. In the process of physical modeling, some characteristics of the external environment are specified and the behavior of the model under given external influences is studied. Physical modeling can take place on real and unreal time scales.

Mathematical modeling is understood as the process of establishing a correspondence between a given real object and a certain mathematical object, called a mathematical model, and the study of this model on a computer in order to obtain the characteristics of the real object in question.

Mathematical models are built on the basis of laws identified by fundamental sciences: physics, chemistry, economics, biology, etc. Ultimately, one or another mathematical model is chosen on the basis of practice criteria, understood in a broad sense. After the model is formed, it is necessary to study its behavior.

Any mathematical model, like any other, describes a real object only with a certain degree of approximation to reality. Therefore, in the modeling process it is necessary to solve the problem of correspondence (adequacy) of the mathematical model and the system, i.e. conduct additional research into the consistency of simulation results with the real situation.

Mathematical modeling can be divided into the following groups:

Analytical;

Imitation;

Combined.

Using analytical modeling, the study of an object (system) can be carried out if explicit analytical dependencies are known that connect the desired characteristics with the initial conditions, parameters and variables of the system.

However, such dependencies can only be obtained for relatively simple systems. As systems become more complex, studying them using analytical methods encounters significant difficulties that are often insurmountable.

In simulation modeling, the algorithm that implements the model reproduces the process of system functioning over time, and the elementary phenomena that make up the process are simulated while preserving the logical structure, which allows, from the source data, to obtain information about the states of the process at certain points in time in each link of the system.

The main advantage of simulation modeling compared to analytical modeling is the ability to solve more complex problems. Simulation models make it possible to quite simply take into account factors such as the presence of discrete and continuous elements, nonlinear characteristics of system elements, numerous random influences, etc.

Currently, simulation modeling is often the only practically available method for obtaining information about the behavior of a system, especially at the design stage.

Combined (analytical-simulation) modeling allows you to combine the advantages of analytical and simulation modeling.

When building combined models, a preliminary decomposition of the object’s functioning process into its constituent subprocesses is carried out, and for those of them, where possible, analytical models are used, and simulation models are built for the remaining subprocesses.

From the point of view of describing an object and depending on its nature, mathematical models can be divided into models:

analog (continuous);

digital (discrete);

analog-to-digital.

By analogue model we mean a similar model that is described by equations relating continuous quantities. A digital model is understood as a model that is described by equations relating discrete quantities presented in digital form. By analog-to-digital we mean a model that can be described by equations connecting continuous and discrete quantities.

1.2 Numerical methodsWithcouple

Solving a problem for a mathematical model means specifying an algorithm to obtain the required result from the original data.

Solution algorithms are conventionally divided into:

precise algorithms that allow you to obtain the final result in a finite number of actions;

approximate methods - allow, due to certain assumptions, to reduce the solution to a problem with an exact result;

numerical methods - involve the development of an algorithm that provides a solution with a given controlled error.

Solving problems of structural mechanics is associated with great mathematical difficulties, which are overcome with the help of numerical methods, which make it possible, using a computer, to obtain approximate solutions that satisfy practical purposes.

The numerical solution is obtained by discretization and algebraization of the boundary value problem. Discretization is the replacement of a continuous set with a discrete set of points. These points are called grid nodes, and only at them are the function values ​​searched. In this case, the function is replaced by a finite set of its values ​​at the grid nodes. Using the values ​​at the grid nodes, partial derivatives can be approximately expressed. As a result, the partial differential equation is transformed into algebraic equations (algebraization of the boundary value problem).

Depending on the way discretization and algebraization are performed, various methods are distinguished.

The first method for solving boundary value problems that has become widespread is the finite difference method (FDM). IN this method discretization consists of covering the solution area with a grid and replacing a continuous set of points with a discrete set. A grid with constant step sizes (regular grid) is often used.

The MKR algorithm consists of three stages:

1. Construction of a grid in a given area. Approximate values ​​of the function (nodal values) are determined at the grid nodes. A set of node values ​​is a grid function.

2. Partial derivatives are replaced by difference expressions. In this case, the continuous function is approximated by a grid function. The result is a system of algebraic equations.

3. Solution of the resulting system of algebraic equations.

Another numerical method is the boundary element method (BEM). It is based on considering a system of equations that includes only the values ​​of variables at the boundaries of the region. The discretization scheme requires only the surface to be partitioned. The boundary of the region is divided into a number of elements and it is believed that it is necessary to find an approximate solution that approximates the original boundary value problem. These elements are called boundary elements. Discretizing only the boundary leads to a smaller system of problem equations than discretizing the whole body. BEM reduces the dimension of the original problem by one.

When designing various technical objects, the finite element method (FEM) is widely used. The emergence of the finite element method is associated with the solution of space research problems in the 1950s. Currently, the scope of application of the finite element method is very extensive and covers all physical problems that can be described by differential equations. The most important advantages of the finite element method are the following:

1. The material properties of adjacent elements do not have to be the same. This allows the method to be applied to bodies composed of several materials.

2. A curved region can be approximated using straight-line elements or described exactly using curved elements.

3. Item sizes may be variable. This allows you to enlarge or refine the network of dividing the area into elements, if necessary.

4. Using the finite element method, it is easy to consider boundary conditions with a discontinuous surface load, as well as mixed boundary conditions.

Solving problems using FEM contains the following steps:

1.Partition of a given area into finite elements. Numbering of nodes and elements.

2.Construction of finite element stiffness matrices.

3. Reduction of loads and impacts applied to finite elements to nodal forces.

4.Formation common system equations; taking into account boundary conditions. Solution of the resulting system of equations.

5. Determination of stresses and strains in finite elements.

The main disadvantage of FEM is the need to discretize the entire body, which leads to a large number of finite elements and, therefore, unknown problems. In addition, FEM sometimes leads to discontinuities in the values ​​of the quantities under study, since the method procedure imposes continuity conditions only at the nodes.

To solve the problem, the finite element method was chosen, since it is the most optimal for calculating a structure with a complex geometric shape.

1.3 General concept of the finite element method

The finite element method consists of breaking down a mathematical model of a structure into some elements, called finite elements. Elements are one-dimensional, two-dimensional and multi-dimensional. An example of finite elements is provided in Figure 1. The type of element depends on the initial conditions. The set of elements into which a structure is divided is called a finite element mesh.

The finite element method generally consists of the following steps:

1. Partitioning the area into finite elements. The division of an area into elements usually begins from its boundary, in order to most accurately approximate the shape of the boundary. Then the internal areas are divided. Often, the division of an area into elements is carried out in several stages. First, they are divided into large parts, the boundaries between which pass where the properties of the materials, geometry, and applied load change. Each subarea is then broken down into elements. After dividing the area into finite elements, the nodes are numbered. Numbering would be a trivial task if it did not affect the efficiency of subsequent calculations. If we consider the resulting system of linear equations, we can see that some non-zero elements in the coefficient matrix are between the two lines; this distance is called the bandwidth of the matrix. It is the numbering of nodes that affects the width of the stripe, which means that the wider the stripe, the more iterations are needed to obtain the desired answer.

modeling algorithm software ansys

Figure 1 - Some finite elements

2. Determination of the approximating function for each element. At this stage, the required continuous function is replaced by a piecewise continuous function defined on a set of finite elements. This procedure can be performed once for a typical area element and then the resulting function can be used for other area elements of the same type.

3. Combination of finite elements. At this stage, the equations relating to individual elements are combined, that is, into a system of algebraic equations. The resulting system is a model of the desired continuous function. We get the stiffness matrix.

4. Solution of the resulting system of algebraic equations. The real structure is approximated by many hundreds of finite elements, and systems of equations with many hundreds and thousands of unknowns arise.

Solving such systems of equations is the main problem in implementing the finite element method. The solution methods depend on the size of the resolving system of equations. In this regard, special methods for storing the stiffness matrix have been developed to reduce the volume required for this. random access memory. Stiffness matrices are used in each strength analysis method using a finite element mesh.

To solve systems of equations, various numerical methods are used, which depend on the resulting matrix; this is clearly visible in the case when the matrix is ​​not symmetrical; in this case, methods such as the conjugate gradient method cannot be used.

Instead of constitutive equations, a variational approach is often used. Sometimes a condition is set to ensure a small difference between the approximate and true solutions. Since the number of unknowns in the final system of equations is large, matrix notation is used. Currently, there are a sufficient number of numerical methods for solving a system of equations, which makes it easier to obtain the result.

2. Algorithmic analysis of the problem

2 .1 Problem statement

It is required to develop an application that simulates the stress-strain state of a flat structure and carry out a similar calculation in the Ansys system.

To solve the problem, it is necessary to: divide the area into finite elements, number the nodes and elements, set the characteristics of the material and boundary conditions.

The initial data for the project are a diagram of a flat structure with an applied distributed load and fastening (Appendix A), values ​​of material characteristics (elastic modulus -2*10^5 Pa, Poisson's ratio -0.3), load 5000H.

The result of the course work is obtaining the movements of the part in each node.

2.2 Description of the mathematical model

To solve the problem, the finite element method described above is used. The part is divided into triangular finite elements with nodes i, j, k (Figure 2).

Figure 2 - Finite element representation of a body.

The displacements of each node have two components, formula (2.1):

six components of displacements of element nodes form a displacement vector (d):

The displacement of any point inside the finite element is determined by relations (2.3) and (2.4):

When combining (2.3) and (2.4) into one equation, the following relation is obtained:

Deformations and displacements are related to each other as follows:

When substituting (2.5) into (2.6), we obtain relation (2.7):

Relationship (2.7) can be represented as:

where [B] is a gradient matrix of the form (2.9):

The shape functions linearly depend on the x, y coordinates, and therefore the gradient matrix does not depend on the coordinates of the point inside the finite element, and the deformations and stresses inside the finite element are constant in this case.

In a plane deformed state in an isotropic material, the matrix of elastic constants [D] is determined by formula (2.10):

where E is the elastic modulus, and is Poisson's ratio.

The finite element stiffness matrix has the form:

where h e is the thickness, A e is the area of ​​the element.

The equilibrium equation of the i-th node has the form:

To take into account the fastening conditions, there is the following method. Let there be some system N of equations (2.13):

In the case when one of the supports is motionless, i.e. U i =0, use the following procedure. Let U 2 =0, then:

that is, the corresponding row and column are set to zero, and the diagonal element is set to one. Accordingly, F 2 is also equal to zero.

To solve the resulting system, we choose the Gaussian method. The solution algorithm using the Gauss method is divided into two stages:

1. direct stroke: by elementary transformations above the lines, the system is reduced to a stepped or triangular shape, or it is established that the system is incompatible. The kth resolving row is selected, where k = 0…n - 1, and for each subsequent row the elements are converted

for i = k+1, k+2 … n-1; j = k+1,k+2 … n.

2. reverse: the values ​​of the unknowns are determined. From the last equation of the transformed system the value of the variable x n is calculated, after which from the penultimate equation it becomes possible to determine the variable x n -1 and so on.

2. 3 Graphic diagram of the algorithm

The presented graphical diagram of the algorithm shows the main sequence of actions performed when modeling a structural part. In block 1, the initial data is entered. Based on the entered data, the next step is the construction of a finite element mesh. Next, in blocks 3 and 4, local and global stiffness matrices are constructed, respectively. In block 5, the resulting system is solved by the Gaussian method. Based on the solution in block 6, the required movements in the nodes are determined, and the results are displayed. A brief graphical diagram of the algorithm is presented in Figure 7.

Figure 7 - Graphic diagram of the algorithm

3 . Aboutgrammaticallysuccessful implementation of the task

3.1 Deviations and tolerances of cylindrical pipe threads

Pipe cylindrical thread (GOST 6357-73) has a triangular profile with rounded peaks and valleys. This thread is mainly used for connecting pipes, pipeline fittings and fittings.

To achieve the proper joint density, special sealing materials (linen threads, red lead yarn, etc.) are placed in the gaps formed by the arrangement of the tolerance fields between the bolt cavities and the nut protrusions.

The maximum deviations of cylindrical pipe thread elements for diameter “1” of external and internal threads are given in tables 1 and 2, respectively.

Table 1 - deviations of external cylindrical pipe threads (according to GOST 6357 - 73)

Table 2 - deviations of pipe internal cylindrical threads (according to GOST 6357 - 73)

Limit deviations of the external thread of the minimum outer diameter, formula (3.1):

dmin=dн + ei (3.1)

where dн is the nominal size of the outer diameter.

The maximum deviations of the external thread of the maximum outer diameter are calculated using formula (3.2):

dmax=dн + es (3.2)

Limit deviations of external threads of minimum average diameter, formula (3.3):

d2min=d2 + ei (3.3)

where d2 is the nominal size of the average diameter.

Limit deviations of external threads of maximum average diameter are calculated using formula (3.4):

d2max=d2 + es (3.4)

Limit deviations of the external thread of the minimum internal diameter, formula (3.5):

d1min=d1 + ei (3.5)

where d1 is the nominal size of the internal diameter.

The maximum deviations of the external thread of the maximum internal diameter are calculated using formula (3.6):

d1max=d1 + es (3.6)

Limit deviations of the internal thread of the minimum outer diameter, formula (3.7):

Dmin=Dн + EI, (3.7)

where Dн is the nominal size of the outer diameter.

The maximum deviations of the internal thread of the maximum outer diameter are calculated using formula (3.8):

Dmax=Dн + ES (3.8)

Limit deviations of internal threads of minimum average diameter, formula (3.9):

D2min=D2 + EI (3.9)

where D2 is the nominal size of the average diameter.

Limit deviations of internal threads of maximum average diameter are calculated using formula (3.10):

D2max=D2 + ES (3.10)

Limit deviations of the internal thread of the minimum internal diameter, formula (3.11):

D1min=D1 + EI (3.11)

where D1 is the nominal size of the internal diameter.

The maximum deviations of the internal thread of the maximum internal diameter are calculated using formula (3.12):

D1max=D1 + ES (3.12)

A fragment of the thread sketch can be seen in Figure 6 of Chapter 3.2.

3.2 Implementation of deviations and tolerances of cylindrical pipe threads inSoftware "Compass"

Figure 6 - Pipe cylindrical thread with tolerances.

The coordinates of the points are shown in Table 1 of Appendix D

Copying a constructed thread:

Select the thread > Editor > copy;

Thread insertion:

We place the cursor at the place we need>editor>paste.

The result of the constructed thread can be seen in Appendix D

3.3 Implementation of the taskchi in the C# programming language

To implement the strength calculation algorithm, the MS Visual Studio 2010 development environment was selected using the language C# from the package . NETFramework 4.0. Using the object-oriented programming approach, we will create classes containing the necessary data:

Table 3 - Element class structure

Variable name




Top