Pasar al contenido principal

MARCO DE OPTIMIZACION ESTOCASTICA PARA EL DISEÑO EXTRUCTURAL DE AERONAVES

RTI2018-096898-B-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2018
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario CENTRE INTERNACIONAL DE METODES NUMERICS A L ENGINYERIA

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A generic finite element framework on parallel tree-based adaptive meshes

  • Badia, Santiago|||0000-0003-2391-4086
  • Martín, Alberto F.
  • Miranda Neiva, Eric|||0000-0002-1220-9624
  • Verdugo Rojano, Francesc|||0000-0003-3667-443X
In this work we formally derive and prove the correctness of the algorithms and data structures in a parallel, distributed-memory, generic finite element framework that supports h-adaptivity on computational domains represented as forest-of-trees. The framework is grounded on a rich representation of the adaptive mesh suitable for generic finite elements that is built on top of a low-level, light-weight forest-of-trees data structure handled by a specialized, highly parallel adaptive meshing engine, for which we have identified the requirements it must fulfill to be coupled into our framework. Atop this two-layered mesh representation, we build the rest of the data structures required for the numerical integration and assembly of the discrete system of linear equations. We consider algorithms that are suitable for both subassembled and fully assembled distributed data layouts of linear system matrices. The proposed framework has been implemented within the FEMPAR scientific software library, using p4est as a practical forest-of-octrees demonstrator. A strong scaling study of this implementation when applied to Poisson and Maxwell problems reveals remarkable scalability up to 32.2K CPU cores and 482.2M degrees of freedom. Besides, a comparative performance study of FEMPAR and the state-of-the-art deal.II finite element software shows at least comparative performance, and at most a factor of 2--3 improvement in the h-adaptive approximation of a Poisson problem with first- and second-order Lagrangian finite elements, respectively., Financial support from the European Commission under the EMUSIC and ExaQUteprojects within the Horizon 2020 Framework Programme is gratefully acknowledged (grants 690725and 800898, resp.). This work has been partially funded by the project RTI2018-096898-B-I00from the “FEDER/Ministerio de Ciencia e Innovación–Agencia Estatal de Investigación”. The firstauthor gratefully acknowledges the support received from the Catalan Government through theICREA Acadèmia Research Program. The third author gratefully acknowledges the support receivedfrom the Catalan Government through an FI fellowship (2019 FI-B2-00090; 2018 FI-B1-00095; 2017FI-B-00219). The fourth author gratefully acknowledges the support received from the Secretariad’Universitats i Recerca of the Catalan Government in the framework of the Beatriu Pinós Program(grant 2016 BP 00145). The authors thankfully acknowledge the computer resources at Marenostrum-IV and the technical support provided by the Barcelona Supercomputing Center (RES-ActivityID:FI-2018-2-0009, FI-2018-3-0029, IM-2020-1-0002)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Robust and scalable h-adaptive aggregated unfitted finite elements for interface elliptic problems

  • Miranda Neiva, Eric|||0000-0002-1220-9624
  • Badia, Santiago|||0000-0003-2391-4086
This work introduces a novel, fully robust and highly-scalable, -adaptive aggregated unfitted finite element method for large-scale interface elliptic problems. The new method is based on a recent distributed-memory implementation of the aggregated finite element method atop a highly-scalable Cartesian forest-of-trees mesh engine. It follows the classical approach of weakly coupling nonmatching discretisations at the interface to model internal discontinuities at the interface. We propose a natural extension of a single-domain parallel cell aggregation scheme to problems with a finite number of interfaces; it straightforwardly leads to aggregated finite element spaces that have the structure of a Cartesian product. We demonstrate, through standard numerical analysis and exhaustive numerical experimentation on several complex Poisson and linear elasticity benchmarks, that the new technique enjoys the following properties: well-posedness, robustness with respect to cut location and material contrast, optimal (h-adaptive) approximation properties, high scalability and easy implementation in large-scale finite element codes. As a result, the method offers great potential as a useful finite element solver for large-scale interface problems modelled by partial differential equations., Financial support from the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme is gratefully acknowledged. This work has been partially funded by the projects RTI2018-096898-B-I00 and ERC2018-092843 from the “Ministerio de Ciencia e Innovación” of Spain. E. Neiva gratefully acknowledges the support received from the Catalan Government, Spain through a FI fellowship (2019 FI-B2-00090; 2018 FI-B1-00095; 2017 FI-B-00219). S. Badia gratefully acknowledges the support received from the Catalan Government through the ICREA Acadèmia Research Program, Spain. The authors thankfully acknowledge the computer resources at Marenostrum-IV and the technical support provided by the Barcelona Supercomputing Center (RES-ActivityIDs: IM-2019-3-0008, IM-2020-1-0002). Financial support to CIMNE via the CERCA Programme/Generalitat de Catalunya, Spain is also acknowledged., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Robust high-order unfitted finite elements by interpolation-based discrete extension

  • Badia, Santiago|||0000-0003-2391-4086
  • Miranda Neiva, Eric|||0000-0002-1220-9624
  • Verdugo Rojano, Francesc|||0000-0003-3667-443X
In this work, we propose a novel formulation for the solution of partial differential equations using finite element methods on unfitted meshes. The proposed formulation relies on the discrete extension operator proposed in the aggregated finite element method. This formulation is robust with respect to the location of the boundary/interface within the cell. One can prove enhanced stability results, not only on the physical domain, but on the whole active mesh. However, the stability constants grow exponentially with the polynomial order being used, since the underlying extension operators are defined via extrapolation. To address this issue, we introduce a new variant of aggregated finite elements, in which the extension in the physical domain is an interpolation for polynomials of order higher than two. As a result, the stability constants only grow at a polynomial rate with the order of approximation. We demonstrate that this approach enables robust high-order approximations with the aggregated finite element method. The proposed method is consistent, optimally convergent, and with a condition number that scales optimally for high order approximation., This research was partially funded by the Australian Government through the Australian Research Council (project number DP210103092), the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme and the project RTI2018-096898-B-I00 from the “FEDER/Ministerio de Ciencia e Innovación (MCIN) – Agencia Estatal de Investigación (AEI)”. F. Verdugo acknowledges support from the “Severo Ochoa Program for Centers of Excellence in R&D (2019-2023)” under the grant CEX2018-000797-S funded by MCIN/AEI/10.13039/501100011033. This work was also supported by computational resources provided by the Australian Government through NCI under the National Computational Merit Allocation Scheme., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

The aggregated unfitted finite element method on parallel tree-based adaptive meshes

  • Badia, Santiago|||0000-0003-2391-4086
  • Martín, Alberto F.
  • Miranda Neiva, Eric|||0000-0002-1220-9624
  • Verdugo Rojano, Francesc|||0000-0003-3667-443X
In this work, we present an adaptive unfitted finite element scheme that combines the aggregated finite element method with parallel adaptive mesh refinement. We introduce a novel scalable distributed-memory implementation of the resulting scheme on locally adapted Cartesian forest-of-trees meshes. We propose a two-step algorithm to construct the finite element space at hand by means of a discrete extension operator that carefully mixes aggregation constraints of problematic degrees of freedom, which get rid of the small cut cell problem, and standard hanging degree of freedom constraints, which ensure trace continuity on nonconforming meshes. Following this approach, we derive a finite element space that can be expressed as the original one plus well-defined linear constraints. Moreover, it requires minimum parallelization effort, using standard functionality available in existing large-scale finite element codes. Numerical experiments demonstrate its optimal mesh adaptation capability, robustness to cut location, and parallel efficiency, on classical Poisson hp-adaptivity benchmarks. Our work opens the path to functional and geometrical error-driven dynamic mesh adaptation with the aggregated finite element method in large-scale realistic scenarios. Likewise, it can offer guidance for bridging other scalable unfitted methods and parallel adaptive mesh refinement., This work was supported by the European Commission under the FET-HPC ExaQUte project (grant 800898) within the Horizon 2020 Framework Programme and the project RTI2018- 096898-B-I00, by the Barcelona Supercomputing Center (RES-ActivityID: FI-2019-1-0007, IM-2019- 2-0007, IM-2019-3-0008), and by the Australian Government. The work of the third author was supported by the Catalan Government through an FI fellowship (2019 FI-B2-00090, 2018 FI-B1- 00095, 2017 FI-B-00219). The work of the fourth author was supported by the Spanish Ministry of Economy and Competitiveness through the “Severo Ochoa Programme for Centers of Excellence in R&D (CEX2018-000797-S)” and Secretaria d’Universitats i Recerca of the Catalan Government in the framework of the Beatriu Pinós Program (grant 2016 BP 00145)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Linking ghost penalty and aggregated unfitted methods

  • Badia, Santiago|||0000-0003-2391-4086
  • Miranda Neiva, Eric|||0000-0002-1220-9624
  • Verdugo Rojano, Francesc|||0000-0003-3667-443X
In this work, we analyse the links between ghost penalty stabilisation and aggregation-based discrete extension operators for the numerical approximation of elliptic partial differential equations on unfitted meshes. We explore the behaviour of ghost penalty methods in the limit as the penalty parameter goes to infinity, which returns a strong version of these methods. We observe that these methods suffer locking in that limit. On the contrary, aggregated finite element spaces are locking-free because they can be expressed as an extension operator from well-posed to ill-posed degrees of freedom. Next, we propose novel ghost penalty methods that penalise the distance between the solution and its aggregation-based discrete extension. These methods are locking-free and converge to aggregated finite element methods in the infinite penalty parameter limit. We include an exhaustive set of numerical experiments in which we compare weak (ghost penalty) and strong (aggregated finite elements) schemes in terms of error quantities, condition numbers and sensitivity with respect to penalty coefficients on different geometries, intersection locations and mesh topologies., This research was partially funded by the Australian Government through the Australian Research Council (project number DP210103092), the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme and the projects RTI2018-096898-B-I00 and ERC2018-092843 from the “FEDER/Ministerio de Ciencia e Innovación – Agencia Estatal de Investigación”. F. Verdugo acknowledges support from the Spanish Ministry of Economy and Competitiveness through the “Severo Ochoa Programme for Centers of Excellence in R&D (CEX2018-000797-S)”. F. Verdugo acknowledges support from the Secretaria d’Universitats i Recerca of the Catalan Government, Spain in the framework of the Beatriu Pinós Program (Grant Id.: 2016 BP 00145). This work was also supported by computational resources provided by the Australian Government through NCI under the National Computational Merit Allocation Scheme., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Robust and scalable h-adaptive aggregated unfitted finite elements for interface elliptic problems

  • Miranda Neiva, Eric
  • Badia, Santiago
This work introduces a novel, fully robust and highly-scalable, -adaptive aggregated unfitted finite element method for large-scale interface elliptic problems. The new method is based on a recent distributed-memory implementation of the aggregated finite element method atop a highly-scalable Cartesian forest-of-trees mesh engine. It follows the classical approach of weakly coupling nonmatching discretisations at the interface to model internal discontinuities at the interface. We propose a natural extension of a single-domain parallel cell aggregation scheme to problems with a finite number of interfaces; it straightforwardly leads to aggregated finite element spaces that have the structure of a Cartesian product. We demonstrate, through standard numerical analysis and exhaustive numerical experimentation on several complex Poisson and linear elasticity benchmarks, that the new technique enjoys the following properties: well-posedness, robustness with respect to cut location and material contrast, optimal (h-adaptive) approximation properties, high scalability and easy implementation in large-scale finite element codes. As a result, the method offers great potential as a useful finite element solver for large-scale interface problems modelled by partial differential equations., Financial support from the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme is gratefully acknowledged. This work has been partially funded by the projects RTI2018-096898-B-I00 and ERC2018-092843 from the “Ministerio de Ciencia e Innovación” of Spain. E. Neiva gratefully acknowledges the support received from the Catalan Government, Spain through a FI fellowship (2019 FI-B2-00090; 2018 FI-B1-00095; 2017 FI-B-00219). S. Badia gratefully acknowledges the support received from the Catalan Government through the ICREA Acadèmia Research Program, Spain. The authors thankfully acknowledge the computer resources at Marenostrum-IV and the technical support provided by the Barcelona Supercomputing Center (RES-ActivityIDs: IM-2019-3-0008, IM-2020-1-0002). Financial support to CIMNE via the CERCA Programme/Generalitat de Catalunya, Spain is also acknowledged., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Linking ghost penalty and aggregated unfitted methods

  • Badia, Santiago
  • Miranda Neiva, Eric
  • Verdugo Rojano, Francesc
In this work, we analyse the links between ghost penalty stabilisation and aggregation-based discrete extension operators for the numerical approximation of elliptic partial differential equations on unfitted meshes. We explore the behaviour of ghost penalty methods in the limit as the penalty parameter goes to infinity, which returns a strong version of these methods. We observe that these methods suffer locking in that limit. On the contrary, aggregated finite element spaces are locking-free because they can be expressed as an extension operator from well-posed to ill-posed degrees of freedom. Next, we propose novel ghost penalty methods that penalise the distance between the solution and its aggregation-based discrete extension. These methods are locking-free and converge to aggregated finite element methods in the infinite penalty parameter limit. We include an exhaustive set of numerical experiments in which we compare weak (ghost penalty) and strong (aggregated finite elements) schemes in terms of error quantities, condition numbers and sensitivity with respect to penalty coefficients on different geometries, intersection locations and mesh topologies., This research was partially funded by the Australian Government through the Australian Research Council (project number DP210103092), the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme and the projects RTI2018-096898-B-I00 and ERC2018-092843 from the “FEDER/Ministerio de Ciencia e Innovación – Agencia Estatal de Investigación”. F. Verdugo acknowledges support from the Spanish Ministry of Economy and Competitiveness through the “Severo Ochoa Programme for Centers of Excellence in R&D (CEX2018-000797-S)”. F. Verdugo acknowledges support from the Secretaria d’Universitats i Recerca of the Catalan Government, Spain in the framework of the Beatriu Pinós Program (Grant Id.: 2016 BP 00145). This work was also supported by computational resources provided by the Australian Government through NCI under the National Computational Merit Allocation Scheme., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Robust high-order unfitted finite elements by interpolation-based discrete extension

  • Badia, Santiago
  • Miranda Neiva, Eric
  • Verdugo Rojano, Francesc
In this work, we propose a novel formulation for the solution of partial differential equations using finite element methods on unfitted meshes. The proposed formulation relies on the discrete extension operator proposed in the aggregated finite element method. This formulation is robust with respect to the location of the boundary/interface within the cell. One can prove enhanced stability results, not only on the physical domain, but on the whole active mesh. However, the stability constants grow exponentially with the polynomial order being used, since the underlying extension operators are defined via extrapolation. To address this issue, we introduce a new variant of aggregated finite elements, in which the extension in the physical domain is an interpolation for polynomials of order higher than two. As a result, the stability constants only grow at a polynomial rate with the order of approximation. We demonstrate that this approach enables robust high-order approximations with the aggregated finite element method. The proposed method is consistent, optimally convergent, and with a condition number that scales optimally for high order approximation., This research was partially funded by the Australian Government through the Australian Research Council (project number DP210103092), the European Commission under the FET-HPC ExaQUte project (Grant agreement ID: 800898) within the Horizon 2020 Framework Programme and the project RTI2018-096898-B-I00 from the “FEDER/Ministerio de Ciencia e Innovación (MCIN) – Agencia Estatal de Investigación (AEI)”. F. Verdugo acknowledges support from the “Severo Ochoa Program for Centers of Excellence in R&D (2019-2023)” under the grant CEX2018-000797-S funded by MCIN/AEI/10.13039/501100011033. This work was also supported by computational resources provided by the Australian Government through NCI under the National Computational Merit Allocation Scheme., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A generic finite element framework on parallel tree-based adaptive meshes

  • Badia, Santiago
  • Martín, Alberto F.
  • Miranda Neiva, Eric
  • Verdugo Rojano, Francesc
In this work we formally derive and prove the correctness of the algorithms and data structures in a parallel, distributed-memory, generic finite element framework that supports h-adaptivity on computational domains represented as forest-of-trees. The framework is grounded on a rich representation of the adaptive mesh suitable for generic finite elements that is built on top of a low-level, light-weight forest-of-trees data structure handled by a specialized, highly parallel adaptive meshing engine, for which we have identified the requirements it must fulfill to be coupled into our framework. Atop this two-layered mesh representation, we build the rest of the data structures required for the numerical integration and assembly of the discrete system of linear equations. We consider algorithms that are suitable for both subassembled and fully assembled distributed data layouts of linear system matrices. The proposed framework has been implemented within the FEMPAR scientific software library, using p4est as a practical forest-of-octrees demonstrator. A strong scaling study of this implementation when applied to Poisson and Maxwell problems reveals remarkable scalability up to 32.2K CPU cores and 482.2M degrees of freedom. Besides, a comparative performance study of FEMPAR and the state-of-the-art deal.II finite element software shows at least comparative performance, and at most a factor of 2--3 improvement in the h-adaptive approximation of a Poisson problem with first- and second-order Lagrangian finite elements, respectively., Financial support from the European Commission under the EMUSIC and ExaQUteprojects within the Horizon 2020 Framework Programme is gratefully acknowledged (grants 690725and 800898, resp.). This work has been partially funded by the project RTI2018-096898-B-I00from the “FEDER/Ministerio de Ciencia e Innovación–Agencia Estatal de Investigación”. The firstauthor gratefully acknowledges the support received from the Catalan Government through theICREA Acadèmia Research Program. The third author gratefully acknowledges the support receivedfrom the Catalan Government through an FI fellowship (2019 FI-B2-00090; 2018 FI-B1-00095; 2017FI-B-00219). The fourth author gratefully acknowledges the support received from the Secretariad’Universitats i Recerca of the Catalan Government in the framework of the Beatriu Pinós Program(grant 2016 BP 00145). The authors thankfully acknowledge the computer resources at Marenostrum-IV and the technical support provided by the Barcelona Supercomputing Center (RES-ActivityID:FI-2018-2-0009, FI-2018-3-0029, IM-2020-1-0002)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

The aggregated unfitted finite element method on parallel tree-based adaptive meshes

  • Badia, Santiago
  • Martín, Alberto F.
  • Miranda Neiva, Eric
  • Verdugo Rojano, Francesc
In this work, we present an adaptive unfitted finite element scheme that combines the aggregated finite element method with parallel adaptive mesh refinement. We introduce a novel scalable distributed-memory implementation of the resulting scheme on locally adapted Cartesian forest-of-trees meshes. We propose a two-step algorithm to construct the finite element space at hand by means of a discrete extension operator that carefully mixes aggregation constraints of problematic degrees of freedom, which get rid of the small cut cell problem, and standard hanging degree of freedom constraints, which ensure trace continuity on nonconforming meshes. Following this approach, we derive a finite element space that can be expressed as the original one plus well-defined linear constraints. Moreover, it requires minimum parallelization effort, using standard functionality available in existing large-scale finite element codes. Numerical experiments demonstrate its optimal mesh adaptation capability, robustness to cut location, and parallel efficiency, on classical Poisson hp-adaptivity benchmarks. Our work opens the path to functional and geometrical error-driven dynamic mesh adaptation with the aggregated finite element method in large-scale realistic scenarios. Likewise, it can offer guidance for bridging other scalable unfitted methods and parallel adaptive mesh refinement., This work was supported by the European Commission under the FET-HPC ExaQUte project (grant 800898) within the Horizon 2020 Framework Programme and the project RTI2018- 096898-B-I00, by the Barcelona Supercomputing Center (RES-ActivityID: FI-2019-1-0007, IM-2019- 2-0007, IM-2019-3-0008), and by the Australian Government. The work of the third author was supported by the Catalan Government through an FI fellowship (2019 FI-B2-00090, 2018 FI-B1- 00095, 2017 FI-B-00219). The work of the fourth author was supported by the Spanish Ministry of Economy and Competitiveness through the “Severo Ochoa Programme for Centers of Excellence in R&D (CEX2018-000797-S)” and Secretaria d’Universitats i Recerca of the Catalan Government in the framework of the Beatriu Pinós Program (grant 2016 BP 00145)., Peer Reviewed, Postprint (published version)