# Jared Tanner, Ph.D

## Affiliations: | University of Oxford | University of Oxford, Oxford, United Kingdom |

##### Area:

Compressed Sensing, Matrix Completion, Stochastic Geometry, Approximation Theory##### Website:

http://people.maths.ox.ac.uk/tanner/##### Google:

"Jared Tanner"##### Bio:

Professor of the Mathematics of Information in the Mathematics Institute at Oxford University and a Fellow at Exeter College; SIAM UKIE Vice President (2011-2013) and Founding Editor-in-Chief of Information and Inference: A Journal of the IMA. Previous academic appointments are:

University of Edinburgh, School of Mathematics, 2007-2012. Professor of the Mathematics of Information (2010-2012), Reader (2009-2010), and Lecturer (2007-2009).

University of Utah, Department of Mathematics, 2006-2007. Assistant Professor.

Stanford University, Department of Statistics, 2004-2006. NSF Postdoctoral Fellow.

University of California at Davis, Department of Mathematics, 2002-2004. Visiting Assistant Research Professor.

My research focus is on the design, analysis, and application of numerical algorithms for information inspired applications in signal & image processing.

##### Mean distance: 16.65 (cluster 17)

#### Parents

Sign in to add mentorEitan Tadmor | grad student | (MathTree) | |

Terence Tao | grad student | (MathTree) | |

David L. Donoho | post-doc | (MathTree) |

#### Children

Sign in to add traineeMostafa (Neo) Mohsenvand | grad student | 2012-2013 | Oxford |

Vinayak Abrol | post-doc | 2018-2019 | Oxford |

#### Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |

Tanner J, Wei K. (2016) Low rank matrix completion by alternating steepest descent methods Applied and Computational Harmonic Analysis. 40: 417-429 |

Blanchard JD, Tanner J, Wei K. (2015) Conjugate gradient iterative hard thresholding: Observed noise stability for compressed sensing Ieee Transactions On Signal Processing. 63: 528-537 |

Blanchard JD, Tanner J. (2015) Performance comparisons of greedy algorithms in compressed sensing Numerical Linear Algebra With Applications. 22: 254-282 |

Bah B, Tanner J. (2014) Bounds of restricted isometry constants in extreme asymptotics: Formulae for Gaussian matrices Linear Algebra and Its Applications. 441: 88-109 |

Tanner J, Wei K. (2013) Normalized iterative hard thresholding for matrix completion Siam Journal On Scientific Computing. 35: S104-S125 |

Bah B, Tanner J. (2013) Vanishingly sparse matrices and expander graphs, with application to compressed sensing Ieee Transactions On Information Theory. 59: 7491-7508 |

Blanchard JD, Tanner J. (2013) GPU accelerated greedy algorithms for compressed sensing Mathematical Programming Computation. 5: 267-304 |

Powell AM, Tanner J, Wang Y, et al. (2012) Coarse quantization for random interleaved sampling of bandlimited signals Esaim: Mathematical Modelling and Numerical Analysis. 46: 605-618 |

Donoho DL, Tanner J. (2010) Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by random sampling Ieee Transactions On Information Theory. 56: 2002-2016 |

Chartrand R, Baraniuk RG, Eldar YC, et al. (2010) Introduction to the issue on compressive sensing Ieee Journal On Selected Topics in Signal Processing. 4: 241-243 |