A simulated annealing based algorithm for eigenvalue problems
β Scribed by Mihir Arjunwadkar; D.G. Kanhere
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 655 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We here present the details of the numerical realization of the recently advanced algorithm developed to identify the fragmentation in heavy ion reactions. This new algorithm is based on the simulated annealing method and is dubbed the simulated annealing clusterization algorithm (SACA). We discuss
## Abstract We present a novel approach for optimizing reservoir operation through fuzzy programming and a hybrid evolution algorithm, i.e. genetic algorithm (GA) with simulated annealing (SA). In the analysis, objectives and constraints of reservoir operation are transformed by fuzzy programming f
In this paper we study the performance of two stochastic search methods: Genetic Algorithms and Simulated Annealing, applied to the optimization of pin-jointed steel bar structures. We show that it is possible to embed these two schemes into a single parametric family of algorithms, and that optimal
In applying Arnoldi method to non-symmetric eigenvalue problems for damped structures, a structure of the projected upper Hessenberg matrix is obtained in this paper. By exploiting the structure of the upper Hessenberg matrix and taking advantages of the block properties of system matrices, the Arno