Sciweavers

1418 search results - page 60 / 284
» Schema polynomials and applications
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 11 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
FOCM
2007
48views more  FOCM 2007»
15 years 6 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
Alexander I. Barvinok
FOSSACS
2004
Springer
15 years 11 months ago
Polynomials for Proving Termination of Context-Sensitive Rewriting
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
Salvador Lucas
STOC
1998
ACM
111views Algorithms» more  STOC 1998»
15 years 10 months ago
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
Nathan Linial, Alex Samorodnitsky, Avi Wigderson
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
15 years 9 months ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...