- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Block Based Newton-Like Blending Interpolation
- BibTex
- RIS
- TXT
@Article{JCM-24-515,
author = {},
title = {Block Based Newton-Like Blending Interpolation},
journal = {Journal of Computational Mathematics},
year = {2006},
volume = {24},
number = {4},
pages = {515--526},
abstract = { Newton's polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets (blocks), then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton's method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton's polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method. },
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/8771.html}
}
TY - JOUR
T1 - Block Based Newton-Like Blending Interpolation
JO - Journal of Computational Mathematics
VL - 4
SP - 515
EP - 526
PY - 2006
DA - 2006/08
SN - 24
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8771.html
KW - Interpolation
KW - Block based divided differences
KW - Blending method
AB - Newton's polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets (blocks), then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton's method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton's polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method.
Qian-jin Zhao & Jie-qing Tan. (1970). Block Based Newton-Like Blending Interpolation.
Journal of Computational Mathematics. 24 (4).
515-526.
doi:
Copy to clipboard