Skip to main content
Article thumbnail
Location of Repository

Optimized Programming of Computing Algorithms Using Symbolical Address Structures

By Genādijs Burovs

Abstract

Abstract – Implementation of computing algorithms for problems of technical object identification is offered to perform in the space of symbolical address models. It allows to optimize the developed programs in order to reduce the amount of executed arithmetic operations and to reduce the time necessary for identification. The suggested models are mathematically formalized; they possess regular and recursive properties. It allows to automate the process of software creation depending on the character of the problem being solved. The method of monitoring allows to carry out imitation modelling of programs and to investigate the dynamics of computing process. In this case, it is possible to estimate the usability of algorithms, to reveal the character of arising singular situations and to prevent them. The developed structure of address models allows to realize parallel operating modes in computers and to increase the execution speed of algorithms. On the basis of such models, analytical expressions for algorithms can be derived and important theoretical results can be obtained

Topics: symbolical combinatory model, parallel algorithm, polynomial approximation, numerical stability
OAI identifier: oai:ortus.rtu.lv:8794
Sorry, our data provider has not provided any external links therefore we are unable to provide a link to the full text.

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.