{
  "id": "1910.10385",
  "version": "v1",
  "published": "2019-10-23T06:55:47.000Z",
  "updated": "2019-10-23T06:55:47.000Z",
  "title": "Adaptive Padé-Chebyshev Type Approximation to Piecewise Smooth Functions",
  "authors": [
    "S. Akansha",
    "S. Baskar"
  ],
  "categories": [
    "math.NA",
    "cs.NA"
  ],
  "abstract": "The aim of this article is to study the role of piecewise implementation of Pad\\'e-Chebyshev type approximation in minimising Gibbs phenomena in approximating piecewise smooth functions. A piecewise Pad\\'e-Chebyshev type (PiPCT) algorithm is proposed and an $L^1$-error estimate for at most continuous functions is obtained using a decay property of the Chebyshev coefficients. An advantage of the PiPCT approximation is that we do not need to have an {\\it a prior} knowledge of the positions and the types of singularities present in the function. Further, an adaptive piecewise Pad\\'e-Chebyshev type (APiPCT) algorithm is proposed in order to get the essential accuracy with a relatively lower computational cost. Numerical experiments are performed to validate the algorithms. The numerical results are also found to be well in agreement with the theoretical results. Comparison results of the PiPCT approximation with the singular Pad\\'e-Chebyshev and the robust Pad\\'e-Chebyshev methods are also presented.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-10-23T06:55:47.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "adaptive padé-chebyshev type approximation",
      "piecewise smooth functions",
      "piecewise pade-chebyshev type",
      "pipct approximation",
      "relatively lower computational cost"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}