✦ LIBER ✦

A parallel algorithm for the generalLU factorization

✍ Scribed by Kincaid, David R. ;Oppe, Thomas C.

Publisher: Wiley (John Wiley & Sons)
Year: 1988
Tongue: English
Weight: 504 KB
Volume: 4
Category: Article
ISSN: 0748-8025
DOI: 10.1002/cnm.1630040309

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A family of parallel QR factorization al

A family of parallel QR factorization algorithms

✍ Meyer, Gerard G.L.; Pascale, Mike 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 624 KB

Rapid computation of the QR factorization of a matrix is fundamental to many scientific and engineering problems. The paper presents a family of algorithms parameterized by the number of processors available P, arithmetic grain aggregation parameters gl ,@, . . . ,gp, and communication grain aggrega

A Parallel Algorithm for 4×4 DCT

✍ J. Jiang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 175 KB

By developing a generalized 1D approach and parallel computing algorithm, this paper presents a parallel algorithm design and hardware implementation for the computation of 4\_4 DCT. This algorithm sorts all the 2D input pixel data into four groups. Each group is then forwarded to a 1D DCT arithmeti

A Parallel Algorithm for Rotating-Frame

A Parallel Algorithm for Rotating-Frame Zeugmatography

✍ C.-N. Chen; D. I. Hoult; V. J. Sank 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

## Abstract An algorithm, which utilizes a high degree of parallel processing, has been developed for two‐dimensional rotating‐frame zeugmatography so that a picture of 256 X 256 pixels can be generated with a minicomputer system 2 sec after data accumulation. An array processor is employed as a se

A Lanczos-type algorithm for the QR fact

A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices

✍ Dario Fasino; Luca Gemignani 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

An Algorithm for Solving the Factorizati

An Algorithm for Solving the Factorization Problem in Permutation Groups

✍ T. Minkwitz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The factorization problem in permutation groups is to represent an element g of some permutation group G as a word over a given set S of generators of G. For practical purposes, the word should be as short as possible, but must not be minimal. Like many other problems in computational group theory,

A Randomized Parallel Algorithm for Plan

A Randomized Parallel Algorithm for Planar Graph Isomorphism

✍ Hillel Gazit; John H Reif 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We present a parallel randomized algorithm running on a CRCW PRAM, to determine whether two planar graphs are isomorphic, and if so to find the isomorphism. We assume that we have a tree of separators for each planar graph Ž Ž 2 . 1 q ⑀ which can be computed by known algorithms in O log n time with