✦ LIBER ✦

Applications of a strategy for designing divide-and-conquer algorithms

✍ Scribed by Douglas R. Smith

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 965 KB
Volume: 8
Category: Article
ISSN: 0167-6423
DOI: 10.1016/0167-6423(87)90034-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A divide-and-conquer algorithm for grid

A divide-and-conquer algorithm for grid generation

✍ Randall L. Dougherty; James M. Hyman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 880 KB

Optimal speeding up of parallel algorith

Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy

✍ C.Y. Tang; R.C.T. Lee 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 633 KB

A General Method and a Master Theorem fo

A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications

✍ R.M. Verma 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 505 KB

A recursive algorithm for matrix Padé ap

A recursive algorithm for matrix Padé approximants—the divide-and-conquer approach

✍ P. Achuthan; S. Sundar 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 500 KB

Implementation of a divide-and-conquer m

Implementation of a divide-and-conquer method for intersection of parametric surfaces

✍ Elizabeth G. Houghton; Robert F. Emnett; James D. Factor; Chaman L. Sabharwal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 693 KB

A BSP Recursive Divide and Conquer Algor

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study