๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A matrix decomposition-reduction procedure for the pole-zero calculation of transfer functions

โœ Scribed by Ohtsuki, T.; Lap-Kit Cheung

Book ID
114614584
Publisher
Institute of Electrical and Electronics Engineers
Year
1973
Tongue
English
Weight
1014 KB
Volume
20
Category
Article
ISSN
0018-9324

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An eigenvalue method for calculating dom
An eigenvalue method for calculating dominant poles of a transfer function
โœ Licio Hernanes Bezerra ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 151 KB

Here we give a mathematical proof that a current method that calculates dominant poles is locally convergent. Moreover, the convergence is at least quadratic.

Reduction procedures for calculating the
Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids
โœ H.M. Rara ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 207 KB

Let G be a graph without loops and multiple edges. If V(G) = {vl, v2 .... , v,}, we define the adjacency matrix of G to be the n x n (0, D-matrix A(G) = (aij), where ais = l if viv s e E(G) and ais = 0 otherwise. G is said to be singular if the matrix A(G) is singular. Reduction procedures which wil