Cargando…
Recursion-Transform method to a non-regular m×n cobweb with an arbitrary longitude
A general Recursion-Transform method is put forward and is applied to resolving a difficult problem of the two-point resistance in a non-regular m × n cobweb network with an arbitrary longitude (or call radial), which has never been solved before as the Green’s function technique and the Laplacian m...
Autor principal: | Tan, Zhi-Zhong |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4466885/ https://www.ncbi.nlm.nih.gov/pubmed/26073882 http://dx.doi.org/10.1038/srep11266 |
Ejemplares similares
-
Flexibility of Boolean Network Reservoir Computers in Approximating Arbitrary Recursive and Non-Recursive Binary Filters
por: Echlin, Moriah, et al.
Publicado: (2018) -
The Cobweb
por: Kelly, Eileen
Publicado: (1954) -
Large cobwebs
Publicado: (1975) -
Fast Recursive Computation of Sliding DHT with Arbitrary Step
por: Kober, Vitaly
Publicado: (2020) -
Difference of Longitude
Publicado: (1873)