Sciweavers

51 search results - page 10 / 11
» Newton's method for overdetermined systems of equations
Sort
View
DLT
2008
14 years 11 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 1 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
RC
2002
70views more  RC 2002»
14 years 9 months ago
On Existence and Uniqueness Verification for Non-Smooth Functions
Given an approximate solution to a nonlinear system of equations at which the Jacobi matrix is nonsingular, and given that the Jacobi matrix is continuous in a region about this ap...
R. Baker Kearfott
ICA3PP
2005
Springer
15 years 3 months ago
GridMD: Program Architecture for Distributed Molecular Simulation
In the present work we describe architectural concepts of the distributed molecular simulation package GridMD. The main purpose of this work is to underline the construction patter...
Ilya Valuev
CP
2010
Springer
14 years 8 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...