The discrete convolution based Fast Fourier Transform algorithm (DC-FFT) has been successfully applied in numerical simulation of contact problems. The algorithm is revisited from a mathematical point of view, equivalent to a Toeplitz matrix multiplied by a vector. The nature of the convolution property permits one to implement the algorithm with fewer constraints in choosing the computational domains. This advantageous feature is explored in the present work, and is expected to be beneficial to many tribological studies.

This content is only available via PDF.
You do not currently have access to this content.