✦ LIBER ✦

A divide-and-conquer method for the tridiagonal generalized eigenvalue problem

✍ Scribed by L. Elsner; A. Fasse; E. Langmann

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 368 KB
Volume: 86
Category: Article
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(97)00152-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Divide and conquer methods for block tri

Divide and conquer methods for block tridiagonal systems

✍ Volker Mehrmann 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 967 KB

A divide and conquer method for polynomi

A divide and conquer method for polynomial zeros

✍ T.L. Freeman; R.W. Brankin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 575 KB

A frame for general divide-and-conquer r

A frame for general divide-and-conquer recurrences

✍ Wang Xiaodong; Fu Qingxiang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 432 KB

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

Newton's Method for a Generalized Invers

Newton's Method for a Generalized Inverse Eigenvalue Problem

✍ Hua Dai; Peter Lancaster 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB 👁 2 views

A kind of generalized inverse eigenvalue problem is proposed which includes the additive, multiplicative and classical inverse eigenvalue problems as special cases. Newton's method is applied, and a local convergence analysis is given for both the distinct and the multiple eigenvalue cases. When the

Parallel divide and conquer approach for

Parallel divide and conquer approach for the protein threading problem

✍ Nicola Yanev; Rumen Andonov 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB