An algorithm for symbolic solving of differential equations and estimation of accuracy Natalia Malaschonok Tambov State University, Internatsionalnaya 33, 392622 Tambov, Russia email: [email protected] An algorithm, which is produced in this article, is based on the application of the Laplace transform method for solving differential equations systems. This method provides the symbolic character of computations. However there exists a fragment of numerical calculations. It concerns the computing of polynomial roots. This is the operation that requires an estimation of accuracy for calculations. An algorithm for such estimation is produced in this paper. The Laplace transform has been very useful in various problems of differential equations theory We consider systems of ordinary linear differential equations with constant coefficients, nonzero initial conditions and right-hand parts as composite functions, reducible to the sums of exponents with the polynomial coefficients. A case of continuous right-hand parts was discussed in [NMal05a], [NMal05b]. Here we consider a general case of composite functions and obtain estimations in a general case and of higher exactness. In the first section of the paper an algorithm for solving systems of differential equations is produced. At first a preparation of data functions for the formal Laplace transform is performed. It is achieved with application of Heaviside function and moving the obtained functions into the bounds of smoothness intervals. The next step is solving the algebraic system with polynomial coefficients and the right hand part, obtained after the Laplace transform of the data system. There are algorithms, that are efficient for solving this type of equations, and are different for various types of such systems. Then the obtained solution of algebraic system is prepared to the inverse Laplace transform. It is reduced to the sum of partial fractions with exponential coefficients. Just at this stage it is necessary to calculate the error of the denominator roots, sufficient for the required accuracy of differential equations solutions. The second section is devoted to an estimation of an error of calculations. sufficient to obtain a preassigned accuracy of solution of a differential equations system. The complexity of computations is discussed in the third section. In the last section an example is considered. 1

References [NMal05a] Malaschonok N.: An algorithm to settle the necessary exactness in Laplace transform method. In: Computer science and information technologies. Yerevan (2005) 453-456 [NMal05b] Malaschonok N.: Estimations in Laplace transform method for solutions of differential equations in symbolic computations. In: Differential equations and computer algebra systems. Minsk (2005) 195199 [NMal06] Malaschonok N.: Parallel Laplace Method with Assured Accuracy for Solutions of Differential Equations by symbolic computations. In: Computer Algebra and Scientific Computing, CASC 2006, LNCS 4196, Springer, Berlin (2006) 251-261

2

An algorithm for symbolic solving of differential ...

The next step is solving the algebraic system with polynomial coefficients and the right ... ferential equations and computer algebra systems. Minsk (2005) 195-.

27KB Sizes 0 Downloads 244 Views

Recommend Documents

An application of genetic algorithm method for solving ...
To expound the potential use of the approach, a case example of the city Kolkata, ... From the mid-'60s to early '70s of the last century, a .... early stage. ... objective Fk(X), k = 1, 2, ..., K. Then the fuzzy goal ..... enforcement of traffic rul

An algorithm for solving the open gallery problem
ABSTRACT. Given a polygon and a desired number of guards resulting after performing an reflex vertex straddling (RVS) deploy- ment or a polygonal ...

A Practical Algorithm for Solving the ... - Research at Google
Aug 13, 2017 - from the data. Both of these problems result in discovering a large number of incoherent topics that need to be filtered manually which limits the ...

A heuristic ant algorithm for solving QoS multicast ...
the network, real time services will be affected. ... quality ofreal time services can be guaranteed. ... (1) applying Dijkstra algorithm to find the shortest path, (2).

A Competent Genetic Algorithm for Solving Permutation ...
Jan 30, 2002 - ... Volume 6) (Genetic Algorithms and Evolutionary Computation) Q2 Cloud, TFT 2. ... algorithm, combines some of the latest in competent GA technology to ... Competent GAs are those designed for principled solutions of hard ...

Hybrid Taguchi-Harmony Search Algorithm for Solving ...
Finally, it is applied to the shape design optimization of a vehicle component to illustrate how the present approach can be applied for solving multi-objective shape design optimization problems. Keywords: Design optimization, Harmony search algorit

A multigrid-in-time algorithm for solving evolution ...
our multigrid-in-time algorithm simply calls an existing time-stepping routine. However, to ...... Algebraic Multigrid Cycle on HPC Platforms, in 25th ACM International Conference on Supercomputing,. Tucson, AZ ... App. Math. and Comp. Sci., 5.

An Evolutionary Algorithm for Homogeneous ...
fitness and the similarity between heterogeneous formed groups that is called .... the second way that is named as heterogeneous, students with different ...

An Algorithm for Implicit Interpolation
More precisely, we consider the following implicit interpolation problem: Problem 1 ... mined by the sequence F1,...,Fn and such that the degree of the interpolants is at most n(d − 1), ...... Progress in Theoretical Computer Science. Birkhäuser .

An Adaptive Fusion Algorithm for Spam Detection
An email spam is defined as an unsolicited ... to filter harmful information, for example, false information in email .... with the champion solutions of the cor-.

An Algorithm for Implicit Interpolation
most n(d − 1), where d is an upper bound for the degrees of F1,...,Fn. Thus, al- though our space is ... number of arithmetic operations required to evaluate F1,...,Fn and F, and δ is the number of ...... Progress in Theoretical Computer Science.

An Adaptive Fusion Algorithm for Spam Detection
adaptive fusion algorithm for spam detection offers a general content- based approach. The method can be applied to non-email spam detection tasks with little ..... Table 2. The (1-AUC) percent scores of our adaptive fusion algorithm AFSD and other f

An Algorithm for Nudity Detection
importance of skin detection in computer vision several studies have been made on the behavior of skin chromaticity at different color spaces. Many studies such as those by Yang and Waibel (1996) and Graf et al. (1996) indicate that skin tones differ

An Implementation of a Backtracking Algorithm for the ...
sequencing as the Partial Digest Problem (PDP). The exact computational ... gorithm presented by Rosenblatt and Seymour in [8], and a backtracking algorithm ...

An exact algorithm for energy-efficient acceleration of ...
tion over the best single processor schedule, and up to 50% improvement over the .... Figure 3: An illustration of the program task de- pendency graph for ... learning techniques to predict the running time of a task has been shown in [5].

An Improved Algorithm for the Solution of the ...
tine that deals with duplicate data points, a routine that guards against ... numerical algorithm has been tested on several data sets with duplicate points and ...

Development of an Avoidance Algorithm for Multiple ...
Traffic Collision Avoid- ance System (TCAS) II is a collision avoidance .... the controlled vehicle among unexpected obstacles” [3]. The VFF method works in.

An Iterative Algorithm for Segmentation of Isolated ...
of overlapped, connected and merged characters with in a word. Structural features are helpful in segmentation of machine printed text but these are of little help ...

An exact algorithm for energy-efficient acceleration of ...
data transfers given that the adjacent nodes are executed on different processors. Input data nodes represent the original input data residing in CPU memory.

Implementation of a Symbolic Circuit Simulator for ... - Semantic Scholar
as a simulator for large network analysis due to their complexity and ..... pairs have different topologies, they lead to two identical sub-GRDDs. We call such ...

Symbolic method for simplifying AND-EXOR representations of ...
Oct 25, 1995 - tionally, Reed-Muller designs have been seen as more costly to implement ... 0 IEE, 1996. IEE Proceedings online no. 19960196 .... Sft;rJ 1: Store the input function truth table as ininterm strings. Srep 2: Minterni strings ...

An Improved Divide-and-Conquer Algorithm for Finding ...
Zhao et al. [24] proved that the approximation ratio is. 2 − 3/k for an odd k and 2 − (3k − 4)/(k2 − k) for an even k, if we compute a k-way cut of the graph by iteratively finding and deleting minimum 3-way cuts in the graph. Xiao et al. [23