There are many algorithms for permutation groups that rely on the availability of a BSGS for the group. With matrix groups a BSGS can not always be found efficiently. In this talk I will talk out computing in large degree matrix groups using Ascgbacher's Theorem. In particular the construction of a chief series, re-ordering this chief series into the standard Trivial Fitting model and computing Sylow subgroups.