Abstract
Resistor network is widely used. Many potential formulae of resistor networks have been solved accurately, but the scale of data is limited by manual calculation, and numerical simulation has become the trend of large-scale operation. This paper improves the general solution of potential formula for an \(m\times n\) globe network. Chebyshev polynomials are introduced to represent new potential formula of a globe network. Compared with the original potential formula, it saves time to calculate the potential. In addition, an algorithm for computing potential by the famous second type of discrete cosine transform (DCT-II) is also proposed. It is the first time to be used for machine calculation. Moreover, it greatly increases the efficiency of computing potential. In the application of this new potential formula, the equivalent resistance formulae in special cases are given and displayed by three-dimensional dynamic view. The new potential formulae and the proposed fast algorithm realize large-scale operation for resistor networks.
Similar content being viewed by others
Introduction
With the development of natural science, people have encountered various new problems. According to the complexity of the problem, solutions emerge in endlessly. Researches show that a host of problems can be solved by establishing resistor network model1,2,3,4,5,6,7,8,9,10 and neural network model11,12,13,14,15,16,17. In the past few years, many results have been achieved in the study of resistor networks. For example, the establishment of graph theory, the researches on Laplacian matrix (LM) method of resistor network, infinite network, finite network, and corner-to-corner resistance and so on7,8,9,10,18,19,20,21,22,23,24,25,26,27,28,29,30,31. Shi11,12 et al. studied a novel discrete-time recurrent neural network. Liu13 et al. and Sun14 et al. proposed different types of the zeroing neural network. And Jin15,16,17 et al. studied an innovative control theory stimulated gradient neural network algorithm.
In recent years, Tan32,33,34,35,36,37,38,39,40,41,42,43 proposed the Recursion-Transform (RT) method which is different from the Laplacian matrix method. It only depends on one matrix and one direction, and the calculation is simpler. In 2013, Tan32 studied the problem of two-point resistance on cobweb with a 2r boundary, which has never been solved before. Under finite and infinite conditions, the \(m \times n\) cobweb general formula of resistance between any two nodes is proposed. In 2014, Tan36,38 made a new breakthrough and introduced the equivalent resistance of the globe network and fan network model by RT method. Shortly after that many researches on resistor networks are based on RT method. RT method needs eigenvalues of a tridiagonal matrix to represent the potential formula. At present, there have been many results on tridiagonal matrices45,46,47,48,49,50,51, which are also widely used. It can be said that it is a powerful tool to solve the resistor network33,34,35,36,37,38,39,40,41,42,43.
In 2018, Tan44 proposed an \(m \times n\) globe network, as shown in Fig. 1. The resistances in the latitude and longitude directions are r and \(r_{0}\), respectively, where m and n are the resistance numbers along the latitude and longitude directions. The nodes of the network are represented by coordinates \(\{x, y\}\). Considering \(O_{0}=0\) as the origin of the coordinate system, the potential of node d(x, y) is \(U_{m\times n}(x , y )\) as shown in Fig. 2. The potential of any node in the \(m\times n\) globe network is as follows
where
New formula of potential represented by Chebyshev polynomials
Since the potential formula (1) contains exponential function operation, it is less efficient to calculate potential of globe resistor networks by computer. The purpose of this section is to give an improved potential formula of the globe network44, i.e. a new formula of potential expressed by Chebyshev polynomial of the second class is given53. it saves time to calculate the potential by computer.
Let the current J from \(d_{1}(x_{1}, y_{1})\) to \(d_{2}(x_{2}, y_{2})\), the potential formula of two nodes in an \(m \times n\) resistor network can be written as
where
In particular, the input and output points can be one or more, so formula (5) applies to all coordinate points \((x_{k}, y_{k})\) \((0\le k \le n)\). Therefore, p can also be \(y_3,\ y_4,\ldots ,\ y_k\).
Suppose that \(O_{0} = 0\), then calculating the node potential between any two points by Ohm’s law can be described as
where \(I_{x}^{(j)}\) is denoted by the current in the vertical direction.
Base on formula (5), using the visualization of data to realize the dynamic visualization of the potential change. With the change of the current input and output point change, the potential change of any two nodes is shown in Fig. 3.
Three terms recurrence sequence and discrete cosine transform
In this section, in order to improve the actual performance and realize the fast algorithm, the three terms recurrence sequence represented by Chebyshev polynomial of the second class and two types of discrete cosine transform are introduced.
The three terms recurrence sequence is defined by the following conditions:
where \(k\in \textbf{N},~~k\ge 2,~~A,B,d,q\in \textbf{C}\), \(\textbf{N}\) is the set of all natural numbers and \(\textbf{C}\) is the set of all complex numbers.
The three terms recurrence sequence52 represented by Chebyshev polynomial of the second class is
where
is the Chebyshev polynomial of the second class53.
Remark
Based on the above formula, how to replace Eqs. (1), (2), (3) and (4) with Eqs. (5), (6), (7) and (9) will be showed, respectively. According to the equation (4), \(\lambda _{j}+\bar{\lambda }_{j}=t_{j}\) and \(\lambda _{j}\cdot \bar{\lambda }_{j}=1\) are obtained . Take it into the equation (11), and a three term recursive formula is obtained
where \(d=t_{j},\ q=1\), \(t_{j}\) and \(F^{(j)}_{k}\) are the same as Eqs. (8) and (3), respectively. By Eq. (14) and formula (12), the replacement result can be obtained
Similarly, Let
where \(Q^{(j)}_{0}=2,\ Q^{(j)}_{1}=t_{j}\). Then the recursive relation of \(Q^{(j)}_{n}\) is obtained as follows
where \(d=t_{j},\ q=1\), \(t_{j}\) and \(Q^{(j)}_{n}\) are the same as Eqs. (8) and (16), respectively. By Eq. (17) and formula (12), the replacement result can be obtained as follows
According to Eqs. (1), (3),(15) and (18), a new potential formula (5) is got.
In order to obtain a fast numerical algorithm for computing the potential, the orthogonal diagonalization of the matrix \(\textbf{B}_m\) is given.
where \(b = r/r_0\).
Then the eigenvalues \(t_1,\ldots ,t_m\) of \(\textbf{B}_{m}\) are given by
and the corresponding eigenvectors \(\zeta ^{(j)}=(\zeta ^{(j)}_1,\ldots ,\zeta ^{(j)}_m)^\dag\) are given by
where \(d_j={\left\{ \begin{array}{ll}1,&j\ne 1,\\ \frac{\sqrt{2}}{2},&j=1.\end{array}\right. }\)
Let
where \(d_j={\left\{ \begin{array}{ll}1,&j\ne 1,\\ \frac{\sqrt{2}}{2},&j=1.\end{array}\right. }\)
Obviously, the matrix \(\mathbb {C}_m^{III}\) is the famous third type of discrete cosine transform (DCT-III)54,55,56,57. \(\mathbb {C}_m^{III}\) is an orthogonal matrix and the inverse of \(\mathbb {C}_m^{III}\) is actually \(\mathbb {C}_m^{II}\), i.e.
where the orthogonal matrix \(\mathbb {C}_m^{II}\) is the famous second type of discrete cosine transform (DCT-II)54,55,56,57.
By calculation we obtain the orthogonal diagonalization of the matrix \(\textbf{B}_{m}\) as follows
i.e.
where \(t_j, j=1,2,\ldots , m\) are given by Eq. (20).
Tan44 used Kirchhoff’s law to analyze the resistor network and to establish the resistor network model. The following general matrix equation is
where \(\textbf{B}_{m}\) is given by Eq. (19), the function \(\delta _{k,x}\) is defined as: \(\delta _{k,x}(x =k) = 1\), \(\delta _{k,x}(x\ne k) = 0\), \(\textbf{I}_{k}\) and \(\textbf{H}_{x}\) are the \(m \times 1\) column matrices, and can be written as
To solve the Eq. (26), using the matrix transformation method to multiply \(\mathbb {C}_m^{III}\) at the same time. Through Eq. (24) and the transformed matrix equation we appoint
where the \(m\times 1\) column matrix \(\textbf{W}_{k}\) is
Based on the Chebyshev polynomial of the second class, the general solution formula of current is rewrited . When \(j = 1\), the following formula is obtained
When \(j\ge 2\), the following formula is obtained
where \(\gamma ^{(j)}_{x_{s},x_{k}}\) is equal to Eq. (6), \(\varsigma _{1,j}= -2\sin (\frac{(j-1)\pi }{2m})\sin (\frac{y_{1}(j-1)\pi }{m})\), and \(\varsigma _{2,j}= 2\sin (\frac{(j-1)\pi }{2m})\sin (\frac{y_{2}(j-1)\pi }{m})\).
Displaying of some special and interesting potential formulae
Since formula (5) is a general potential conclusion of a globe network including all cases, some special conditions in formula (5) and a series of fascinating results under various parameters will be displayed. In the following, assuming that the potential reference at point O(0, 0) is \(U(0, 0) = 0\).
Special 1
Suppose the current J flows in from the origin \(d_{1}(x_{1}, y_{1})\) and out from \(d_{2}(x_{2}, y_{2})=O(0, 0)\), the potential of any two points can be written as
where \(\gamma ^{(j)}_{x_{s},x_{k}} = U^{(j)}_{n-|x_{s}-x_{k}|-1}+U^{(j)}_{|x_{s}-x_{k}|-1}\) is defined in Eq. (6), and \(U^{(j)}_{k}\) is the same as Eq. (9).
When \(m = n = 90,\ J = 10,\ x_{1} = y_{1} = 50,\ x_{2} = y_{2} = 0,\ and \ r_{0}=r=1,\) the following formula is obtained
where
And a 3D dynamic view is shown in Fig. 4 by Matlab.
Special 2
Consider an arbitrary \(m \times n\) globe network as shown in Fig. (1). Assume the electric current J outflow the network from the pole \(d_{2}(x_{2}, y_{2})\), and the current J input at the node \(d_{1}(x_{1}, y_{1})=O(0, 0)\), the potential of an arbitrary node d(x, y) can be written as
where \(\gamma ^{(j)}_{x_{s},x_{k}}\) is defined in Eq. (6), and \(U^{(j)}_{k}\) is the same as Eq. (9).
In the network with \(m = 90\) and \(n = 90\), the current flows in from \((x_{1},y_{1})(x_{1} =0,y_{1} = 0)\) and out from \((x_{2},y_{2})(x_{2} =30,y_{2} = 30)\). Let \(r_{0} = r = 1\) and \(J = 10\), the formula is deduced.
where
\(t_{j}\) and \(U^{(j)}_{k}\) are the same as Eqs. (35) and (37), respectively, \(k=89-|30-x|,~|30-x|-1,~89,~88,~~j=1,2,\ldots ,90.\) And a 3D dynamic view is shown in Fig. 5 by Matlab.
Special 3
Presume that when the current J is injected at node \(d_{1}(x_{1}, y_{1})\) and withdrawn at node \(d_{2}(x_{2}, y_{2})(x_{2}=y_{1},y_{2}=x_{1})\), the potential of any node d(x, y) is
where \(t_{j}\) is defined in Eq. (8), and \(U^{(j)}_{k}\) is the same as Eq. (9).
In the scale of \(m \times n (90\times 90)\), we get \(J = 10,\ x_{1} = y_{2}= 0,\ x_{2}=y_{1} = 30, \ and \ r_{0}=r=1,\) the following formula is
where \(t_{j}\) and \(U^{(j)}_{k}\) are the same as Eq. (35) and Eq. (37), respectively, and \(k=90-x,~x,~89,~88,~~j=1,2,\ldots ,90.\)
And a 3D dynamic view is shown in Fig. 6 by Matlab.
Special 4
When we inject current J at node \(d_{1}(x_{1}, y_{1})\) and exit the current J at node \(d_{2}(x_{1}, y_{2})(x_{2} = x_{1})\), the potential of an arbitrary node d(x, y) is
where \(C_{k,j}\), \(U^{(j)}_{k}\) and \(\gamma ^{(j)}_{x_{1},x}\) are equal to Eqs. (7), (9) and Eq. (6), respectively.
When \(m = n = 90,\ J = 10,\ x_{1} = x_{2} = y_{1} = 50,\ y_{2} = 30,\ and \ r_{0}=r=1,\) the following formula is obtained
where
\(t_{j}\), \(U^{(j)}_{k}\) and \(\gamma ^{(j)}_{50,x}\) are the same as Eq. (35), Eq. (37)(\(k=~89,~88,~~j=1,2,\ldots ,90\)) and Eq. (36), respectively.
And a 3D dynamic view is shown in Fig. 7 by Matlab.
Special 5
When the current J enters from node \(d_{1}(x_{1}, y_{1})\) to node \(d_{2}(x_{2}, y_{1})\), in other words, \(y_{1} = y_{2}\). From Eq. (5), the potential of any node d(x, y) can be written as
where \(\gamma ^{(j)}_{x_{s},x_{k}}\), \(U^{(j)}_{k}\) and \(C_{k,j}\) are equal to Eq. (6), Eq. (9) and Eq. (7), respectively.
When \(m = n = 90,\ J = 10,\ y_{1} = y_{2} = x_{1} = 50,\ x_{2} = 30,\ and \ r_{0}=r=1,\) the following formula is obtained
where \(\gamma ^{(j)}_{50,x}\), \(\gamma ^{(j)}_{30,x}\), \(C_{50,j}\), \(t_{j}\) and \(U^{(j)}_{k}\) are the same as Eq. (36), Eq. (40), Eq. (45), Eq. (35) and Eq. (37), respectively, \(k=89-|50-x|,~|50-x|-1,89-|30-x|,~|30-x|-1,~89,~88,~~j=1,2,\ldots ,90.\) And a 3D dynamic view is shown in Fig. 8 by Matlab.
Special 6
Presuming that \(d_{k}(x_{k}, y_{1}) (k = 1, 2, \ldots k)\) entering the node at the same latitude is J/k and the current flowing out from O(0, 0) is J, the potential equation is obtained.
where \(C_{k,j}\), \(\gamma ^{(j)}_{x_{s},x_{k}}\) and \(U^{(j)}_{k}\) are equal to Eq. (7), Eq. (6) and Eq. (9), respectively.
When \(m = n = 90,\ J = 10,\ y_{1} = y_{2} = x_{1} = 50,\ x_{2} = 30,\ x_{3} = 40,\) \(r_{0}=r=1,\ and \ k=3\) the following formula is obtained
where \(C_{50,j}\), \(t_{j}\), \(\gamma ^{(j)}_{50,x}\), \(\gamma ^{(j)}_{30,x}\) and \(U^{(j)}_{k}\) is defined in Eq. (45), Eq. (35), Eq. (36), Eq. (40) and Eq. (37)\((k=89-|50-x|,~|50-x|-1,89-|40-x|,~|40-x|-1,89-|30-x|,~|30-x|-1,~89,~88,~~j=1,2,\ldots ,90)\), respectively.
And a 3D dynamic view is shown in Fig. 9 by Matlab.
Fast numerical algorithm for computing potential
In order to realize fast calculation of potential for large-scale resistor networks. In this section, by summarizing the previous discussion and analysis, a fast numerical algorithm of computing potential by the Eqs. (8), (9), (10), (26), (27), (28), (29), (30), (31), (32) and the famous second type of discrete cosine transform (DCT-II) are given.
As is well known, the complexity of tridiagonal matrix-vector multiplication is O(n), which is the same as Algorithm 1. Moreover, one DCT-II needs \(2n\log _2 n+ O(n)\) real arithmetic operations57,58. So the complexity of Algorithm 2 is \(4n\log _2 n+ O(n)\) consist of two DCT-II and Algorithm 1.
According to the above two algorithms, two examples are used to vividly show the computational efficiency for the large scale globe resistor networks.
Example 1
In the network with \(m = 1000\) and \(n = 10\), the current flows in from \((x_{1},y_{1})(x_{1} =3,y_{1} = 200)\) and out from \((x_{2},y_{2})(x_{2} =5,y_{2} = 300)\), \(r = 1,~~r_{0} = 100\), and \(J = 10\). The results calculated using Algorithm 2 are shown in Fig. 10.
Example 2
In the scale of \(m \times n (300\times 10)\), when the current \(x_{1} =3,\ x_{2} = 5,\ y_{1} =100,\ y_{2} = 200\), and \(r=1, r_{0}=100\). The results calculated using Algorithm 2 are shown in Fig. 11.
Conclusions
This paper achieved a series of improved exact potential formulae in an \(m \times n\) globe network by the RT-I method. Chebyshev polynomial of the second kind is introduced to improve the potential formula of the globe network44. Some applications of the new potential formula of the globe network are presented, such as some special and interesting potential formulae are given in Eqs. (33), (38), (41), (43), (46) and (48), respectively. The image numerical simulation using matlab has produced many interesting 3D dynamic views. Finally, we also put forward a fast numerical algorithm by the famous second type of discrete cosine transform, which can realize fast calculation of potential for large-scale resistor networks. Furthermore, by using our research ideas of resistor network, we can also explore neural networks11,12,13,14,15,16,17. That will be our next step.
Data availability
All data generated or analysed during this study are included in this article [and its supplementary information files].
References
Hadad, Y., Soric, J. C., Khanikaev, A. B. & Alù, A. Self-induced topological protection in nonlinear circuit arrays. Nat. Electron. 1, 178–182 (2018).
Zhang, D. et al. Impact damage localization and mode identification of CFRPs panels using an electric resistance change method. Compos. Struct. 276, 114587 (2021).
Kirchhoff, G. Ueber die Aufölsung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. 148, 497–508 (1847).
Winstead, V. & Demarco, C. L. Network essentiality. IEEE T. Circuits-I. 60(3), 703–709 (2012).
Ferri, G. & Antonini, G. Ladder-network-based model for interconnects and transmission lines time delay and cutoff frequency determination. J. Circuit. Syst. Comp. 16, 489–505 (2007).
Owaidat, M. Q., Hijjawi, R. S. & Khalifeh, J. M. Network with two extra interstitial resistors. Int. J. Theor. Phys. 51, 3152–3159 (2012).
Kirkpatrick, S. Percolation and conduction. Rev. Mod. Phys. 45, 497–508 (1973).
Katsura, S. & Inawashiro, S. Lattice Green’s functions for the rectangular and the square lattices at arbitrary points. J. Math. Phys. 12, 1622 (1971).
Pennetta, C. et al. Biased resistor network model for electromigration failure and related phenomena in metallic lines. Phys. Rev. B. 70, 174305 (2004).
Kook, W. Combinatorial Green’s function of a graph and applications to networks. Adv. Appl. Math. 46, 417–423 (2011).
Shi, Y. et al. Novel discrete-time recurrent neural networks handling discrete-form time-variant multi-augmented Sylvester matrix problems and manipulator application. IEEE T. Neur. Net. Lear. 33(2), 587–599 (2022).
Shi, Y., Zhao, W.-H., Li, S., Li, B. & Sun, X.-B. Novel discrete-time recurrent neural network for robot manipulator: A direct discretization technical route. IEEE T. Neur. Net. Lear.https://doi.org/10.1109/TNNLS.2021.3108050 (2021).
Liu, K.-P. et al. Five-step discrete-time noise-tolerant zeroing neural network model for time-varying matrix inversion with application to manipulator motion generation. Eng. Appl. Artif. Intel. 103, 104306 (2021).
Sun, Z.-B. et al. Noise-suppressing zeroing neural network for online solving time-varying matrix square roots problems: A control-theoretic approach. Expert. Syst. Appl. 192, 116272 (2022).
Jin, L., Qi, Y.-M., Luo, X., Li, S. & Shang, M.-S. Distributed competition of multi-robot coordination under variable and switching topologies. IEEE T. Autom. Sci. Eng. 19(4), 3575–3586 (2022).
Jin, L., Zhang, Y.-N., Li, S. & Zhang, Y.-Y. Modified ZNN for time-varying quadratic programming with inherent tolerance to noises and its application to kinematic redundancy resolution of robot manipulators. IEEE T. Ind. Electron. 63(11), 6978–6988 (2016).
Jin, L., Zheng, X. & Luo, X. Neural dynamics for distributed collaborative control of manipulators with time delays. IEEE-CAA J. Autom. 9(5), 854–863 (2022).
Klein, D. J. & Randić, M. Resistance distance. J. Math. Chem. 12, 81–95 (1993).
Cserti, J. Application of the lattice Green’s function for calculating the resistance of an infinite network of resistors. Am. J. Phys. 68, 896–906 (2000).
Giordano, S. Disordered lattice networks: General theory and simulations. Int. J. Circ. Theor. App. 33, 519–540 (2005).
Wu, F. Y. Theory of resistor networks: The two-point resistance. J. Phys. A Math. Gen. 37, 6653 (2004).
Tzeng, W. J. & Wu, F. Y. Theory of impedance networks: The two-point impedance and LC resonances. J. Phys. A Math. Gen. 39, 8579 (2006).
Essam, J. W. & Wu, F. Y. The exact evaluation of the corner-to-corner resistance of an \(M \times N\) resistor network: Asymptotic expansion. J. Phys. A Math. Theor. 42, 025205 (2008).
Izmailian, N. S. & Huang, M.-C. Asymptotic expansion for the resistance between two maximum separated nodes on an \(M\) by \(N\) resistor network. Phys. Rev. E. 82, 011125 (2010).
Lai, M.-C. & Wang, W.-C. Fast direct solvers for Poisson equation on 2D polar and spherical geometries. Numer. Meth. Part. D. E. 18, 56–68 (2002).
Borges, L. & Daripa, P. A fast parallel algorithm for the Poisson equation on a disk. J. Comput. Phys. 169, 151–192 (2001).
Izmailian, N. S., Kenna, R. & Wu, F. Y. The two-point resistance of a resistor network: A new formulation and application to the cobweb network. J. Phys. A Math. Theor. 47, 035003 (2014).
Izmailian, N. S. & Kenna, R. A generalised formulation of the Laplacian approach to resistor networks. J. Stat. Mech : Theor. E. 9, 1742–5468 (2014).
Izmailian, N. S. & Kenna, R. The two-point resistance of fan networks. Chin. J. Phys. 53(2), 040703 (2015).
Chair, N. Trigonometrical sums connected with the chiral Potts model, verlinde dimension formula, two-dimensional resistor network, and number theory. Ann. Phys. 341, 56–76 (2014).
Chair, N. The effective resistance of the N-cycle graph with four nearest neighbors. J. Stat. Phys. 154, 1177–1190 (2014).
Tan, Z.-Z., Zhou, L. & Yang, J.-H. The equivalent resistance of a \(2\times n\) cobweb network and its conjecture of an \(m \times n\) cobweb network. J. Phys. A Math. Theor. 46(19), 195202 (2013).
Tan, Z.-Z. Recursion-transform approach to compute the resistance of a resistor network with an arbitrary boundary. Chin. Phys. B. 24(2), 020503 (2015).
Tan, Z.-Z. Recursion-transform method for computing resistance of the complex resistor network with three arbitrary boundaries. Phys. Rev. E. 91(5), 052122 (2015).
Tan, Z.-Z. Recursion-transform method to a non-regular \(m\times n\) cobweb with an arbitrary longitude. Sci. Rep. 5, 11266 (2015).
Tan, Z.-Z., Essam, J. W. & Wu, F. Y. Two-point resistance of a resistor network embedded on a globe. Phys. Rev. E. 90(1), 012130 (2014).
Essam, J. W., Tan, Z.-Z. & Wu, F. Y. Resistance between two nodes in general position on an \(m\times n\) fan network. Phys. Rev. E. 90(3), 032130 (2014).
Tan, Z.-Z. & Fang, J.-H. Two-point resistance of a cobweb network with a \(2r\) boundary. Commun. Theor. Phys. 63(1), 36–44 (2015).
Tan, Z.-Z. Theory on resistance of \(m\times n\) cobweb network and its application. Int. J. Circ. Theor. Appl. 43(11), 1687–1702 (2015).
Tan, Z.-Z. Two-point resistance of a non-regular cylindrical network with a zero resistor axis and two arbitrary boundaries. Commun. Theor. Phys. 67(3), 280–288 (2017).
Tan, Z.-Z. Two-point resistance of an \(m\times n\) resistor network with an arbitrary boundary and its application in RLC network. Chin. Phys. B. 25(5), 050504 (2016).
Tan, Z.-Z. Recursion-transform method and potential formulae of the \(m\times n\) cobweb and fan networks. Chin. Phys. B. 26(9), 090503 (2017).
Tan, Z., Tan, Z.-Z. & Chen, J. Potential formula of the nonregular \(m\times n\) fan network and its application. Sci. Rep. 8, 5798 (2018).
Tan, Z. & Tan, Z.-Z. Potential formula of an \(m\times n\) globe network and its application. Sci. Rep. 8(1), 9937 (2018).
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Properties of a class of perturbed Toeplitz periodic tridiagonal matrices. Comp. Appl. Math. 39, 1–19 (2020).
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Inverses and eigenpairs of tridiagonal Toeplitz matrix with opposite-bordered rows. J. Appl. Anal. Comput. 10(4), 1599–1613 (2020).
Fu, Y.-R., Jiang, X.-Y., Jiang, Z.-L. & Jhang, S. Analytic determinants and inverses of Toeplitz and Hankel tridiagonal matrices with perturbed columns. Spec. Matrices. 8, 131–143 (2020).
Wei, Y.-L., Zheng, Y.-P., Jiang, Z.-L. & Shon, S. The inverses and eigenpairs of tridiagonal Toeplitz matrices with perturbed rows. J. Appl. Math. Comput. 68, 623–636 (2022).
Wei, Y.-L., Jiang, X.-Y., Jiang, Z.-L. & Shon, S. On inverses and eigenpairs of periodic tridiagonal Toeplitz matrices with perturbed corners. J. Appl. Anal. Comput. 10(1), 178–191 (2020).
Wei, Y.-L., Zheng, Y.-P., Jiang, Z.-L. & Shon, S. A study of determinants and inverses for periodic tridiagonal Toeplitz matrices with perturbed corners involving Mersenne numbers. Mathematics 7(10), 893 (2019).
Wei, Y.-L., Jiang, X.-Y., Jiang, Z.-L. & Shon, S. Determinants and inverses of perturbed periodic tridiagonal Toeplitz matrices. Adv. Differ. Equ. 2019(1), 410 (2019).
Udrea, G. A note on the sequence \((W_n)_{n\ge 0}\) of A.F. Horadam. Port. Math. 53, 143–156 (1996).
Mason, J. C. & Handscomb, D. C. Chebyshev Polynomials (Chapman and Hall/CRC, Boca Raton, 2002).
Garcia, S. R. & Yih, S. Supercharacters and the discrete Fourier, cosine, and sine transforms. Commun. Algebra. 46(9), 3745–3765 (2018).
Sanchez, V., Garcia, P., Peinado, A. M., Segura, J. C. & Rubio, A. J. Diagonalizing properties of the discrete cosine transforms. IEEE T. Signal. Process. 43(11), 2631–2641 (1995).
Strang, G. The discrete cosine transform. SIAM. Rev. 41(1), 135–147 (1999).
Liu, Z., Chen, S., Xu, W. & Zhang, Y. The eigen-structures of real (skew) circulant matrices with some applications. Comput. Appl. Math. 38, 178 (2019).
Yip, P. C. & Rao, K. R. DIF algorithms for DCT and DST. IEEE Int. Conf. Acoust. Speech. Signal Process.https://doi.org/10.1109/ICASSP.1985.1168246 (1985).
Acknowledgements
The research was Supported by the National Natural Science Foundation of China (Grant No. 12001257), the Natural Science Foundation of Shandong Province (Grant No. ZR2020QA035).
Author information
Authors and Affiliations
Contributions
Y.-P.Z. and X.-Y.J. conceived the project, performed and analyzed formulae calculations. Y.-F.Z. validated the correctness of the calculations. Z.-L.J. present the fast algorithm for solving the matrix equation. All authors contributed equally to the manuscript.
Corresponding authors
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher's note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Zhou, Y., Zheng, Y., Jiang, X. et al. Fast algorithm and new potential formula represented by Chebyshev polynomials for an \(m\times n\) globe network. Sci Rep 12, 21260 (2022). https://doi.org/10.1038/s41598-022-25724-y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s41598-022-25724-y
This article is cited by
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.