Megson, Graham M.
(1991)
*A systolic Broyden algorithm.*
In:
Second International Specialist Seminar on the Design and Application of Parallel Digital Processors, 15-19 April, 1991, venue The Gulbenkian Foundation, Lisbon, Portugal.
Institution of Electrical Engineers, London, pp. 127-131.
ISBN 0852965192

## Abstract

A systolic array for solving nonlinear systems of equations using the Quasi-Newton Broyden algorithm is proposed. The design is based on the idea of reducing a single iteration of the method to a number of Schur complements which can be pipelined on a number of Faddeev arrays. The algorithm requires O(n2) cells for a system of n nonlinear equations in n unknowns and a single iteration of the method requires 6n+5 steps. The input and output formats of the array are identical allowing the start and end of consecutive iterations to be overlapped and pipelined.

Item Type: | Book Section |
---|---|

Uncontrolled Keywords: | Computational complexity, nonlinear equations, parallel algorithms, systolic arrays, Broyden algorithm, Faddeev arrays, Quasi-Newton Broyden algorithm, Schur complements, nonlinear systems of equations, systolic array |

Subjects: | University of Westminster > Science and Technology > Electronics and Computer Science, School of (No longer in use) |

Depositing User: | Miss Nina Watts |

Date Deposited: | 28 Jan 2009 15:57 |

Last Modified: | 19 Oct 2009 15:25 |

URI: | http://westminsterresearch.wmin.ac.uk/id/eprint/5742 |

### Actions (login required)

Edit Item (Repository staff only) |