An algorithm for rescaling a matrix positive definite
From MaRDI portal
Given a square matrix M, find D diagonal, so that DM is positive definite, i.e. has its field of values in the right half plane. Here it is shown that this problem can be formulated as an infinite set of linear inequalities, and solved by solving a finite sequence of linear programming problems.
Recommendations
Cites work
- Application of M-matrices to the stability problems of composite dynamical systems
- scientific article; zbMATH DE number 3422541 (Why is no real title available?)
- scientific article; zbMATH DE number 3818523 (Why is no real title available?)
- scientific article; zbMATH DE number 3012115 (Why is no real title available?)
- scientific article; zbMATH DE number 3269388 (Why is no real title available?)
- scientific article; zbMATH DE number 3284923 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Matrix Diagonal Stability and Its Implications
- Nonlinear Programs with Positively Bounded Jacobians
- On the existence of positive diagonal<tex>P</tex>such that<tex>PA + A^{T}P < 0</tex>
- Positive diagonal solutions to the Lyapunov equations
- Scalings of vector spaces and the uniqueness of lyapunov scaling factors
- State Constraints in Convex Control Problems of Bolza
- Three types of matrix stability
Cited in
(6)- Matrix-theoretic conditions for the realizability of sliding manifolds
- A Symmetry Preserving Algorithm for Matrix Scaling
- A Projective Method for Rescaling a Diagonally Stable Matrix to be Positive Definite
- Unifying matrix stability concepts with a view to applications
- Positive definiteness via off-diagonal scaling of a symmetric indefinite matrix
- Residual algorithm for large-scale positive definite generalized eigenvalue problems
This page was built for publication: An algorithm for rescaling a matrix positive definite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094822)