Search
Search Funnelback University
- Refined by:
- Date: 2023
11 -
20 of
21
search results for `Computational Mathematics` |u:www.damtp.cam.ac.uk
Fully-matching results
-
brum_mjc
www.damtp.cam.ac.uk/user/mjc249/talks/birmingham_mjc.pdf20 Sep 2023: computational analysis Compute spectral properties rigorously, practically! • Continuous linear algebra Avoid the woes of discretization. • ... 16] Colbrook, Matthew J. "On the computation of geometric features of spectra of linear operators on -
PDEs_meets_DATA_mjc
www.damtp.cam.ac.uk/user/mjc249/talks/PDE_meets_data_mjc.pdf19 Sep 2023: computational analysis Compute spectral properties rigorously, practically! • Continuous linear algebra Avoid the woes of discretization. • ... 16] Colbrook, Matthew J. "On the computation of geometric features of spectra of linear operators on -
The difficulty of computing stable and accurate neural networks On…
www.damtp.cam.ac.uk/user/mjc249/talks/SAE_mjc.pdf9 Feb 2023: 2021). 12/38. Echoes of an old story. Hilbert’s vision (start of 20th century): secure foundations for all mathematics. ... I True statements in mathematics that cannot be proven! I Computational problems that cannot be computed by an algorithm! -
ON THE EXISTENCE OF OPTIMAL MULTI-VALUED DECODERS AND THEIR ...
www.damtp.cam.ac.uk/research/afha/anders/Version0.pdf28 Nov 2023: 1. INTRODUCTION. Finite dimensional inverse problems are ubiquitous in the computational sciences as they naturally appearin a plethora of applications. ... 5. RELATION TO PREVIOUS WORK. As an ongoing topic of research in many areas of mathematics, -
COMPUTING SPECTRA – ON THE SOLVABILITY COMPLEXITY INDEX HIERARCHYAND…
www.damtp.cam.ac.uk/research/afha/anders/SCI_FINAL.pdf20 Nov 2023: This is a classification hierarchy for all types of prob-lems in computational mathematics that allows for classifications determining the boundaries of what algorithmscan achieve. ... The SCI hierarchy captures many key computational issues in the -
WHEN CAN YOU TRUST FEATURE SELECTION? – I: A ...
www.damtp.cam.ac.uk/research/afha/anders/InitialSubmitFeatureSelectionDeterministic.pdf18 Dec 2023: Remark 1.3 (Trustworthiness of algorithms). By ’trustworthy algorithm’ for a computational problem, we meanthe following. ... Condition in optimisation: Condition numbers in computational mathematics and numerical analysis have beena mainstay [27, 39] -
Part IIC Michaelmas term 2021 QUANTUM INFORMATION AND COMPUTATION ...
www.damtp.cam.ac.uk/user/examples/D27L.pdf19 Nov 2023: e. the number of computational steps, and ‘space’i.e. the amount of computer memory workspace needed. ... Our discussion of computational complexity above shows that thelatter is surely the way to go! -
WHEN CAN YOU TRUST FEATURE SELECTION? – II: ON ...
www.damtp.cam.ac.uk/research/afha/anders/InitialSubmitFeatureSelectionProbabilistic.pdf18 Dec 2023: Hence, we assume that algorithms accessthe input to whatever finite precision desired and that all computational operations are done exactly. ... It is also a part of broader efforts to establishthe mathematics behindthe Solvability Complexity Index (SCI) -
Restarts subject to approximate sharpness: A parameter-free and…
www.damtp.cam.ac.uk/user/mjc249/pdfs/GeneralRestartSchemes.pdf11 Jan 2023: Mathematics Subject Classification: 65K0, 65B99, 68Q25, 90C25, 90C60. 1 Introduction. First-order methods are the workhorse of much of modern continuous optimization [6, 10, 24, 59].They are widely used to ... The main difference is theinclusion of the -
Computing spectral properties of topological insulators without…
www.damtp.cam.ac.uk/user/mjc249/pdfs/computing_top_ins.pdf7 Mar 2023: Forour computational problems, this allows:. 5. (P1) Computation of spectra and approximate eigenstates with guaranteed error control. ... There is an increased computational cost for smaller , which typically requireslarger truncation parameters.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.