Data-flow algorithms for parallel matrix computation
From MaRDI portal
Publication:3745172
DOI10.1145/4021.4025zbMath0606.65029OpenAlexW2003249877MaRDI QIDQ3745172
Dianne P. O'Leary, G. W. Stewart
Publication date: 1985
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/4021.4025
Related Items
Communication complexity of the Gaussian elimination algorithm on multiprocessors, Numerical solution of the Lyapunov equation by approximate power iteration, A systolic algorithm for Riccati and Lyapunov equations, Parallel solution of Fredholm integral equations of the second kind by orthogonal polynomial expansions, Methods and algorithms of solving spectral problems for polynomial and rational matrices, Iterative refinement of Schur decompositions, Some aspects of parallel implementation of the finite-element method on message passing architectures, Efficient diagonalization of oversized matrices on a distributed-memory multiprocessor, A symplectic acceleration method for the solution of the algebraic Riccati equation on a parallel computer, An acceleration method for computing the generalized eigenvalue problem on a parallel computer, On efficient implementations of Kogbetliantz's algorithm for computing the singular value decomposition, Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian, A parallel interior point algorithm for linear programming on a network of transputers, Assignment and scheduling in parallel matrix factorization, Parallel Cholesky factorization on a shared-memory multiprocessor, Torus data flow for parallel computation of missized matrix problems, Complexity of dense-linear-system solution on a multiprocessor ring, A direct method for completing eigenproblem solutions on a parallel computer, A triangular processor array for computing singular values
