Search

5 Oct 2013: On the approximation of spectra of linear operatorson Hilbert spaces. Anders C. Hansen. DAMTP, University of Cambridgeemail: A.Hansen@damtp.cam.ac.uk. Abstract. We present several new techniques for approximating spectra of linear operators

13 Apr 2007: Operator theory and C-algebras in infinitedimensional numerical linear algebra. Anders C. HansenUniversity of Cambridge. Abstract. We present several new techniques for approximating spectra of linear operators (notnecessarily bounded) on an

22 Oct 2016: Complexity Issues in Computing Spectra, Pseudospectra. and Resolvents. Anders C. HansenDAMTP, Centre for Mathematical Sciences. University of CambridgeWilberforce Rd, Cambridge CB3 0WA. United Kingdom. Olavi NevanlinnaDepartment of Mathematics and

20 Oct 2012: Beyond consistent reconstructions: optimality and sharp bounds. for generalized sampling, and application to the uniform. resampling problem. Ben AdcockDepartment of Mathematics. Purdue University150 N. University StreetWest Lafayette, IN 47907.

5 Oct 2013: On the approximation of spectra of linear operatorson Hilbert spaces. Anders C. Hansen. DAMTP, University of Cambridgeemail: A.Hansen@damtp.cam.ac.uk. Abstract. We present several new techniques for approximating spectra of linear operators

5 Oct 2013: Beyond consistent reconstructions: optimality and sharp bounds. for generalized sampling, and application to the uniform. resampling problem. Ben AdcockDepartment of Mathematics. Purdue University150 N. University StreetWest Lafayette, IN 47907.

6 Dec 2020: On the infinite-dimensional QR algorithm. Matthew J. Colbrook† and Anders C. Hansen†. †DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Rd,Cambridge CB3 0WA, United Kingdom. Abstract. Spectral computations of

8 Nov 2015: On the Solvability Complexity Index, the n-Pseudospectrumand Approximations of Spectra of Operators. ANDERS C. HANSENApplied and Computational Mathematics, California Institute of Technology,. hansen@acm.caltech.edu. Abstract. We show that it is

5 Oct 2013: On optimal wavelet reconstructions from Fourier samples:. linearity and universality of the stable sampling rate. B. Adcocka, A. C. Hansenb,c, and C. Poonb. aDepartment of Mathematics, Purdue UniversitybDepartment of Applied Mathematics and

2 Nov 2016: Breaking the coherence barrier: A new theory forcompressed sensing. B. AdcockSimon Fraser Univ. A. C. HansenUniv. of Cambridge. C. PoonUniv. of Cambridge. B. RomanUniv. of Cambridge. Abstract. This paper presents a framework for compressed sensing

2 Nov 2016: Breaking the coherence barrier: A new theory forcompressed sensing. B. AdcockSimon Fraser Univ. A. C. HansenUniv. of Cambridge. C. PoonUniv. of Cambridge. B. RomanUniv. of Cambridge. Abstract. This paper presents a framework for compressed sensing

5 Oct 2013: Beyond consistent reconstructions: optimality and sharp bounds. for generalized sampling, and application to the uniform. resampling problem. Ben AdcockDepartment of Mathematics. Purdue University150 N. University StreetWest Lafayette, IN 47907.

8 Nov 2015: On the Solvability Complexity Index, the n-Pseudospectrumand Approximations of Spectra of Operators. ANDERS C. HANSENApplied and Computational Mathematics, California Institute of Technology,. hansen@acm.caltech.edu. Abstract. We show that it is

5 Oct 2013: On optimal wavelet reconstructions from Fourier samples:. linearity and universality of the stable sampling rate. B. Adcocka, A. C. Hansenb,c, and C. Poonb. aDepartment of Mathematics, Purdue UniversitybDepartment of Applied Mathematics and

29 Jan 2019: On the infinite-dimensional QR algorithm. Matthew J. Colbrook† and Anders C. Hansen†. †DAMTP, Centre for Mathematical Sciences, University of Cambridge, Wilberforce Rd,Cambridge CB3 0WA, United Kingdom. Abstract. Spectral computations of