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

19 May 2020: 106. [17] W. Arveson, in C-Algebras: 1943–1993 (San Antonio, TX,1993), Contemporary Mathematics Vol. ... 57] J.-N. Fuchs and J. Vidal, Phys. Rev. B 94, 205437 (2016).[58] C.

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

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

20 Nov 2023: COMPUTING SPECTRA – ON THE SOLVABILITY COMPLEXITY INDEX HIERARCHYAND TOWERS OF ALGORITHMS. J. BEN-ARTZI, M. J. COLBROOK, A. C. HANSEN, O. NEVANLINNA, AND M. SEIDEL. ABSTRACT. This paper establishes the Solvability Complexity Index (SCI) hierarchy

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

25 Sep 2015: FL47CH15-Goldstein ARI 1 December 2014 20:34. Green Algae as ModelOrganisms for BiologicalFluid DynamicsRaymond E. GoldsteinDepartment of Applied Mathematics and Theoretical Physics, Centre for MathematicalSciences, University of Cambridge,

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: 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

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

15 Jun 2020: COMPUTING SPECTRA - ON THE SOLVABILITY COMPLEXITY INDEX HIERARCHYAND TOWERS OF ALGORITHMS. J. BEN-ARTZI, M. J. COLBROOK, A. C. HANSEN, O. NEVANLINNA, AND M. SEIDEL. 1. INTRODUCTION. This paper resolves the long-standing computational spectral problem

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

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

27 Aug 2012: The hydrodynamics of swimming microorganisms. This article has been downloaded from IOPscience. Please scroll down to see the full text article. 2009 Rep. Prog. Phys. 72 096601. (http://iopscience.iop.org/0034-4885/72/9/096601). Download details:.

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.

21 Feb 2023: 2022 European Mathematical SocietyPublished by EMS Press. J. Eur. Math. Soc. (Online first) DOI 10.4171/JEMS/1289. Matthew J. Colbrook Anders C. Hansen. The foundations of spectral computations via theSolvability Complexity Index hierarchy. Received

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

9 Sep 2014: IOP PUBLISHING REPORTS ON PROGRESS IN PHYSICS. Rep. Prog. Phys. 72 (2009) 096601 (36pp) doi:10.1088/0034-4885/72/9/096601. The hydrodynamics of swimmingmicroorganismsEric Lauga1 and Thomas R Powers2. 1 Department of Mechanical and Aerospace

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

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