Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T09:54:18.660Z Has data issue: false hasContentIssue false

Adaptive Dimensionality-Reduction for Time-Stepping in Differential and Partial Differential Equations

Published online by Cambridge University Press:  12 September 2017

Xing Fu
Affiliation:
Department of Applied Mathematics, University of Washington, Seattle, WA 98195, USA
J. Nathan Kutz*
Affiliation:
Department of Applied Mathematics, University of Washington, Seattle, WA 98195, USA
*
*Corresponding author. Email address:kutz@uw.edu (J. N. Kutz)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A numerical time-stepping algorithm for differential or partial differential equations is proposed that adaptively modifies the dimensionality of the underlying modal basis expansion. Specifically, the method takes advantage of any underlying low-dimensional manifolds or subspaces in the system by using dimensionality-reduction techniques, such as the proper orthogonal decomposition, in order to adaptively represent the solution in the optimal basis modes. The method can provide significant computational savings for systems where low-dimensional manifolds are present since the reduction can lower the dimensionality of the underlying high-dimensional system by orders of magnitude. A comparison of the computational efficiency and error for this method are given showing the algorithm to be potentially of great value for high-dimensional dynamical systems simulations, especially where slow-manifold dynamics are known to arise. The method is envisioned to automatically take advantage of any potential computational saving associated with dimensionality-reduction, much as adaptive time-steppers automatically take advantage of large step sizes whenever possible.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2017