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(n²) 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