Skip to main content
Log in

Recovery of a Function from Information on Its Values at the Nodes of a Triangular Grid Based on Data Completion

  • Published:
Ukrainian Mathematical Journal Aims and scope

Abstract

We consider a method for binary completion of two-dimensional data. On the basis of information about a surface given by a triangular grid, we construct a continuous polygonal surface based on a denser grid (than the one given). We determine the error and norm of this method and study its properties.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. I. Daubechies, Ten Lectures on Wavelets, SIAM, Philadelphia (1992).

    Google Scholar 

  2. A. A. Ligun and A. A. Shumeiko, “A linear method for the recovery of functions based on binary data completion,” Ukr. Mat. Zh., 53, No. 11, 1501–1512 (2001).

    Google Scholar 

  3. S. Dubuc, “Interpolation through an iterative scheme,” J. Math. Anal. Appl., 185–204 (1986).

  4. S. de Marchi, The Dyadic Iterative Interpolation Method and Some Extensions, Technical Report No. 10.94, Univ. Padua (1994).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ligun, A.A., Shumeiko, A.A. Recovery of a Function from Information on Its Values at the Nodes of a Triangular Grid Based on Data Completion. Ukrainian Mathematical Journal 54, 409–420 (2002). https://doi.org/10.1023/A:1020561316289

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020561316289

Keywords

Navigation