Monte Carlo optimization for reducing the condition number of ill conditioned matrices
Scaling consists in pre- and post-multiplying a matrix by two diagonal matrices, and, respectively. Classical scaling is a well known algorithm as row and column scaling. In this paper, we apply multi-start algorithm and simulated annealing algorithm for optimizing the condition number of an ill conditioned matrix and compare their results.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.
ACMA©: World Science Publisher United States