Papers › Discovery of Nonlinear Multiscale Systems: Sampling Strategies and Embeddings

Discovery of Nonlinear Multiscale Systems: Sampling Strategies and Embeddings

18 May 2018arXiv:1805.07411links table onlyarchive 2025-07-28

Kathleen Champion, Steven L. Brunton, J. Nathan Kutz

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

A major challenge in the study of dynamical systems is that of model discovery: turning data into models that are not just predictive, but provide insight into the nature of the underlying dynamical system that generated the data. This problem is made more difficult by the fact that many systems of interest exhibit diverse behaviors across multiple time scales. We introduce a number of data-driven strategies for discovering nonlinear multiscale dynamical systems and their embeddings from data. We consider two canonical cases: (i) systems for which we have full measurements of the governing variables, and (ii) systems for which we have incomplete measurements. For systems with full state measurements, we show that the recent sparse identification of nonlinear dynamical systems (SINDy) method can discover governing equations with relatively little data and introduce a sampling method that allows SINDy to scale efficiently to problems with multiple time scales. Specifically, we can discover distinct governing equations at slow and fast scales. For systems with incomplete observations, we show that the Hankel alternative view of Koopman (HAVOK) method, based on time-delay embedding coordinates, can be used to obtain a linear model and Koopman invariant measurement system that nearly perfectly captures the dynamics of nonlinear quasiperiodic systems. We introduce two strategies for using HAVOK on systems with multiple time scales. Together, our approaches provide a suite of mathematical strategies for reducing the data required to discover and model nonlinear multiscale systems.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1805.07411")

Code

Syntology Ran 0 of 10 code samples harvested from 1 repository linked to this paper; 10 have no recorded run.

By repository: official repository: 10 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kpchamp/MultiscaleDiscovery officialmentioned in paperMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 0 ran; 0 honoured the contract we drafted; 10 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

10unverified

Licence: 0 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from kpchamp/MultiscaleDiscovery. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

compute_dmd_rank kpchamp/MultiscaleDiscovery/utils/dmd.py official repository unverified MIT (permissive) · 3604988b24bf5e84 · report
compute_real_dmd_modes kpchamp/MultiscaleDiscovery/utils/dmd.py official repository unverified MIT (permissive) · 6d09bbfb907c0023 · report
differentiate kpchamp/MultiscaleDiscovery/utils/utils.py official repository unverified MIT (permissive) · 88d6d45a22a42600 · report
hankel_matrix kpchamp/MultiscaleDiscovery/utils/utils.py official repository unverified MIT (permissive) · 376c1c8678d1ec65 · report
integrate kpchamp/MultiscaleDiscovery/utils/utils.py official repository unverified MIT (permissive) · 51ec96927f21771b · report
lorenz kpchamp/MultiscaleDiscovery/utils/simulations.py official repository unverified MIT (permissive) · 61bb4253415897b6 · report
pool_data kpchamp/MultiscaleDiscovery/utils/sindy.py official repository unverified MIT (permissive) · fac03da3b3e4db74 · report
rossler kpchamp/MultiscaleDiscovery/utils/simulations.py official repository unverified MIT (permissive) · d2eb930e32fc4c4f · report
simulate_lorenz kpchamp/MultiscaleDiscovery/utils/simulations.py official repository unverified MIT (permissive) · 6af40b4d5db08cd4 · report
sindy_setup kpchamp/MultiscaleDiscovery/utils/sindy.py official repository unverified MIT (permissive) · 723fc65bc9acf573 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections