Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 2
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parallel finite element density functional computations exploiting grid refinement and subspace recycling

  • Young, T. D.
  • Romero Alcalde, Eloy
  • Jose E. Roman|||0000-0003-1144-6772
In this communication computational methods that facilitate finite element analysis of density functional computations are developed. They are: (i) h¿adaptive grid refinement techniques that reduce the total number of degrees of freedom in the real space grid while improving on the approximate resolution of the wanted solution; and (ii) subspace recycling of the approximate solution in self-consistent cycles with the aim of improving the performance of the generalized eigenproblem solver. These techniques are shown to give a convincing speed-up in the computation process by alleviating the overhead normally associated with computing systems with many degrees-of-freedom., The anonymous referees whose comments improved the presentation of this work are gratefully acknowledged. The work was supported by the Polish Ministry of Science and Higher Education N N519402837 and by the Spanish Ministry of Science and Innovation TIN2009-07519 and TIN2012-32846. The resources provided by the Barcelona Supercomputing Center are also acknowledged.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Eigenvalue computations in the context of data-sparse approximations of integral operators

  • Jose E. Roman|||0000-0003-1144-6772
  • Vasconcelos, P. B.
  • Nunes, A. L.
In this work, we consider the numerical solution of a large eigenvalue problem resulting from a finite rank discretization of an integral operator. We are interested in computing a few eigenpairs, with an iterative method, so a matrix representation that allows for fast matrix-vector products is required. Hierarchical matrices are appropriate for this setting, and also provide cheap LU decompositions required in the spectral transformation technique. We illustrate the use of freely available software tools to address the problem, in particular SLEPc for the eigensolvers and HLib for the construction of H-matrices. The numerical tests are performed using an astrophysics application. Results show the benefits of the data-sparse representation compared to standard storage schemes, in terms of computational cost as well as memory requirements., This work was partially supported by the Spanish Ministerio de Ciencia e Innovacion under projects TIN2009-07519, TIN2012-32846 and AIC10-D-000600 and by Fundacao para a Ciencia e a Tecnologia - FCT under project FCT/MICINN proc 441.00.