Pasar al contenido principal

Resultados relacionados

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

Recercat. Dipósit de la Recerca de Catalunya
Publicación 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
Publicación 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)