Skip to main content

SOLVERS DE VALORES PROPIOS ALTAMENTE ESCALABLES EN EL CONTEXTO DE LA BIBLIOTECA SLEPC

TIN2016-75985-P

•
Funding agency name Agencia Estatal de Investigación
Funding agency acronym AEI
Program Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia
Subprogram Subprograma Estatal de Generación de Conocimiento
Call Proyectos de I+D (Excelencia / Generación de Conocimiento)
Call year 2016
State Plan 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Beneficiary centre UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

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

NEP: A Module for the Parallel Solution of Nonlinear Eigenvalue Problems in SLEPc

  • Campos, Carmen
  • Jose E. Roman|||0000-0003-1144-6772
[EN] SLEPc is a parallel library for the solution of various types of large-scale eigenvalue problems. Over the past few years, we have been developing a module within SLEPc, called NEP, that is intended for solving nonlinear eigenvalue problems. These problems can be defined by means of a matrix-valued function that depends nonlinearly on a single scalar parameter. We do not consider the particular case of polynomial eigenvalue problems (which are implemented in a different module in SLEPc) and focus here on rational eigenvalue problems and other general nonlinear eigenproblems involving square roots or any other nonlinear function. The article discusses how the NEP module has been designed to fit the needs of applications and provides a description of the available solvers, including some implementation details such as parallelization. Several test problems coming from real applications are used to evaluate the performance and reliability of the solvers., This work was partially funded by the Spanish Agencia Estatal de Investigacion AEI http://ciencia.gob.es under grants TIN2016-75985-P AEI and PID2019-107379RB-I00 AEI (including European Commission FEDER funds).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Verification of the Parallel Pin-Wise Core Simulator pCTF/PARCSv3.2 in Operational Control Rod Drop Transient Scenarios

  • Ramos Peinado, Enrique|||0000-0002-5960-5501
  • Jose E. Roman|||0000-0003-1144-6772
  • Miró Herrero, Rafael|||0000-0003-1012-0869
  • Abarca Giménez, Agustín
  • Bermejo, Juan A.
  • Ortego, Alberto
  • Posada-Barral, Jose Maria
[EN] Thanks to advances in computer technology, it is feasible to obtain detailed reactor core descriptions for safety analysis of the light water reactor (LWR), in order to represent realistically the fuel elements design, as is the case for three-dimensional coupled simulations for local neutron kinetics and thermal hydraulics. This scenario requires an efficient thermal-hydraulic code that can produce a response in a reasonable time for large-scale, detailed models. In two-fluid codes, such as the thermal-hydraulic subchannel code COBRA-TF, the time restriction is even more important, since the set of equations to be solved is more complex. We have developed a message passing interface parallel version of COBRA-TF, called pCTF. The parallel code is based on a cell-oriented domain decomposition approach, and performs well in models that consist of many cells. The Jacobian matrix is computed in parallel, with each processor in charge of calculating the coefficients related to a subset of the cells. Furthermore, the resulting system of linear equations is also solved in parallel, by exploiting solvers and preconditioners from PETSc. The goal of this study is to demonstrate the capability of the recently developed pCTF/PARCS coupled code to simulate large cores with a pin-by-pin level of detail in an acceptable computational time, using for this purpose two control rod drop operational transients that took place in the core of a three-loop pressurized water reactor. As a result, the main safety parameters of the core hot channel have been calculated by the coupled code in a pin level of detail, obtaining best estimate results for this transient., This work has been partially supported by the Universitat Politecnica de Valencia under Projects COBRA_PAR (PAID-05-11-2810) and OpenNUC (PAID-05-12), and by the Spanish Ministerio de Economia y Competitividad under Projects SLEPc-HS (TIN2016-75985-P) and NUC-MULTPHYS (ENE2012-34585).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Parallel Direct Solution of the Covariance-Localized Ensemble Square Root Kalman Filter Equations with Matrix Functions

  • Steward, Jeffrey L.
  • Aksoy, Altug
  • Jose E. Roman|||0000-0003-1144-6772
  • Lamas Daviña, Alejandro
[EN] Recently, the serial approach to solving the square root ensemble Kalman filter (ESRF) equations in the presence of covariance localization was found to depend on the order of observations. As shown previously, correctly updating the localized posterior covariance in serial requires additional effort and computational expense. A recent work by Steward et al. details an all-at-once direct method to solve the ESRF equations in parallel. This method uses the eigenvectors and eigenvalues of the forward observation covariance matrix to solve the difficult portion of the ESRF equations. The remaining assimilation is easily parallelized, and the analysis does not depend on the order of observations. While this allows for long localization lengths that would render local analysis methods inefficient, in theory, an eigenpair-based method scales as the cube number of observations, making it infeasible for large numbers of observations. In this work, we extend this method to use the theory of matrix functions to avoid eigenpair computations. The Arnoldi process is used to evaluate the covariance-localized ESRF equations on the reduced-order Krylov subspace basis. This method is shown to converge quickly and apparently regains a linear scaling with the number of observations. The method scales similarly to the widely used serial approach of Anderson and Collins in wall time but not in memory usage. To improve the memory usage issue, this method potentially can be used without an explicit matrix. In addition, hybrid ensemble and climatological covariances can be incorporated., This research was partially funded by the NOAA Hurricane Forecast Improvement Project Award NA14NWS4680022. This work was partially supported by Agencia Estatal de Investigacion (AEI) under Grant TIN2016-75985-P, which includes European Commission ERDF funds. Alejandro Lamas Davina was supported by the Spanish Ministry of Education, Culture and Sport through a grant with reference FPU13-06655. The fourth author's work was in part carried out under the auspices of CIMAS, a joint institute of the University of Miami and NOAA, Cooperative Agreement NA15OAR4320064. The authors acknowledge the NOAA Research and Development High Performance Computing Program for providing computing and storage resources that have contributed to the research results reported within this paper (http://rdhpcs.noaa.gov). We thank Jeff Anderson, Shu-Chih Yang, and three anonymous reviewers for their helpful comments and contributions. We also thank Hui Christophersen for providing technical assistance.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Scalable Block-Tridiagonal Eigensolvers in the Context of Electronic Structure Calculations

  • Lamas Daviña, Alejandro
  • Jose E. Roman|||0000-0003-1144-6772
  • Cartoixà, Xavier
[EN] In computer-based numerical simulations, some methods to determine the electronic and optical properties of semiconductor nanostructures, require computing the energies that correspond to the interior eigenvalues of a Hamiltonian matrix. We study the case in which the Schrödinger equation is expanded into a matrix that has a block-tridiagonal structure. Additionally, the matrix can have two extra non zero blocks in the corners due to periodic boundary conditions. Given that not the whole eigenspectrum is required, we choose to use projection methods to compute the necessary set of eigenvalues. The shift-and-invert Lanczos method requires to solve a linear system at each iteration. We have developed a parallel code that improves the scalability of this step by exploiting the block structure. Results show that, to solve these specific cases, this method offers better scalability when compared to a general-purpose solver such as MUMPS., The authors would like to acknowledge the support by Agencia Estatal de Investigacion under project TIN2016-75985-P, which includes European Commission ERDF funds, and the Spanish Ministerio de Economia y Competitividad under project No. TEC2015-67462-C2-1-R (MINECO/FEDER). Also, this work has received funding from the European Union¿s Horizon 2020 research and innovation program under grant agreement No 696656, and the Department d¿Universitats, Recerca i Societat de la Informacio of the Generalitat de Catalunya under contract 2014-SGR-384. Alejandro Lamas Davi¿na was supported by the Spanish Ministry of Education, Culture and Sport through grant FPU13-06655. The authors are also grateful for the resources provided by the Spanish Supercomputing Network.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

MPI-CUDA parallel linear solvers for block-tridiagonal matrices in the context of SLEPc&apos, s eigensolvers

  • Lamas Daviña, Alejandro
  • Jose E. Roman|||0000-0003-1144-6772
[EN] We consider the computation of a few eigenpairs of a generalized eigenvalue problem Ax = lambda Bx with block-tridiagonal matrices, not necessarily symmetric, in the context of Krylov methods. In this kind of computation, it is often necessary to solve a linear system of equations in each iteration of the eigensolver, for instance when B is not the identity matrix or when computing interior eigenvalues with the shift-and-invert spectral transformation. In this work, we aim to compare different direct linear solvers that can exploit the block-tridiagonal structure. Block cyclic reduction and the Spike algorithm are considered. A parallel implementation based on MPI is developed in the context of the SLEPc library. The use of GPU devices to accelerate local computations shows to be competitive for large block sizes., This work was supported by Agencia Estatal de Investigacion (AEI) under grant TIN2016-75985-P, which includes European Commission ERDF funds. Alejandro Lamas Davina was supported by the Spanish Ministry of Education, Culture and Sport through a grant with reference FPU13-06655.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Inertia-based spectrum slicing for symmetric quadratic eigenvalue problems

  • Campos, Carmen
  • Jose E. Roman|||0000-0003-1144-6772
[EN] In the quadratic eigenvalue problem (QEP) with all coefficient matrices symmetric, there can be complex eigenvalues. However, some applications need to compute real eigenvalues only. We propose a Lanczos-based method for computing all real eigenvalues contained in a given interval of large-scale symmetric QEPs. The method uses matrix inertias of the quadratic polynomial evaluated at different shift values. In this way, for hyperbolic problems, it is possible to make sure that all eigenvalues in the interval have been computed. We also discuss the general nonhyperbolic case. Our implementation is memory-efficient by representing the computed pseudo-Lanczos basis in a compact tensor product representation. We show results of computational experiments with a parallel implementation in the SLEPc library., Agencia Estatal de Investigacion, Grant/Award Number: TIN2016-75985-P
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation

  • Campos, Carmen
  • Jose E. Roman|||0000-0003-1144-6772
[EN] Large-scale polynomial eigenvalue problems can be solved by Krylov methods operating on an equivalent linear eigenproblem (linearization) of size d center dot n where d is the polynomial degree and n is the problem size, or by projection methods that keep the computation in the n-dimensional space. Jacobi-Davidson belongs to the latter class of methods, and, since it is a preconditioned eigensolver, it may be competitive in cases where explicitly computing a matrix factorization is exceedingly expensive. However, a fully fledged implementation of polynomial Jacobi-Davidson has to consider several issues, including deflation to compute more than one eigenpair, use of non-monomial bases for the case of large degree polynomials, and handling of complex eigenvalues when computing in real arithmetic. We discuss these aspects and present computational results of a parallel implementation in the SLEPc library., This work was supported by Agencia Estatal de Investigación (AEI) under Grant TIN2016-75985-P, which includes European Commission ERDF funds.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

SIESTA-SIPs: Massively parallel spectrum-slicing eigensolver for an ab initio molecular dynamics package

  • Keçeli, Murat
  • Corsetti, Fabiano
  • Campos, Carmen
  • Zhang, Hong
  • Vazquez-Mayagoitia, Alvaro
  • Zapol, Peter
  • Wagner, Albert F.
  • Jose E. Roman|||0000-0003-1144-6772
[EN] Integration of Shift-and-Invert Parallel Spectral Transformation (SIPs) eigensolver (as implemented in the SLEPc library) into an ab initio molecular dynamics package, SIESTA, is described. The effectiveness of the code is demonstrated on applications to polyethylene chains, boron nitride sheets, and bulk water clusters. For problems with the same number of orbitals, the performance of the SLEPc eigensolver depends on the sparsity of the matrices involved, favoring reduced dimensional systems such as polyethylene or boron nitride sheets in comparison to bulk systems like water clusters. For all problems investigated, performance of SIESTA-SIPs exceeds the performance of SIESTA with default solver (ScaLAPACK) at the larger number of cores and the larger number of orbitals. A method that improves the load-balance with each iteration in the self-consistency cycle by exploiting the emerging knowledge of the eigenvalue spectrum is demonstrated. (c) 2018 Wiley Periodicals, Inc., Contract grant sponsor: Argonne National Laboratory, and by Basic Energy Science, provided by the Director, Office of Science, of the U.S. Department of Energy; Contract grant number: DE-AC02-06CH11357; Contract grant sponsor: The U.S. Department of Energy Office of Science, Office of Basic Energy Sciences Division of Materials Science and Engineering; Contract grant number: DE-AC02-06CH11357; Contract grant sponsor: The Spanish Ministry of Economy and Competitiveness; Contract grant number: TIN2016-75985-P (including European Commission FEDER funds)
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Non-linear eigenvalue problems with GetDP and SLEPc: Eigenmode computations of frequency-dispersive photonic open structures

  • Demesy, Guillaume
  • Nicolet, André
  • Gralak, Boris
  • Geuzaine, Christophe
  • Campos, Carmen
  • Jose E. Roman|||0000-0003-1144-6772
[EN] We present a framework to solve non-linear eigenvalue problems suitable for a Finite Element discretization. The implementation is based on the open-source finite element software GetDP and the open-source library SLEPc. As template examples, we propose and compare in detail different ways to address the numerical computation of the electromagnetic modes of frequency-dispersive objects. This is a non-linear eigenvalue problem involving a non-Hermitian operator. A classical finite element formulation is derived for five different solutions and solved using algorithms adapted to the large size of the resulting discrete problem. The proposed solutions are applied to the computation of the dispersion relation of a diffraction grating made of a Drude material. The important numerical consequences linked to the presence of sharp corners and sign-changing coefficients are carefully examined. For each method, the convergence of the eigenvalues with respect to the mesh refinement and the shape function order, as well as computation time and memory requirements are investigated. The open-source template model used to obtain the numerical results is provided. Details of the implementation of polynomial and rational eigenvalue problems in GetDP are given in the appendix. Program summary Program title: NonLinearEVP.pro CPC Library link to program files: http://dx.doi.org/10.17632/r57nxxtc62.1 Licensing provisions: GNU General Public License 3 Programming language: Gmsh (http://gmsh.info), GetDP (http://getdp.info) Nature of problem: Computing the eigenvalues and eigenvectors of electromagnetic wave problems involving frequency-dispersive materials. The resulting eigenvalue problem is non-linear and non-hermitian. Solution method: Finite element method coupled to efficient non-linear eigenvalue solvers: Relevant SLEPc solvers were interfaced to the Finite Element software GetDP. Several linearization schemes are benchmarked. (C) 2020 Elsevier B.V. All rights reserved., The work was partly supported by the French National Agency for Research (ANR) under the project "Resonance" (ANR-16-CE240013). The authors acknowledge the members of the project "Resonance'' for fruitful discussions. C. Campos and J. E. Roman were supported by the Spanish Agencia Estatal de Investigacion (AEI) under project SLEPc-HS (TIN2016-75985-P), which includes European Commission ERDF funds. C. Geuzaine was supported by ARC grant for Concerted Research Actions (ARC WAVES 15/19-03), financed by the Wallonia-Brussels Federation of Belgium. The authors thank Christian Engström from Ume¿ Universitet for helpful comments. Maxence Cassier from Institut Fresnel is acknowledged. Finally, the authors address special thanks to Anne-Sophie Bonnet Ben-Dhia and Camille Carvalho from INRIA (POEMS) for their motivating remarks and insights.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

An extension of the Cayley transform method for a parameterized generalized inverse eigenvalue problem

  • Dalvand, Zeynab
  • Hajarian, Masoud
  • Jose E. Roman|||0000-0003-1144-6772
[EN] Since recent studies have shown that the Cayley transform method can be an effective iterative method for solving the inverse eigenvalue problem, in this work, we consider using an extension of it for solving a type of parameterized generalized inverse eigenvalue problem and prove its locally quadratic convergence. This type of inverse eigenvalue problem, which includes multiplicative and additive inverse eigenvalue problems, appears in many applications. Also, we consider the case where the given eigenvalues are multiple. In this case, we describe a modified problem that is not overdetermined and discuss the extension of the Cayley transform method for this modified problem. Finally, to demonstrate the effectiveness of these algorithms, we present some numerical examples to show that the proposed methods are practical and efficient., The authors would like to express their heartfelt thanks to the editor and anonymous referees for their useful comments and constructive suggestions that substantially improved the quality and presentation of this article. This research was developed during a visit of Z.D. to Universitat Politecnica de Valencia. Z.D. would like to thank the hospitality shown by D. Sistemes Informatics i Computacio, Universitat Politecnica de Valencia. J.E.R. was partially supported by the Spanish Agencia Estatal de Investigacion (AEI) under grant TIN2016-75985-P, which includes European Commission ERDF funds. The authors thank Carmen Campos for useful comments on an initial draft of the article.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Multigroup neutron diffusion equation with the finite volume method in reactors using MOX fuels

  • Bernal-Garcia, Alvaro
  • Jose E. Roman|||0000-0003-1144-6772
  • Miró Herrero, Rafael|||0000-0003-1012-0869
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The use of mixed oxide (MOX) fuel to partially fill the cores of commercial light water reactors (LWRs) gives rise to a reduction of the radioactive waste and production of more energy. However, the use of MOX fuels in LWRs changes the physics characteristics of the reactor core, since the variation with energy of the cross sections for the plutonium isotopes is more complex than for the uranium isotopes. Although the neutron diffusion theory could be applied to reactors using MOX fuels, more emphasis on treatment of the energy discretization should be placed. This energy discretization could be typically 4¿8 energy groups, instead of the standard 2-energy group approach. In this work, the authors developed a finite volume method for discretizing the general multigroup neutron diffusion equation. This method solves the eigenvalue problem by using Krylov projection methods, in which the size of the vectors used for building the Krylov subspace does not depend on the number of energy groups, but it can solve the multigroup formulation with upscattering and fission production terms in several energy groups. The method was applied to MOX reactors for its validation. © 2017 Atomic Energy Society of Japan. All rights reserved., This work has been partially supported by the Spanish Ministerio de Eduacion Cultura y Deporte [grant number FPU13/01009]; the Spanish Ministerio de Ciencia e Innovacion [project ENE2014-59442-P]; the Spanish Ministerio de Economia y Competitividad and the European Fondo Europeo de Desarrollo Regional (MINECO/FEDER) [project ENE2015-68353-P]; the Generalitat Valenciana [project PROMETEOII/2014/008]; and the Spanish Ministerio de Economia y Competitividad [project TIN2016-75985-P].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

A Krylov-Schur solution of the eigenvalue problem for the neutron diffusion equation discretized with the Raviart-Thomas method

  • Bernal-Garcia, Alvaro
  • Hébert, Alain
  • Jose E. Roman|||0000-0003-1144-6772
  • Miró Herrero, Rafael|||0000-0003-1012-0869
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] Mixed-dual formulations of the finite element method were successfully applied to the neutron diffusion equation, such as the Raviart¿Thomas method in Cartesian geometry and the Raviart¿Thomas¿Schneider in hexagonal geometry. Both methods obtain system matrices which are suitable for solving the eigenvalue problem with the preconditioned power method. This method is very fast and optimized, but only for the calculation of the fundamental mode. However, the determination of non-fundamental modes is important for modal analysis, instabilities, and fluctuations of nuclear reactors. So, effective and fast methods are required for solving eigenvalue problems. The most effective methods are those based on Krylov subspaces projection combined with restart, such as Krylov¿Schur. In this work, a Krylov¿Schur method has been applied to the neutron diffusion equation, discretized with the Raviart¿Thomas and Raviart¿Thomas¿Schneider methods., This work has been partially supported by the Spanish Ministerio de Eduacion Cultura y Deporte [grant number FPU13/01009]; Spanish Ministerio de Ciencia e Innovacion [project number ENE2014-59442-P]; Spanish Ministerio de Economia y Competitividad and the European Fondo Europeo de Desarrollo Regional (FEDER) [project number ENE2015-68353-P (MINECO/FEDER)]; Generalitat Valenciana [project number PROMETEOII/2014/008]; Universitat Politecnica de Valencia [project number UPPTE/2012/118]; Spanish Ministerio de Economia y Competitividad [project number TIN2016-75985-P].
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Calculation of multiple eigenvalues of the neutron diffusion equation discretized with a parallelized finite volume method

  • Bernal-Garcia, Alvaro
  • Jose E. Roman|||0000-0003-1144-6772
  • Miró Herrero, Rafael|||0000-0003-1012-0869
  • Verdú Martín, Gumersindo Jesús|||0000-0001-5098-080X
[EN] The spatial distribution of the neutron flux within the core of nuclear reactors is a key factor in nuclear safety. The easiest and fastest way to determine it is by solving the eigenvalue problem of the neutron diffusion equation, which only contains spatial derivatives. The approximation of these derivatives is performed by discretizing the geometry and using numerical methods. In this work, the authors used a finite volume method based on a polynomial expansion of the neutron flux. Once these terms are discretized, a set of matrix equations is obtained, which constitutes the eigenvalue problem. A very effective class of methods for the solution of eigenvalue problems are those based on projection onto a low-dimensional subspace, such as Krylov subspaces. Thus, the SLEPc library was used for solving the eigenvalue problem by means of the Krylov-Schur method, which also uses projection methods of PETSc for solving linear systems. This work includes a complete sensitivity analysis of different issues: mesh, polynomial terms, linear systems solvers and parallelization., This work has been partially supported by the Spanish Ministerio de Eduacion Cultura y Deporte under the grant FPU13/01009, the Spanish Ministerio de Ciencia e Innovacion under the project ENE2014-59442-P, the Spanish Ministerio de Economia y Competitividad and the European Fondo Europeo de Desarrollo Regional (FEDER) under the project ENE2015-68353-P (MINECO/FEDER), the Generalitat Valenciana under the project PROMETEOII/2014/008, and the Spanish Ministerio de Economia y Competitividad and the European Fondo Europeo de Desarrollo Regional (FEDER) under the project TIN2016-075985-P.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Stellarator microinstabilities and turbulence at low magnetic shear

  • Faber, B. J.
  • Pueschel, M. J.
  • Terry, P. W.
  • Hegna, C. C.
  • Jose E. Roman|||0000-0003-1144-6772
[EN] Gyrokinetic simulations of drift waves in low-magnetic-shear stellarators reveal that simulation domains comprised of multiple turns can be required to properly resolve critical mode structures important in saturation dynamics. Marginally stable eigenmodes important in saturation of ion temperature gradient modes and trapped electron modes in the Helically Symmetric Experiment (HSX) stellarator are observed to have two scales, with the envelope scale determined by the properties of the local magnetic shear and an inner scale determined by the interplay between the local shear and magnetic field-line curvature. Properly resolving these modes removes spurious growth rates that arise for extended modes in zero-magnetic-shear approximations, enabling use of a zero-magnetic-shear technique with smaller simulation domains and attendant cost savings. Analysis of subdominant modes in trapped electron mode (TEM)-driven turbulence reveals that the extended marginally stable modes play an important role in the nonlinear dynamics, and suggests that the properties induced by low magnetic shear may be exploited to provide another route for turbulence saturation., The authors would like to thank F. Jenko for insightful questions that motivated this research and J. Smoniewski and J. H. E. Proll for engaging discussions. This work was supported by US DoE grant nos. DE-FG02-99ER54546, DE-FG02-93ER54222 and DE-FG02-89ER53291. J.E.R. was supported by Agencia Estatal de Investigacion (AEI) under grant TIN2016-75985-P, which includes European Commission ERDF funds. This research used resources of the National Energy Research Scientific Computing Center (NERSC), a US Department of Energy Office of Science User Facility operated under contract no. DE-AC02-05CH11231. This research was performed using the compute resources and assistance of the UW-Madison Center For High Throughput Computing (CHTC) in the Department of Computer Sciences. The CHTC is supported by UW-Madison, the Advanced Computing Initiative, the Wisconsin Alumni Research Foundation, the Wisconsin Institutes for Discovery and the National Science Foundation, and is an active member of the Open Science Grid, which is supported by the National Science Foundation and the US Department of Energy's Office of Science.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Artículo científico (JournalArticle)

Computation of scattering resonances in absorptive and dispersive media with applications to metal-dielectric nano-structures

  • Araujo C., Juan C.
  • Campos, Carmen
  • Engstrom, Christian
  • Jose E. Roman|||0000-0003-1144-6772
[EN] In this paper we consider scattering resonance computations in optics when the resonators consist of frequency dependent and lossy materials, such as metals at optical frequencies. The proposed computational approach combines a novel hp-FEM strategy, based on dispersion analysis for complex frequencies, with a fast implementation of the nonlinear eigenvalue solver NLEIGS. Numerical computations illustrate that the pre-asymptotic phase is significantly reduced compared to standard uniform h and p strategies. Moreover, the efficiency grows with the refractive index contrast, which makes the new strategy highly attractive for metal-dielectric structures. The hp-refinement strategy together with the efficient parallel code result in highly accurate approximations and short runtimes on multi processor platforms. (C) 2019 Elsevier Inc. All rights reserved., Juan C. Araujo and Christian Engstrom gratefully acknowledge the support of the Swedish Research Council under Grant No. 621-2012-3863. Carmen Campos and Jose E. Roman were supported by the Spanish Agencia Estatal de Investigacion (AEI) under project SLEPc-HS (TIN2016-75985-P), which includes European Commission ERDF funds. The supercomputer Tirant 3 used in some of the computational experiments belongs to Universitat de Valencia. Juan C. Araujo acknowledges Andree Falgin Hultgren, for his contributions on the meshing routine.