A cost-optimal parallel algorithm for B-spline surface fitting
โ Scribed by Kuo-Liang Chung; Ferng-Ching Lin
- Publisher
- Elsevier Science
- Year
- 1991
- Weight
- 424 KB
- Volume
- 53
- Category
- Article
- ISSN
- 1049-9652
No coin nor oath required. For personal study only.
โฆ Synopsis
We show how to transform the B-splhre surface fitting problem into suffix computations of continued fractions. Then a parallel substitution scheme is used to compute the suffix values on a newly proposed mesh-of-unshuffle network. The derived parallel algorithm allows the surface interpolation at m x n points to be solved in O(log m log n) time using O(mnl(log m log n)) processors. The algorithm is cost-optimal in the sense that number of processors times execution time is minimized. The problem can be even more quickly solved in O(log m + log n) time if @(mn) processors are used in the network.
๐ SIMILAR VOLUMES
In this paper a method is presented for fitting, in the least-squares sense, a bivariate cubic spline function to values of a dependent variable, specified at points on a rectangular grid in the plane of the independent variables. Products of B-splines are used to represent the bicubic splines. The
In this paper we present a novel method for solving a class of nonlinear optimal feedback control problems with moderately high dimensional state spaces, based on an adapted version of the BMARS algorithm. Numerical experiments were performed using problems with up to six state variables. The numeri