Standard

Numeric deduction in symbolic computation. Application to normalizing transformations. / Shevchenko, Ivan I.

In: Journal of Symbolic Computation, Vol. 24, No. 1, 01.01.1997, p. 103-111.

Research output: Contribution to journal › Article › peer-review

Harvard

Shevchenko, II 1997, 'Numeric deduction in symbolic computation. Application to normalizing transformations', Journal of Symbolic Computation, vol. 24, no. 1, pp. 103-111. https://doi.org/10.1006/jsco.1997.0115

APA

Shevchenko, I. I. (1997). Numeric deduction in symbolic computation. Application to normalizing transformations. Journal of Symbolic Computation, 24(1), 103-111. https://doi.org/10.1006/jsco.1997.0115

Vancouver

Shevchenko II. Numeric deduction in symbolic computation. Application to normalizing transformations. Journal of Symbolic Computation. 1997 Jan 1;24(1):103-111. https://doi.org/10.1006/jsco.1997.0115

Author

Shevchenko, Ivan I. / Numeric deduction in symbolic computation. Application to normalizing transformations. In: Journal of Symbolic Computation. 1997 ; Vol. 24, No. 1. pp. 103-111.

BibTeX

@article{5e0745f05ec64870a06d469a847f6112,
title = "Numeric deduction in symbolic computation. Application to normalizing transformations",
abstract = "Algorithms of numeric (in exact arithmetic) deduction of analytical expressions, proposed and described by Shevchenko and Vasiliev (1993), are developed and implemented in a computer algebra code. This code is built as a superstructure for the computer algebra package by Shevchenko and Sokolsky (1993a) for normalization of Hamiltonian systems of ordinary differential equations, in order that high complexity problems of normalization could be solved. As an example, a resonant normal form of a Hamiltonian describing the hyperboloidal precession of a dynamically symmetric satellite is derived by means of the numeric deduction technique. The technique provides a considerable economy, about 30 times in this particular application, in computer memory consumption. It is naturally parallelizable. Thus the economy of memory consumption is convertible into a gain in computation speed.",
author = "Shevchenko, {Ivan I.}",
year = "1997",
month = jan,
day = "1",
doi = "10.1006/jsco.1997.0115",
language = "English",
volume = "24",
pages = "103--111",
journal = "Journal of Symbolic Computation",
issn = "0747-7171",
publisher = "Elsevier",
number = "1",

}

RIS

TY - JOUR

T1 - Numeric deduction in symbolic computation. Application to normalizing transformations

AU - Shevchenko, Ivan I.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - Algorithms of numeric (in exact arithmetic) deduction of analytical expressions, proposed and described by Shevchenko and Vasiliev (1993), are developed and implemented in a computer algebra code. This code is built as a superstructure for the computer algebra package by Shevchenko and Sokolsky (1993a) for normalization of Hamiltonian systems of ordinary differential equations, in order that high complexity problems of normalization could be solved. As an example, a resonant normal form of a Hamiltonian describing the hyperboloidal precession of a dynamically symmetric satellite is derived by means of the numeric deduction technique. The technique provides a considerable economy, about 30 times in this particular application, in computer memory consumption. It is naturally parallelizable. Thus the economy of memory consumption is convertible into a gain in computation speed.

AB - Algorithms of numeric (in exact arithmetic) deduction of analytical expressions, proposed and described by Shevchenko and Vasiliev (1993), are developed and implemented in a computer algebra code. This code is built as a superstructure for the computer algebra package by Shevchenko and Sokolsky (1993a) for normalization of Hamiltonian systems of ordinary differential equations, in order that high complexity problems of normalization could be solved. As an example, a resonant normal form of a Hamiltonian describing the hyperboloidal precession of a dynamically symmetric satellite is derived by means of the numeric deduction technique. The technique provides a considerable economy, about 30 times in this particular application, in computer memory consumption. It is naturally parallelizable. Thus the economy of memory consumption is convertible into a gain in computation speed.

UR - http://www.scopus.com/inward/record.url?scp=0031188234&partnerID=8YFLogxK

U2 - 10.1006/jsco.1997.0115

DO - 10.1006/jsco.1997.0115

M3 - Article

AN - SCOPUS:0031188234

VL - 24

SP - 103

EP - 111

JO - Journal of Symbolic Computation

JF - Journal of Symbolic Computation

SN - 0747-7171

IS - 1

ER -

ID: 45990250