๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast divide-and-conquer algorithm for computing the spectra of real symmetric tridiagonal matrices

โœ Scribed by Coakley, Ed S.; Rokhlin, Vladimir


Book ID
123071255
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
546 KB
Volume
34
Category
Article
ISSN
1063-5203

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A BSP Recursive Divide and Conquer Algor
โœ 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

Divide and conquer: a parallel algorithm
โœ Stefan Bondeli ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 655 KB

Bondeli, S\_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Computing 17 (1991) 419-434\_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel com