The following pages link to Anders C. Hansen (Q413645):
Displaying 41 items.
- Stable reconstructions in Hilbert spaces and the resolution of the Gibbs phenomenon (Q413646) (← links)
- Generalized sampling and infinite-dimensional compressed sensing (Q515987) (← links)
- A theoretical framework for backward error analysis on manifolds (Q542594) (← links)
- On the order of deferred correction (Q548338) (← links)
- A generalized sampling theorem for stable reconstructions in arbitrary bases (Q692617) (← links)
- New barriers in complexity theory: on the solvability complexity index and the towers of algorithms (Q889488) (← links)
- Density theorems for nonuniform sampling of bandlimited functions using derivatives or bunched measurements (Q1691986) (← links)
- Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling (Q1979911) (← links)
- On the stable sampling rate for binary measurements and wavelet reconstruction (Q2300752) (← links)
- On the infinite-dimensional QR algorithm (Q2315193) (← links)
- On the approximation of spectra of linear operators on Hilbert spaces (Q2426503) (← links)
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate (Q2450938) (← links)
- Weighted frames of exponentials and stable recovery of multidimensional functions from nonuniform Fourier samples (Q2627890) (← links)
- Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing (Q2658730) (← links)
- Beyond Consistent Reconstructions: Optimality and Sharp Bounds for Generalized Sampling, and Application to the Uniform Resampling Problem (Q2870603) (← links)
- BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING (Q2971048) (← links)
- On Asymptotic Incoherence and Its Implications for Compressed Sensing of Inverse Problems (Q2977021) (← links)
- Infinite-dimensional numerical linear algebra: theory and applications (Q2997304) (← links)
- On the Solvability Complexity Index, the 𝑛-pseudospectrum and approximations of spectra of operators (Q3074553) (← links)
- On Reconstructing Functions from Binary Measurements (Q3296176) (← links)
- Structure and Optimisation in Computational Harmonic Analysis: On Key Aspects in Sparse Regularisation (Q3384130) (← links)
- The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing (Q3460832) (← links)
- Complexity issues in computing spectra, pseudospectra and resolvents (Q4596307) (← links)
- Linear reconstructions and the analysis of the stable sampling rate (Q4631279) (← links)
- Generalized sampling: extension to frames and inverse and ill-posed problems (Q4917589) (← links)
- Compressive Imaging: Structure, Sampling, Learning (Q4986961) (← links)
- On Stable Reconstructions from Nonuniform Fourier Measurements (Q5174286) (← links)
- Linear Stable Sampling Rate: Optimality of 2D Wavelet Reconstructions from Fourier Measurements (Q5253455) (← links)
- On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels (Q5266378) (← links)
- A Stability Barrier for Reconstructions from Fourier Samples (Q5415983) (← links)
- Generalized sampling and the stable and accurate reconstruction of piecewise analytic functions from their Fourier coefficients (Q5497022) (← links)
- The foundations of spectral computations via the solvability complexity index hierarchy (Q6064883) (← links)
- Generalized sampling: stable reconstructions, inverse problems and compressed sensing over the continuum (Q6245340) (← links)
- A note on compressed sensing of structured sparse wavelet coefficients from subsampled Fourier measurements (Q6250142) (← links)
- On asymptotic structure in compressed sensing (Q6252390) (← links)
- Continuous Compressed Sensing of Inelastic and Quasielastic Helium Atom Scattering Spectra (Q6266044) (← links)
- On the infinite-dimensional QR algorithm (Q6353872) (← links)
- The extended Smale's 9th problem -- On computational barriers and paradoxes in estimation, regularisation, computer-assisted proofs and learning (Q6381663) (← links)
- Generalised hardness of approximation and the SCI hierarchy -- On determining the boundaries of training algorithms in AI (Q6410754) (← links)
- On the existence of optimal multi-valued decoders and their accuracy bounds for undersampled inverse problems (Q6461140) (← links)
- When can you trust feature selection? -- II: On the effects of random data on condition in statistics and optimisation (Q6464110) (← links)