{'fraction_non_alphanumeric': 0.03455882352941177, 'fraction_numerical': 0.008823529411764706, 'mean_word_length': 5.075892857142857, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A generalized forward-backward method for the efficient analysis of large array problems

Development of novel analysis techniques to treat large array problems remains attractive due to the increasing need to employ very large array structures in practical applications. Recently, a forward-backward method (FBM), has been extended to treat large array problems; several unique advantages have been demonstrated. The previous approach of FBM requires monotonic variation on the array surface in order to set up a forward-backward procedure. This limitation is overcome by a generalization of FBM (GFBM) (see Pino, M.R. et al., 1999), which allows arbitrary array elements in general shapes. In contrast to the previous FBM (see Chou, H-T, IEE Proc.-Microw. Antennas Propag., vol.147, no.3, 2000) where the current computation sweeps cell by cell (each cell corresponding to a MoM basis of pulse function) in the forward or backward procedure, the GFBM sweeps the current computation element by element (corresponding to array elements). A simple MoM procedure with very few unknowns (usually only these unknowns to model three elements at most) is employed to obtain the forward current and its backward correction on the selected element. This modification allows arbitrary array elements to be treated accurately. Numerical results demonstrate its validity.