A primal-dual algorithm for computing Finsler distances and applications

IF 1.4 2区数学 Q1 MATHEMATICS

Calcolo Pub Date : 2024-08-21 DOI:10.1007/s10092-024-00596-y

Hamza Ennaji, Yvain Quéau, Abderrahim Elmoataz

引用次数: 0

Abstract

This note discusses the computation of the distance function with respect to Finsler metrics. To this end, we show how the Finsler variants of the Eikonal equation can be solved by a primal-dual algorithm exploiting the variational structure. We also discuss the acceleration of the algorithm by preconditioning techniques, and illustrate the flexibility of the proposed method through a series of numerical examples.

Abstract Image

查看原文本刊更多论文

计算芬斯勒距离的原始二元算法及其应用

本论文讨论与芬斯勒度量相关的距离函数的计算。为此，我们展示了如何利用变分结构的初等二元算法求解艾克纳方程的芬斯勒变分。我们还讨论了通过预处理技术加速算法的问题，并通过一系列数值示例说明了所提方法的灵活性。

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

求助全文

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

来源期刊

Calcolo 数学-数学

CiteScore

2.40

自引率

11.80%

发文量

审稿时长

>12 weeks

期刊介绍： Calcolo is a quarterly of the Italian National Research Council, under the direction of the Institute for Informatics and Telematics in Pisa. Calcolo publishes original contributions in English on Numerical Analysis and its Applications, and on the Theory of Computation. The main focus of the journal is on Numerical Linear Algebra, Approximation Theory and its Applications, Numerical Solution of Differential and Integral Equations, Computational Complexity, Algorithmics, Mathematical Aspects of Computer Science, Optimization Theory. Expository papers will also appear from time to time as an introduction to emerging topics in one of the above mentioned fields. There will be a "Report" section, with abstracts of PhD Theses, news and reports from conferences and book reviews. All submissions will be carefully refereed.