The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
A non-adapted sparse approximation of PDEs with stochastic inputs
Open accessAbstract
We propose a method for the approximation of solutions of PDEs with stochastic coefficients based on the direct, i.e., non-adapted, sampling of solutions. This sampling can be done by using any legacy code for the deterministic problem as a black box. The method converges in probability (with probabilistic error bounds) as a consequence of sparsity and a concentration of measure phenomenon on the empirical correlation between samples. We show that the method is well suited for truly high-dimensional problems.
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
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
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
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
Stochastic Finite Elements: A Spectral Approach
Ghanem, R., & Spanos, P. D. (1991) · Springer eBooks · doi:10.1007/978-1-4612-3094-6 · Cited by 6,552
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
Xiu, D., & Karniadakis, G. E. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827501387826 · Cited by 4,807
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
Needell, D., & Tropp, J. A. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.07.002 · Cited by 4,326
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
Iterative hard thresholding for compressed sensing
Blumensath, T., & Davies, M. E. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2009.04.002 · Cited by 2,275
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Stable recovery of sparse overcomplete representations in the presence of noise
Donoho, D. L., Elad, M., & Temlyakov, V. N. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.860430 · Cited by 2,183
An Interior-Point Method for Large-Scale -Regularized Least Squares
Kim, S.-J., Koh, K., Lustig, M., Boyd, S., & Gorinevsky, D. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910971 · Cited by 2,083
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
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“Numerous solvers based on the active set [54,36], interior-point continuation [21,42] and projected gradient [25,23,39,13,9,62,3,4] methods have been developed for solving the above formulations of the ‘1-minimization problem.”
MethodProbing the Pareto Frontier for Basis Pursuit Solutions
van den Berg, E., & Friedlander, M. P. (2009) · SIAM Journal on Scientific Computing · doi:10.1137/080714488 · Cited by 1,939
High-Order Collocation Methods for Differential Equations with Random Inputs
Xiu, D., & Hesthaven, J. S. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040615201 · Cited by 1,522
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
Babuska, I. M., Nobile, F., & Tempone, R. F. (2007) · SIAM Journal on Numerical Analysis · doi:10.1137/050645142 · Cited by 1,458
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
Yang, J., & Zhang, Y. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/090777761 · Cited by 1,201
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
Compressed sensing and best 𝑘-term approximation
Cohen, A., Dahmen, W., & DeVore, R. (2008) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-08-00610-3 · Cited by 1,002
Nobile, F., Tempone, R. F., & Webster, C. (2008) · SIAM Journal on Numerical Analysis · doi:10.1137/060663660 · Cited by 965
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Needell, D., & Vershynin, R. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-008-9031-3 · Cited by 952
Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
Hale, E. T., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Optimization · doi:10.1137/070698920 · Cited by 909
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
Becker, S., Bobin, J., & Candès, E. J. (2009) · Cited by 897
Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
Babuska, I. M., Tempone, R. F., & Zouraris, G. E. (2004) · SIAM Journal on Numerical Analysis · doi:10.1137/s0036142902418680 · Cited by 877
A new approach to variable selection in least squares problems
Osborne, M. (2000) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/20.3.389 · Cited by 859
Needell, D., & Vershynin, R. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042412 · Cited by 850
Blatman, G., & Sudret, B. (2010) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2009.10.003 · Cited by 832
An adaptive multi-element generalized polynomial chaos method for stochastic differential equations
Wan, X., & Karniadakis, G. E. (2005) · Journal of Computational Physics · doi:10.1016/j.jcp.2005.03.023 · Cited by 577
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Candes, E. J., & Romberg, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0162-x · Cited by 504
Ma, X., & Zabaras, N. J. (2009) · Journal of Computational Physics · doi:10.1016/j.jcp.2009.01.006 · Cited by 457
Karhunen–Loève approximation of random fields by generalized fast multipole methods
Schwab, C., & Todor, R. A. (2006) · Journal of Computational Physics · doi:10.1016/j.jcp.2006.01.048 · Cited by 359
Multi-resolution analysis of Wiener-type uncertainty propagation schemes
Maître, O. P. L., Najm, H. N., Ghanem, R., & Knio, O. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2003.12.020 · Cited by 335
A Non-Intrusive Polynomial Chaos Method For Uncertainty Propagation in CFD Simulations
Hosder, S., Walters, R. J., & Perez, R. (2006) · AIAA Aerospace Sciences Meeting and Exhibit · doi:10.2514/6.2006-891 · Cited by 327
Linear convergence of iterative soft-thresholdingPreprint
Bredies, K., & Lorenz, D. A. (2012) · Cited by 265
Sparse Signal Reconstruction from Noisy Compressive Measurements using Cross Validation
Boufounos, P. T., Duarte, M. F., & Baraniuk, R. G. (2007) · IEEE Statistical Signal Processing Workshop (SSP) · doi:10.1109/ssp.2007.4301267 · Cited by 157
Nouy, A. (2008) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2008.06.012 · Cited by 157
Compressed Sensing With Cross Validation
Ward, R. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2032712 · Cited by 146
Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints
Bredies, K., & Lorenz, D. A. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/060663556 · Cited by 140
Cited by
POLYNOMIAL-CHAOS-BASED KRIGING
Schobi, R., Sudret, B., & Wiart, J. (2015) · International Journal for Uncertainty Quantification · doi:10.1615/int.j.uncertaintyquantification.2015012467 · Cited by 398
Sparse Polynomial Chaos Expansions: Literature Survey and Benchmark
Lüthen, N., Marelli, S., & Sudret, B. (2021) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/20m1315774 · Cited by 256
Metadata
- Authors
- Doostan, A., & Owhadi, H.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2011-04
- Volume
- 230
- Issue
- 8
- Pages
- 3015-3034
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2056558085
- Cited by
- 436
- References
- 51
- FWCI
- 20.94
- 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.