𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

✍ Scribed by Yuli Eidelman; Israel Gohberg; Luca Gemignani


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
222 KB
Volume
420
Category
Article
ISSN
0024-3795

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

On reduction schemes and the symmetry of
✍ Ren, Gexue ;Cheng, Jiangang ;Jinwu, Xiang ;Lu, Qiuhai πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 88 KB πŸ‘ 1 views

In this paper, Lanczos and Arnoldi reduction methods as the special cases of the generalized Hessenberg method are brieΒ―y reviewed. Attention is paid to the eect of symmetry of matrices on the behaviour of the reduction schemes, such as serious numerical breakdown. Based on the summation decompositi