Sciweavers

573 search results - page 31 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
ICML
2005
IEEE
14 years 9 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul
SIGGRAPH
1998
ACM
14 years 1 months ago
Large Steps in Cloth Simulation
The bottle-neck in most cloth simulation systems is that time steps must be small to avoid numerical instability. This paper describes a cloth simulation system that can stably ta...
David Baraff, Andrew P. Witkin
TCS
2008
13 years 9 months ago
Solving difference equations whose coefficients are not transcendental
We consider a large class of sequences, called admissible sequences, which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumera...
Manuel Kauers
FGCS
2006
122views more  FGCS 2006»
13 years 9 months ago
Conceptual interfaces in hypre
The hypre software library is being developed with the aim of providing scalable solvers for the solution of large, sparse linear systems on massively parallel computers. To this e...
Robert D. Falgout, Jim E. Jones, Ulrike Meier Yang
COCOON
2000
Springer
14 years 1 months ago
Recent Progress and Prospects for Integer Factorisation Algorithms
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
Richard P. Brent