Computing Nearest Correlation Matrix via Low-Rank ODE’s Based Technique
For <i>n</i>-dimensional real-valued matrix <i>A</i>, the computation of nearest correlation matrix; that is, a symmetric, positive semi-definite, unit diagonal and off-diagonal entries between <inline-formula><math display="inline"><semantics><...
Main Authors: | Rehman, Mutti-Ur, Alzabut, Jehad, Abodayeh, Kamaleldin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Chemical Engineering |
Format: | Article |
Published: |
Multidisciplinary Digital Publishing Institute
2021
|
Online Access: | https://hdl.handle.net/1721.1/131319 |
Similar Items
-
Quadratic stability of non-linear systems modeled with norm bounded linear differential inclusions
by: Rehman, Mutti-Ur, et al.
Published: (2020) -
Stability analysis of linear feedback systems in control
by: Rehman, Mutti-Ur, et al.
Published: (2020) -
Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
by: Saunderson, James F., et al.
Published: (2013) -
Low rank matrix completion
by: Nan, Feng, S.M. Massachusetts Institute of Technology
Published: (2010) -
Nearest neighbour distance matrix classification
by: Sainin, Mohd Shamrie, et al.
Published: (2010)