skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Tuning the coarse space construction in a spectral AMG solver

Conference · · Procedia Computer Science

In this paper, we discuss strategies for computing subsets of eigenvectors of matrices corresponding to subdomains of finite element meshes achieving compromise between two contradicting goals. The subset of eigenvectors is required in the construction of coarse spaces used in algebraic multigrid methods (AMG) as well as in certain domain decomposition (DD) methods. The quality of the coarse spaces depends on the number of eigenvectors, which improves the approximation properties of the coarse space and impacts the overall performance and convergence of the associated AMG or DD algorithms. However, a large number of eigenvectors affects negatively the sparsity of the corresponding coarse matrices, which can become fairly dense. The sparsity of the coarse matrices can be controlled to a certain extent by the size of the subdomains (union of finite elements) referred to as agglomerates. If the size of the agglomerates is too large, then the cost of the eigensolvers increases and eventually can become unacceptable for the purpose of constructing the AMG or DD solvers. This paper investigates strategies to optimize the solution of the partial eigenproblems of interest. In particular, we examine direct and iterative eigensolvers for computing those subsets. Our experiments with a well-known model of an oil-reservoir simulation benchmark indicate that iterative eigensolvers can lead to significant improvements in the overall performance of an AMG solver that exploits such spectral construction of coarse spaces.

Research Organization:
Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
Sponsoring Organization:
USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
DOE Contract Number:
AC02-05CH11231
OSTI ID:
1827641
Journal Information:
Procedia Computer Science, Conference: The International Conference on Computational Science (ICCS 2016), San Diego, CA (United States), 6-8 Jun 2016
Country of Publication:
United States
Language:
English

References (12)

Tenth SPE Comparative Solution Project: A Comparison of Upscaling Techniques journal August 2001
Combination of Jacobi-Davidson and conjugate gradients for the partial symmetric eigenproblem journal January 2001
LAPACK Users' Guide software January 1999
Dynamic analysis by direct superposition of Ritz vectors journal November 1982
Smoothed Aggregation Spectral Element Agglomeration AMG: SA-ρAMGe book January 2012
ARPACK Users' Guide book January 1998
The Symmetric Eigenvalue Problem book January 1998
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices journal December 2007
Two-Level Adaptive Algebraic Multigrid for a Sequence of Problems with Slowly Varying Random Coefficients journal January 2013
A Shifted Block Lanczos Algorithm for Solving Sparse Symmetric Generalized Eigenproblems journal January 1994
The use of a refined error bound when updating eigenvalues of tridiagonals journal July 1985
Dynamic analysis of structures using lanczos co-ordinates journal January 1984

Similar Records

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients
Technical Report · Mon Apr 02 00:00:00 EDT 2012 · OSTI ID:1827641

Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method
Journal Article · Thu Sep 22 00:00:00 EDT 2016 · SIAM Journal on Scientific Computing · OSTI ID:1827641

NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Technical Report · Fri Jan 22 00:00:00 EST 2016 · OSTI ID:1827641

Related Subjects