An algorithm for the estimation of the segmental Lebesgue constant

IF 2.1 2区数学 Q1 MATHEMATICS, APPLIED

Journal of Computational and Applied Mathematics Pub Date : 2025-05-04 DOI:10.1016/j.cam.2025.116745

Ludovico Bruni Bruno , Giacomo Elefante

引用次数: 0

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.

查看原文本刊更多论文

一种估计分段勒贝格常数的算法

这项工作的主要目标是提供一种明确的算法来估计分段勒贝格常数，这是在组织定位问题中出现的节点勒贝格常数的扩展。在两个简单而有效的引理的帮助下，我们扭转了已知的技术，并合理地加快了这些数量的数值估计。结果与已知文献相当，尽管该方法的cpu时间明显更小。值得指出的是，数值方法是唯一已知的分析大多数家庭的支持。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Computational and Applied Mathematics 数学-应用数学

CiteScore

5.40

自引率

4.20%

发文量

437

审稿时长

3.0 months

期刊介绍： The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.