Application of preconditioned Krylov subspace iterative FFT techniques to method of lines for analysis of the infinite plane metallic grating

Abstract

In this paper, both fast Fourier transformation (FFT) and

Fast Analysis and Design of Frequency Selective Surface Using the Gmresr-FFT Method

“…This has led to the development of various iterative algorithms with the FFT technique for solving the surface current with computational complexity of O(N log N ), where N denotes the number of unknowns. Here the details are omitted (see [11,[19][20][21][22][23][24][25][26][27]). After the unknown currents are obtained, the transmission coefficient can be calculated from the unknown currents.…”

“…To accelerate the convergence rate of iterative methods, preconditioning techniques are usually employed [17,21,22,[27][28][29][30][31][32][33]. One widely used preconditioner is the incomplete LU (ILU) decomposition of the coefficient matrix and its block variants [21,28].…”

“…One widely used preconditioner is the incomplete LU (ILU) decomposition of the coefficient matrix and its block variants [21,28]. However, to form these preconditioner, additional computing time is required, depending on the preconditioning algorithm.…”

SSOR preconditioned GPBiCG method for the linear interference cancellation of asynchronous CDMA systems

“…Recently various preconditioning strategies had been used to improve the convergence of GPBiCG algorithm [21][22][23][24][25][26], which attempt to transform the matrix equation into one with more favorable properties for an iterative method. The incomplete LU factorizations of the coefficient matrix and its block variants are a widely used class of preconditioners [21][22].…”

Fast analysis of microwave integrated circuits by use of the inner‐outer flexible GMRES‐FFT method

“…To reduce the number of iterations, various preconditioning techniques have been used [5, 7, 9 -20]. One of the most widely used preconditioners is the incomplete LU (ILU) decomposition of the coefficient matrix and its block variants [12][13][14]. Another is based on the factorization of the approximated inverse of the coefficient matrix [15][16].…”