2017ACM Transactions on Mathematical SoftwareRequires access

Algorithm 986

Mani Mehra, Kuldip Singh Patel

Open publisher page 27 citations

Abstract

A collection of Matlab routines that compute derivative approximations of arbitrary functions using high-order compact finite difference schemes is presented. Tenth-order accurate compact finite difference schemes for first and second derivative approximations and sixth-order accurate compact finite difference schemes for third and fourth derivative approximations are discussed for the functions with periodic boundary conditions. Fourier analysis of compact finite difference schemes is explained, and it is observed that compact finite difference schemes have better resolution characteristics when compared to classical finite difference schemes. Compact finite difference schemes for the functions with Dirichlet and Neumann boundary conditions are also discussed. Moreover, compact finite difference schemes for partial derivative approximations of functions in two variables are also given. For each case a Matlab routine is provided to compute the differentiation matrix and results are validated using the test functions.

About this research paper

What this paper is about

A collection of Matlab routines that compute derivative approximations of arbitrary functions using high-order compact finite difference schemes is presented. Tenth-order accurate compact finite difference schemes for first and second derivative approximations and sixth-order accurate compact finite difference schemes for third and fourth derivative approximations are discussed for the functions with periodic boundary conditions. Fourier analysis of compact finite difference schemes is explained, and it is observed that compact finite difference schemes have better resolution characteristics when compared to classical finite difference schemes. Compact finite difference schemes for the functions with Dirichlet and Neumann boundary conditions are also discussed. Moreover, compact finite difference schemes for partial derivative approximations of functions in two variables are also given. For each case a Matlab routine is provided to compute the differentiation matrix and results are validated using the test functions.

Why it matters

OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A collection of Matlab routines that compute derivative approximations of arbitrary functions using high-order compact finite difference schemes is presented. Tenth-order accurate compact finite difference schemes for first and second derivative approximations and sixth-order accurate compact finite difference schemes for third and fourth derivative approximations are discussed for the functions with periodic boundary conditions. Fourier analysis of compact finite difference schemes is explained, and it is observed that compact finite difference schemes have better resolution characteristics when compared to classical finite difference schemes. Compact finite difference schemes for the functions with Dirichlet and Neumann boundary conditions are also discussed. Moreover, compact finite difference schemes for partial derivative approximations of functions in two variables are also given. For each case a Matlab routine is provided to compute the differentiation matrix and results are validated using the test functions.

Key concepts: Compact finite difference, Finite difference, Finite difference coefficient, Mathematics, Finite difference method, MATLAB, Boundary value problem, Mathematical analysis

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithm 986 — Research Paper | ScholarLens