Sciweavers

21984 search results - page 628 / 4397
» C
Sort
View
TOMS
2008
96views more  TOMS 2008»
15 years 7 months ago
Block variants of Hammarling's method for solving Lyapunov equations
This paper is concerned with the efficient numerical solution of the Lyapunov equation AT X +XA = -C with a stable matrix A and a symmetric positive semidefinite matrix C of possi...
Daniel Kressner
COMBINATORICS
2004
112views more  COMBINATORICS 2004»
15 years 7 months ago
On a Combinatorial Problem of Asmus Schmidt
For any integer r 2, define a sequence of numbers {c (r) k }k=0,1,..., independent of the parameter n, by n k=0 n k r n + k k r = n k=0 n k n + k k c (r) k , n = 0, 1, 2, . . . ....
W. Zudilin
MR
2002
87views Robotics» more  MR 2002»
15 years 7 months ago
Development of gold to gold interconnection flip chip bonding for chip on suspension assemblies
Gold to Gold Interconnection (GGI) flip chip bonding technology has been developed to bond the driver IC chip on the integrated circuit suspension used in hard disk drives (HDDs)....
C. F. Luk, Y. C. Chan, K. C. Hung
SIAMJO
2002
105views more  SIAMJO 2002»
15 years 7 months ago
An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs
We consider the interior-point approach to sensitivity analysis in linear programming developed by the authors. We investigate the quality of the interior-point bounds under degene...
E. Alper Yildirim, Michael J. Todd
210
Voted
RSA
2008
118views more  RSA 2008»
15 years 6 months ago
The cover time of the giant component of a random graph
We study the cover time of a random walk on the largest component of the random graph Gn,p. We determine its value up to a factor 1 + o(1) whenever np = c > 1, c = O(ln n). In ...
Colin Cooper, Alan M. Frieze