首页> 美国卫生研究院文献>Scientific Reports >Recursion-Transform method to a non-regular m×n cobweb with an arbitrary longitude
【2h】

Recursion-Transform method to a non-regular m×n cobweb with an arbitrary longitude

机译:对具有任意经度的非规则m×n蜘蛛网的递归变换方法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

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 matrix approach are difficult in this case. Looking for the explicit solutions of non-regular lattices is important but difficult, since the non-regular condition is like a wall or trap which affects the behavior of finite network. This paper gives several general formulae of the resistance between any two nodes in a non-regular cobweb network in both finite and infinite cases by the R-T method which, is mainly composed of the characteristic roots, is simpler and can be easier to use in practice. As applications, several interesting results are deduced from a general formula, and a globe network is generalized.
机译:提出了一种通用的递归变换方法,并将其应用于解决具有任意经度(或称径向)的非规则m×con蜘蛛网中两点阻力的难题,这是以前从未解决的在这种情况下,格林函数技术和拉普拉斯矩阵方法很难实现。寻找非规则晶格的显式解很重要但很困难,因为非规则条件就像墙或陷阱一样,会影响有限网络的行为。本文通过RT方法给出了在有限和无限情况下非规则蜘蛛网网络中任意两个节点之间的电阻的一些通用公式,该方法主要由特征根组成,更简单并且在实践中易于使用。 。作为应用,可以从一个通用公式中得出一些有趣的结果,并且可以对一个Globe网络进行概括。

著录项

  • 期刊名称 Scientific Reports
  • 作者

    Zhi-Zhong Tan;

  • 作者单位
  • 年(卷),期 -1(5),-1
  • 年度 -1
  • 页码 11266
  • 总页数 8
  • 原文格式 PDF
  • 正文语种
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号