Automated Discovery of Numerical Approximation Formulae via Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@Article{streeter:2003:GPEM,

• author = "Matthew Streeter and Lee A. Becker",
• title = "Automated Discovery of Numerical Approximation Formulae via Genetic Programming",
• journal = "Genetic Programming and Evolvable Machines",
• year = "2003",
• volume = "4",
• number = "3",
• pages = "255--286",
• month = sep,
• keywords = "genetic algorithms, genetic programming, approximations, symbolic regression, Pareto optimality",
• ISSN = "1389-2576",
• DOI = "doi:10.1023/A:1025176407779",
• abstract = "the use of genetic programming to perform automated discovery of numerical approximation formulae. We present results involving rediscovery of known approximations for Harmonic numbers, discovery of rational polynomial approximations for functions of one or more variables, and refinement of existing approximations through both approximation of their error function and incorporation of the approximation as a program tree in the initial GP population. Evolved rational polynomial approximations are compared to Pade approximations obtained through the Maple symbolic mathematics package. We find that approximations evolved by GP can be superior to Pade approximations given certain tradeoffs between approximation cost and accuracy, and that GP is able to evolve approximations in circumstances where the Pade approximation technique cannot be applied. We conclude that genetic programming is a powerful and effective approach that complements but does not replace existing techniques from numerical analysis.",
• notes = "Article ID: 5141124",

}

Genetic Programming entries for Matthew J Streeter Lee A Becker

Citations