Desktop Computer Flow Routingby Thomas N. Keefer, (A.M.ASCE), Res. Hydro.; U.S. Geological Survey, Bay St. Louis, MS,
Serial Information: Journal of the Hydraulics Division, 1974, Vol. 100, Issue 7, Pg. 1047-1058
Document Type: Journal Paper
A minimum storage convolution scheme is presented whereby the diffusion analogy or Harley routing models may be applied with desktop computers. The technique reduces the required storage for matrix convolution from (n² + nj + j + n - 1) to 2n, in which n is the number of response function ordinates and j is the number of input values. An extension of the technique may be used for multiple linearization routing.
Subject Headings: Computing in civil engineering | Computer models | Linear functions | Matrix (mathematics)
Services: Buy this book/Buy this article
Return to search