Least squares methods for solving differential equations using Bézier control points

Authors:
Jianmin Zheng;Thomas W. Sederberg;Richard W. Johnson
Affiliations:
Department of Computer Science, Brigham Young University, Provo, UT;Department of Computer Science, Brigham Young University, Provo, UT;Idaho National Engineering and Environmental Laboratory, Idaho Falls, ID
Venue:
Applied Numerical Mathematics
Year:
2004

Citing 4
Cited 4

Two-dimensional mesh embedding for B-spline methods

Journal of Computational Physics
Sharp, quantitative bounds on the distance between a polynomial piece and its Bézier control polygon

Computer Aided Geometric Design - Special issue dedicated to Paul de Faget de Casteljau
Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code

Curves and Surfaces for Computer-Aided Geometric Design: A Practical Code
Finite Element Method for Elliptic Problems

Finite Element Method for Elliptic Problems

One-step recursive method for solving systems of differential equations

Journal of Computational and Applied Mathematics
An approximation to solutions of linear ODE by cubic interpolation

Computers & Mathematics with Applications
The automatic construction and solution of a partial differential equation from the strong form

LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Methods for solving singular perturbation problems arising in science and engineering

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the use of the control points of the Bernstein-Bézier form for numerically solving differential equations. Two least squares type schemes based on degree raising and subdivision are proposed. The convergence of the methods applied to two-point boundary value problems is analyzed.