Upper bounds for nearly optimal diagonal scaling of matrices
Alexander Shapiro
Abstract
Alexander Shapiro
Abstract
Optimal diagonal scaling of an n×n matrix A consists in finding a diagonal matrix D that minimizes a condition number of AD. Often a nearly optimal scaling of A is achieved by taking a diagonal matrix D 1 such that all diagonal elements of D 1 AT AD 1 are equal to one. It is shown in this paper that the condition number of AD 1 can be at least (n/2)1/2 times the minimal one. Some questions for a further research are posed.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Optimal diagonal scaling of an n×n matrix A consists in finding a diagonal matrix D that minimizes a condition number of AD. Often a nearly optimal scaling of A is achieved by taking a diagonal matrix D 1 such that all diagonal elements of D 1 AT AD 1 are equal to one. It is shown in this paper that the condition number of AD 1 can be at least (n/2)1/2 times the minimal one. Some questions for a further research are posed.
Key concepts: Mathematics, Diagonal, Scaling, Diagonal matrix, Combinatorics, Matrix (chemical analysis), Geometry, Materials science