Decoupling Highly Structured Polynomial Systems
Abstract
Recommendations
Decoupling highly structured polynomial systems
An efficient technique for finding numerical approximations of isolated solutions of polynomial systems with a particular structure is presented. This structure is quite specific but arises naturally, for example when computing the critical points of a ...
Certain classes of polynomial expansions and multiplication formulas
The authors first present a class of expansions in a series of Bernoulli polyomials and then show how this general result can be applied to yield various (known or new) polynomial expansions. The corresponding expansion problem involving the Euler ...
Structured matrix-based methods for polynomial ∈-gcd: analysis and comparisons
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computationThe relationship between univariate polynomial ∈-gcd and factorization of resultant matrices is investigated and several stable and effective algorithms for the computation of an ∈-gcd are proposed. The main result is the design of a practically stable ...
Comments
Information & Contributors
Information
Published In

Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Poster
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 33Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in