Flexible piecewise approximations based on partition of unity

Weimin Han; Wing Liu

doi:10.1007/s10444-004-1810-z

Back

Flexible piecewise approximations based on partition of unity

Journal article

Peer reviewed

Flexible piecewise approximations based on partition of unity

Weimin Han and Wing Liu

Advances in Computational Mathematics, Vol.23(1), pp.191-199

07/2005

DOI: 10.1007/s10444-004-1810-z

View Online

Abstract

In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally smooth up to any order, enjoy polynomial reproducing conditions, and satisfy nodal interpolation conditions for function values and derivatives of any order. We present various properties of the approximations, that are desirable properties for optimal order convergence in solving boundary value problems.

Algebra

Computer Science

Optimization

partition of unity

nodal interpolation

Numeric Computing

Mathematics, general

Calculus of Variations and Optimal Control

smooth piecewise approximation

polynomial reproducing

Theory of Computation

Galerkin method

Details

Title: Subtitle: Flexible piecewise approximations based on partition of unity
Creators: Weimin Han - Department of MathematicsUniversity of Iowa CityIA52242USA
Wing Liu - Department of Mechanical EngineeringNorthwestern UniversityEvanstonIL60208USA
Contributors: Zongmin Wu (Editor)
Benny Y. C Hon (Editor)
Resource Type: Journal article
Publication Details: Advances in Computational Mathematics, Vol.23(1), pp.191-199
DOI: 10.1007/s10444-004-1810-z
ISSN: 1019-7168
eISSN: 1572-9044
Publisher: Kluwer Academic Publishers; Dordrecht
Language: English
Date published: 07/2005
Academic Unit: Mathematics
Record Identifier: 9983985876102771

Metrics

26 Record Views

7 Times Cited - Web of Science