Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.519059
Title: Optimizing and approximating eigenvectors in max-algebra
Author: Tam, Kin Po
Awarding Body: University of Birmingham
Current Institution: University of Birmingham
Date of Award: 2010
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
This thesis is a reflection of my research in max-algebra. The idea of max-algebra is replacing the conventional pairs of operations (+,x) by (max, +). It has been known for some time that max-algebraic linear systems and eigenvalue-eigenvector problem can be used to describe industrial processes in which a number of processors work interactively and possibly in stages. Solutions to such max-algebraic linear system typically correspond to start time vectors which guarantee that the processes meet given deadlines or will work in a steady regime. The aim of this thesis is to study such problems subjected to additional requirements or constraints. These include minimization and maximization of the time span of completion times or starting times. We will also consider the case of minimization and maximization of the time span when some completion times or starting times are prescribed. The problem of integrality is also studied in this thesis. This is finding completion times or starting times which consists of integer values only. Finally we consider max-algebraic permuted linear systems where we permute a given vector and decide if the permuted vector is a satisfactory completion time or starting time. For some of these problems, we developed exact and efficient methods. Some of them turn out to be hard. For these we have proposed and tested a number of heuristics.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.519059  DOI: Not available
Keywords: QA Mathematics
Share: