<h1>Tropp, Joel</h1> <h2>Monograph from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h2> <ul> <li>Nakatasukasa, Yuji and Tropp, Joel A. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220909-161413582">Fast & accurate randomized algorithms for linear systems and eigenvalue problems</a>; <a href="https://doi.org/10.7907/cmyh-va31">10.7907/cmyh-va31</a></li> <li>Sun, Yiming and Guo, Yang, el al. (2021) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210621-223135493">Tensor Random Projection for Low Memory Dimension Reduction</a>; <a href="https://doi.org/10.48550/arXiv.2105.00105">10.48550/arXiv.2105.00105</a></li> <li>Chen, Chi-Fang and Huang, Hsin-Yuan (Robert), el al. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154423869">Quantum simulation via randomized product formulas: Low gate complexity with accuracy guarantees</a>; <a href="https://doi.org/10.48550/arXiv.2008.11751">10.48550/arXiv.2008.11751</a></li> <li>Lotz, Martin and Tropp, Joel A. (2020) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220829-181401723">Sharp phase transitions in Euclidian integral geometry</a>; <a href="https://doi.org/10.7907/9rja-rh15">10.7907/9rja-rh15</a></li> <li>Yurtsever, Alp and Tropp, Joel A., el al. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154437706">Scalable Semidefinite Programming</a>; <a href="https://doi.org/10.48550/arXiv.1912.02949">10.48550/arXiv.1912.02949</a></li> <li>Kueng, Richard and Tropp, Joel A. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154441081">Binary Component Decomposition. Part I: The Positive-Semidefinite Case</a>; <a href="https://doi.org/10.48550/arXiv.1907.13603">10.48550/arXiv.1907.13603</a></li> <li>Kueng, Richard and Tropp, Joel A. (2019) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20201218-154444454">Binary component decomposition. Part II: The asymmetric case</a>; <a href="https://doi.org/10.48550/arXiv.1907.13602">10.48550/arXiv.1907.13602</a></li> <li>Tropp, Joel A. and Yurtsever, Alp, el al. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220826-183609942">More practical sketching algorithms for low-rank matrix approximation</a>; <a href="https://doi.org/10.7907/bb7w-ve61">10.7907/bb7w-ve61</a></li> <li>Tropp, Joel A. (2018) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369">Analysis of randomized block Krylov methods</a></li> <li>Tropp, Joel A. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170620-081901312">Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data</a>; <a href="https://doi.org/10.7907/QJE2-RP11">10.7907/QJE2-RP11</a></li> <li>Yurtsever, Alp and Udell, Madeleine, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180828-145534045">Sketchy Decisions: Convex Low-Rank Matrix Optimization with Optimal Storage</a>; <a href="https://doi.org/10.48550/arXiv.1702.06838">10.48550/arXiv.1702.06838</a></li> <li>McCoy, Michael B. and Tropp, Joel A. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170314-110228775">The Achievable Performance of Convex Demixing</a>; <a href="https://doi.org/10.7907/4KWM-5N31">10.7907/4KWM-5N31</a></li> <li>Tropp, Joel A. and Yurtsever, Alp, el al. (2017) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20170215-154809329">Randomized Single-View Algorithms for Low-Rank Matrix Approximation</a>; <a href="https://doi.org/10.7907/Z9HT2M9C">10.7907/Z9HT2M9C</a></li> <li>Oymak, Samet and Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112137332">Universality laws for randomized dimension reduction, with applications</a>; <a href="https://doi.org/10.48550/arXiv.1511.09433">10.48550/arXiv.1511.09433</a></li> <li>Tropp, Joel A. (2015) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112133957">Second-Order Matrix Concentration Inequalities</a>; <a href="https://doi.org/10.48550/arXiv.1504.05919">10.48550/arXiv.1504.05919</a></li> <li>Moarref, Rashad and Sharma, Ati S., el al. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112157832">A foundation for analytical developments in the logarithmic region of turbulent channels</a>; <a href="https://doi.org/10.48550/arXiv.1409.6047">10.48550/arXiv.1409.6047</a></li> <li>Gittens, A. and Tropp, J. A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140828-082707636">Error Bounds for Random Matrix Approximation Schemes</a>; <a href="https://doi.org/10.7907/03an-qj61">10.7907/03an-qj61</a></li> <li>Gittens, Alex A. and Tropp, Joel A. (2014) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20140828-084239607">Tail Bounds for All Eigenvalues of a Sum of Random Matrices</a>; <a href="https://doi.org/10.7907/tz8n-h623">10.7907/tz8n-h623</a></li> <li>McCoy, Michael B. and Tropp, Joel A. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112130540">The achievable performance of convex demixing</a>; <a href="https://doi.org/10.48550/arXiv.1309.7478">10.48550/arXiv.1309.7478</a></li> <li>Paulin, Daniel and Mackey, Lester, el al. (2013) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112127106">Deriving Matrix Concentration Inequalities from Kernel Couplings</a>; <a href="https://doi.org/10.48550/arXiv.1305.0612">10.48550/arXiv.1305.0612</a></li> <li>Chen, Richard Y. and Gittens, Alex A., el al. (2012) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20120411-102106234">The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform</a>; <a href="https://doi.org/10.7907/6rfh-ce56">10.7907/6rfh-ce56</a></li> <li>Chen, Richard Y. and Gittens, Alex, el al. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180831-112123699">The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities</a>; <a href="https://doi.org/10.48550/arXiv.1109.1637">10.48550/arXiv.1109.1637</a></li> <li>Probel, Clément J. and Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20220826-185558571">Large-Scales PCA with Sparsity Constraints</a>; <a href="https://doi.org/10.7907/51g8-zc61">10.7907/51g8-zc61</a></li> <li>Tropp, Joel A. (2011) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-114710310">User-friendly Tail Bounds for Matrix Martingales</a>; <a href="https://doi.org/10.7907/62v9-yh77">10.7907/62v9-yh77</a></li> <li>Tropp, Joel A. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-112125900">User-Friendly Tail Bounds for Sums of Random Matrices</a>; <a href="https://doi.org/10.7907/A14X-R435">10.7907/A14X-R435</a></li> <li>Halko, N. and Martinsson, P. G., el al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407">Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions</a>; <a href="https://doi.org/10.7907/PK8V-V047">10.7907/PK8V-V047</a></li> <li>Tropp, Joel A. and Wright, Stephen J. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-163243421">Computational Methods for Sparse Solution of Linear Inverse Problems</a>; <a href="https://doi.org/10.7907/QF0D-J303">10.7907/QF0D-J303</a></li> <li>Needell, D. and Tropp, J. A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-160707642">CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples</a>; <a href="https://doi.org/10.7907/KE0N-TN13">10.7907/KE0N-TN13</a></li> <li>Tropp, Joel A. (2008) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-161421093">Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization</a>; <a href="https://doi.org/10.7907/82PQ-TF75">10.7907/82PQ-TF75</a></li> <li>Tropp, Joel A. and Gilbert, Anna C. (2007) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111010-134929077">Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case</a>; <a href="https://doi.org/10.7907/EG9R-Y984">10.7907/EG9R-Y984</a></li> <li>Gilbert, A. C. and Strauss, M. J., el al. (2006) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20180828-150010838">Algorithmic linear dimension reduction in the ℓ_1 norm for sparse vectors</a>; <a href="https://doi.org/10.48550/arXiv.0608079">10.48550/arXiv.0608079</a></li> </ul>