What's New With the Nearest Correlation Matrix? Completion, Thresholding and Symbolic Adjoints 

Professor Nick Higham and NAG present the latest advances in the Nearest Correlation Matrix and see how using the NAG® Library symbolic adjoint NCM solver can dramatically reduce the runtime and memory footprint required to compute derivatives of the NCM.  

Complete the form to watch the webinar.