๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient and Optimal Parallel Algorithms for Cholesky Decomposition

โœ Scribed by Eunice E. Santos; Pei-Yue Chu

Book ID
111589736
Publisher
Springer Netherlands
Year
2003
Tongue
English
Weight
187 KB
Volume
2
Category
Article
ISSN
1570-1166

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm for generalized d
An efficient algorithm for generalized discriminant analysis using incomplete Cholesky decomposition
โœ Haixian Wang; Zilan Hu; Yuโ€™e Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

Generalized discriminant analysis (GDA) has provided an extremely powerful approach to extracting nonlinear features via kernel trick. And it has been suggested for a number of applications, such as classification problem. Whereas the GDA could be solved by the utilization of Mercer kernels, a drawb

Optimal and Efficient Algorithms for Sum
Optimal and Efficient Algorithms for Summing and Prefix Summing on Parallel Machines
โœ Eunice E. Santos ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

The problem of designing efficient parallel algorithms for summing and prefix summing for certain classes of the LogP model is studied. We present optimal algorithms for summing and show that any optimal summing algorithm must have a certain inherent structure. Moreover, we present optimal or near-o

Optimal Parallel Algorithms for Quadtree
Optimal Parallel Algorithms for Quadtree Problems
โœ S. Kasif ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science โš– 449 KB

In this paper we describe optimal processor-time parallel algorithms for set operations such as union, intersection, comparison on quadtrees. The algorithms presented in this paper run in \(O(\log\) \(N\) ) time using \(N / \log N\) processors on a shared memory model of computation that allows conc