Skip to main content

Resultados relacionados

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

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

Subdividing triangular and quadrilateral meshes in parallel to approximate curved geometries

  • Gargallo-Peiró, Abel
  • Houzeaux, Guillaume|||0000-0002-2592-1426
  • Roca, Xevi
A parallel distributed approach to refine a mesh while preserving the curvature of a target geometry is presented. Our approach starts by generating a coarse linear mesh of the computational domain. Second, the former coarse mesh is curved to match the curvature of the target geometry. Then, the curved mesh is partitioned and the subdomain meshes are sent to the slaves. Finally, the curved elements are uniformly subdivided in parallel targeting the geometry approximated by the curved mesh. The result is a distributed finer linear mesh featuring improved geometric accuracy. The key ingredient of our implementation is to approximate the target geometry as a linear mesh equipped with an elemental field corresponding to an element-wise polynomial geometry representation. Thus, the distribution of the curved geometry is equivalent to partitioning the linear mesh and sending the subdomain meshes and the elemental fields to the slaves. The main application of the obtained finer linear mesh is to compute in parallel steady state flow solutions on real topographies. The qualitative results show that for 2D and 3D steady state flow solutions, on real and synthetic topographies, our parallel subdivision approach mitigates the artificial artifacts that might appear with standard straight-sided subdivision methods. We also check the parallel performance of the implementation by performing a weak scalability test in 2D., This work was financially supported by the PRACE project funded in part by the EUs Horizon 2020 research and innovation program (2014-2020) under grant agreement 653838. This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme under grant agreement No 715546. The work of the corresponding author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC- 2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Interpolation of subdivision features for curved geometry modeling

  • Jiménez Ramos, Albert|||0000-0002-6537-149X
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We present a nodal interpolation method to approximate a subdivision model. The main application is to model and represent curved geometry without gaps and preserving the required simulation intent. Accordingly, we devise the technique to maintain the necessary sharp features and smooth the indicated ones. This sharp-to-smooth modeling capability handles unstructured configurations of the simulation points, curves, and surfaces. The surfaces correspond to initial linear triangulations that determine the sharp point and curve features. The method automatically suggests a subset of sharp features to smooth which the user modifies to obtain a limit model preserving the initial points. This model reconstructs the curvature by subdivision of the initial mesh, with no need of an underlying curved geometry model. Finally, given a polynomial degree and a nodal distribution, the method generates a piece-wise polynomial representation interpolating the limit model. We show numerical evidence that this approximation, naturally aligned to the subdivision features, converges to the model geometrically with the polynomial degree for fair nodal distributions. We also apply the method to prescribe the curved boundary of a high-order volume mesh. We conclude that our sharp-to-smooth modeling capability leads to curved geometry representations with enhanced preservation of the simulation intent., This project has received funding from the European Research Council (ERC) [http://dx.doi.org/10.13039/501100000781] under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633. Special thanks to Eloi Ruiz-Gironés., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Automatic Penalty and Degree Continuation for Parallel Pre-Conditioned Mesh Curving on Virtual Geometry

  • Ruiz-Gironés, Eloi
  • Roca, Xevi
We present a distributed parallel mesh curving method for virtual geometry. The main application is to generate large-scale curved meshes on complex geometry suitable for analysis with unstructured high-order methods. Accordingly, we devise the technique to generate geometrically accurate meshes composed of high-quality elements. To this end, we advocate for degree continuation on a penalty-based second-order optimizer that uses global tight tolerances to converge the distortion residuals. To reduce the method memory footprint, waiting time, and energy consumption, we combine three main ingredients. First, we propose a matrix-free GMRES solver pre-conditioned with successive over-relaxation by blocks to reduce the memory footprint three times. We also propose an adaptive penalty technique, to reduce the number of non-linear iterations. Third, we propose an indicator of the required linear solver tolerance to reduce the number of linear iterations. On thousands of cores, the method curves meshes composed of millions of quartic elements featuring highly stretched elements while matching a virtual topology., This project has received funding from the European Research Council (ERC)[http://dx.doi.org/10.13039/501100000781] under the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 715546. This work has also received funding from the Generalitat de Catalunya,Spain under grant number 2017 SGR 1731. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633. We acknowledge PRACE for awarding us ac- cess to MareNostrum at Barcelona Supercomputing Center (BSC), Spain., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

A globalized and preconditioned Newton-CG solver for metric-aware curved high-order mesh optimization

  • Aparicio Estrems, Guillermo|||0000-0002-1956-0409
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We present a specific-purpose globalized and preconditioned Newton-CG solver to minimize a metric-aware curved high-order mesh distortion. The solver is specially devised to optimize curved high-order meshes for high polynomial degrees with a target metric featuring non-uniform sizing, high stretching ratios, and curved alignment — exactly the features that stiffen the optimization problem. To this end, we consider two ingredients: a specific-purpose globalization and a specific-purpose Jacobi-iLDLT (0) preconditioning with varying accuracy and curvature tolerances (dynamic forcing terms) for the CG method. These improvements are critical in stiff problems because, without them, the large number of non-linear and linear iterations makes curved optimization impractical. First, to enhance the global convergence of the non-linear solver, the globalization strategy modifies Newton’s direction to a feasible step. In particular, our specific-purpose globalization strategy memorizes the length of the feasible step (step-length continuation) between the optimization iterations while ensuring sufficient decrease and progress. Second, to compute Newton’s direction in second-order optimization problems, we consider a conjugate-gradient iterative solver with specific-purpose preconditioning and dynamic forcing terms. To account for the metric stretching and alignment, the preconditioner uses specific orderings for the mesh nodes and the degrees of freedom. We also present a preconditioner switch between Jacobi and iLDLT (0) preconditioners to control the numerical ill-conditioning of the preconditioner. In addition, the dynamic forcing terms determine the required accuracy for the Newton direction approximation. Specifically, they control the residual tolerance and enforce sufficient positive curvature for the conjugate-gradients method. Finally, to analyze the performance of our method, the results compare the specific-purpose solver with standard optimization methods. For this, we measure the matrix–vector products indicating the solver computational cost and the line-search iterations indicating the total amount of objective function evaluations. When we combine the globalization and the linear solver ingredients, we conclude that the specific-purpose Newton-CG solver reduces the total number of matrix–vector products by one order of magnitude. Moreover, the number of non-linear and line-search iterations is mainly smaller but of similar magnitude., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad, Spain under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Combining high-order metric interpolation and geometry implicitization for curved r -adaption

  • Aparicio Estrems, Guillermo|||0000-0002-1956-0409
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca, Xevi
We detail how to use Newton’s method for distortion-based curved -adaption to a discrete high-order metric field while matching a target geometry. Specifically, we combine two terms: a distortion measuring the deviation from the target metric; and a penalty term measuring the deviation from the target boundary. For this combination, we consider four ingredients. First, to represent the metric field, we detail a log-Euclidean high-order metric interpolation on a curved (straight-edged) mesh. Second, for this metric interpolation, we detail the first and second derivatives in physical coordinates. Third, to represent the domain boundaries, we propose an implicit representation for 2D and 3D NURBS models. Fourth, for this implicit representation, we obtain the first and second derivatives. The derivatives of the metric interpolation and the implicit representation allow minimizing the objective function with Newton’s method. For this second-order minimization, the resulting meshes simultaneously match the curved features of the target metric and boundary. Matching the metric and the geometry using second-order optimization is an unprecedented capability in curved (straight-edged) -adaption. This capability will be critical in global and cavity-based curved (straight-edged) high-order mesh adaption., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Defining metric-aware size-shape measures to validate and optimize curved high-order meshes

  • Aparicio Estrems, Guillermo|||0000-0002-1956-0409
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We define a regularized size-shape distortion (quality) measure for curved high-order elements on a Riemannian space. To this end, we measure the deviation of a given element, straight-sided or curved, from the stretching, alignment, and sizing determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian spaces determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise stretching, alignment, and sizing of a discrete target metric tensor. In addition, the resulting meshes simultaneously match the curved features of the target metric and boundary. Finally, to verify if the minimization of the metric-aware size-shape distortion leads to meshes approximating the target metric, we compute the Riemannian measures for the element edges, faces, and cells. The results show that, when compared to anisotropic straight-sided meshes, the Riemannian measures of the curved high-order mesh entities are closer to unit. Furthermore, the optimized meshes illustrate the potential of curved ¿-adaptation to improve the accuracy of a function representation., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Conformal marked bisection for local refinement of n-dimensional unstructured conformal meshes

  • Belda Ferrín, Guillem|||0000-0002-6268-7691
  • Ruiz Gironès, Eloi
  • Roca Navarro, Francisco Javier
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
We present an n-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive n-dimensional applications. To this end, we propose a mesh marking pre-process and three marked bisection stages. The pre-process marks the initial mesh conformingly. Then, in the first n-1 bisections, the method accumulates in reverse order a list of new vertices. In the second stage, the n-th bisection, the method uses the reversed list to cast the bisected simplices as reflected simplices, a simplex type suitable for newest vertex bisection. In the final stage, beyond the n-th bisection, the method switches to newest vertex bisection. To allow this switch, after the second stage, we check that under uniform bisection the mesh simplices are conformal and reflected. These conditions are sufficient to use newest vertex bisection, a bisection scheme guaranteeing key advantages for local refinement. Finally, the results show that the proposed bisection is well-suited for local refinement of unstructured conformal meshes., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

An augmented Lagrangian formulation to impose boundary conditions for distortion based mesh moving and curving

  • Ruiz-Gironés, Eloi
  • Gargallo-Peiró, Abel
  • Sarrate Ramos, Josep|||0000-0003-0182-934X
  • Roca, Xevi
We formulate a mesh morphing technique as mesh distortion minimization problem constrained to weakly satisfy the imposed displacement of the boundary nodes. The method is devised to penalize the appearance of inverted elements during the optimization process. Accordingly, we have not equipped the method with untangling capabilities. To solve the constrained minimization problem, we apply the augmented Lagrangian technique to incorporate the boundary condition in the objective function using the Lagrangian multipliers and a penalty parameter. We have applied the proposed formulation to mesh moving and mesh curving problems. The results show that the method has the ability to deal with large displacements for 2D and 3D meshes with non-uniform sizing, and mesh curving of highly stretched 2D high-order meshes., This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme under grant agreement No 715546. The work of the corresponding author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC- 2015-01633. The work of the third author has been supported by the Spanish Ministerio de Economía y Competitividad under grant agreement CTM2014-55014-C3-3-R., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Conformal marked bisection for local refinement of n-dimensional unstructured simplicial meshes

  • Belda Ferrín, Guillem|||0000-0002-6268-7691
  • Ruiz Gironés, Eloi
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca, Xevi
We present an n-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive n-dimensional applications. To this end, we propose a mesh marking pre-process and three marked bisection stages. The pre-process marks the initial mesh conformingly. Then, in the first n−1 bisections, the method accumulates in reverse order a list of new vertices. In the second stage, the n-th bisection, the method uses the reversed list to cast the bisected simplices as reflected simplices, a simplex type suitable for newest vertex bisection. In the final stage, beyond the n-th bisection, the method switches to newest vertex bisection. To allow this switch, after the second stage, we check that under uniform bisection the mesh simplices are conformal and reflected. These conditions are sufficient to use newest vertex bisection, a bisection scheme guaranteeing key advantages for local refinement. Finally, the results show that the proposed bisection is well-suited for local refinement of unstructured conformal meshes., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes

  • Ruiz Gironès, Eloi
  • Sarrate Ramos, Josep|||0000-0003-0182-934X
  • Roca Navarro, Francisco Javier
We present a new disparity functional to measure and improve the geometric accuracy of a curved high-order mesh that approximates a target geometry model. We have devised the disparity to account for compound models, be independent of the entity parameterization, and allow trimmed entities. The disparity depends on the physical mesh and the auxiliary parametric meshes. Since it is two times differentiable on all these variables, we can minimize it with a second-order method. Its minimization with the parametric meshes as design variables measures the geometric accuracy of a given mesh. Furthermore, the minimization with both the physical and parametric meshes as design variables improves the geometric accuracy of an initial mesh. We have numerical evidence that the obtained meshes converge to the target geometry (unitary normal) algebraically, in terms of the element size, with order 2p (2p-1, respectively), where p is the polynomial degree of the mesh. Although we obtain meshes with non-interpolative boundary nodes, we propose a post-process to enforce, if required by the application, meshes with interpolative boundary nodes and featuring the same order of geometric accuracy. In conclusion, we can obtain super-convergent orders, at least for sufficiently smooth parametric curve (surface) entities, for meshes of polynomial degrees up to 4 (3, respectively). In perspective, this super-convergence might enable using a lower polynomial degree to approximate the geometry than to approximate the solution without hampering the required geometric accuracy for high-order analysis., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. This work has been supported by FEDER and the Spanish Government, Ministerio de Ciencia, Innovación y Universidades grant project contract PGC2018-097257-B-C33. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Subdividing triangular and quadrilateral meshes in parallel to approximate curved geometries

  • Gargallo-Peiró, Abel
  • Houzeaux, Guillaume
  • Roca, Xevi
A parallel distributed approach to refine a mesh while preserving the curvature of a target geometry is presented. Our approach starts by generating a coarse linear mesh of the computational domain. Second, the former coarse mesh is curved to match the curvature of the target geometry. Then, the curved mesh is partitioned and the subdomain meshes are sent to the slaves. Finally, the curved elements are uniformly subdivided in parallel targeting the geometry approximated by the curved mesh. The result is a distributed finer linear mesh featuring improved geometric accuracy. The key ingredient of our implementation is to approximate the target geometry as a linear mesh equipped with an elemental field corresponding to an element-wise polynomial geometry representation. Thus, the distribution of the curved geometry is equivalent to partitioning the linear mesh and sending the subdomain meshes and the elemental fields to the slaves. The main application of the obtained finer linear mesh is to compute in parallel steady state flow solutions on real topographies. The qualitative results show that for 2D and 3D steady state flow solutions, on real and synthetic topographies, our parallel subdivision approach mitigates the artificial artifacts that might appear with standard straight-sided subdivision methods. We also check the parallel performance of the implementation by performing a weak scalability test in 2D., This work was financially supported by the PRACE project funded in part by the EUs Horizon 2020 research and innovation program (2014-2020) under grant agreement 653838. This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme under grant agreement No 715546. The work of the corresponding author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC- 2015-01633., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

An augmented Lagrangian formulation to impose boundary conditions for distortion based mesh moving and curving

  • Ruiz-Gironés, Eloi
  • Gargallo-Peiró, Abel
  • Sarrate Ramos, Josep
  • Roca, Xevi
We formulate a mesh morphing technique as mesh distortion minimization problem constrained to weakly satisfy the imposed displacement of the boundary nodes. The method is devised to penalize the appearance of inverted elements during the optimization process. Accordingly, we have not equipped the method with untangling capabilities. To solve the constrained minimization problem, we apply the augmented Lagrangian technique to incorporate the boundary condition in the objective function using the Lagrangian multipliers and a penalty parameter. We have applied the proposed formulation to mesh moving and mesh curving problems. The results show that the method has the ability to deal with large displacements for 2D and 3D meshes with non-uniform sizing, and mesh curving of highly stretched 2D high-order meshes., This project has received funding from the European Research Council (ERC) under the European Unions Horizon 2020 research and innovation programme under grant agreement No 715546. The work of the corresponding author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC- 2015-01633. The work of the third author has been supported by the Spanish Ministerio de Economía y Competitividad under grant agreement CTM2014-55014-C3-3-R., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes

  • Ruiz Gironès, Eloi
  • Sarrate Ramos, Josep
  • Roca Navarro, Francisco Javier
We present a new disparity functional to measure and improve the geometric accuracy of a curved high-order mesh that approximates a target geometry model. We have devised the disparity to account for compound models, be independent of the entity parameterization, and allow trimmed entities. The disparity depends on the physical mesh and the auxiliary parametric meshes. Since it is two times differentiable on all these variables, we can minimize it with a second-order method. Its minimization with the parametric meshes as design variables measures the geometric accuracy of a given mesh. Furthermore, the minimization with both the physical and parametric meshes as design variables improves the geometric accuracy of an initial mesh. We have numerical evidence that the obtained meshes converge to the target geometry (unitary normal) algebraically, in terms of the element size, with order 2p (2p-1, respectively), where p is the polynomial degree of the mesh. Although we obtain meshes with non-interpolative boundary nodes, we propose a post-process to enforce, if required by the application, meshes with interpolative boundary nodes and featuring the same order of geometric accuracy. In conclusion, we can obtain super-convergent orders, at least for sufficiently smooth parametric curve (surface) entities, for meshes of polynomial degrees up to 4 (3, respectively). In perspective, this super-convergence might enable using a lower polynomial degree to approximate the geometry than to approximate the solution without hampering the required geometric accuracy for high-order analysis., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. This work has been supported by FEDER and the Spanish Government, Ministerio de Ciencia, Innovación y Universidades grant project contract PGC2018-097257-B-C33. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Combining high-order metric interpolation and geometry implicitization for curved r -adaption

  • Aparicio Estrems, Guillermo
  • Gargallo Peiró, Abel
  • Roca, Xevi
We detail how to use Newton’s method for distortion-based curved -adaption to a discrete high-order metric field while matching a target geometry. Specifically, we combine two terms: a distortion measuring the deviation from the target metric; and a penalty term measuring the deviation from the target boundary. For this combination, we consider four ingredients. First, to represent the metric field, we detail a log-Euclidean high-order metric interpolation on a curved (straight-edged) mesh. Second, for this metric interpolation, we detail the first and second derivatives in physical coordinates. Third, to represent the domain boundaries, we propose an implicit representation for 2D and 3D NURBS models. Fourth, for this implicit representation, we obtain the first and second derivatives. The derivatives of the metric interpolation and the implicit representation allow minimizing the objective function with Newton’s method. For this second-order minimization, the resulting meshes simultaneously match the curved features of the target metric and boundary. Matching the metric and the geometry using second-order optimization is an unprecedented capability in curved (straight-edged) -adaption. This capability will be critical in global and cavity-based curved (straight-edged) high-order mesh adaption., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Automatic Penalty and Degree Continuation for Parallel Pre-Conditioned Mesh Curving on Virtual Geometry

  • Ruiz-Gironés, Eloi
  • Roca, Xevi
We present a distributed parallel mesh curving method for virtual geometry. The main application is to generate large-scale curved meshes on complex geometry suitable for analysis with unstructured high-order methods. Accordingly, we devise the technique to generate geometrically accurate meshes composed of high-quality elements. To this end, we advocate for degree continuation on a penalty-based second-order optimizer that uses global tight tolerances to converge the distortion residuals. To reduce the method memory footprint, waiting time, and energy consumption, we combine three main ingredients. First, we propose a matrix-free GMRES solver pre-conditioned with successive over-relaxation by blocks to reduce the memory footprint three times. We also propose an adaptive penalty technique, to reduce the number of non-linear iterations. Third, we propose an indicator of the required linear solver tolerance to reduce the number of linear iterations. On thousands of cores, the method curves meshes composed of millions of quartic elements featuring highly stretched elements while matching a virtual topology., This project has received funding from the European Research Council (ERC)[http://dx.doi.org/10.13039/501100000781] under the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 715546. This work has also received funding from the Generalitat de Catalunya,Spain under grant number 2017 SGR 1731. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633. We acknowledge PRACE for awarding us ac- cess to MareNostrum at Barcelona Supercomputing Center (BSC), Spain., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Conformal marked bisection for local refinement of n-dimensional unstructured conformal meshes

  • Belda Ferrín, Guillem
  • Ruiz Gironès, Eloi
  • Roca Navarro, Francisco Javier
  • Gargallo Peiró, Abel
We present an n-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive n-dimensional applications. To this end, we propose a mesh marking pre-process and three marked bisection stages. The pre-process marks the initial mesh conformingly. Then, in the first n-1 bisections, the method accumulates in reverse order a list of new vertices. In the second stage, the n-th bisection, the method uses the reversed list to cast the bisected simplices as reflected simplices, a simplex type suitable for newest vertex bisection. In the final stage, beyond the n-th bisection, the method switches to newest vertex bisection. To allow this switch, after the second stage, we check that under uniform bisection the mesh simplices are conformal and reflected. These conditions are sufficient to use newest vertex bisection, a bisection scheme guaranteeing key advantages for local refinement. Finally, the results show that the proposed bisection is well-suited for local refinement of unstructured conformal meshes., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Conformal marked bisection for local refinement of n-dimensional unstructured simplicial meshes

  • Belda Ferrín, Guillem
  • Ruiz Gironés, Eloi
  • Gargallo Peiró, Abel
  • Roca, Xevi
We present an n-dimensional marked bisection method for unstructured conformal meshes. We devise the method for local refinement in adaptive n-dimensional applications. To this end, we propose a mesh marking pre-process and three marked bisection stages. The pre-process marks the initial mesh conformingly. Then, in the first n−1 bisections, the method accumulates in reverse order a list of new vertices. In the second stage, the n-th bisection, the method uses the reversed list to cast the bisected simplices as reflected simplices, a simplex type suitable for newest vertex bisection. In the final stage, beyond the n-th bisection, the method switches to newest vertex bisection. To allow this switch, after the second stage, we check that under uniform bisection the mesh simplices are conformal and reflected. These conditions are sufficient to use newest vertex bisection, a bisection scheme guaranteeing key advantages for local refinement. Finally, the results show that the proposed bisection is well-suited for local refinement of unstructured conformal meshes., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No. 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of Xevi Roca has been partially supported by the Spanish Ministerio de Economía Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Interpolation of subdivision features for curved geometry modeling

  • Jiménez Ramos, Albert
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We present a nodal interpolation method to approximate a subdivision model. The main application is to model and represent curved geometry without gaps and preserving the required simulation intent. Accordingly, we devise the technique to maintain the necessary sharp features and smooth the indicated ones. This sharp-to-smooth modeling capability handles unstructured configurations of the simulation points, curves, and surfaces. The surfaces correspond to initial linear triangulations that determine the sharp point and curve features. The method automatically suggests a subset of sharp features to smooth which the user modifies to obtain a limit model preserving the initial points. This model reconstructs the curvature by subdivision of the initial mesh, with no need of an underlying curved geometry model. Finally, given a polynomial degree and a nodal distribution, the method generates a piece-wise polynomial representation interpolating the limit model. We show numerical evidence that this approximation, naturally aligned to the subdivision features, converges to the model geometrically with the polynomial degree for fair nodal distributions. We also apply the method to prescribe the curved boundary of a high-order volume mesh. We conclude that our sharp-to-smooth modeling capability leads to curved geometry representations with enhanced preservation of the simulation intent., This project has received funding from the European Research Council (ERC) [http://dx.doi.org/10.13039/501100000781] under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633. Special thanks to Eloi Ruiz-Gironés., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

A globalized and preconditioned Newton-CG solver for metric-aware curved high-order mesh optimization

  • Aparicio Estrems, Guillermo
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We present a specific-purpose globalized and preconditioned Newton-CG solver to minimize a metric-aware curved high-order mesh distortion. The solver is specially devised to optimize curved high-order meshes for high polynomial degrees with a target metric featuring non-uniform sizing, high stretching ratios, and curved alignment — exactly the features that stiffen the optimization problem. To this end, we consider two ingredients: a specific-purpose globalization and a specific-purpose Jacobi-iLDLT (0) preconditioning with varying accuracy and curvature tolerances (dynamic forcing terms) for the CG method. These improvements are critical in stiff problems because, without them, the large number of non-linear and linear iterations makes curved optimization impractical. First, to enhance the global convergence of the non-linear solver, the globalization strategy modifies Newton’s direction to a feasible step. In particular, our specific-purpose globalization strategy memorizes the length of the feasible step (step-length continuation) between the optimization iterations while ensuring sufficient decrease and progress. Second, to compute Newton’s direction in second-order optimization problems, we consider a conjugate-gradient iterative solver with specific-purpose preconditioning and dynamic forcing terms. To account for the metric stretching and alignment, the preconditioner uses specific orderings for the mesh nodes and the degrees of freedom. We also present a preconditioner switch between Jacobi and iLDLT (0) preconditioners to control the numerical ill-conditioning of the preconditioner. In addition, the dynamic forcing terms determine the required accuracy for the Newton direction approximation. Specifically, they control the residual tolerance and enforce sufficient positive curvature for the conjugate-gradients method. Finally, to analyze the performance of our method, the results compare the specific-purpose solver with standard optimization methods. For this, we measure the matrix–vector products indicating the solver computational cost and the line-search iterations indicating the total amount of objective function evaluations. When we combine the globalization and the linear solver ingredients, we conclude that the specific-purpose Newton-CG solver reduces the total number of matrix–vector products by one order of magnitude. Moreover, the number of non-linear and line-search iterations is mainly smaller but of similar magnitude., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya, Spain under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad, Spain under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Defining metric-aware size-shape measures to validate and optimize curved high-order meshes

  • Aparicio Estrems, Guillermo
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We define a regularized size-shape distortion (quality) measure for curved high-order elements on a Riemannian space. To this end, we measure the deviation of a given element, straight-sided or curved, from the stretching, alignment, and sizing determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian spaces determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise stretching, alignment, and sizing of a discrete target metric tensor. In addition, the resulting meshes simultaneously match the curved features of the target metric and boundary. Finally, to verify if the minimization of the metric-aware size-shape distortion leads to meshes approximating the target metric, we compute the Riemannian measures for the element edges, faces, and cells. The results show that, when compared to anisotropic straight-sided meshes, the Riemannian measures of the curved high-order mesh entities are closer to unit. Furthermore, the optimized meshes illustrate the potential of curved ¿-adaptation to improve the accuracy of a function representation., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)