<h1 id="applied-computational-mathematics"><a href="./">Applied & Computational Mathematics</a></h1> <h2 id="section">(““)</h2> <h3 id="combined-from-caltechauthors">combined from <a href="https://authors.library.caltech.edu">CaltechAUTHORS</a></h3> <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>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>Tropp, Joel A.; Yurtsever, Alp; et 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.; Yurtsever, Alp; et 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>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.; Yurtsever, Alp; et 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>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>Chen, Richard Y.; Gittens, Alex A.; et 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>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>Owhadi, Houman and Zhang, Lei (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-113719601">Localized bases for finite dimensional homogenization approximations with non-separated scales and high-contrast</a></li> <li>Owhadi, H.; Scovel, C.; et al. (2010) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-113158874">Optimal Uncertainty Quantification</a>; <a href="https://doi.org/10.7907/TTW6-QD19">10.7907/TTW6-QD19</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.; Martinsson, P. G.; et 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>Desbrun, Mathieu; Donaldson, Roger D.; et al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111011-163848887">Discrete Geometric Structures in Homogenization and Inverse Homogenization with Application to EIT</a>; <a href="https://doi.org/10.7907/XR8W-EA85">10.7907/XR8W-EA85</a></li> <li>Berlyand, Leonid and Owhadi, Houman (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-105135181">Flux Norm Approach to Homogenization Problems with non-separated Scales</a>; <a href="https://doi.org/10.7907/T5DC-SN48">10.7907/T5DC-SN48</a></li> <li>Tao, Molei; Owhadi, Houman; et al. (2009) <a href="https://resolver.caltech.edu/CaltechAUTHORS:20111012-110532817">Non-intrusive and structure preserving multiscale integration of stiff ODEs, SDEs and Hamiltonian systems with hidden slow dynamics via flow averaging</a>; <a href="https://doi.org/10.7907/QZNP-SR14">10.7907/QZNP-SR14</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> </ul>