We use cookies on this site to help provide the best possible online experience. By using this site you agree to our use of cookies.

Click to view our cookie policy and customize your cookie preferences.

Icon
A notification message..

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

Online

* Sorry, you missed this event *
NAG logo

When is it?

Starts at

Finishes at

Join Royal Society Research Professor Nick Higham and NAG for a live discussion on the latest advances in the Nearest Correlation Matrix and see how using the highly anticipated new NAG® Library symbolic adjoint NCM solver can dramatically reduce the runtime and memory footprint required to compute derivatives of the NCM.

Webinar attendees will discover:

  • Technical advances in computing the Nearest Correlation Matrix
  • The benefits of using adjoint solvers when computing the Nearest Correlation Matrix
  • The advantages of symbolic adjoints over algorithmic adjoints in Automatic Differentiation

Join our mailing list for the latest news, event information and resources