𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the QR algorithm and updating the SVD and the URV decomposition in parallel

✍ Scribed by Marc Moonen; Paul Van Dooren; Filiep Vanpoucke

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
969 KB
Volume
188-189
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Parallel Algorithms for the Edge-Colorin
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
✍ Weifa Liang; Xiaojun Shen; Qing Hu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ Ο© 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ Ο© 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Υ… 3⌬/2 [16]. A number of parallel algorithms

Protein calculations on parallel process
Protein calculations on parallel processors. II. Parallel algorithm for the forces and molecular dynamics
✍ J.F. Janak; P.C. Pattnaik πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 456 KB

## Abstract We describe two algorithms for the parallel calculation of a CHARMm‐like force field in macromolecules. For a molecule with a given number of atoms, we show that there is an optimal number of processors leading to a minimum computation time. At the optimum, both the number of processors