𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Z. Trzaska

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
663 KB
Volume
324
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the numerical inversion
An algorithm for the numerical inversion of a tridiagonal matrix
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.

An Efficient Algorithm for Solving the I
An Efficient Algorithm for Solving the Inverse Problem of Locating the Interfaces Using the Frequency Sounding Data
✍ Alexandre Timonov; Michael V. Klibanov πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 146 KB

We consider the inverse coefficient problem of locating the interface positions arising in frequency sounding of layered media. Such a problem is of particular interest in the exploration of geophysics, underwater acoustics and electromagnetics, optical sensing, and so forth. We found that a simplif

An algorithm for the realization of gene
An algorithm for the realization of generalized linear systems via Taylor series expansion about an arbitrary point β€œa”
✍ M.A. Christodoulou; G. Vachtsevanos; B.G. Mertzios πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 432 KB

An algorithm is developed for the realization of generalized state space linear systems via Taylor series expansion about a nominal point <<a". The algorithm provides minimal, jinite dimensional realizations when the data of the external description, such as the impulse response or the frequency res

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.