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

Upcoming Events

| Online

How Bath Spa University Is Exploring AI-Assisted Assessment & Feedback in Higher Education

Join Professor Helen King and Jeroen van Gessel for an overview of Bath Spa University’s pilot of Eduface, an AI-assisted feedback tool designed and trained specifically for higher education.

Maplesoft Logo

| Online

Introducing Maple 2026 for Education and Research

Join Maplesoft for this 1-hour webinar to learn about some of the many improvements in Maple 2026.

| Online

Still Human: A Toolkit for Peer-to-Peer Collaboration in Higher and Further Education

Join Peerceptiv and Jisc licensing for a walkthrough of how institutions are using structured peer collaboration to drive deeper engagement and stronger critical thinking.

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