{"id":1611,"date":"2021-07-15T11:37:43","date_gmt":"2021-07-15T11:37:43","guid":{"rendered":"https:\/\/afribary.com\/opportunities\/?p=1611"},"modified":"2021-07-15T11:37:43","modified_gmt":"2021-07-15T11:37:43","slug":"fully-funded-epsrc-phd-scholarship-noncomputability-in-linear-algebra-at-swansea-university","status":"publish","type":"post","link":"https:\/\/afribary.com\/opportunities\/1611\/fully-funded-epsrc-phd-scholarship-noncomputability-in-linear-algebra-at-swansea-university\/","title":{"rendered":"Fully Funded EPSRC PhD Scholarship: Non(Computability) In Linear Algebra at Swansea University"},"content":{"rendered":"

Opportunity: <\/strong>Fully Funded EPSRC PhD Scholarship: Non(Computability) In Linear Algebra at Swansea University<\/p>\n

Type: <\/strong>Postgraduate<\/p>\n

Value: <\/strong>Fully-funded<\/p>\n

Location: <\/strong>UK<\/p>\n

Who Can Apply: <\/strong>Domestic and International\u00a0students<\/p>\n

 <\/p>\n

 <\/p>\n

About The Scholarship<\/strong><\/p>\n

Algorithmic questions pertaining to linear algebra are predominately studied by either taking the underlying field to be discrete (e.g. the rationals) or by forgoing a rigorous model of computation and instead focussing on the development of concrete numerical algorithms. Computable analysis provides a convenient framework to simultaneously consider non-discrete fields (e.g. real or complex numbers) and a rigorous model of computation (ultimately founded on Turing machines). However, only few initial investigations have been undertaken so far, and the field is wide open for research by an ambitious PhD student.<\/p>\n

Many interesting computational problems in linear algebra will not be computable in general (this holds e.g. for solving systems of linear equations, finding the rank of a matrix or computing the orthogonal complement of a subspace in infinite dimensions). In these cases, it is very interesting to determine how non-computable the problem is, using the framework of Weihrauch degrees. Such results let us draw conclusions to what extent additional input information or a relaxed notion of algorithm can resolve the non-computability.<\/p>\n

This scholarship is funded by the Engineering and Physical Sciences Research Council (EPSRC).<\/p>\n

This four-year fully funded scholarship covers UK tuition fees and\u00a0an annual stipend of \u00a315,245.<\/p>\n

Research Training Support Grant of \u00a31,000 per annum is also provided.<\/p>\n

 <\/p>\n

 <\/p>\n

Requirements<\/strong><\/p>\n