8298 search results - page 349 / 1660 » On the Complexity of Numerical Analysis |
230
click to vote
MOC
2011
15 years 2 months ago
2011
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
178
click to vote
JSCIC
2010
15 years 2 months ago
2010
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
199
click to vote
ISSAC
1997
Springer
15 years 11 months ago
1997
Springer
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...
168
click to vote
APIN
2002
15 years 7 months ago
2002
This paper proposes a few steps to escape structured extensive representations for objects, in the context of evolutionary Topological Optimum Design (TOD) problems: early results ...
150
click to vote
COLING
2008
15 years 9 months ago
2008
We analyse Hindi complex predicates and propose linguistic tests for their detection. This analysis enables us to identify a category of V+V complex predicates called lexical comp...