✦ LIBER ✦

An algorithm for matrix polynomial eigenproblems

✍ Scribed by A.Y.T. Leung

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 254 KB
Volume: 158
Category: Article
ISSN: 0022-460X
DOI: 10.1016/0022-460x(92)90057-5

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

An Householder/QL algorithm for the func

An Householder/QL algorithm for the functional eigenproblem

✍ O Ibidapo-Obe; A.B Sofoluwe; O Abass 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 242 KB

Data parallel evaluation-interpolation a

Data parallel evaluation-interpolation algorithm for polynomial matrix inversion

✍ E.V Krishnamurthy; Chen Pin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 580 KB

An algorithm for high order polynomial e

An algorithm for high order polynomial extrapolation

✍ R. Parker 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

An algorithm for calculating Jones polyn

An algorithm for calculating Jones polynomials

✍ A.E.M. El-Misiery; El-Sayed M. El-Horbaty 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 324 KB

An algorithm for matrix symmetrization

✍ Kabekode V.S. Bhat 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 336 KB

In this paper we characterize a symmetrizability property using the theory of output sets. Employing the basic properties of symmetric matrices and an efficient algorithm for systematic generation of output sets, an algorithm for testing the symmetrizability of a matrix is presented and illustrated.