{'fraction_non_alphanumeric': 0.02, 'fraction_numerical': 0.004, 'mean_word_length': 5.481865284974093, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An iterated tangential filtering decomposition

Large linear systems arising from the discretization of partial differential equations with finite differences or finite elements on structured grids in dimension d(d ⩾ 3) require efficient preconditioners. For a symmetric and positive definite (SPD) matrix, we propose a SPD block LDLT preconditioner whose factorized form requires a smaller amount of memory than the original matrix. Moreover, the computing time for the preconditioner solves is linear with respect to the number of unknowns. The preconditioner is built in d stages: in a first stage, we use the tangential filtering decomposition of Wittum et al. and obtain a preconditioner which remains rather difficult to factorize. Then, in a second stage, we apply tangential filtering decomposition recursively to the diagonal blocks of this first preconditioner. The final stage consists of factorizing exactly the blocks corresponding to one dimensional problems. Such preconditioners can also be computed adaptively and combined in a multiplicative way. A generic programming implementation is discussed and numerical tests are presented, in particular for problems with highly heterogeneous media. Copyright © 2003 John Wiley & Sons, Ltd.