journal article·2023-09-01Open access

Exact novel formulas and fast algorithm of potential for a hammock resistor network

Yufan Zhou, Xiaoyu Jiang, Yanpeng Zheng, Zhaolin Jiang

AIP Advances· Volume 13· Issue 9

Abstract

The establishment of a resistor network model has become a sharp edge to solve complex scientific problems. In this paper, we introduce Chebyshev polynomials to express the potential formula of the hammock resistor network and improve the general solution of the hammock resistor network. Moreover, through the change in different parameters, special potential formulas are proposed and displayed in 3D dynamic view. A fast algorithm of the calculating potential is given by using the matrix equation model, discrete cosine transform-II, and the fast matrix-vector multiplication. Finally, we show the advantages of our improved potential formula and fast algorithm by the calculation efficiency of the three methods. The modified potential formula and the presented fast algorithm provide a new tool for the field of science and engineering.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Low-power high-performance VLSI design · Matrix Theory and Algorithms · Analog and Mixed-Signal Circuit Design

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

1 School of Information Science and Engineering, Linyi University. Linyi 276000, China

School of Automation and Electrical Engineering, Linyi University 2 , Linyi 276000, China

School of Mathematics and Statistics, Linyi University 3 , Linyi 276000, China

Funding

National Natural Science Foundation of China · Natural Science Foundation of Shandong Province

References (47)

Show source-provided references
1. Commun. Theor. Phys. · 2018 · 69 · 61010.1088/0253-6102/69/5/610 ↗
2. Nat. Phys. · 2018 · 14 · 92510.1038/s41567-018-0246-1 ↗
3. Nat. Electron. · 2018 · 1 · 17810.1038/s41928-018-0042-z ↗
4. Compos. Struct. · 2021 · 276 · 11458710.1016/j.compstruct.2021.114587 ↗
5. Ann. Phys. Chem. · 1847 · 148 · 49710.1002/andp.18471481202 ↗
6. Am. J. Phys. · 2000 · 68 · 89610.1119/1.1285881 ↗
7. Chin. J. Phys. · 2015 · 53 · 04070310.48550/arXiv.1401.4463 ↗
8. Ann. Phys. · 2014 · 341 · 5610.1016/j.aop.2013.11.012 ↗
9. Sci. Rep. · 2022 · 12 · 2126010.1038/s41598-022-25724-y ↗
10. Phys. Rev. E. · 2023 · 107 · 04412310.1103/physreve.107.044123 ↗
11. Res. Phys. · 2022 · 33 · 10516010.1016/j.rinp.2021.105160 ↗
12. Int. J. Circuit Theory Appl. · 2022 · 50 · 13510.1002/cta.3167 ↗
13. Res. Phys. · 2022 · 39 · 10577210.1016/j.rinp.2022.105772 ↗
14. Neurocomputing · 2017 · 223 · 7710.1016/j.neucom.2016.10.034 ↗
15. Neurocomputing · 2020 · 418 · 22110.1016/j.neucom.2020.08.026 ↗
16. Automatica · 2022 · 135 · 10999810.1016/j.automatica.2021.109998 ↗
17. IEEE Trans. Neural Networks Learn. · 2023 · 34 · 495710.1109/TNNLS.2021.3126114 ↗
18. IEEE Trans. Neural Networks Learn. Systems · 2022 · 33 · 58710.1109/tnnls.2020.3028136 ↗
19. IEEE Trans. Neural Networks Learn. · 2023 · 34 · 278110.1109/TNNLS.2021.3108050 ↗
20. Eng. Appl. Artif. Intell. · 2021 · 103 · 10430610.1016/j.engappai.2021.104306 ↗
21. Expert Syst. Appl. · 2022 · 192 · 11627210.1016/j.eswa.2021.116272 ↗
22. IEEE Trans. Autom. Sci. Eng. · 2022 · 19 · 357510.1109/tase.2021.3126385 ↗
23. IEEE Trans. Ind. Electron. · 2016 · 63 · 697810.1109/tie.2016.2590379 ↗
24. IEEE/CAA J. Autom. Sin. · 2022 · 9 · 85410.1109/jas.2022.105446 ↗
25. J. Phys. A: Math. Theor. · 2013 · 46 · 19520210.1088/1751-8113/46/19/195202 ↗
26. Phys. Rev. E. · 2014 · 90 · 01213010.1103/physreve.90.012130 ↗
27. Phys. Rev. E. · 2014 · 90 · 03213010.1103/physreve.90.032130 ↗
28. Chin. Phys. B · 2017 · 26 · 09050310.1088/1674-1056/26/9/090503 ↗
29. Sci. Rep. · 2018 · 8 · 579810.1038/s41598-018-24164-x ↗
30. Chin. Phys. B · 2020 · 29 · 08050310.1088/1674-1056/ab96a7 ↗
31. Chin. Phys. B · 2016 · 25 · 05050410.1088/1674-1056/25/5/050504 ↗
32. Phys. Scr. · 2021 · 96 · 07520210.1088/1402-4896/abf67d ↗
33. Commun. Theor. Phys. · 2020 · 72 · 05500110.1088/1572-9494/ab7702 ↗
34. Comput. Appl. Math. · 2020 · 39 · 110.1007/s40314-020-01171-1 ↗
35. J. Appl. Anal. Comput. · 2020 · 10 · 159910.11948/20190287 ↗
36. Spec. Matrices · 2020 · 8 · 13110.1515/spma-2020-0012 ↗
37. J. Appl. Math. Comput. · 2022 · 68 · 62310.1007/s12190-021-01532-x ↗
38. Numer. Algorithms · 2020 · 83 · 14910.1007/s11075-019-00675-0 ↗
39. J. Appl. Anal. Comput. · 2020 · 10 · 17810.11948/20190105 ↗
40. Appl. Math. Lett. · 2018 · 75 · 7410.1016/j.aml.2017.06.016 ↗
41. 2002
42. Port. Math. · 1996 · 53 · 143
43. Commu. Algebra · 2018 · 46 · 374510.1080/00927872.2018.1424866 ↗
44. IEEE Trans. Signal Process. · 1995 · 43 · 263110.1109/78.482113 ↗
45. Siam. Rev. · 1999 · 41 · 13510.1137/s0036144598336745 ↗
46. Comput. Appl. Math. · 2019 · 38 · 110.48550/arXiv.1806.05652 ↗
47. IEEE Int. Conf. Acoust. Speech Signal Process. · 1985 · 10 · 77610.1109/ICASSP.1985.1168246 ↗