Diagonal Scaling of Ill-Conditioned Matrixes by Genetic Algorithm

DOI10.2478/v10294-012-0005-3zbMath1277.65025OpenAlexW2011447574MaRDI QIDQ2867278

Mojtaba Moradi, Behrouz Fathi-Vajargah

Publication date: 11 December 2013

Published in: Journal of Applied Mathematics, Statistics and Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/v10294-012-0005-3

zbMATH Keywords

condition numbergenetic algorithmdiagonal scalingill conditioned matrix

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

The pre/post equilibrated conditioning methods to solve Cauchy problems

Uses Software

• HSL

Cites Work

• Unnamed Item
• Optimally scaled matrices
• Matrices which can be optimally scaled
• Remarks on optimally scaled matrices
• Condition numbers and equilibration of matrices
• A Comparative Study of Algorithms for Matrix Balancing
• An Algorithm for Optimal ℓ₂ Scaling of Matrices
• Minimizing the Euclidean Condition Number
• The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
• Optimal scaling for p-norms and componentwise distance to singularity
• On the Automatic Scaling of Matrices for Gaussian Elimination