A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
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.
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.
Desktop Computer Flow Routing
Keefer, Thomas N. (author)
Journal of the Hydraulics Division ; 100 ; 1047-1058
2021-01-01
121974-01-01 pages
Article (Journal)
Electronic Resource
Unknown
Erratum for “Desktop Computer Flow Routing”
| ASCE | 2021
Computer-supported desktop for structural analysis
| British Library Online Contents | 1996
| Wiley | 2017
| IuD Bahn | 1995