Cart (Loading....) | Create Account
Close category search window
 

Applications of Routh's Algorithm to Network-Theory Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The well-known Routh's criterion uses a very efficient computational method, or algorithm, that has been found to reduce greatly calculational labor and chances of error in a number of other important applications to circuit theory. Among these applications are finding common factors of polynomials, computing Sturm's functions, synthesizing RC, RL, or LC ladder networks by means of continued-fraction expansions, determining RC, RL, or LC realizability of a given immittance function, and analysis of ladder networks. Methods of handling the first two problems, both in normal and special cases, are given and illustrated.

Published in:

Circuit Theory, IRE Transactions on  (Volume:6 ,  Issue: 2 )

Date of Publication:

Jun 1959

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.