ETD Collection

Permanent URI for this collectionhttps://wiredspace.wits.ac.za/handle/10539/104


Please note: Digitised content is made available at the best possible quality range, taking into consideration file size and the condition of the original item. These restrictions may sometimes affect the quality of the final published item. For queries regarding content of ETD collection please contact IR specialists by email : IR specialists or Tel : 011 717 4652 / 1954

Follow the link below for important information about Electronic Theses and Dissertations (ETD)

Library Guide about ETD

Browse

Filters

20151

Settings

Author: search.filters.author.Earle, Adam ChristopherSubject: search.filters.subject.Linear systems.

Search Results

Now showing 1 - 1 of 1
  • No Thumbnail Available
    Item
    Minimum L∞ norm solutions to finite dimensional algebraic underdetermined linear systems
    (2015-02-04) Earle, Adam Christopher
    A new method of solution to the problem of nding the minimum `1 norm solution to an algebraic underdetermined linear system is developed. The new method is a geometrically clear, primal method. Like some existing methods, the new method can be logically divided into two parts. A number of new techniques are suggested in this part of the algorithm, including an iterative ascent procedure. In the second part of the solution process, the particular solution obtained in the rst part is iteratively improved. We have developed a number of new techniques here corresponding to both single and multi-element exchange procedures. Central to the new method is the development of descent criteria for a direction vector, and the stopping condition.The performance of our algorithm is also compared with two well-known methods from the literature. Our method is shown to be much superior to these well known-methods with respect to both the number of iterations and the wall-clock time required. The iterative computational complexity of the new method also compares favourably with most well-known methods. A geometric heuristic is developed for initial active constraint set selection and a number of theoretical results are given. The heuristic stands to be much more valuable if the results presented herein can be generalised