1993
DOI: 10.1016/0893-9659(93)90124-6
|View full text |Cite
|
Sign up to set email alerts
|

Numerical triangle, Fibonacci sequence and ladder networks: Some further results

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

1996
1996
2011
2011

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 4 publications
0
5
0
Order By: Relevance
“…Applying (32) in circuit theory we get a simple expression for a parrallel connection of infinite number of resistors with resistances determined by successive Fibonacci numbers. Such type of electric circuits can be considered as an alternative structure for ladder networks composed of identical resistors (see [9,16]).…”
Section: Particular Properties Of Polynomials (2)mentioning
confidence: 99%
See 3 more Smart Citations
“…Applying (32) in circuit theory we get a simple expression for a parrallel connection of infinite number of resistors with resistances determined by successive Fibonacci numbers. Such type of electric circuits can be considered as an alternative structure for ladder networks composed of identical resistors (see [9,16]).…”
Section: Particular Properties Of Polynomials (2)mentioning
confidence: 99%
“…The Fibonacci polynomials can be used to represent a given physical quantity, for example, voltage in a voltage divider (see [11,13,16)), or a fixed number as a sum of suitable components (see [4,20]). Our particular interest here is the decomposition of a given value g into elements of a Fibonacci polynomial of n-th degree, i.e.…”
Section: Optimizations With Fibonacci Polynomialsmentioning
confidence: 99%
See 2 more Smart Citations
“…In general, a polynomial characterizes the electrical network over a frequency range. New methods were developed to find the coefficients of these characteristic polynomials using recurrence relations [4], which generate the correct coefficients for a ladder network of any given number of stages. These methods are less accessible to third or fourth year undergraduate students as they involve the matrix formalism or knowledge of theorems, such as Cagney-Hamilton [3] theorems applied to ladder networks, from which the modified numerical triangle is being generated.…”
Section: Introductionmentioning
confidence: 99%