Approximation and interpolation with Bernstein polynomials.
Access rightsWorldwide access
Allen, Larry J., 1993-
MetadataShow full item record
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. In this dissertation, we investigate fundamental problems in approximation theory and numerical analysis involving Bernstein polynomials. We begin by developing a structured decomposition of the inverse of the matrices related to approximation and interpolation. These matrices are highly ill-conditioned, and so we introduce a nonstandard matrix norm to study the conditioning of the matrices, showing that the conditioning in this case is better than in the standard 2-norm. We conclude by giving an algorithm for enforcing bounds constraints on the approximating polynomial. Extensions of the interpolation problem and constrained approximation problem to higher dimensions are also considered.
Showing items related by title, author, creator and subject.
Howard, Catherine (2014-06-02)Angiogenesis in the heart requires cell-cell communication between fibroblasts and endothelial cells (ECs). We have demonstrated that fibroblast-EC interactions involve the cell surface molecule N-cadherin. In tube formation ...
Maurer, Peter M. (2013-09-20)There are nine conjugacy classes of faithful representations of S4 in the general linear group of 4x4 matrices. This report gives generator matrices for one group in each class. These generator pairs allow each of the ...
Ahn, Jeong H. (2009-03-31)NPXY (Asn-Pro-X-Tyr) is a conserved tyrosine phosphorylation motif that binds to PTB (phospho-tyrosine binding) domain of other protein. Integrins, a heterodimeric cell surface receptor for extracellular matrix (ECM), ...