Abstract

Previous article Next article The Synthesis of Certain Subclasses of Tridiagonal Matrices with Prescribed EigenvaluesIsrael NavotIsrael Navothttps://doi.org/10.1137/0115023PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] L. Fox, An introduction to numerical linear algebra, Monographs on Numerical Analysis, Clarendon Press, Oxford, 1964xi+295, Chap. 10 MR0164436 0122.35701 Google Scholar[2] C. Donald LaBudde, The reduction of an arbitrary real square matrix to tridiagonal form using similarity transformations, Math. Comp., 17 (1963), 433–437 MR0156455 CrossrefGoogle Scholar[3] Ernst A. Guillemin, Synthesis of passive networks. Theory and methods appropriate to the realization and approximation problems, John wiley and Sons, Inc., New York, 1958xviii+741, Chap. 10 MR0137480 Google Scholar[4] N. Balabanian, Network Synthesis, Prentice-Hall, Englewood Cliffs, New Jersey, 1958, Chap. 3 Google Scholar[5] H. S. Wall, Analytic Theory of Continued Fractions, D. Van Nostrand Company, Inc., New York, N. Y., 1948, 161–162 MR0025596 0035.03601 Google Scholar[6] G. Chrystal, Algebra, Part II, Chelsea, New York, 1952, Chap. 39 Google Scholar[7] Louis Weinberg and , Paul Slepian, Takahasi's results on Tchebycheff and Butterworth ladder networks, IRE Trans., CT-7 (1960), 88–101 MR0142304 Google Scholar[8] I. Navot, , B. Gonen and , Z. Peri, Explicit formulas for Butterworth and Chebycheff ladder filters with new patterns of reflection zeros, 1966, Proc. 4th Allerton Conference on Circuit and System Theory, University of Illinois, to appear Google Scholar[9] T. G. Marshall, Discussion of “Computer solution of the network realization problem” by D. A. Calahan, Proc. 2nd Allerton Conference on Circuit and System Theory, University of Illinois, 1964, 194–200 Google Scholar[10] T. G. Marshall, Ladder network synthesis by similarity transformation, 1965, Preprint prepared for 3rd Allerton Conference on Circuit and System Theory, Radio Corporation of America, Princeton Google Scholar[11] T. G. Marshall, Primitive matrices for doubly terminated ladder networks, 1966, Proc. 4th Allerton Conference on Circuit and System Theory, University of Illinois, to appear Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails On the conditions for a Hamiltonian matrix to have an eigen-value density with some prescribed characteristicsJournal of Computational and Applied Mathematics, Vol. 2, No. 4 Cross Ref Synthesis of Multiple-Feedback Active Filters29 July 2013 | Bell System Technical Journal, Vol. 52, No. 4 Cross Ref A State-Space Approach to RLCT Two-Port Transfer-Function SynthesisIEEE Transactions on Circuit Theory, Vol. 19, No. 1 Cross Ref Synthesis of RLC Ladder Networks by Matrix TridiagonalizationIEEE Transactions on Circuit Theory, Vol. 16, No. 1 Cross Ref An Application of Tridiagonal Matrices to Network SynthesisR. Yarlagadda12 July 2006 | SIAM Journal on Applied Mathematics, Vol. 16, No. 6AbstractPDF (1049 KB) Volume 15, Issue 2| 1967SIAM Journal on Applied Mathematics History Submitted:30 December 1965Published online:13 July 2006 InformationCopyright © 1967 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0115023Article page range:pp. 241-251ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.