Abstract
A parallel global optimization strategy for an ill posed inverse problem in computational mechanics is proposed. It contains a rough recognition of basins of attraction of local minima (clustering) with the use of genetic algorithms. Two levels of parallelism are involved. Basic asymptotic properties of the proposed genetic clustering will be proved. The computational example of the optimal pretractions design in a network structure (hanging roof) will be also shortly described.
Preview
Unable to display preview. Download preview PDF.
References
Billingsley, P.: Probability and measure. John Wiley & Sons, New York (1979)
Cabib, E., Davini, C., Chong-Quing Ru: A Problem in the Optimal Design of Networks under Transverse Loading. Quarterly of Appl. Mathematics, Vol. XLVIII, (1990) 252–263
Goldberg D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)
Horst, Panos M. Pardalos: Handbook of Global Optimization. Kluwer Ac. Publisher (1995)
Vose, M.: Modeling Genetic Algorithms with Markov Chains. Annals of Mathematics and Artificial Intelligence, no 5 (1992) 79–88
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Telega, H., Schaefer, R., Cabib, E. (1998). A parallel genetic clustering for inverse problems. In: Kågström, B., Dongarra, J., Elmroth, E., Waśniewski, J. (eds) Applied Parallel Computing Large Scale Scientific and Industrial Problems. PARA 1998. Lecture Notes in Computer Science, vol 1541. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0095381
Download citation
DOI: https://doi.org/10.1007/BFb0095381
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65414-8
Online ISBN: 978-3-540-49261-0
eBook Packages: Springer Book Archive