Evolutionary Design of Numerical Methods: Generating Finite Difference and Integration Schemes by Differential Evolution
Classical and new numerical schemes are generated using evolutionary computing. Differential Evolution is used to find the coefficients of finite difference approximations of function derivatives, and of single and multi-step integration methods. The coefficients are reverse engineered based on samples from a target function and its derivative used for training. The Runge-Kutta schemes are trained using the order condition equations. An appealing feature of the evolutionary method is the low number of model parameters. The population size, termination criterion and number of training points are determined in a sensitivity analysis. Computational results show good agreement between evolved and analytical coefficients. In particular, a new fifth-order Runge-Kutta scheme is computed which adheres to the order conditions with a sum of absolute errors of order 10^-14. Execution of the evolved schemes proved the intended orders of accuracy. The outcome of this study is valuable for future developments in the design of complex numerical methods that are out of reach by conventional means.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Evolving Evolutionary Algorithms with Patterns
A new model for evolving Evolutionary Algorithms (EAs) is proposed in this paper. The model is based on the Multi Expression Programming (MEP) technique. Each MEP chromosome encodes an evolutionary pattern that is repeat…
BenchmarkingEvolutionary AlgorithmsExact solutions for the selection-mutation equilibrium in the Crow-Kimura evolutionary model
We reformulate the eigenvalue problem for the selection--mutation equilibrium distribution in the case of a haploid asexually reproduced population in the form of an equation for an unknown probability generating functio…
FormLLM-Guided Evolutionary Program Synthesis for Quasi-Monte Carlo Design
Low-discrepancy point sets and digital sequences underpin quasi-Monte Carlo (QMC) methods for high-dimensional integration. We cast two long-standing QMC design problems as program synthesis and solve them with an LLM-gu…
Program SynthesisExploring Maximum Entropy Distributions with Evolutionary Algorithms
This paper shows how to evolve numerically the maximum entropy probability distributions for a given set of constraints, which is a variational calculus problem. An evolutionary algorithm can obtain approximations to som…
Evolutionary AlgorithmsSwarm Systems as a Platform for Open-Ended Evolutionary Dynamics
Artificial swarm systems have been extensively studied and used in computer science, robotics, engineering and other technological fields, primarily as a platform for implementing robust distributed systems to achieve pr…
Diversity