{"title":"Lagrange-type Algebraic Minimal Bivariate Fractal Interpolation Formula","authors":"Ildikó Somogyi, Anna Soós","doi":"10.11648/j.acm.20231205.11","DOIUrl":null,"url":null,"abstract":"Fractal interpolation methods became an important method in data processing, even for functions with abrupt changes. In the last few decades it has attracted several authors because it can be applied in various fields. The advantage of these methods are that we can generalize the classical approximation methods and also we can combine these methods for example with Lagrange interpolation, Hermite interpolation or spline interpolation. The classical Lagrange interpolation problem give the construction of a suitable approximate function based on the values of the function on given points. These method was generalized for more than one variable functions. In this article we generalize the so-called algebraic maximal Lagrange interpolation formula in order to approximate functions on a rectangular domain with fractal functions. The construction of the fractal function is made with a so-called iterated function system. This method it has the advantage that all classical methods can be obtained as a particular case of a fractal function. We also use the construction for a polynomial type fractal function and we proof that the Lagrange-type algebraic minimal bivariate fractal function satisfies the required interpolation conditions. Also we give a delimitation of the error, using the result regarding the error of a polynomial fractal interpolation function.","PeriodicalId":55503,"journal":{"name":"Applied and Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied and Computational Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11648/j.acm.20231205.11","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
Fractal interpolation methods became an important method in data processing, even for functions with abrupt changes. In the last few decades it has attracted several authors because it can be applied in various fields. The advantage of these methods are that we can generalize the classical approximation methods and also we can combine these methods for example with Lagrange interpolation, Hermite interpolation or spline interpolation. The classical Lagrange interpolation problem give the construction of a suitable approximate function based on the values of the function on given points. These method was generalized for more than one variable functions. In this article we generalize the so-called algebraic maximal Lagrange interpolation formula in order to approximate functions on a rectangular domain with fractal functions. The construction of the fractal function is made with a so-called iterated function system. This method it has the advantage that all classical methods can be obtained as a particular case of a fractal function. We also use the construction for a polynomial type fractal function and we proof that the Lagrange-type algebraic minimal bivariate fractal function satisfies the required interpolation conditions. Also we give a delimitation of the error, using the result regarding the error of a polynomial fractal interpolation function.
期刊介绍:
Applied and Computational Mathematics (ISSN Online: 2328-5613, ISSN Print: 2328-5605) is a prestigious journal that focuses on the field of applied and computational mathematics. It is driven by the computational revolution and places a strong emphasis on innovative applied mathematics with potential for real-world applicability and practicality.
The journal caters to a broad audience of applied mathematicians and scientists who are interested in the advancement of mathematical principles and practical aspects of computational mathematics. Researchers from various disciplines can benefit from the diverse range of topics covered in ACM. To ensure the publication of high-quality content, all research articles undergo a rigorous peer review process. This process includes an initial screening by the editors and anonymous evaluation by expert reviewers. This guarantees that only the most valuable and accurate research is published in ACM.