Abstract
The previous work on forward‐backward method (FBM) for analysis of array problems restricts the element shapes to varying monotonically along the horizontal plane. This paper generalizes FBM, and allows element shapes of arbitrary cross sections while still retaining the efficiency and complexity. Numerical examples are presented to demonstrate its validity.
Notes
Correspondence addressee