Data-driven discovery of coordinates and governing equations

Abstract

The discovery of governing equations from scientific data has the potential to transform data-rich fields that lack well-characterized quantitative descriptions. Advances in sparse regression are currently enabling the tractable identification of both the structure and parameters of a nonlinear dynamical system from data. The resulting models have the fewest terms necessary to describe the dynamics, balancing model complexity with descriptive ability, and thus promoting interpretability and generalizability. This provides an algorithmic approach to Occam’s razor for model discovery. However, this approach fundamentally relies on an effective coordinate system in which the dynamics have a simple representation. In this work, we design a custom deep autoencoder network to discover a coordinate transformation into a reduced space where the dynamics may be sparsely represented. Thus, we simultaneously learn the governing equations and the associated coordinate system. We demonstrate this approach on several example high-dimensional systems with low-dimensional behavior. The resulting modeling framework combines the strengths of deep neural networks for flexible representation and sparse identification of nonlinear dynamics (SINDy) for parsimonious models. This method places the discovery of coordinates and models on an equal footing.

Full text

Its licence does not allow us to show the full text. Read it at PubMed Central:

References 86

1. 1.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

2. 2.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

3. 3.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

4. 4.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

5. 5.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

6. 6.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

7. 7.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

8. 8.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

9. 9.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

17. 17.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

19. 19.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

20. 20.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

21. 21.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

22. 22.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

24. 24.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

27. 27.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

29. 29.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

30. 30.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

33. 33.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

34. 34.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

35. 35.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

36. 36.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

37. 37.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

38. 38.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

39. 39.
    Chaos as an intermittently forced linear system · 2017

    No notice
40. 40.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

41. 41.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

42. 42.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

43. 43.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

44. 44.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

45. 45.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

46. 46.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

47. 47.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

48. 48.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

49. 49.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

50. 50.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

51. 51.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

52. 52.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

53. 53.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

54. 54.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

55. 55.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

56. 56.
    VAMPnets for deep learning of molecular kinetics · 2018

    Corrected
57. 57.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

58. 58.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

59. 59.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

60. 60.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

61. 61.
    Deep learning for universal linear embeddings of nonlinear dynamics · 2018

    No notice
62. 62.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

63. 63.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

64. 64.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

65. 65.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

66. 66.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

67. 67.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

68. 68.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

69. 69.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

70. 70.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

71. 71.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

72. 72.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

73. 73.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

74. 74.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

75. 75.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

76. 76.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

77. 77.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

78. 78.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

79. 79.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

80. 80.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

81. 81.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

82. 82.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

83. 83.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

84. 84.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

85. 85.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

86. 86.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

Cited by papers we hold 2

• A Toolkit for Data-Driven Discovery of Governing Equations in High-Noise Regimes · 2022
  Not checked
• A Unified Sparse Optimization Framework to Learn Parsimonious Physics-Informed Models From Data · 2020
  Not checked

Reads

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.