Application of genetic algorithms to the algebraic simplification of tensor polynomials
| Autor: | M. Kavian, Keith O. Geddes, R. G. McLenaghan |
|---|---|
| Rok vydání: | 1997 |
| Předmět: |
Discrete mathematics
Polynomial Riemann curvature tensor Cultural algorithm Symbolic computation Nondeterministic algorithm Algebra symbols.namesake Tensor (intrinsic definition) ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION symbols Covariant transformation Genetic representation Mathematics |
| Zdroj: | ISSAC |
| DOI: | 10.1145/258726.258759 |
| Popis: | Thr design of a new algorithm for the simplification of expressions which are polynomial in the Riemann tensor [11] and its covariant derivatives is described. The simplification of such indicial expressions is complex and should be based on nondeterministic algorithms, Due to the large number ofpossible terms the nondeterministic algorithms should be complemented by stochastic methods to control the size of the search space, We show that appropriately implemented genetic algorithms can provide solutions to these problems. Thealgorithms have been implemented inthe MapleTensor system for performing indicial and component tensor calculations using symbolic computation. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|