default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaurent Demanet
Person information
- affiliation: MIT, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Hongyu Sun
, Laurent Demanet:
Beyond Correlations: Deep Learning for Seismic Interferometry. IEEE Trans. Neural Networks Learn. Syst. 34(7): 3385-3396 (2023)- 2022
- [j26]Matthew Li, Laurent Demanet, Leonardo Zepeda-Núñez:
Wide-Band Butterfly Network: Stable and Efficient Inversion Via Multi-Frequency Neural Networks. Multiscale Model. Simul. 20(4): 1191-1227 (2022) - [j25]Hongyu Sun, Laurent Demanet:
Deep Learning for Low-Frequency Extrapolation of Multicomponent Data in Elastic FWI. IEEE Trans. Geosci. Remote. Sens. 60: 1-11 (2022) - 2021
- [j24]Augustin Cosse, Laurent Demanet:
Stable Rank-One Matrix Completion is Solved by the Level 2 Lasserre Relaxation. Found. Comput. Math. 21(4): 891-940 (2021) - [j23]Zhilong Fang, Laurent Demanet:
Lift and Relax for PDE-Constrained Inverse Problems in Seismic Imaging. IEEE Trans. Geosci. Remote. Sens. 59(9): 8034-8039 (2021) - [i14]Matthew Li, Laurent Demanet, Leonardo Zepeda-Núñez:
Accurate and Robust Deep Learning Framework for Solving Wave-Based Inverse Problems in the Super-Resolution Regime. CoRR abs/2106.01143 (2021) - [i13]Pawan Bharadwaj, Matthew Li, Laurent Demanet:
Redatuming physical systems using symmetric autoencoders. CoRR abs/2108.02537 (2021) - 2020
- [j22]Matthias Taus, Leonardo Zepeda-Núñez, Russell J. Hewett, Laurent Demanet:
L-Sweeps: A scalable, parallel preconditioner for the high-frequency Helmholtz equation. J. Comput. Phys. 420: 109706 (2020) - [j21]Dmitry Batenkov, Laurent Demanet, Gil Goldman, Yosef Yomdin:
Conditioning of Partial Nonuniform Fourier Matrices with Clustered Nodes. SIAM J. Matrix Anal. Appl. 41(1): 199-220 (2020) - [i12]Matthew Li, Laurent Demanet, Leonardo Zepeda-Núñez:
Wide-band butterfly network: stable and efficient inversion via multi-frequency neural networks. CoRR abs/2011.12413 (2020)
2010 – 2019
- 2019
- [j20]Laurent Demanet, Alex Townsend:
Stable Extrapolation of Analytic Functions. Found. Comput. Math. 19(2): 297-331 (2019) - [j19]Pawan Bharadwaj, Laurent Demanet, Aimé Fournier:
Focused Blind Deconvolution. IEEE Trans. Signal Process. 67(12): 3168-3180 (2019) - [i11]Matthias Taus, Leonardo Zepeda-Núñez, Russell J. Hewett, Laurent Demanet:
L-Sweeps: A scalable, parallel preconditioner for the high-frequency Helmholtz equation. CoRR abs/1909.01467 (2019) - 2018
- [j18]Leonardo Zepeda-Núñez, Laurent Demanet:
Nested Domain Decomposition with Polarized Traces for the 2D Helmholtz Equation. SIAM J. Sci. Comput. 40(3) (2018) - [j17]Ali Ahmed, Laurent Demanet:
Leveraging Diversity and Sparsity in Blind Deconvolution. IEEE Trans. Inf. Theory 64(6): 3975-4000 (2018) - [i10]Dmitry Batenkov, Laurent Demanet, Gil Goldman, Yosef Yomdin:
Stability of partial Fourier matrices with clustered nodes. CoRR abs/1809.00658 (2018) - 2017
- [j16]Laurent Demanet, Vincent Jugnon:
Convex Recovery From Interferometric Measurements. IEEE Trans. Computational Imaging 3(2): 282-295 (2017) - [c4]Dmitry Batenkov, Laurent Demanet:
Soft extrapolation of bandlimited functions. CAMSAP 2017: 1-5 - 2016
- [j15]Leonardo Zepeda-Núñez, Laurent Demanet:
The method of polarized traces for the 2D Helmholtz equation. J. Comput. Phys. 308: 347-388 (2016) - [j14]Laurent Demanet, Xiangxiong Zhang:
Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit. Math. Comput. 85(297): 209-238 (2016) - [i9]Laurent Demanet, Alex Townsend:
Stable extrapolation of analytic functions. CoRR abs/1605.09601 (2016) - [i8]Ali Ahmed, Laurent Demanet:
Leveraging Diversity and Sparsity in Blind Deconvolution. CoRR abs/1610.06098 (2016) - 2015
- [j13]Rosalie Bélanger-Rioux, Laurent Demanet:
Compressed Absorbing Boundary Conditions via Matrix Probing. SIAM J. Numer. Anal. 53(5): 2441-2471 (2015) - [c3]Ali Ahmed, Augustin Cosse, Laurent Demanet:
A convex approach to blind deconvolution with diverse inputs. CAMSAP 2015: 5-8 - [c2]Augustin Cosse, Laurent Demanet:
Rank-one matrix completion is solved by the sum-of-squares relaxation of order two. CAMSAP 2015: 9-12 - [i7]Laurent Demanet, Nam Nguyen:
The recoverability limit for superresolution via sparsity. CoRR abs/1502.01385 (2015) - 2014
- [j12]Jack Poulson, Laurent Demanet, Nicholas Maxwell, Lexing Ying:
A Parallel Butterfly Algorithm. SIAM J. Sci. Comput. 36(1) (2014) - 2013
- [j11]Jiawei Chiu, Laurent Demanet:
Sublinear Randomized Algorithms for Skeleton Decompositions. SIAM J. Matrix Anal. Appl. 34(3): 1361-1383 (2013) - [c1]Nam Nguyen, Laurent Demanet:
Sparse image super-resolution via superset selection and pruning. CAMSAP 2013: 208-211 - [i6]Laurent Demanet, Xiangxiong Zhang:
Eventual linear convergence of the Douglas Rachford iteration for basis pursuit. CoRR abs/1301.0542 (2013) - [i5]Laurent Demanet, Deanna Needell, Nam Nguyen:
Super-resolution via superset selection and pruning. CoRR abs/1302.6288 (2013) - [i4]Jack Poulson, Laurent Demanet, Nicholas Maxwell, Lexing Ying:
A parallel butterfly algorithm. CoRR abs/1305.4650 (2013) - [i3]Laurent Demanet, Vincent Jugnon:
Convex recovery from interferometric measurements. CoRR abs/1307.6864 (2013) - 2012
- [j10]Laurent Demanet, Lexing Ying:
Fast wave computation via Fourier integral operators. Math. Comput. 81(279): 1455-1486 (2012) - [j9]Laurent Demanet, Matthew Ferrara, Nicholas Maxwell, Jack Poulson, Lexing Ying:
A Butterfly Algorithm for Synthetic Aperture Radar Imaging. SIAM J. Imaging Sci. 5(1): 203-243 (2012) - [j8]Jiawei Chiu, Laurent Demanet:
Matrix Probing and its Conditioning. SIAM J. Numer. Anal. 50(1): 171-193 (2012) - 2011
- [j7]Laurent Demanet, Gabriel Peyré:
Compressive Wave Computation. Found. Comput. Math. 11(3): 257-303 (2011) - [j6]Laurent Demanet, Lexing Ying:
Discrete Symbol Calculus. SIAM Rev. 53(1): 71-104 (2011) - [i2]Jiawei Chiu, Laurent Demanet:
Matrix Probing and its Conditioning. CoRR abs/1102.5689 (2011) - [i1]Jiawei Chiu, Laurent Demanet:
Sublinear randomized algorithms for skeleton decompositions. CoRR abs/1110.4193 (2011) - 2010
- [j5]Laurent Demanet, Lexing Ying:
Scattering in Flatland: Efficient Representations via Wave Atoms. Found. Comput. Math. 10(5): 569-613 (2010)
2000 – 2009
- 2009
- [j4]Emmanuel J. Candès, Laurent Demanet, Lexing Ying:
A Fast Butterfly Algorithm for the Computation of Fourier Integral Operators. Multiscale Model. Simul. 7(4): 1727-1750 (2009) - [j3]Laurent Demanet, Lexing Ying:
Wave atoms and time upscaling of wave equations. Numerische Mathematik 113(1): 1-71 (2009) - 2007
- [j2]Emmanuel J. Candès, Laurent Demanet, Lexing Ying:
Fast Computation of Fourier Integral Operators. SIAM J. Sci. Comput. 29(6): 2464-2493 (2007) - 2006
- [j1]Emmanuel J. Candès, Laurent Demanet, David L. Donoho, Lexing Ying:
Fast Discrete Curvelet Transforms. Multiscale Model. Simul. 5(3): 861-899 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
