Thesis
Computational problems in linear algebra
- Abstract:
-
In this thesis we consider the problems that arise in computational linear algebra when the matrix involved is vary large and sparse. This necessarily results in the emphasis throughout being mostly on iterative methods, but we begin with a chapter in which the usual direct methods for the solution of linear equations are summarized with the very large problem in mind. Methods for band-matrices and block tridiagonal matrices are c...
Expand abstract
- Peer review status:
- Peer reviewed
Actions
Authors
Bibliographic Details
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
Item Description
- UUID:
-
uuid:cc624a33-231b-4eda-a4b2-919557b2f2e4
- Local pid:
- polonsky:8:25
- Source identifiers:
-
601870472
- Deposit date:
- 2017-10-05
Terms of use
- Copyright holder:
- Reid, J; Reid, J K
- Copyright date:
- 1964
- Notes:
- This thesis was digitised thanks to the generosity of Dr Leonard Polonsky
Metrics
If you are the owner of this record, you can report an update to it here: Report update to this record