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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
