✦ LIBER ✦

Error complexity analysis of two algorithms for computing powers of arbitrary Hessenberg matrices

✍ Scribed by Nai-Kuan Tsao

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 834 KB
Volume: 322
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(86)90038-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing powers of arbitrary Hessenberg

Computing powers of arbitrary Hessenberg matrices

✍ C.P. Huang 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 485 KB

An algorithm for computing powers of a H

An algorithm for computing powers of a Hessenberg matrix and its applications

✍ B.N. Datta; Karabi Datta 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 485 KB

A Power Method for Computing Square Root

A Power Method for Computing Square Roots of Complex Matrices

✍ Mohammed A. Hasan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 188 KB

In this paper higher order convergent methods for computing square roots of nonsingular complex matrices are derived. These methods are globally convergent and are based on eigenvalue shifting and powering. Specifically, it is shown for each positive integer r G 2, a convergent method of order r can

Algorithms of polynomial complexity for

Algorithms of polynomial complexity for computing the radius of instability in two classes of trajectory problems

✍ E.N. Gordeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 481 KB

Error analysis of algorithms for computi

Error analysis of algorithms for computing the projection of a point onto a linear manifold

✍ M. Arioli; A. Laratta 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 930 KB

Two algorithms for the parallel computat

Two algorithms for the parallel computation of eigenvalues and eigenvectors of large symmetric matrices using the ICL DAP

✍ J.S Weston; M Clint 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 675 KB