160 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Claremont McKenna CollegeUS16 papers
- California Institute of TechnologyUS7 papers
- Keck Graduate InstituteUS7 papers
- University of California, Los AngelesUS6 papers
- University of Southern CaliforniaUS6 papers
- Los Alamos National LaboratoryUS5 papers
- Pomona CollegeUS5 papers
- Claremont InstituteUS4 papers
- Massachusetts Institute of TechnologyUS3 papers
- California State University, FullertonUS2 papers
- Colorado School of MinesUS2 papers
- Goucher CollegeUS2 papers
11 papers · 1 filter
An Eigenfunction Approach to Conversion of the Laplace Transform of Point Masses on the Real Line to the Fourier Domain
Michael McKenna, Hrushikesh N. Mhaskar, Richard G. Spencer
Motivated by applications in magnetic resonance relaxometry, we consider the following problem: Given samples of a function , where i…
Stable soft extrapolation of entire functions
Dmitry Batenkov, Laurent Demanet, Hrushikesh N. Mhaskar
Soft extrapolation refers to the problem of recovering a function from its samples, multiplied by a fast-decaying window and perturbed by an additive noise, over an interval which…
A Numerical Study of Steklov Eigenvalue Problem via Conformal Mapping
Weaam Alhejaili, Chiu-Yen Kao
In this paper, a spectral method based on conformal mappings is proposed to solve Steklov eigenvalue problems and their related shape optimization problems in two dimensions. To ap…
Minimum Sobolev norm interpolation of derivative data
S. Chandrasekaran, C. H. Gorman, H. N. Mhaskar
We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points o…
Stochastic Gradient Descent for Linear Systems with Missing Data
Anna Ma, Deanna Needell
Traditional methods for solving linear systems have quickly become impractical due to an increase in the size of available data. Utilizing massive amounts of data is further compli…
Approximate quadrature measures on data--defined spaces
Hrushikesh N. Mhaskar
An important question in the theory of approximate integration is to study the conditions on the nodes and weights that allow an estimate of the form $$ \sup_{f…
Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods
Anna Ma, Deanna Needell, Aaditya Ramdas
The Kaczmarz and Gauss-Seidel methods both solve a linear system by iteratively refining the solution estimate. Recent interest in these methods has been spar…
Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints
Nam Nguyen, Deanna Needell, Tina Woolf
Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for possibly non-convex optimization problems with sparsity…
A Comparison of Clustering and Missing Data Methods for Health Sciences
Ran Zhao, Deanna Needell, Christopher Johansen +1
In this paper, we compare and analyze clustering methods with missing data in health behavior research. In particular, we propose and analyze the use of compressive sensing's matri…
Randomized Block Kaczmarz Method with Projection for Solving Least Squares
Deanna Needell, Ran Zhao, Anastasios Zouzias
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax=b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershy…
Accurate Evaluation of Polynomials
Brian M. Sutin
For a large class of polynomials, the standard method of polynomial evaluation, Horner's method, can be very inaccurate. The alternative method given here is on average 100 to 1000…