Sciweavers

374 search results - page 16 / 75
» Fast separable factorization and applications
Sort
View
IPPS
2009
IEEE
14 years 2 months ago
Fast development of dense linear algebra codes on graphics processors
—We present an application programming interface (API) for the C programming language that facilitates the development of dense linear algebra algorithms on graphics processors a...
M. Jesús Zafont, Alberto F. Martín, ...
AUTOMATICA
2007
80views more  AUTOMATICA 2007»
13 years 7 months ago
Fast, large-scale model predictive control by partial enumeration
Partial enumeration (PE) is presented as a method for treating large, linear model predictive control applications that are out of reach with available MPC methods. PE uses both a...
Gabriele Pannocchia, James B. Rawlings, Stephen J....
CGF
2010
98views more  CGF 2010»
13 years 7 months ago
Fast Generation of Pointerless Octree Duals
Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee dire...
Thomas Lewiner, Vinícius Mello, Adelailson ...
PC
2008
119views Management» more  PC 2008»
13 years 7 months ago
Atomic wavefunction initialization in ab initio
We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are ve...
Constantine Bekas, Alessandro Curioni, Wanda Andre...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
13 years 12 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu