Pasar al contenido principal

METODOS AVANZADOS Y TECNICAS COMPUTACIONALES NOVEDOSAS PARA LA RESOLUCION NUMERICA DE PROBLEMAS DE VALORES PROPIOS DE GRAN DIMENSION

TIN2009-07519

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2009
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

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

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

Strategies for spectrum slicing based on restarted Lanczos methods

  • Campos González, Maria Camen
  • Jose E. Roman|||0000-0003-1144-6772
In the context of symmetric-definite generalized eigenvalue problems, it is often required to compute all eigenvalues contained in a prescribed interval. For large-scale problems, the method of choice is the so-called spectrum slicing technique: a shift-and-invert Lanczos method combined with a dynamic shift selection that sweeps the interval in a smart way. This kind of strategies were proposed initially in the context of unrestarted Lanczos methods, back in the 1990's. We propose variations that try to incorporate recent developments in the field of Krylov methods, including thick restarting in the Lanczos solver and a rational Krylov update when moving from one shift to the next. We discuss a parallel implementation in the SLEPc library and provide performance results. © 2012 Springer Science+Business Media, LLC., This work was supported by the Spanish Ministerio de Ciencia e Innovacion under grant TIN2009-07519.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Multi-dimensional gyrokinetic parameter studies based on eigenvalue computations

  • Merz, F.
  • Kowitz, C.
  • Romero Alcalde, Eloy
  • Jenko, F.
  • Jose E. Roman|||0000-0003-1144-6772
Plasma microinstabilities, which can be described in the framework of the linear gyrokinetic equations, are routinely computed in the context of stability analyses and transport predictions for magnetic confinement fusion experiments. The GENE code, which solves the gyrokinetic equations, has been coupled to the SLEPc package for an efficient iterative, matrix-free, and parallel computation of rightmost eigenvalues. This setup is presented, including the preconditioner which is necessary for the newly implemented Jacobi-Davidson solver. The fast computation of instabilities at a single parameter set is exploited to make parameter scans viable, that is to compute the solution at many points in the parameter space. Several issues related to parameter scans are discussed, such as an efficient parallelization over parameter sets and subspace recycling. © 2011 Elsevier B.V. All rights reserved., E. Romero and J.E. Roman were supported by the Spanish Ministry of Science and Innovation (MICINN) under project number TIN2009-07519.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc

  • Romero Alcalde, Eloy
  • Jose E. Roman|||0000-0003-1144-6772
In the context of large-scale eigenvalue problems, methods of Davidson type such as Jacobi-Davidson can be competitive with respect to other types of algorithms, especially in some particularly difficult situations such as computing interior eigenvalues or when matrix factorization is prohibitive or highly inefficient. However, these types of methods are not generally available in the form of high-quality parallel implementations, especially for the case of non-Hermitian eigenproblems. We present our implementation of various Davidson-type methods in SLEPc, the Scalable Library for Eigenvalue Problem Computations. The solvers incorporate many algorithmic variants for subspace expansion and extraction, and cover a wide range of eigenproblems including standard and generalized, Hermitian and non-Hermitian, with either real or complex arithmetic. We provide performance results on a large battery of test problems., This work was supported by the Spanish Ministerio de Ciencia e Innovacion under project TIN2009-07519. Author's addresses: E. Romero, Institut I3M, Universitat Politecnica de Valencia, Cami de Vera s/n, 46022 Valencia, Spain), and J. E. Roman, Departament de Sistemes Informatics i Computacio, Universitat Politecnica de Valencia, Cami de Vera s/n, 46022 Valencia, Spain; email: jroman@dsic.upv.es.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Parallel computation of 3-D soil-structure interaction in time domain with a coupled FEM/SBFEM approach

  • Schauer, Marco
  • Langer, Sabine
  • Jose E. Roman|||0000-0003-1144-6772
  • Quintana-Ortí, Enrique S.|||0000-0002-5454-165X
This paper introduces a parallel algorithm for the scaled boundary finite element method (SBFEM). The application code is designed to run on clusters of computers, and it enables the analysis of large-scale soil-structure-interaction problems, where an unbounded domain has to fulfill the radiation condition for wave propagation to infinity. The main focus of the paper is on the mathematical description and numerical implementation of the SBFEM. In particular, we describe in detail the algorithm to compute the acceleration unit impulse response matrices used in the SBFEM as well as the solvers for the Riccati and Lyapunov equations. Finally, two test cases validate the new code, illustrating the numerical accuracy of the results and the parallel performances. © Springer Science+Business Media, LLC 2011., Jose E. Roman and Enrique S. Quintana-Orti were partially supported by the Spanish Ministerio de Ciencia e Innovacion under grants TIN2009-07519, and TIN2008-06570-C04-01, respectively.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Large scale simulation of wave propagation in soils interacting with structures using FEM and SBFEM

  • Schauer, M
  • Langer, S
  • Quintana-Orti, ES
  • Jose E. Roman|||0000-0003-1144-6772
This paper applies a parallel algorithm for a coupled Finite Element/Scaled Boundary Element (FEM/SBFEM)-approach to study soil-structure-interaction problems. The application code is designed to run on clusters of computers, and it enables the analysis of large-scale problems. A crucial point of the approach is that the SBFEM fulfills the radiation condition. Hence, the hybrid numerical approach is well suited for such problems where wave propagation to infinity in an unbounded domain must be considered. The main focus of the paper is to show the applicability of the numerical implementation on large scale problems. First the coupled FEM/SBFEM approach is validated by comparing the numerical results with a semi-analytical solution for a settlement problem. Then the implemented algorithm is applied to study the dynamical behavior of founded wind energy plants under time dependent loading. © 2011 IMACS., Jose E. Roman and Enrique S. Quintana-Orti were partially supported by the Spanish Ministerio de Ciencia e Innovacion under grants TIN2009-07519, and TIN2008-06570-C04-01, respectively.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Computing subdominant unstable modes of turbulent plasma with a parallel Jacobi-Davidson eigensolver

  • Romero Alcalde, Eloy
  • Jose E. Roman|||0000-0003-1144-6772
In the numerical solution of large-scale eigenvalue problems, Davidson-type methods are an increasingly popular alternative to Krylov eigensolvers. The main motivation is to avoid the expensive factorizations that are often needed by Krylov solvers when the problem is generalized or interior eigenvalues are desired. In Davidson-type methods, the factorization is replaced by iterative linear solvers that can be accelerated by a smart preconditioner. Jacobi-Davidson is one of the most effective variants. However, parallel implementations of this method are not widely available, particularly for non-symmetric problems. We present a parallel implementation that has been included in SLEPc, the Scalable Library for Eigenvalue Problem Computations, and test it in the context of a highly scalable plasma turbulence simulation code. We analyze its parallel efficiency and compare it with a Krylov-Schur eigensolver. © 2011 John Wiley and Sons, Ltd.., The authors are indebted to Florian Merz for providing us with the test cases and for his useful suggestions. The authors acknowledge the computer resources provided by the Barcelona Supercomputing Center (BSC). This work was supported by the Spanish Ministerio de Ciencia e Innovacion under project TIN2009-07519.
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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Jacobi-Davidson type method with a correction equation tailored for integral operators

  • Vasconcelos, Paulo B.
  • d'Almeida, Filomena D.
  • Jose E. Roman|||0000-0003-1144-6772
We propose two iterative numerical methods for eigenvalue computations of large dimensional problems arising from finite approximations of integral operators, and describe their parallel implementation. A matrix representation of the problem on a space of moderate dimension, defined from an infinite dimensional one, is computed along with its eigenpairs. These are taken as initial approximations and iteratively refined, by means of a correction equation based on the reduced resolvent operator and performed on the moderate size space, to enhance their quality. Each refinement step requires the prolongation of the correction equation solution back to a higher dimensional space, defined from the infinite dimensional one. This approach is particularly adapted for the computation of eigenpair approximations of integral operators, where prolongation and restriction matrices can be easily built making a bridge between coarser and finer discretizations. We propose two methods that apply a Jacobi–Davidson like correction: Multipower Defect-Correction (MPDC), which uses a single-vector scheme, if the eigenvalues to refine are simple, and Rayleigh–Ritz Defect-Correction (RRDC), which is based on a projection onto an expanding subspace. Their main advantage lies in the fact that the correction equation is performed on a smaller space while for general solvers it is done on the higher dimensional one. We discuss implementation and parallelization details, using the PETSc and SLEPc packages. Also, numerical results on an astrophysics application, whose mathematical model involves a weakly singular integral operator, are presented., This work was partially supported by European Regional Development Fund through COMPETE, FCT-Fundacao para a Ciencia e a Tecnologia through CMUP-Centro de Matematica da Universidade do Porto and Spanish Ministerio de Ciencia e Innovacion under projects TIN2009-07519 and AIC10-D-000600.