Computing Iterative Roots with Neural Networks


Contact
lkindermann [ at ] awi-bremerhaven.de

Abstract

Many real processes are composed of a n-fold repetition ofsome simpler process. If the whole process can be modelledwith a neural network, we present a method to derive a modelof the basic process, too, thus performing not only a systemidentificationbut also a decomposition into basic blocks.Mathematically this is equivalent to the problem of computingiterative or functional roots: Given the equation F(x)=f(f(x))and an arbitrary function F(x) we seek a solution for f(x). Solvingthis functional equation in a closed form is an exceptionallyhard problem and often impossible, even for simplefunctions. Furthermore there are no standard numerical methodsavailable yet. But a special topology of multilayer perceptronsand a simple addition to the delta rule of backpropagationwill allow most NN tools to compute good approximationseven of higher order iterative roots.Applications range from data analysis within chaos theory(many chaotic systems are derived from iterated functions) tothe optimization of industrial processes, where productionlines like steel mills often consist of several identical machinesin a row.



Item Type
Conference (Conference paper)
Authors
Divisions
Programs
Peer revision
Not peer-reviewed
Publication Status
Published
Event Details
Proceedings of the Fifth International Conference on Neural Information Processing (ICONIP98), Kitakyushu..
Eprint ID
10396
Cite as
Kindermann, L. (1998): Computing Iterative Roots with Neural Networks , Proceedings of the Fifth International Conference on Neural Information Processing (ICONIP98), Kitakyushu. .


Share

Research Platforms
N/A

Campaigns


Actions
Edit Item Edit Item