27 research outputs found

    A Direct Elliptic Solver Based on Hierarchically Low-rank Schur Complements

    Full text link
    A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N)O(N \log^2 N) arithmetic complexity and O(NlogN)O(N \log N) memory footprint. We provide a baseline for performance and applicability by comparing with well known implementations of the H\mathcal{H}-LU factorization and algebraic multigrid with a parallel implementation that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as H\mathcal{H}-LU and that it can tackle problems where algebraic multigrid fails to converge

    Implementing techniques for elliptic problems on vector processors

    No full text
    To provide the arithmetic power required by large-scale numerical simulations, the fastest computers today incorporate vector processing. Two types of vector architecture are defined, and the variation in performance that can occur on a vector processor as a function of algorithm and implementation, the consequences of this variation, and the performance of some basic operators on the two classes of vector architecture are discussed. The performance of some higher-level operators that should be used with caution is also considered. Then the implementation of techniques for elliptic problems using the operators discussed previously is reviewed. Included are Fast Poisson solvers, dissection, and point, line, block, and conjugant gradient schemes. Finally, some areas of research are noted. 1 figure. (RWR

    On Block Relaxation Techniques

    No full text
    In connection with efforts to utilize the CRAY-1 computer efficiently, we present some methods of analysis of rates of convergence for block iterative methods applied to the model problem. One of the more interesting methods involves relaxing on p x p blocks of points. A Cholesky decomposition is used for that smaller problem. One of the basic methods of analysis is a modification of a method discussed earlier by Parter. This analysis easily extends to more general second order elliptic problems

    Parallel Tridiagonal Equation Solvers

    No full text

    A Block Fourier Decomposition Method

    No full text
    corecore