Sciweavers

2008 search results - page 89 / 402
» Computing with Equations
Sort
View
FMSD
2006
104views more  FMSD 2006»
13 years 9 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
SIAMAM
2002
72views more  SIAMAM 2002»
13 years 8 months ago
Desorption Overshoot in Polymer-Penetrant Systems: Asymptotic and Computational Results
Many practically relevant polymers undergoing desorption change from the rubbery (saturated) to the glassy (nearly dry) state. The dynamics of such systems cannot be described by t...
David A. Edwards, Richard A. Cairncross
CSE
2009
IEEE
14 years 4 months ago
Parallel Computation of Nash Equilibria in N-Player Games
—We propose a parallel algorithm for finding Nash equilibria in n-player noncooperative games. The algorithm is based on enumerating the supports of mixed strategies in parallel...
Jonathan Widger, Daniel Grosu
MP
2006
93views more  MP 2006»
13 years 9 months ago
Computation of Error Bounds for P-matrix Linear Complementarity Problems
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
Xiaojun Chen, Shuhuang Xiang
MOC
2010
13 years 4 months ago
Computation of conformal representations of compact Riemann surfaces
We find a system of two polynomial equations in two unknowns, whose solution allows us to give an explicit expression of the conformal representation of a simply connected three-sh...
Guillermo López Lagomasino, Domingo Pestana...