Computational complexity of spline interpolation
作者:
KAZUO TORAICHI,
KAZUKI KATAGISHI,
IWAO SEKITA,
RYOICHI MORI,
期刊:
International Journal of Systems Science
(Taylor Available online 1987)
卷期:
Volume 18,
issue 5
页码: 945-954
ISSN:0020-7721
年代: 1987
DOI:10.1080/00207728708964021
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
The procedure for composing the spline function of order m that interpolates n data is roughly divided into two stages: (1) constructing the matrix Anthat transforms the fl-spline coefficient vector c into the sample value vector s; and (2) calculating the vector c. Then the effects of boundary conditions and the locations of the sampling points and the knots on the number of computations for spline interpolation are evaluated. There are no boundary condition effects of the construction of A" for equispacing. Non-periodic boundary conditions reduce the number of computations needed to calculate c from O(m2n) to O(m2n/4).
点击下载:
PDF (330KB)
返 回