Article

Free access

Application of genetic algorithms to the algebraic simplification of tensor polynomials

Authors:

M. Kavian,

R. G. McLenaghan,

K. O. GeddesAuthors Info & Claims

ISSAC '97: Proceedings of the 1997 international symposium on Symbolic and algebraic computation

Pages 93 - 100

https://doi.org/10.1145/258726.258759

Published: 01 July 1997 Publication History

PDF eReader

References

[1]

BUTLER, G., AND LAM, C. W. H. A general backtrack algorithm for the isomorphism problem of combinatorial objects. Journal o/ Symbolic Computation 1 (1985), 363 -381.

Digital Library

Google Scholar

[2]

FULLING, S. A., KING, R. C., WYBOURNE, B. G., AND CUMMINS) C. J. Normal forms for tensor polynomials: I. the riemann tensor. Classical Quantum Gravity, 9 (1992), 1151,1197.

Crossref

Google Scholar

[3]

GOLDBERG, D. E. Genetic Algorithms in Search, Optimization ~ Machine Learning. Addison-Wesley, 1989.

Digital Library

Google Scholar

[4]

HAMERMESH, M. Group Theory and its Application to Physical Problems. Addison-Wesley, 1962.

Crossref

Google Scholar

[5]

HOFFMAN, C. M. Group-Theoretic Algorithms and Graph Isomorphism, col. 136. Springer Lec. Notes Comp. Sci., 1982.

Google Scholar

[6]

HOLLAND, J. H. Adaptation in natural and artificial systems. University of Michigan Press (1975).

Digital Library

Google Scholar

[7]

KAVIAN, M., MCLENAGHAN, R. G., AND GEDDES, K. O. Mapletensor: Progress report on a new system for performing indicial and component tensor calculations using symbolic computation. In Proceedings of the ISSAC 96 (1996), Y. N. Lakshman, Ed., pp. 204, 211.

Digital Library

Google Scholar

[8]

MICHALEWICZ, Z. Genetic Algorithms + Data Structures - Evolution Programs. Springer-Verlag, 1992.

Digital Library

Google Scholar

[9]

RICH, S., AND KNIGHT, K. Artificial Intelligence. McGraw-Hill, Inc, 1991.

Digital Library

Google Scholar

[10]

R, INKE, B., AND WUENSCH, V. Zum huygensschen prinzip bei der skalaren wellengleichungen, zur Analysis, 18 (1981), 43,75.

Google Scholar

[11]

THOMS, T. Y. The differential invariants o~ generalized spaces. Cambridge University Press, Cambridge, 1899.

Google Scholar

Cited By

View all

Li HLi ZLi YYap CEl Din M(2017)Riemann Tensor Polynomial Canonicalization by Graph Algebra ExtensionProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087625(269-276)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087625
Giesbrecht MWatt S(2011)ForewordJournal of Symbolic Computation10.1016/j.jsc.2010.08.00946:7(735-740)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.jsc.2010.08.009
Jian MChou TSie KChung L(2009)Adaptive life-cycle and viability based paramecium-imitated evolutionary algorithmWSEAS Transactions on Computers10.5555/1639457.16394718:8(1358-1367)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.5555/1639457.1639471

Index Terms

Application of genetic algorithms to the algebraic simplification of tensor polynomials
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
      1. Heuristic function construction
2. Mathematics of computing
  1. Mathematical analysis
    1. Nonlinear equations
    2. Numerical analysis
      1. Computations on polynomials
  2. Mathematical software

Recommendations

Inequalities of Rafalson type for algebraic polynomials

For a positive Borel measure dµ, we prove that the constant γ_n(dv;dµ) = sup_π∈J_n_\{0} ∫_-x^x π²(x)dv(x)/∫_-x^x π²(x)dµ(x)' can be represented by the zeros of orthogonal polynomials corresponding to dµ in case (i) dv(x)=(A+Bx)dµ(x), where A+Bx is nonnegative ...
Sheffer polynomials, monomiality principle, algebraic methods and the theory of classical polynomials

The Sheffer polynomials and the monomiality principle, along with the underlying operational formalism, offer a powerful tool for investigation of the properties of a wide class of polynomials. We present, within such a context, a self-contained theory ...
Resultants and Discriminants for Bivariate Tensor-Product Polynomials
ISSAC '17: Proceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation

Optimal resultant formulas have been systematically constructed mostly for unmixed polynomial systems, that is, systems of polynomials which all have the same support. However, such a condition is restrictive, since mixed systems of equations arise ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ISSAC '97: Proceedings of the 1997 international symposium on Symbolic and algebraic computation

July 1997

414 pages

ISBN:0897918754

DOI:10.1145/258726

Chairmen:
Bruce Char
Drexel Univ., Philadelphia, PA
,
Paul S. Wang
Kent State Univ., Kent, OH
,
Editor:
Wolfgang W. Küchlin
Univ. of Tu¨bingen, Tu¨bingen, Germany

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC97

Sponsor:

ISSAC97: International Symposium on Symbolic and Algebraic Computation

July 21 - 23, 1997

Hawaii, Kihei, Maui, USA

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
507
Total Downloads

Downloads (Last 12 months)39
Downloads (Last 6 weeks)4

Reflects downloads up to 18 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li HLi ZLi YYap CEl Din M(2017)Riemann Tensor Polynomial Canonicalization by Graph Algebra ExtensionProceedings of the 2017 ACM International Symposium on Symbolic and Algebraic Computation10.1145/3087604.3087625(269-276)Online publication date: 23-Jul-2017
https://dl.acm.org/doi/10.1145/3087604.3087625
Giesbrecht MWatt S(2011)ForewordJournal of Symbolic Computation10.1016/j.jsc.2010.08.00946:7(735-740)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.jsc.2010.08.009
Jian MChou TSie KChung L(2009)Adaptive life-cycle and viability based paramecium-imitated evolutionary algorithmWSEAS Transactions on Computers10.5555/1639457.16394718:8(1358-1367)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.5555/1639457.1639471

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Inequalities of Rafalson type for algebraic polynomials

Sheffer polynomials, monomiality principle, algebraic methods and the theory of classical polynomials

Resultants and Discriminants for Bivariate Tensor-Product Polynomials