Items where Research Group Name is "Applied & Computational Mathematics"
Number of items: 23. 2021Nakatasukasa, Yuji and Tropp, Joel A. (2021) Fast & accurate randomized algorithms for linear systems and eigenvalue problems. ACM Technical Reports, 2021-01. California Institute of Technology , Pasadena, CA. doi:10.7907/cmyh-va31. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20220909-161413582 2020Lotz, Martin and Tropp, Joel A. (2020) Sharp phase transitions in Euclidian integral geometry. ACM Technical Reports, 2020-01. California Institute of Technology , Pasadena, CA. doi:10.7907/9rja-rh15. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20220829-181401723 2018Tropp, Joel A. and Yurtsever, Alp and Udell, Madeleine et al. (2018) More practical sketching algorithms for low-rank matrix approximation. ACM Technical Reports, 2018-01. California Institute of Technology , Pasadena, CA. doi:10.7907/bb7w-ve61. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20220826-183609942 Tropp, Joel A. (2018) Analysis of randomized block Krylov methods. ACM Technical Reports, 2018-02. California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20210624-180721369 2017Tropp, Joel A. and Yurtsever, Alp and Udell, Madeleine et al. (2017) Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data. ACM Technical Reports, 2017-03. California Institute of Technology , Pasadena, CA. doi:10.7907/QJE2-RP11. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20170620-081901312 McCoy, Michael B. and Tropp, Joel A. (2017) The Achievable Performance of Convex Demixing. ACM Technical Reports, 2017-02. California Institute of Technology , Pasadena, CA. doi:10.7907/4KWM-5N31. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20170314-110228775 Tropp, Joel A. and Yurtsever, Alp and Udell, Madeleine et al. (2017) Randomized Single-View Algorithms for Low-Rank Matrix Approximation. ACM Technical Reports, 2017-01. California Institute of Technology , Pasadena, CA. doi:10.7907/Z9HT2M9C. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20170215-154809329 2014Gittens, A. and Tropp, J. A. (2014) Error Bounds for Random Matrix Approximation Schemes. ACM Technical Reports, 2014-01. California Institute of Technology , Pasadena, CA. doi:10.7907/03an-qj61. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20140828-082707636 Gittens, Alex A. and Tropp, Joel A. (2014) Tail Bounds for All Eigenvalues of a Sum of Random Matrices. ACM Technical Reports, 2014-02. California Institute of Technology , Pasadena, CA. doi:10.7907/tz8n-h623. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20140828-084239607 2012Chen, Richard Y. and Gittens, Alex A. and Tropp, Joel A. (2012) The Masked Sample Covariance Estimator: An Analysis via the Matrix Laplace Transform. ACM Technical Reports, 2012-01. California Institute of Technology , Pasadena, CA. doi:10.7907/6rfh-ce56. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20120411-102106234 2011Probel, Clément J. and Tropp, Joel A. (2011) Large-Scales PCA with Sparsity Constraints. ACM Technical Reports, 2011-02. California Institute of Technology , Pasadena, CA. doi:10.7907/51g8-zc61. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20220826-185558571 Tropp, Joel A. (2011) User-friendly Tail Bounds for Matrix Martingales. ACM Technical Reports, 2011-01. California Institute of Technology , Pasadena, CA. doi:10.7907/62v9-yh77. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-114710310 2010Owhadi, Houman and Zhang, Lei (2010) Localized bases for finite dimensional homogenization approximations with non-separated scales and high-contrast. ACM Technical Reports, 2010-04. California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-113719601 Owhadi, H. and Scovel, C. and Sullivan, T. J. et al. (2010) Optimal Uncertainty Quantification. ACM Technical Reports, 2010-03. California Institute of Technology , Pasadena, CA. doi:10.7907/TTW6-QD19. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-113158874 Tropp, Joel A. (2010) User-Friendly Tail Bounds for Sums of Random Matrices. ACM Technical Reports, 2010-01. California Institute of Technology , Pasadena, CA. doi:10.7907/A14X-R435. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-112125900 2009Halko, N. and Martinsson, P. G. and Tropp, J. A. (2009) Finding Structure with Randomness: Stochastic Algorithms for Constructing Approximate matrix Decompositions. ACM Technical Reports, 2009-05. California Institute of Technology , Pasadena, CA. doi:10.7907/PK8V-V047. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-111324407 Desbrun, Mathieu and Donaldson, Roger D. and Owhadi, Houman (2009) Discrete Geometric Structures in Homogenization and Inverse Homogenization with Application to EIT. ACM Technical Reports, 2009-02. California Institute of Technology , Pasadena, CA. doi:10.7907/XR8W-EA85. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111011-163848887 Berlyand, Leonid and Owhadi, Houman (2009) Flux Norm Approach to Homogenization Problems with non-separated Scales. ACM Technical Reports, 2009-03. California Institute of Technology , Pasadena, CA. doi:10.7907/T5DC-SN48. https://resolver.caltech.edu/CaltechAUTHORS:20111012-105135181 Tao, Molei and Owhadi, Houman and Marsden, Jerrold E. (2009) Non-intrusive and structure preserving multiscale integration of stiff ODEs, SDEs and Hamiltonian systems with hidden slow dynamics via flow averaging. ACM Technical Reports, 2009-04. California Institute of Technology , Pasadena, CA. doi:10.7907/QZNP-SR14. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111012-110532817 Tropp, Joel A. and Wright, Stephen J. (2009) Computational Methods for Sparse Solution of Linear Inverse Problems. ACM Technical Reports, 2009-01. California Institute of Technology , Pasadena, CA. doi:10.7907/QF0D-J303. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111011-163243421 2008Needell, D. and Tropp, J. A. (2008) CoSaMP: Iterative Signal Recovery from Incomplete and Inaccurate Samples. ACM Technical Reports, 2008-01. California Institute of Technology , Pasadena, CA. doi:10.7907/KE0N-TN13. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111011-160707642 Tropp, Joel A. (2008) Column Subset Selection, Matrix Factorization, and Eigenvalue Optimization. ACM Technical Reports, 2008-02. California Institute of Technology , Pasadena, CA. doi:10.7907/82PQ-TF75. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111011-161421093 2007Tropp, Joel A. and Gilbert, Anna C. (2007) Signal Recovery from Random Measurements Via Orthogonal Matching Pursuit: The Gaussian Case. ACM Technical Reports, 2007-01. California Institute of Technology , Pasadena, CA. doi:10.7907/EG9R-Y984. (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20111010-134929077 |