𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An O(N2) method for computing the eigensystem of N × N symmetric tridiagonal matrices by the divide-and-conquer approach

✍ Scribed by Doron Gill; Eitan Tadmor

Book ID
107826283
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
85 KB
Volume
120
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n2) Divide-and-Conquer Algorithm fo
An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
✍ A. Ehrenfeucht; H.N. Gabow; R.M. Mcconnell; S.J. Sullivan 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 526 KB

This paper presents a simple divide-and-conquer algorithm for computing the prime tree decomposition of a two-structure. The algorithm runs in \(O\left(n^{2}\right)\) time, when \(n\) is the number of nodes of the two-structure. A directed or undirected graph is a special case of a two-structure, an