SU543001A1 - Integrator - Google Patents

Description

The system of differential equations is entered into input block 1, oTKvna is fed to decomposition block 2. In decomposition block 2, a given system of differential equations is decomposed into simple functions, the sequence of these functions is determined, i.e. the composition of simple automata is calculated to calculate a given system of differential equations (iodine by a simple automaton is meant an automaton implementing a simple function).

Defining an automaton composition means specifying the sequence number of the automaton in the problem solving program, the operation code performed by the automaton, and the automaton numbers from whose outputs the arguments of this automaton are given, i.e., the program of each automaton.

In order to compose a program of the automaton, the type 11 word type analysis node analyzes the type of the next word coming from the input unit 1. If the word is one of the variables of the differential equation system or a number, it is transmitted to the memory node of the operands 12. The same word is a functional symbol or by a separator, it is transmitted to the priority analysis node 13, where it is compared with the next character in the memory node of the function symbols 14. The incoming function symbol is written to the inayuschy functional symbols unit 14 only after it learned of all the regular characters that have no priority is mensche priority analyzing character. The extracted symbol is transmitted to the program generation unit of the simple automaton 15. At the same time, the signal from the priority node 13 also receives the corresponding number of successive operands in the storage node of operands 12, in which the number of the extracted function symbol is stored as the next operand. In the simple machine 15 generation program, the program of a simple machine is formed from the number of the next functional symbol, the operation code and the onoraid numbers.

The resulting program is minimal, since it can contain automata that compute one and the same function if this function is used several times in the task record.

This program is transferred from the decomposition unit 2 to minimization unit 3, where odioiac automata are excluded from the program and automata are re-switched from the excluded ones to the rest, and the simple aBTOiMaTOB switching program is completed between them to solve a given system of differential equations. For this, the automata program enters the memory node of the simple automata 16, from where they are output to the node generating the program for switching the simple automats.

17. In this node, the numbers of the automata that produce the desired derivatives and variables of a given system of differential equations are determined, and in place of the numbers of the operands, which are variable or derivative, write the numbers of these automata. After the switching program for all machines is completed, the programs of each machine are alternately

are transferred to the comparison register 28. The next program, located in the comparison register 18, is compared in the comparison node 19 with the programs of the remaining automata, which are output from the simple memory node

augments 16 to another input of the comparison site IV. In case of coincidence of operation codes and numbers of operands of compared automata, they calculate the same function. Then one of the automata is excluded from the program, the other automata are reconnected from the excluded one to the rest and the numbering of all subsequent automata is performed. This is accomplished by the switching node 20 according to a signal from the reference node 19.

11, after minimization, the program is transmitted to switch 4, in which it is viewed sequentially from the first machine to the last. According to the signal from the switch 4 for each young machine in the ier block

Memory 5 is searched for the switching program of a set of decisive CIM units implementing this simple machine, as well as the initial values of all the functions that are necessary for this set. It all comes in

switch 4, where the switching program joins the previously found programs and switches these programs together. After that, the array of the switching program is fed to the input of the input register 7 for organizing the switching of the decision blocks to solve the problem, and the array of initial values is fed to the scaling block 6, where the scaling factors are calculated that provide

correct scale relationships when solving a problem; the initial values of the functions are scaled in accordance with the obtained scale factors and the pa input of the register 7 is transmitted to use them

when solving a problem.

The invention makes it possible to reduce the time needed to prepare a task for a solution from several months to several hours and even minutes.

Claims (1)

Invention Formula An integrating device containing an input unit, a switch, the outputs of which are connected respectively to the input of the first memory unit, through a scaling unit — to the first input of the input register, directly with the second input of the input register, which is connected bilaterally with the second memory block and the control unit connected by two-way communications to the second block and computed by a two-way communication block connected to the second block memory, the output of the first memory block is connected to the first input of the switch, characterized in that, in order to improve speed, the decomposition and minimization blocks are inserted into it, and the input of the decomposition block is connected to the output of the block in ode, and the output - to the input of the minimization unit, whose output is connected to the second input of the commentator. J