Solving nonlinear polynomial systems in the barycentric Bernstein basis
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the barycentric Bernstein basis and subdivision. The roots are approximated to arbitrary precision by iteratively constructing a s...
Main Authors: | Reuter, Martin, Mikkelsen, Tarjei Sigurd, Sherbrooke, Evan C., Maekawa, Takashi, Patrikalakis, Nicholas M. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mechanical Engineering |
Format: | Article |
Language: | en_US |
Published: |
Spring Berlin/Heidelberg
2011
|
Online Access: | http://hdl.handle.net/1721.1/65558 |
Similar Items
-
Computation of the solutions of nonlinear polynomial systems
by: Sherbrooke, Evan Conway
Published: (2005) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
by: Pachon, R, et al.
Published: (2009) -
Barycentric−Remez algorithms for best polynomial approximation in the chebfun system
by: Pachόn, R, et al.
Published: (2008) -
Barycentric-Remez algorithms for best polynomial approximation in the chebfun system
by: Pachon, R, et al.
Published: (2008) -
What makes us human?
by: Mikkelsen, Tarjei Sigurd
Published: (2010)