Skip to main content

Resultados relacionados

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

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 Contribución de congreso (ConferenceOutput)

Estimating the Number of Similarity Classes for Marked Bisection in General Dimensions

  • Belda Ferrín, Guillem
  • Ruiz-Gironés, Eloi
  • Roca, Xevi
To measure the stability of a marked bisection method, we estimate in general dimensions an upper bound of the number of generated similarity classes. Moreover, to understand the cyclic similarity structure, we estimate the number of uniform refinements required to generate all the similarity classes. We first prove that switching to the newest vertex bisection after n uniform refinements is equivalent to switching after uniform refinements. Then, we obtain the similarity bound, a bound that we use to derive the number of uniform refinements required to generate all the similarity classes. Although the similarity bound is not tight, the results show that it estimates the magnitude of the expected number of classes. We also show the ratio of the number of similarity classes for marked bisection and newest vertex bisection. Because this ratio grows exponentially with the dimension, we conclude that marked bisection is suitable for low-dimensional applications., his 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 alsoreceived funding from the Generalitat de Catalunyaunder grant number 2017 SGR 1731. The work ofXevi 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)

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 Contribución de congreso (ConferenceOutput)

Refining simplex points for scalable estimation of the Lebesgue constant

  • Jiménez Ramos, Albert
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
To estimate the Lebesgue constant, we propose a point refinement method on the d-dimensional simplex. The proposed method features a smooth gradation of the point resolution, neighbor queries based on neighbor-aware coordinates, and a point refinement that algebraically scales as (d + 1) d. Remarkably, by using neighbor-aware coordinates, the point refinement method is ready to automatically stop using a Lipschitz criterion. For different polynomial degrees and point distributions, we show that our automatic method efficiently reproduces the literature estimations for the triangle and the tetrahedron. Moreover, we efficiently estimate the Lebesgue constant in higher dimensions. Accordingly, up to six dimensions, we conclude that the point refinement method is well-suited to efficiently estimate the Lebesgue constant on simplices. In perspective, for a given polynomial degree, the proposed point refinement method might be relevant to optimize a set of simplex points that guarantees a small interpolation error., 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 the second author has been partially supported by Grant IJC2020-045140-I from MCIN/AEI/10.13039/501100011 033 and “European Union NextGenerationEU/PRTR”. 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., 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)