Fast transforms for tridiagonal linear equations (Q1343044)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fast transforms for tridiagonal linear equations
scientific article

    Statements

    Fast transforms for tridiagonal linear equations (English)
    0 references
    0 references
    0 references
    30 June 1995
    0 references
    This paper studies the use of Fourier, sine and cosine transformations for solving (in the 1D case) or preconditioning (in the 2D case) linear systems, which arise from the discretization of elliptic problems. In view of the connections between the circulant matrix by congruence transformation with the Fourier or the sine matrices, a direct solver is given in the 1D case, using only FFT and the Sherman-Morrison-Woodbury formula. By taking the Kronecker product of the one-dimensional transformations, for the 2D case, a good preconditioner for the conjugate gradient method is suggested. Numerical examples show that these new methods are fast and highly parallelizable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    iterative methods
    0 references
    fast Fourier transformation
    0 references
    Toeplitz matrices
    0 references
    fast sine transformation
    0 references
    fast cosine transformation
    0 references
    parallel computation
    0 references
    numerical examples
    0 references
    preconditioning
    0 references
    circulant matrix
    0 references
    congruence transformation
    0 references
    Sherman-Morrison-Woodbury formula
    0 references
    conjugate gradient method
    0 references
    0 references