✦ LIBER ✦

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

✍ Scribed by B.N. Datta; Karabi Datta

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 485 KB
Volume: 14
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(76)90072-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for computing the eigenstru

An algorithm for computing the eigenstructure of a regular matrix polynomial

✍ Wen-Wei Lin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 665 KB

Short note: An integrable numerical algo

Short note: An integrable numerical algorithm for computing eigenvalues of a specially structured matrix

✍ Jian-Qing Sun; Xing-Biao Hu; Hon-Wah Tam 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB

This paper is motivated by some recent work of Fukuda, Ishiwata, Iwasaki, and Nakamura (Inverse Problems 2009; 25:015007). We first design an algorithm for computing the eigenvalues of a specially structured matrix from the discrete Bogoyavlensky Lattice 2 (dBL2) system. A Lax representation for the

Powers of a matrix and a formula for the

Powers of a matrix and a formula for the moduli of its eigenvalues

✍ Hȧrald K. Wimmer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 84 KB

An LDU decomposition algorithm for a blo

An LDU decomposition algorithm for a block Toeplitz matrix having a parallel and pipelined computing structure

✍ Youji Iiguni; Hideaki Sakai; Hidekatsu Tokumaru 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 585 KB

A practical method for computing the exp

A practical method for computing the exponential of a matrix and its integral

✍ Westreich, David 📂 Article 📅 1990 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 341 KB

A practical algorithm is described for the computation of the transition matrix and its integral of a timeinvariant state-space system. It is based on the partial Taylor expansion of the matrices, and methods for reducing computations and increasing accuracy are given.

An Accurate and Efficient Algorithm for

An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix

✍ S. Rombouts; K. Heyde 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.