The main goal of this work is to provide an explicit algorithm for the estimation of the segmental Lebesgue constant, an extension of the nodal Lebesgue constant that arise, for instance, in histopolation problems. With the help of two simple but efficacious lemmas, we reverse the already known technology and sensibly speed up the numerical estimation of such quantities. Results are comparable with the known literature, although cpu time of the presented method is sensibly smaller. It is worth pointing out that the numerical approach is the only known for analyzing the majority of families of supports.
An algorithm for the estimation of the segmental Lebesgue constant
Elefante G.
In corso di stampa
Abstract
The main goal of this work is to provide an explicit algorithm for the estimation of the segmental Lebesgue constant, an extension of the nodal Lebesgue constant that arise, for instance, in histopolation problems. With the help of two simple but efficacious lemmas, we reverse the already known technology and sensibly speed up the numerical estimation of such quantities. Results are comparable with the known literature, although cpu time of the presented method is sensibly smaller. It is worth pointing out that the numerical approach is the only known for analyzing the majority of families of supports.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
20_BruniBrunoElefante-AnAlgorithmForTheEstimationOfTheSegmentalLebsgueConstant(2026).pdf
Accesso riservato
Tipo di file:
PDF EDITORIALE
Dimensione
855.75 kB
Formato
Adobe PDF
|
855.75 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.



