SIAMREV
2010
12 years 11 months ago
2010
Suppose x and y are unit 2-norm n-vectors whose components sum to zero. Let P(x, y) be the polygon obtained by connecting (x1, y1), . . . , (xn, yn), (x1, y1) in order. We say that...
SIAMNUM
2010
12 years 11 months ago
2010
The method of enhanced assumed strains (EAS) is a popular tool for avoiding locking phenomena, e.g., a remedy for shear locking in plane elasticity. We consider bending-dominated p...
SIAMCO
2010
12 years 11 months ago
2010
This work is concerned with identification of Hammerstein systems whose outputs are measured by quantized sensors. The system consists of a memoryless nonlinearity that is polynomi...
SIAMADS
2010
12 years 11 months ago
2010
Abstract. We consider a novel asymptotic limit of model equations proposed to describe the formation of localized states in a vertically vibrated layer of granular material or visc...
COMPUTING
1999
13 years 4 months ago
1999
Nonconforming finite element discretisations require special care in the construction of the prolongation andrestrictioninthemultigridprocess. Inthispaper,ageneralschemeisproposed...
SIAMCOMP
2000
13 years 4 months ago
2000
We investigate a conjecture stated by Coffman, Flatto, and Wright within the context of a stochastic machine minimization problem with a hard deadline. We prove that the conjecture...
COMBINATORICS
2004
13 years 4 months ago
2004
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...
SIAMCO
2008
13 years 5 months ago
2008
Given a control-affine system and a controlled invariant submanifold, we present necessary and sufficient conditions for local feedback equivalence to a system whose dynamics tran...
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...