Performance of the parallel block Jacobi method with dynamic ordering for the symmetric eigenvalue problem

Abstract

<p> We investigate the performance of the parallel block Jacobi method for the symmetric eigenvalue problem with dynamic ordering both theoretically and experimentally. First, we present an improved global convergence theorem of the method that takes into account the effect of annihilating multiple blocks at once. Next, we compare the dynamic ordering with two representative parallel cyclic orderings experimentally and show that the former can speedup the convergence for ill-conditioned matrices considerably with little extra cost. </p>

Journal

  • JSIAM Letters

    JSIAM Letters 10 (0), 41-44, 2018

    The Japan Society for Industrial and Applied Mathematics

Citations (3)*help

See more

References(6)*help

See more

Related Projects

See more

Details 詳細情報について

Report a problem

Back to top