Adaptive hard-thresholding for linear inverse problems

Paul Rochet

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Adaptive hard-thresholding for linear inverse problems”

Spectral Galerkin approximation of Fokker-Planck equations with unbounded drift

David J. Knezevic, Endre Süli (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

This paper is concerned with the analysis and implementation of spectral Galerkin methods for a class of Fokker-Planck equations that arises from the kinetic theory of dilute polymers. A relevant feature of the class of equations under consideration from the viewpoint of mathematical analysis and numerical approximation is the presence of an unbounded drift coefficient, involving a smooth convex potential that is equal to +∞ along the boundary ∂ of the computational domain . Using...

From h to p Efficiently: Selecting the Optimal Spectral/ Discretisation in Three Dimensions

C. D. Cantwell, S. J. Sherwin, R. M. Kirby, P. H. J. Kelly (2011)

Mathematical Modelling of Natural Phenomena

Similarity:

There is a growing interest in high-order finite and spectral/ element methods using continuous and discontinuous Galerkin formulations. In this paper we investigate the effect of - and -type refinement on the relationship between runtime performance and solution accuracy. The broad spectrum of possible domain discretisations makes establishing a performance-optimal selection non-trivial. Through comparing the runtime of different implementations...