Search

Search Funnelback University

Search powered by Funnelback
11 - 13 of 13 search results for `Computational Mathematics` |u:www.damtp.cam.ac.uk
  1. Fully-matching results

  2. WHEN CAN YOU TRUST FEATURE SELECTION? – I: A ...

    www.damtp.cam.ac.uk/research/afha/anders/InitialSubmitFeatureSelectionDeterministic.pdf
    18 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]
  3. WHEN CAN YOU TRUST FEATURE SELECTION? – II: ON ...

    www.damtp.cam.ac.uk/research/afha/anders/InitialSubmitFeatureSelectionProbabilistic.pdf
    18 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)
  4. Convergence analysis of oversampled collocation boundary element…

    www.damtp.cam.ac.uk/user/gam37/preprints/preprint_oversampled_collocation_maierhoferhuybrechs.pdf
    1 May 2024: Mathematics Subject Classification (2020) 45B05 65N35. The work of the first author was supported by the UK Engineering and Physical Sciences Research Council(EPSRC) grant EP/L016516/1 for the University ... The latter is, ofcourse, computationally less

Refine your results

Related searches for `Computational Mathematics` |u:www.damtp.cam.ac.uk

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.