The factorization of matrices into products of positive definite factors
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915717693046784 |
|---|---|
| author | Abdelgalil, Mahmoud Georgiou, Tryphon T. |
| author_facet | Abdelgalil, Mahmoud Georgiou, Tryphon T. |
| contents | Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably adjusted. Thus, factoring an arbitrary matrix (with positive determinant) into a product of positive-definite ones provides the needed schedule for a time-varying potential to have a desired effect. The present work provides a detailed analysis of this factorization problem by lifting it into a sequence of Monge-Kantorovich transportation steps on Gaussian distributions and studying the induced holonomy of the optimal transportation problem. From this vantage point we determine the minimal number of positive-definite factors that have a desired effect on the spectrum of the product, e.g., ensure specified eigenvalues or being a rotation matrix. Our approach is computational and allows to identify the needed number of factors as well as trade off their conditioning number with their actual number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12560 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The factorization of matrices into products of positive definite factors Abdelgalil, Mahmoud Georgiou, Tryphon T. Optimization and Control Numerical Analysis Systems and Control Dynamical Systems 15A23, 15B48, 49Q22, 37N35, 37J25, 93C05, 93Axx, 90C52, 65F30, 68T30 Positive-definite matrices materialize as state transition matrices of linear time-invariant gradient flows, and the composition of such materializes as the state transition after successive steps where the driving potential is suitably adjusted. Thus, factoring an arbitrary matrix (with positive determinant) into a product of positive-definite ones provides the needed schedule for a time-varying potential to have a desired effect. The present work provides a detailed analysis of this factorization problem by lifting it into a sequence of Monge-Kantorovich transportation steps on Gaussian distributions and studying the induced holonomy of the optimal transportation problem. From this vantage point we determine the minimal number of positive-definite factors that have a desired effect on the spectrum of the product, e.g., ensure specified eigenvalues or being a rotation matrix. Our approach is computational and allows to identify the needed number of factors as well as trade off their conditioning number with their actual number. |
| title | The factorization of matrices into products of positive definite factors |
| topic | Optimization and Control Numerical Analysis Systems and Control Dynamical Systems 15A23, 15B48, 49Q22, 37N35, 37J25, 93C05, 93Axx, 90C52, 65F30, 68T30 |
| url | https://arxiv.org/abs/2507.12560 |