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

Chest image

| Online

AI for Assessment: Cutting Workload in Higher and Further Education

This joint webinar with the Jisc AI and Licensing will give an overview and demonstration of TeacherMatic's assessment and feedback tools

Find out more Register now
Maplesoft Logo

| Online

Maple Conference 2025 - Exploring the Frontiers of Mathematics Technology

Join Maplesoft's free virtual event to explore the impact and potential of mathematics technology in post-secondary education and research.

Find out more Register now
Chest image

| Online

AAF Virtual Meeting Nov 2025

A 2.5 hour virtual AAF meeting with a condensed agenda, for members of the UK academic community.

Find out more Register here
View all events

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