Sciweavers

35 search results - page 2 / 7
» Numerically validating the completeness of the real solution...
Sort
View
SMA
2010
ACM
164views Solid Modeling» more  SMA 2010»
13 years 5 months ago
Topologically guaranteed univariate solutions of underconstrained polynomial systems via no-loop and single-component tests
We present an algorithm which robustly computes the intersection curve(s) of an under-constrained piecewise polynomial system consisting of n equations with n + 1 unknowns. The so...
Michael Barton, Gershon Elber, Iddo Hanniel
BMCBI
2007
161views more  BMCBI 2007»
13 years 5 months ago
Efficient classification of complete parameter regions based on semidefinite programming
Background: Current approaches to parameter estimation are often inappropriate or inconvenient for the modelling of complex biological systems. For systems described by nonlinear ...
Lars Kuepfer, Uwe Sauer, Pablo A. Parrilo
MOC
1998
108views more  MOC 1998»
13 years 5 months ago
Numerical conformal mapping based on the generalised conjugation operator
Abstract. An iterative procedure for numerical conformal mapping is presented which imposes no restriction on the boundary complexity. The formulation involves two analytically equ...
Bao Cheng Li, Stavros Syngellakis
CASC
2005
Springer
113views Mathematics» more  CASC 2005»
13 years 11 months ago
Real Solving of Bivariate Polynomial Systems
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...
Ioannis Z. Emiris, Elias P. Tsigaridas
NN
2000
Springer
128views Neural Networks» more  NN 2000»
13 years 5 months ago
A recurrent neural network for solving linear projection equations
Linear projection equations arise in many optimization problems and have important applications in science and engineering. In this paper, we present a recurrent neural network fo...
Youshen Xia, Jun Wang