Diagonal scaling of ill-conditioned matrixes by genetic algorithm
From MaRDI portal
Recommendations
- Genetic programming and randomized algorithms for estimation of singulars values of large matrices
- scientific article; zbMATH DE number 1193049
- Diagonal Matrix Scaling and Linear Programming
- An iterative algorithm for searching a scaling matrix for diagonal dominance
- scientific article; zbMATH DE number 1100797
- An improved iterative algorithm for generalized diagonally dominant matrices
- Reducing the bandwidth of a sparse matrix with a genetic algorithm
- Competent genetic algorithms for weighing matrices
Cites work
- A Comparative Study of Algorithms for Matrix Balancing
- An Algorithm for Optimal ℓ2 Scaling of Matrices
- Condition numbers and equilibration of matrices
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- Matrices which can be optimally scaled
- Minimizing the Euclidean Condition Number
- On the Automatic Scaling of Matrices for Gaussian Elimination
- Optimal scaling for p-norms and componentwise distance to singularity
- Optimally scaled matrices
- Remarks on optimally scaled matrices
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
This page was built for publication: Diagonal scaling of ill-conditioned matrixes by genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867278)