dc.contributor.author Garcia, D. dc.contributor.author Pardo, D. dc.contributor.author Dalcin, L. dc.contributor.author Calo, V.M. dc.date.accessioned 2018-08-21T12:24:16Z dc.date.available 2018-08-21T12:24:16Z dc.date.issued 2018-06-15 dc.identifier.issn 0045-7825 dc.identifier.uri http://hdl.handle.net/20.500.11824/840 dc.description.abstract Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces $C^0$ hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree $p=3$, the iterative solver is approximately $2.6$ times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers. en_US dc.description.sponsorship David Pardo has received funding from the Project of the Spanish Ministry of Economy and Competitiveness en_US with reference MTM2016-76329-R (AEI/FEDER, EU), and MTM2016-81697-ERC/AEI, the BCAM “Severo Ocho” accreditation of excellence SEV-2013-0323, and the Basque Government through the BERC 2014-2017 program and the Consolidated Research Group Grant IT649-13 on “Mathematical Modeling, Simulation, and Industrial Applica- tions (M2SI)”. This publication was also made possible in part by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 644602, the CSIRO Professorial Chair in Computational Geoscience at Curtin University, the Deep Earth Imaging Enterprise Future Science Platforms of the Commonwealth Scientific Industrial Research Organisation, CSIRO, of Australia, the Mega-grant of the Russian Federation Government (N14.Y26.31.0013) and the Curtin Institute for Computation. The J. Tinsley Oden Faculty Fellowship Research Program at the Institute for Computational Engineering and Sciences (ICES) of the University of Texas at Austin has partially supported the visits of VMC to ICES. The authors acknowledge the Texas Advanced Computing Center (TACC) at The University of Texas at Austin for providing HPC resources that have contributed to the research results reported within this paper dc.format application/pdf en_US dc.language.iso eng en_US dc.rights Reconocimiento-NoComercial-CompartirIgual 3.0 España en_US dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/es/ en_US dc.subject Isogeometric Analysis (IGA) en_US dc.subject Finite Element Analysis (FEA) en_US dc.subject refined Isogeometric Analysis (rIGA) en_US dc.subject solver-based discretization en_US dc.subject iterative solvers en_US dc.subject Conjugate gradient en_US dc.subject Incomplete LU factorization en_US dc.subject k-refinement en_US dc.title Refined Isogeometric Analysis for a Preconditioned Conjugate Gradient Solver en_US dc.type info:eu-repo/semantics/article en_US dc.identifier.doi https://doi.org/10.1016/j.cma.2018.02.006 dc.relation.publisherversion https://www.sciencedirect.com/science/article/pii/S004578251830077X en_US dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/644202 en_US dc.relation.projectID ES/1PE/SEV-2013-0323 en_US dc.relation.projectID ES/1PE/MTM2016-76329-R en_US dc.relation.projectID ES/1PE/MTM2016-81697-ERC en_US dc.relation.projectID EUS/BERC/BERC.2014-2017 en_US dc.rights.accessRights info:eu-repo/semantics/openAccess en_US dc.type.hasVersion info:eu-repo/semantics/publishedVersion en_US dc.journal.title Computer Methods in Applied Mechanics and Engineering en_US
﻿

This item appears in the following Collection(s)

Except where otherwise noted, this item's license is described as Reconocimiento-NoComercial-CompartirIgual 3.0 España