Sciweavers

20 search results - page 2 / 4
» Directional Newton methods in n variables
Sort
View
MOC
2010
13 years 1 months ago
A direct coupling of local discontinuous Galerkin and boundary element methods
The coupling of local discontinuous Galerkin (LDG) and boundary element methods (BEM), which has been developed recently to solve linear and nonlinear exterior transmission proble...
Gabriel N. Gatica, Norbert Heuer, Francisco-Javier...
IJCAI
1989
13 years 7 months ago
An Approximate Solver for Symbolic Equations
This paper describes a program, called NEWTON, that finds approximate symbolic solutions to parameterized equations in one variable. N E W T O N derives an initial approximation b...
Elisha Sacks
JACM
2000
119views more  JACM 2000»
13 years 6 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CP
2009
Springer
14 years 6 months ago
Filtering Numerical CSPs Using Well-Constrained Subsystems
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
SAC
2010
ACM
14 years 1 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...