|Chapter title||A systolic Broyden algorithm|
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.
|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|
|Book title||Second International Specialist Seminar on the Design and Application of Parallel Digital Processors, 15-19 April, 1991, venue The Gulbenkian Foundation, Lisbon, Portugal|
|Publisher||Institution of Electrical Engineers|
|Place of publication||London|
|Web address (URL)||http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=140032&isnumber=3776|