Padé-based nonlinear approximation of bivariate non-smooth functions

Document Type

Article

Publication Title

BIT Numerical Mathematics

Abstract

This paper introduces a novel algorithm for approximating bivariate functions, addressing both smooth and non-smooth cases efficiently. We extend the concept of domain splitting to two dimensions, presenting a Padé-based nonlinear approximation method using Chebyshev series coefficients. Our approach approximates smooth functions to machine precision and ensures non-oscillatory profiles for non-smooth functions. Notably, we present the first theoretical convergence results using approximated coefficients, departing from existing literature that relies on exact Chebyshev or series coefficients. We provide a comprehensive L1-convergence analysis for functions of bounded variation in the sense of Hardy on rectangular domains. The method incorporates quadrature formulas for practical coefficient approximation, significantly enhancing its real-world applicability. A key advantage is its independence from prior knowledge of singularity locations, although currently limited to functions with discontinuities along coordinate axes. Numerical results demonstrate the algorithm’s effectiveness in mitigating the Gibbs phenomenon for non-smooth functions with finite Vitali variation, reducing it to negligible levels.

DOI

10.1007/s10543-025-01059-8

Publication Date

6-1-2025

This document is currently not available here.

Share

COinS