𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms for solving linear equations using Givens transformations

✍ Scribed by M. Head-Gordon; P. Piela

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
118 KB
Volume
1
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Parallel Algorithms for Solving Tri
Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube
✍ O.H. Ibarra; M.H. Kim πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 864 KB

This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec

Specialized Parallel Algorithms for Solv
Specialized Parallel Algorithms for Solving Lyapunov and Stein Equations
✍ Enrique S. Quintana-Ortı́; Robert van de Geijn πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 215 KB

Lyapunov and Stein matrix equations arise in many important analysis and synthesis applications in control theory. The traditional approach to solving these equations relies on the QR algorithm which is notoriously difficult to parallelize. We investigate iterative solvers based on the matrix sign f

On Efficient Parallel Algorithms for Sol
On Efficient Parallel Algorithms for Solving Set Recurrence Equations
✍ O.H. Ibarra; H. Wang; T. Jiang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 545 KB

We present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in \(O\left(\log ^{2} n\right)