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 (Author), Alzabut, Jehad (Author), Abodayeh, Kamaleldin (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Multidisciplinary Digital Publishing Institute,
2021-09-20T14:16:11Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Computing Nearest Correlation Matrix via Low-Rank ODE’s Based Technique
by: Mutti-Ur Rehman, et al.
Published: (2020-11-01) -
Oscillation theorems for higher order dynamic equations with superlinear neutral term
by: Said R. Grace, et al.
Published: (2021-03-01) -
On Instability Analysis of Linear Feedback Systems
by: Mutti-Ur Rehman, et al.
Published: (2020-03-01) -
Computing $\mu$-values for LTI Systems
by: Mutti-Ur Rehman, et al.
Published: (2021-10-01) -
A sequential semismooth Newton method for the nearest low-rank correlation matrix problem
by: Li, Qingna, et al.
Published: (2011)