✦ LIBER ✦

An Arithmetic for Matrix Pencils: Theory and New Algorithms

✍ Scribed by Peter Benner; Ralph Byers

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 486 KB
Volume: 103
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s00211-006-0001-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for partial fract

An efficient algorithm for partial fraction expansion of the linear matrix pencil inverse

✍ Z. Trzaska 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 663 KB

An algorithm for computing the spectral

An algorithm for computing the spectral structure of a singular linear matrix pencil

✍ V. N. Kublanovskaya 📂 Article 📅 1989 🏛 Springer US 🌐 English ⚖ 483 KB

Fully parallel arithmetic algorithm for

Fully parallel arithmetic algorithm for an N-bit parallel adder and its optical implementations

✍ Senmao Lin; Itsuo Kumazawa 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 914 KB

An algorithm for computing Jordan chains

An algorithm for computing Jordan chains and inverting analytic matrix functions

✍ Jon Wilkening 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On the relation of the Drazin inverse an

On the relation of the Drazin inverse and matrix pencil theory methods for the study of generalized linear systems

✍ Grigoris I. Kalogeropoulos; Athanasios D. Karageorgos; Athanasios A. Pantelous 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An improved algorithm for the computatio

An improved algorithm for the computation of structural invariants of a system pencil and related geometric aspects

✍ C. Oară; P. Van Dooren 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 696 KB

In this paper we propose a new recursive algorithm for computing the staircase form of a matrix pencil, and implicitly its Kronecker structure. The algorithm compares favorably to existing ones in terms of elegance, versatility, and complexity. In particular, the algorittun without any modification