MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Solving nonlinear polynomial systems in the barycentric Bernstein basis

Author(s)
Reuter, Martin; Mikkelsen, Tarjei Sigurd; Sherbrooke, Evan C.; Maekawa, Takashi; Patrikalakis, Nicholas M.
Thumbnail
DownloadReuter_Solving nonlinear.pdf (508.0Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
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 series of smaller bounding simplices. We use geometric subdivision to isolate multiple roots within a simplex. An algorithm implementing this method in rounded interval arithmetic is described and analyzed. We find that when the total order of polynomials is close to the maximum order of each variable, an iteration of this solver algorithm is asymptotically more efficient than the corresponding step in a similar algorithm which relies on polynomial representation in the tensor product Bernstein basis. We also discuss various implementation issues and identify topics for further study.
Date issued
2007-11
URI
http://hdl.handle.net/1721.1/65558
Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Journal
Visual Computer
Publisher
Spring Berlin/Heidelberg
Citation
Reuter, Martin et al. “Solving Nonlinear Polynomial Systems in the Barycentric Bernstein Basis.” The Visual Computer 24.3 (2007) : 187-200. © 2007 Springer-Verlag
Version: Author's final manuscript
ISSN
0178-2789
1432-2315

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.