<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml">The purpose of this article is to use genetic algorithm for finding two invertible diagonal matrices <italic>D</italic>1 and <italic>D</italic>2 such that the scaled matrix <italic>D</italic>1<italic>AD</italic>2 approaches to minimum condition number.</abstract>

The purpose of this article is to use genetic algorithm for finding two invertible diagonal matrices D1 and D2 such that the scaled matrix D1AD2 approaches to minimum condition number.

Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm

Department of Statistics, Faculty of Mathematical Sciences, University of Guilan, Rasht, Iran

Journal of Applied Mathematics, Statistics and Informatics

{"article-title":"Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm"}

The purpose of this article is to use genetic algorithm for finding two invertible diagonal matrices D1 and D2 such that the scaled matrix D1AD2 approaches to...

Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm

Data publikacji: 13 sie 2012

Zakres stron: 49 - 53

DOI: https://doi.org/10.2478/v10294-012-0005-3

Słowa kluczowe
Ill conditioned matrix, Condition number, Diagonal scaling, Genetic algorithm

This content is open access.

Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm

Data publikacji: 13 sie 2012

Zakres stron: 49 - 53

DOI: https://doi.org/10.2478/v10294-012-0005-3

Słowa kluczoweIll conditioned matrix, Condition number, Diagonal scaling, Genetic algorithm

This content is open access.

Słowa kluczowe
Ill conditioned matrix, Condition number, Diagonal scaling, Genetic algorithm