𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A parallel algorithm for computing the polar decomposition

✍ Scribed by Nicholas J. Higham; Pythagoras Papadimitriou

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
721 KB
Volume
20
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Parallel Algorithm for Computing Minim
A Parallel Algorithm for Computing Minimum Spanning Trees
✍ D.B. Johnson; P. Metaxas πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

A multistage stochastic programming algo
A multistage stochastic programming algorithm suitable for parallel computing
✍ JΓΆrgen Blomvall πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 187 KB

In [Euro. J. Operat. Res. 143 (2002) 452; Opt. Meth. Software 17 (2002) 383] a Riccatibased primal interior point method for multistage stochastic programmes was developed. This algorithm has several interesting features. It can solve problems with a nonlinear node-separable convex objective, local