The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Learning partial differential equations via data discovery and sparse optimization
Open accessAbstract
We investigate the problem of learning an evolution equation directly from some given data. This work develops a learning algorithm to identify the terms in the underlying partial differential equations and to approximate the coefficients of the terms only using data. The algorithm uses sparse optimization in order to perform feature selection and parameter estimation. The features are data driven in the sense that they are constructed using nonlinear algebraic equations on the spatial derivatives of the data. Several numerical experiments show the proposed method's robustness to data noise and size, its ability to capture the true features of the data, and its capability of performing additional analytics. Examples include shock equations, pattern formation, fluid flow and turbulence, and oscillatory convection.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Discovering governing equations from data by sparse identification of nonlinear dynamical systems
Brunton, S. L., Proctor, J. L., & Kutz, J. N. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1517384113 · Cited by 4,796
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Chambolle, A., & Pock, T. (2011) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-010-0251-1 · Cited by 4,336
The Split Bregman Method for L1-Regularized Problems
Goldstein, T., & Osher, S. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080725891 · Cited by 4,282
Compressive Sensing [Lecture Notes]
Baraniuk, R. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286571 · Cited by 4,177
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Distilling Free-Form Natural Laws from Experimental Data
Schmidt, M., & Lipson, H. (2009) · Science · doi:10.1126/science.1165893 · Cited by 2,890
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Operateurs Maximaux Monotones - Et Semi-Groupes De Contractions Dans Les Espaces De Hilbert
(1973) · North-Holland Mathematics Studies · doi:10.1016/s0304-0208(08)x7125-7 · Cited by 2,578
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Sparsity and incoherence in compressive sampling
Candès, E., & Romberg, J. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/008 · Cited by 2,075
Splitting Algorithms for the Sum of Two Nonlinear Operators
Lions, P. L., & Mercier, B. (1979) · SIAM Journal on Numerical Analysis · doi:10.1137/0716071 · Cited by 1,972
Oscillating Patterns in Image Processing and Nonlinear Evolution Equations
Meyer, Y. (2001) · University Lecture Series · doi:10.1090/ulect/022 · Cited by 1,037
On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
He, B., & Yuan, X. (2012) · SIAM Journal on Numerical Analysis · doi:10.1137/110836936 · Cited by 881
Automated reverse engineering of nonlinear dynamical systems
Bongard, J., & Lipson, H. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0609476104 · Cited by 792
A Douglas–Rachford Splitting Approach to Nonsmooth Convex Variational Signal Recovery
Combettes, P. L., & Pesquet, J.-C. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910264 · Cited by 490
Numerical Differentiation of Noisy, Nonsmooth Data
Chartrand, R. (2011) · ISRN Applied Mathematics · doi:10.5402/2011/164564 · Cited by 444
Compressive sensing as a paradigm for building physics models
Nelson, L. J., Hart, G. L. W., Zhou, F., & Ozoliņš, V. (2013) · Physical Review B · doi:10.1103/physrevb.87.035125 · Cited by 233
Compressed modes for variational problems in mathematics and physics
Ozoliņš, V., Lai, R., Caflisch, R., & Osher, S. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1318679110 · Cited by 195
Bright, I., Lin, G., & Kutz, J. N. (2013) · Physics of Fluids · doi:10.1063/1.4836815 · Cited by 178
Sparse dynamics for partial differential equations
Schaeffer, H., Caflisch, R., Hauck, C. D., & Osher, S. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1302752110 · Cited by 172
Self-citationBrunton, S. L., Tu, J. H., Bright, I., & Kutz, J. N. (2014) · SIAM Journal on Applied Dynamical Systems · doi:10.1137/130949282 · Cited by 122
Nonlinear model reduction for dynamical systems using sparse sensor locations from learned libraries
Sargsyan, S., Brunton, S. L., & Kutz, J. N. (2015) · Physical Review E · doi:10.1103/physreve.92.033304 · Cited by 69
On the Compressive Spectral Method
Mackey, A., Schaeffer, H., & Osher, S. (2014) · Multiscale Modeling and Simulation · doi:10.1137/140965909 · Cited by 55
Self-citation
Cited by
Machine Learning for Fluid Mechanics
Brunton, S. L., Noack, B. R., & Koumoutsakos, P. (2020) · Annual Review of Fluid Mechanics · doi:10.1146/annurev-fluid-010719-060214 · Cited by 3,063
Data-driven discovery of coordinates and governing equations
Champion, K., Lusch, B., Kutz, J. N., & Brunton, S. L. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1906995116 · Cited by 909
Universal Differential Equations for Scientific Machine Learning
Rackauckas, C., Ma, Y., Martensen, J., Warner, C., Zubov, K., Supekar, R., Skinner, D., Ramadhan, A., & Edelman, A. (2020) · doi:10.21203/rs.3.rs-55125/v1 · Cited by 643
Physics-informed learning of governing equations from scarce data
Chen, Z., Liu, Y., & Sun, H. (2021) · Nature Communications · doi:10.1038/s41467-021-26434-1 · Cited by 609
Chaos as an intermittently forced linear system
Brunton, S. L., Brunton, B. W., Proctor, J. L., Kaiser, E., & Kutz, J. N. (2017) · Nature Communications · doi:10.1038/s41467-017-00030-8 · Cited by 608
Metadata
- Authors
- Schaeffer, H.
- Venue
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 2017-01
- Volume
- 473
- Issue
- 2197
- Pages
- 20160446
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W2573798107
- Cited by
- 432
- References
- 31
- FWCI
- 14.05
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.