Please use this identifier to cite or link to this item:
https://scholar.ptuk.edu.ps/handle/123456789/261
cc-by
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Asad, J. H | - |
dc.contributor.author | Hijjawi, R. S | - |
dc.contributor.author | Sakaji, A. J | - |
dc.contributor.author | Khalifeh, J. M | - |
dc.date.accessioned | 2019-04-17T10:21:37Z | - |
dc.date.available | 2019-04-17T10:21:37Z | - |
dc.date.issued | 2007-12 | - |
dc.identifier.issn | 12860042 | - |
dc.identifier.uri | https://scholar.ptuk.edu.ps/handle/123456789/261 | - |
dc.description.abstract | The capacitance between any two arbitrary lattice sites of an infinite square network consisting of identical capacitors is studied analytically and numerically for a perturbed network. The perturbation is as a result of removing the bonds and from the perfect network. The equivalent capacitance is expressed in terms of the Lattice Green's Function (LGF) of the perturbed network. Solving Dyson's equation we express the LGF and the capacitance of the perturbed network in terms of those of the infinite perfect network. The asymptotic behavior of the perturbed capacitance is also studied. Finally, some numerical results are presented for the perturbed infinite square lattice, and a comparison is carried out for those of the perturbed and perfect infinite square network | en_US |
dc.language.iso | en | en_US |
dc.publisher | EDP Sciences | en_US |
dc.subject | Finite-difference methods | en_US |
dc.subject | Lattice theory and statistics | en_US |
dc.subject | Defects and impurities in crystals | en_US |
dc.subject | microstructure | en_US |
dc.title | Infinite 2D square network of identical capacitors with two missing bonds | en_US |
dc.type | Article | en_US |
Appears in Collections: | Applied science faculty |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
10- Infinite 2D squre network with two missing bonds-journal copy.pdf | 184.79 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.