Results 1  10
of
19
The multivariate spline method for numerical solution of partial differential equations and scattered data fitting
"... Multivariate spline functions are smooth piecewise polynomial functions over triangulations consisting of nsimplices in the Euclidean space R^n. We present a straightforward method for using these spline functions to numerically solve elliptic partial differential equations such as Poisson and bi ..."
Abstract

Cited by 18 (14 self)
 Add to MetaCart
Multivariate spline functions are smooth piecewise polynomial functions over triangulations consisting of nsimplices in the Euclidean space R^n. We present a straightforward method for using these spline functions to numerically solve elliptic partial differential equations such as Poisson and biharmonic equations and fit given scattered data. This method does not require constructing macroelements or locally supported basis functions nor computing the dimension of the finite element spaces or spline spaces. We have implemented the method in MATLAB using multivariate splines in R² and R³. Several numerical examples are presented to demonstrate the effectiveness and efficiency of the method.
The Multivariate Spline Method for Scattered Data Fitting . . .
, 2005
"... Multivariate spline functions are smooth piecewise polynomial functions over triangulations consisting of nsimplices in the Euclidean space IR n. A straightforward method for using these spline functions to fit given scattered data and numerically solve elliptic partial differential equations is p ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
Multivariate spline functions are smooth piecewise polynomial functions over triangulations consisting of nsimplices in the Euclidean space IR n. A straightforward method for using these spline functions to fit given scattered data and numerically solve elliptic partial differential equations is presented. This method does not require constructing macroelements or locally supported basis functions nor computing the dimension of the finite element spaces or spline spaces. The method for splines in R² and R³ has been implemented in MATLAB. Several numerical examples are shown to demonstrate the effectiveness and efficiency of the method.
Spherical Splines for Data Interpolation and Fitting
 SIAM J. Scientific Computing
, 2005
"... Abstract. We study minimal energy interpolation, discrete and penalized least squares approximation problems on the unit sphere using nonhomogeneous spherical splines. Several numerical experiments are conducted to compare approximating properties of homogeneous and nonhomogeneous splines. Our numer ..."
Abstract

Cited by 10 (6 self)
 Add to MetaCart
(Show Context)
Abstract. We study minimal energy interpolation, discrete and penalized least squares approximation problems on the unit sphere using nonhomogeneous spherical splines. Several numerical experiments are conducted to compare approximating properties of homogeneous and nonhomogeneous splines. Our numerical experiments show that nonhomogeneous splines have certain advantages over homogeneous splines. Key words. spherical splines, data fitting AMS subject classifications. 65D05, 65D07, 65D17
Multivariate Splines for Data Fitting and Approximation
"... Abstract. Methods for scattered data fitting using multivariate splines will be surveyed in this paper. Existence, uniqueness, and computational algorithms for these methods, as well as their approximation properties will be discussed. Some applications of multivariate splines for data fitting will ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
Abstract. Methods for scattered data fitting using multivariate splines will be surveyed in this paper. Existence, uniqueness, and computational algorithms for these methods, as well as their approximation properties will be discussed. Some applications of multivariate splines for data fitting will be briefly explained. Some new research initiatives of scattered data fitting will be outlined. Given a set of scattered data, e.g., {(xi, yi, zi), i = 1, · · · , N}, we need to find a smooth function or surface S such that S(xi, yi) = zi, i = 1, · · · , N, if zi are very accurate measurements or
Error Bounds for minimal energy interpolatory spherical splines
 NUMERISHE MATH
, 2005
"... The convergence of the minimal energy interpolatory splines on the unit sphere is studied in this paper. An upper bound on the difference between a sufficiently smooth function and its interpolatory spherical spline in the infinity norm is given. The error bound is expressed in terms of a second or ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
(Show Context)
The convergence of the minimal energy interpolatory splines on the unit sphere is studied in this paper. An upper bound on the difference between a sufficiently smooth function and its interpolatory spherical spline in the infinity norm is given. The error bound is expressed in terms of a second order spherical Sobolevtype seminorm of the original function.
Penalized least squares fitting
 Serdica Math. J
, 2002
"... Abstract. Bounds on the error of certain penalized least squares data setting, more detailed results are included for several particularly interesting special cases, including splines in both one and several variables. 1. Introduction. We ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Bounds on the error of certain penalized least squares data setting, more detailed results are included for several particularly interesting special cases, including splines in both one and several variables. 1. Introduction. We
Computing Bivariate Splines in Scattered Data Fitting and the Finiteelement Method
"... Abstract. A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves solving a system of linear equations. Examples include several wellknown methods for fitting scattered data, suc ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves solving a system of linear equations. Examples include several wellknown methods for fitting scattered data, such as the minimal energy, leastsquares, and penalized leastsquares methods. Finiteelement methods for solving boundaryvalue problems are also of this type. It is shown here that these types of globallydefined splines can be efficiently computed, provided we work with spline spaces with stable local minimal determining sets. Bivariate splines defined over triangulations are important tools in several application areas including scattered data fitting and the numerical solution of boundaryvalue problems by the finite element method. Methods for computing spline approximations fall into two classes:
A Domain Decomposition Method for Computing Bivariate Spline Fits of Scattered Data
"... Abstract. A domain decomposition method for solving large bivariate scattered data fitting problems with bivariate minimal energy, discrete leastsquares, and penalized leastsquares splines is described. The method is based on splitting the domain into smaller domains, solving the associated smalle ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. A domain decomposition method for solving large bivariate scattered data fitting problems with bivariate minimal energy, discrete leastsquares, and penalized leastsquares splines is described. The method is based on splitting the domain into smaller domains, solving the associated smaller fitting problems, and combining the coefficients to get a global fit. Explicit error bounds are established for how well our locally constructed spline fits approximate the global fits. Some numerical examples are given to illustrate the effectiveness of the method. Suppose f is a smooth function defined on a domain Ω in IR 2 with polygonal boundary. Given the values {fi: = f(xi, yi)} nd i=1 of f at some set of scattered points
A Bivariate Spline Approach for Image Enhancement
, 2010
"... A new approach for image enhancement is developed in this paper. It is based on bivariate spline functions. By choosing a local region from an image to be enhanced, one can use bivariate splines with minimal surface area to enhance the image by reducing noises, smoothing the contrast, e.g. smoothing ..."
Abstract
 Add to MetaCart
(Show Context)
A new approach for image enhancement is developed in this paper. It is based on bivariate spline functions. By choosing a local region from an image to be enhanced, one can use bivariate splines with minimal surface area to enhance the image by reducing noises, smoothing the contrast, e.g. smoothing wrinkles and removing stains or damages from images. To establish this approach, we first discuss its mathematical aspects: the existence, uniqueness and stability of the splines of minimal surface area and propose an iterative algorithm to compute the fitting splines of minimal surface area. The convergence of the iterative solutions will be established. In addition, the fitting splines of minimal surface area are convergent as the size of triangulation goes to zero in theory. Finally, several numerical examples are shown to demonstrate the effectiveness of this new approach. 1