
This work proposes a new scheme under the umbrella of iteration methods to compute the sign of an invertible matrix. To this target, a review of the exiting solvers of the same type is given and then a new scheme is derived based on a multi-step Newton-type nonlinear equation solver. It is shown that the new method and its reciprocal converge globally with wider convergence radii in contrast to their competitors of the same order from the general Padé schemes. After investigation on the theoretical parts, numerical experiments based on complex matrices of various sizes are furnished to reveal the superiority of the proposed solver in terms of elapsed CPU time.
Citation: Malik Zaka Ullah, Sultan Muaysh Alaslani, Fouad Othman Mallawi, Fayyaz Ahmad, Stanford Shateyi, Mir Asma. A fast and efficient Newton-type iterative scheme to find the sign of a matrix[J]. AIMS Mathematics, 2023, 8(8): 19264-19274. doi: 10.3934/math.2023982
[1] | Da Shi, Ghulam Farid, Abd Elmotaleb A. M. A. Elamin, Wajida Akram, Abdullah A. Alahmari, B. A. Younis . Generalizations of some q-integral inequalities of Hölder, Ostrowski and Grüss type. AIMS Mathematics, 2023, 8(10): 23459-23471. doi: 10.3934/math.20231192 |
[2] | M. Emin Özdemir, Saad I. Butt, Bahtiyar Bayraktar, Jamshed Nasir . Several integral inequalities for (α, s,m)-convex functions. AIMS Mathematics, 2020, 5(4): 3906-3921. doi: 10.3934/math.2020253 |
[3] | Muhammad Amer Latif, Mehmet Kunt, Sever Silvestru Dragomir, İmdat İşcan . Post-quantum trapezoid type inequalities. AIMS Mathematics, 2020, 5(4): 4011-4026. doi: 10.3934/math.2020258 |
[4] | Shuang-Shuang Zhou, Saima Rashid, Muhammad Aslam Noor, Khalida Inayat Noor, Farhat Safdar, Yu-Ming Chu . New Hermite-Hadamard type inequalities for exponentially convex functions and applications. AIMS Mathematics, 2020, 5(6): 6874-6901. doi: 10.3934/math.2020441 |
[5] | Humaira Kalsoom, Muhammad Amer Latif, Muhammad Idrees, Muhammad Arif, Zabidin Salleh . Quantum Hermite-Hadamard type inequalities for generalized strongly preinvex functions. AIMS Mathematics, 2021, 6(12): 13291-13310. doi: 10.3934/math.2021769 |
[6] | Attazar Bakht, Matloob Anwar . Ostrowski and Hermite-Hadamard type inequalities via (α−s) exponential type convex functions with applications. AIMS Mathematics, 2024, 9(10): 28130-28149. doi: 10.3934/math.20241364 |
[7] | Hong Yang, Shahid Qaisar, Arslan Munir, Muhammad Naeem . New inequalities via Caputo-Fabrizio integral operator with applications. AIMS Mathematics, 2023, 8(8): 19391-19412. doi: 10.3934/math.2023989 |
[8] | Soubhagya Kumar Sahoo, Fahd Jarad, Bibhakar Kodamasingh, Artion Kashuri . Hermite-Hadamard type inclusions via generalized Atangana-Baleanu fractional operator with application. AIMS Mathematics, 2022, 7(7): 12303-12321. doi: 10.3934/math.2022683 |
[9] | Haoliang Fu, Muhammad Shoaib Saleem, Waqas Nazeer, Mamoona Ghafoor, Peigen Li . On Hermite-Hadamard type inequalities for n-polynomial convex stochastic processes. AIMS Mathematics, 2021, 6(6): 6322-6339. doi: 10.3934/math.2021371 |
[10] | Saad Ihsan Butt, Erhan Set, Saba Yousaf, Thabet Abdeljawad, Wasfi Shatanawi . Generalized integral inequalities for ABK-fractional integral operators. AIMS Mathematics, 2021, 6(9): 10164-10191. doi: 10.3934/math.2021589 |
This work proposes a new scheme under the umbrella of iteration methods to compute the sign of an invertible matrix. To this target, a review of the exiting solvers of the same type is given and then a new scheme is derived based on a multi-step Newton-type nonlinear equation solver. It is shown that the new method and its reciprocal converge globally with wider convergence radii in contrast to their competitors of the same order from the general Padé schemes. After investigation on the theoretical parts, numerical experiments based on complex matrices of various sizes are furnished to reveal the superiority of the proposed solver in terms of elapsed CPU time.
It is known to all that Lurie systems consist of a linear dynamical system and a nonlinear part with the sector bounded constrains, which can be used to model many nonlinear dynamical systems such as Chua's circuit [1], Hopfield neural networks [2], cellular neural networks [3] and hyperchaotic attractors [4], and so on. Thus, the Lurie systems have attracted much attention of researchers in the field of physical and natural science. For example, by using an extended integral inequality, the convex combination theorem and S-procedure, Tang et al. investigated the cluster synchronization of complex dynamical networks consisting of identical or nonidentical Lurie systems and designed some adaptive updating laws in [5]. Qin et al. investigated the problem of the global exponential stability of a class of uncertain neural networks with discontinuous Lurie-type activation and mixed delays and presented some stability conditions by using the Leray-Schauder alternative theorem in [6].
In recent years, master-slave synchronization has attracted some researchers attention for its broad applications and there exist lots of literatures such as [7,8,9,10,11,12,13,14]. Master-slave synchronization means that the state of master system follows with the state of slave system along with the time development. In some practical plants, because the state of the master systems can not be measured directly for technical limitations or too cost, we can use its measurement output to design a slave system that the structure is same with the master system. So, one can use the state of slave system to replace the state of master system. Viewed from the used methods of solving this problem, there include adaptive control [7], PID control [9], output feedback control [10], impulsive control [11,12], and so on. There exist many work to study the master-slave synchronization of the Lurie systems so far. For example, Chen et al. investigated the master-slave synchronization of chaotic Lurie systems with sampled-data control based on a novel construction of piecewise differentiable Lyapunov functionals in [15]. By using the Lyapunov stability theory, Ji et al. considered the synchronization problem for Lurie systems with sector and slope restricted nonlinearities in [16]. For the master-slave Lurie systems with constant time delay, Guo et al. presented some synchronization criteria and designed a PD controller by using the integral inequality method in [17].
In addition, event-triggered control, as one of the effective control methods, has been deeply studied. Event-triggered controller is updated only if some predefined triggering criteria are activated. Compared with the time-triggered controller, the event-triggered controller can reduce the number of the sampling and decrease the computation complexity. Some related works can be found in [18,19,20,21,22,23,24,25,26]. For instance, Su et al. studied the problem of sliding mode control for discrete-time switched systems via an event-triggered strategy by using a time-delay system design method in [18]. By using the multiple Lyapunov functional method, Xiao et al. considered the event-triggered control problem for continuous-time switched linear systems in [19]. Liu et al. discussed the event-triggered synchronization in fixed time for semi-Markov switching dynamical complex networks with multiple weights and discontinuous nonlinearity by applying Lyapunov functional method and inequality analysis technique in [21]. In [22], Wang et al. investigated the Lyapunov stability for general nonlinear systems by means of the event-triggered impulsive control by using the impulsive control theory.
Motivated by the above discussion, in this paper, we intend to investigate the master-slave synchronization of Lurie systems based on the event-triggered control. The main contributions are as follows: (1) The considered master-slave systems are the Lurie systems, and the related results by using the event-triggered control are less. (2) Provide a predefined event-triggering condition and prove that this condition is not commonplace. (3) Some synchronization control criteria are presented. Moreover, the control gains can be easily found in terms of linear matrix inequalities.
The rest of this paper is organized as follows. In section 2, model description and preliminary results are presented. In section 3, The event-triggered conditions and feasibility are derived. In section 4, a numerical example is provided to illustrate the effectiveness of the obtained method. Finally, this paper is ended with a conclusion in section 5.
Throughout this paper, the following notations are used. Rn and Rn×m, respectively, denote the n-dimensional Euclidean space and the set of n×m real matrices. For a n-dimensional vector x=(x1,x2,...,xn)T∈Rn, ||x||=√∑ni=1x2i denotes its norms. The notation X≥Y(respectively, X>Y), where X,Y are symmetric matrices, means that X−Y is a symmetric semi-definite matrix(respectively, positive definite matrix). For a given matrix A∈Rn×n, AT denotes its transpose. λmax(A) and λmin(A) denote its maximum and minimum eigenvalues, respectively, whose norm is defined as ||A||=√λmax(ATA).
In this paper, we consider the following master-slave systems composed of Lurie systems
Master:{˙x(t)=Ax(t)+Bx(t−τ)+Cσ(Dx(t))x(t)=φ(t),t∈[0,τ] | (2.1) |
and
Slave:{˙ˆx(t)=Aˆx(t)+Bˆx(t−τ)+Cσ(Dˆx(t))+u(t)ˆx(t)=ψ(t),t∈[0,τ], | (2.2) |
where x(t)=(x1(t),x2(t),...,xn(t))T and ˆx(t)=(ˆx1(t),ˆx2(t),...,ˆxn(t))T denote the state vectors, respectively. A∈Rn×n,B∈Rn×n,C∈Rn×m,D∈Rm×n are some known constant real matrices. σ(⋅)=(σ1(⋅),σ2(⋅),...,σm(⋅))T:Rm→Rm is a nonlinear function. The initial conditions φ(t)∈Rn and ψ(t)∈Rn are continuous functions. u(t)∈Rn is the control input to be designed. τ>0 is a known constant and denotes the transmission time delay.
Definition 1. Master system (2.1) and slave system (2.2) are said to be asymptotic synchronization if
limt→∞||x(t)−ˆx(t)||=0 |
for any initial conditions.
In what follows, we intend to design the following state feedback controller
u(t)=K(x(tk)−ˆx(tk)),∀t∈[tk,tk+1), | (2.3) |
such that master system (2.1) synchronizes with slave system (2.2), where K∈Rn×n is the control gain to be determined, t0,t1,⋯,tk,⋯ are the sampling time and limk→+∞tk=+∞. From which we know that the control signal holds constant by a zero-order hold (ZOH) until the next sampling time. This kind of control scheme is usually called event-triggered control. Different with some common state feedback controller, which needs not be updated at each sampling instant.
Remark 1. Event-triggered controller (2.3) is a ZOH and does not compute and transmit the control information at each sampling instant, which can reduce the computation complexity and decrease the burden of transmission data.
Let z(t)=x(t)−ˆx(t) and e(t)=z(t)−z(tk), then one gets the error system
˙z(t)=Az(t)+Bz(t−τ)+Ch(z(t))−Kz(tk)=(A−K)z(t)+Bz(t−τ)+Ch(z(t))+Ke(t),t∈[tk,tk+1), | (2.4) |
where h(z(t))=σ(Dx(t))−σ(Dˆx(t)) and hi(z(t))=σi(dTix(t))−σi(dTiˆx(t)), dTi is the ith row of matrix D.
In order to establish our main results, the following assumptions and lemmas are necessary.
Assumption 1. Assume that each component of the nonlinear function σ(⋅) belongs to the sector bound [0,η], i. e.,
0≤σi(ξ1)−σi(ξ2)ξ1−ξ2≤η,∀i=1,2,...,m, |
for any ξ1,ξ2∈R, where η>0 is a known positive constant. In fact, this condition is similar to literature[26].
From Assumption 1, one gets
||σ(Dx(t))−σ(Dˆx(t))||2=∑mi=1|σi(dTix(t))−σi(dTiˆx(t))|2≤∑mi=1η2|dTix(t)−dTiˆx(t)|2≤η2∑mi=1||di||2⋅||x(t)−ˆx(t)||2=η2d2⋅||x(t)−ˆx(t)||2, | (2.5) |
where d=√∑mi=1||di||2=√∑mi=1∑nj=1d2ij, dij are the element of matrix D=(dij)m×n.
Lemma 1.[27] For any symmetric positive matrix W∈Rn×n and scalar τ>0, there is
∫tt−τxT(s)dsW∫tt−τx(s)ds≤τ∫tt−τxT(s)Wx(s)ds. |
This section will present some event-triggered conditions under which master system (2.1) and slave system (2.2) achieve synchronization, and further shows that the length of triggered interval is bigger than zero.
Theorem 1. Under Assumption 1 and the action of event-triggered controller (2.3), if there exist symmetric positive matrices P∈Rn×n, Q∈Rn×n, R∈Rn×n, matrix K∈Rn×n and positive constants β>0,γ>0 such that
Θ=[Θ11Θ12Θ13P+τ2(A−K)TR∗−Q−R+τ2BTRBτ2BTRCτ2BTR∗∗τ2CTRC−γIτ2CTR∗∗∗−βIn+τ2R]<0, | (3.1) |
where
Θ11=P(A−K)+(A−K)TP+τ2(A−K)TR(A−K)+Q−R+βIn, |
Θ12=PB−R+τ2(A−K)TRB, |
Θ13=PC+τ2(A−K)TRC+12ηγI, |
then master system (2.1) synchronizes with slave system (2.2). In addition, controller (2.3) is updated when
||Ke(t)||=√α||z(t)|| |
with α∈[0,1).
Proof. Choose the Lyapunov functional as
V(t)=zT(t)Pz(t)+∫tt−τzT(s)Qz(s)ds+τ∫0−τ∫tt+s˙zT(v)R˙z(v)dvds. | (3.2) |
Then the derivative of V(t) with respect to the trajectories of error system (2.4) is
˙V(t)=2zT(t)P[(A−K)z(t)+Bz(t−τ)+Ch(z(t))+Ke(t)]+zT(t)Qz(t)−zT(t−τ)Qz(t−τ)+τ2˙zT(t)R˙z(t)−τ∫tt−τ˙zT(s)R˙z(s)ds=zT(t)[P(A−K)+(A−K)TP+Q]z(t)+2zT(t)PBz(t−τ)+2zT(t)PCh(z(t))+2zT(t)PKe(t)−zT(t−τ)Qz(t−τ)+τ2[(A−K)z(t)+Bz(t−τ)+Ch(z(t))+Ke(t)]TR[(A−K)z(t)+Bz(t−τ)+Ch(z(t))+Ke(t)]−τ∫tt−τ˙zT(s)R˙z(s)ds. | (3.3) |
It is known that there exists a positive scalar γ>0 such that
γhT(z(t))(h(z(t))−ηz(t))≤0. | (3.4) |
By Lemma 1 and (3.1), one gets
˙V(t)≤ξT(t)Θξ(t)−βzT(t)z(t)+βeT(t)KTKe(t)≤(α−1)βzT(t)z(t), | (3.5) |
where ξ(t)=[zT(t),zT(t−τ),hT(z(t)),eT(t)KT]T and ||Ke(t)||≤√α||z(t)||. From the Lyapunov stability theory, we know that limt→∞z(t)=0. Thus, master system (2.1) and slave system (2.2) are synchronized.
Remark 2. In fact, system (2.4) asymptotically converges to zero only if condition (3.1) holds when t∈[tk,tk+1). If inequality (3.1) does not hold, then we will control it by using the information of next sampling instant. So we can take the triggering event as
||Ke(t)||=√α||z(t)||. | (3.6) |
It is noticed that (3.1) is a nonlinear inequality on the variables, and we can obtain the following linear matrix inequality by variable transformation.
Theorem 2. Under Assumption 1 and the action of event-triggered controller (2.3), if there exist symmetric positive matrices Q∈Rn×n, R∈Rn×n, matrix W∈Rn×n and positive constants β>0,γ such that
˜Θ=[˜Θ11˜Θ12˜Θ13R+τ2(AR−WT)τ(ATR−WT)∗−Q−R+τ2BTRBτ2BTRCτ2BTR0∗∗τ2CTRC−γIτ2CTR0∗∗∗−βIn+τ2R0∗∗∗∗−R]<0, | (3.7) |
where
˜Θ11=RA+ATR−W−WT+Q−R+βIn, |
˜Θ12=RB−R+τ2(ATRB−WTB), |
˜Θ13=RC+τ2(ATRC−WTC)+12ηγI, |
then master system (2.1) synchronizes with slave system (2.2). In addition, controller (2.3) is updated when
||Ke(t)||=√α||z(t)|| |
with α∈[0,1), K=R−1W.
Proof. From (3.1) and letting P=R, one gets
Θ=ˆΘ+[τ(A−K)TR000]R−1[τR(A−K)000]<0, | (3.8) |
where ˆΘ is the same with Θ except ˆΘ11=P(A−K)+(A−K)TP+Q−R+βIn. Letting RK=W and applying the Schur complement lemma, we know that (3.8) is equivalent with (3.7). The proof is completed.
Remark 3. In Theorem 1, because PK and RK all include variable K, it is difficult to depart them away. Thus we take P=R, which increases the conservatism of the results.
Theorem 3. For α∈[0,1), the length of triggered control interval [tk,tk+1) is not commonplace for any k=0,1,⋯. That is, there must exist a positive scalar δ>0 such that mink≥0{tk+1−tk}≥δ.
Proof. In order to show this result, we calculate
ddt(||Ke(t)||||z(t)||)=(Ke(t))TK˙e(t)||Ke(t)||⋅||z(t)||−||Ke(t)||⋅zT(t)˙z(t)||z(t)||3≤||K˙e(t)||||z(t)||+||Ke(t)||⋅||˙z(t)||||z(t)||2=(||K||+||Ke(t)||||z(t)||)||˙z(t)||||z(t)||=(||K||+||Ke(t)||||z(t)||)||(A−K)z(t)+Bz(t−τ)+Ch(z(t))+Ke(t)||||z(t)||. | (3.9) |
Noting that error system (2.4) is convergence, so its state is bounded for t>0. Without loss of generality, we suppose that there exists a nonnegative constant γ≥0 such that supt≥0{||z(t−τ)||||z(t)||}≤γ. Thus,
ddt(||Ke(t)||||z(t)||)≤(||K||+||Ke(t)||||z(t)||)(||A−K||+γ||B||+dη||C||+||Ke(t)||||z(t)||)=(||Ke(t)||||z(t)||)2+(||K||+μ)||Ke(t)||||z(t)||+μ||K||=(||Ke(t)||||z(t)||+μ+||K||2)2−(μ+||K||)24+μ||K||, | (3.10) |
where μ=||A−K||+γ||B||+dη||C||. Letting y(t)=||Ke(t)||||z(t)||+μ+||K||2, and in view of
(μ+||K||)24−μ||K||=(μ−||K||)24, |
there is
˙y(t)≤y2(t). |
It follows from the compare theory of the differential equation that
y(t)≤μ+||K||2−(μ+||K||)(t−tk), |
where we use the fact e(tk)=0 and y(tk)=μ+||K||2. As
||Ke(t)||=√α||z(t)||, |
there is
t−tk=4√α2√α(μ+||K||)+(μ+||K||)2. | (3.11) |
Since α∈[0,1), one gets t>tk. Which shows that the length of the sampling interval [tk,tk+1) is bigger than zero for k=0,1,2,....
Example 1. Take the following Chua circuits [28] as master system
{˙x1(t)=a(x2(t)−m1x1(t)+σ(x1(t)))−cx1(t−τ),˙x2(t)=x1(t)−x2(t)+x3(t)−cx1(t−τ),˙x3(t)=−bx2(t)+c(2x1(t−τ)−x3(t−τ)), | (4.1) |
where σ(x1(t))=12(m1−m0)(|x1(t)+1|−|x1(t)−1|), m0=−17,m1=27,a=9,b=14.286,c=0.1, τ=2. Writing
A=[−am1a01−110−b0],B=[−c00−c002c0−c],C=[a(m1−m0)00000000],D=I3, |
σ(x(t))=(0.5(|x1(t)+1|−|x1(t)−1|),0,0)T, then system (4.1) can be rewritten as the form of system (2.1). Then its phase diagram is shown in Figure 1 and appears the scroll attractors.
After computation, one gets the feasible solutions of inequality (3.7) as
R=[1.04660.02820.07640.02820.90840.01390.07640.01390.9525],Q=[1.66850.10620.55250.10620.43640.05970.55250.05970.7254], |
W=[2.55438.1001−0.34051.44544.41730.1505−1.0214−11.94815.0374],K=[2.49398.5814−0.71841.53364.80040.1060−1.2948−13.30275.3448], |
α=0.5,β=2.4024,γ=0.3741,η=2,τ=2. |
From Theorem 2, we know that master-slave systems (2.1) and (2.2) with the given parameters can synchronize with each other. Taking the initial conditions x(0)=(−41.5,34,−44.5)T and ˆx(0)=(−6,10.5,−8)T respectively, then the state trajectories of master-slave systems (2.1) and (2.2), update laws (2.3) and error system (2.4) are shown in Figures 2–5. In particular, Figure 4 shows that master-slave systems (2.1) and (2.2) synchronizes well.
This paper has investigated the master-slave synchronization of Lurie systems with time delay via event-triggered control scheme. We have obtained the synchronization conditions and the computation method of the control gain. Moreover, we have proved that the presented event-trigged controller is not commonplace. A numerical example has shown that the proposed method is right.
The authors declare that they have no conflicts of interest.
[1] |
G. Candelario, A. Cordero, J. R. Torregrosa, M. P. Vassileva, An optimal and low computational cost fractional Newton-type method for solving nonlinear equations, Appl. Math. Lett., 124 (2022), 107650, http://doi.org/10.1016/j.aml.2021.107650 doi: 10.1016/j.aml.2021.107650
![]() |
[2] |
A. Cordero, F. Soleymani, J. R. Torregrosa, M. Zaka Ullah, Numerically stable improved Chebyshev-Halley type schemes for matrix sign function, J. Comput. Appl. Math., 318 (2017), 189–198, http://doi.org/10.1016/j.cam.2016.10.025 doi: 10.1016/j.cam.2016.10.025
![]() |
[3] |
E. D. Denman, A. N. Beavers, The matrix sign function and computations in systems, Appl. Math. Comput., 2 (1976), 63–94, http://doi.org/10.1016/0096-3003(76)90020-5 doi: 10.1016/0096-3003(76)90020-5
![]() |
[4] |
O. Gomilko, F. Greco, K. Ziȩtak, A Padé family of iterations for the matrix sign function and related problems, Numer. Linear. Algebr. Appl., 19 (2012), 585–605, http://doi.org/10.1002/nla.786 doi: 10.1002/nla.786
![]() |
[5] | N. J. Higham, Functions of Matrices: Theory and Computation, Philadelphia: SIAM, 2008. |
[6] | B. Iannazzo, Numerical Solution of Certain Nonlinear Matrix Equations, PhD thesis, Universita degli studi di Pisa, 2007. |
[7] |
C. S. Kenney, A. J. Laub, Rational iterative methods for the matrix sign function, SIAM J. Matrix Anal. Appl., 12 (1991), 273–291, http://doi.org/10.1137/0612020 doi: 10.1137/0612020
![]() |
[8] |
E. M. Maralani, F. D. Saei, A. A. J. Akbarfam, K. Ghanbari, Computation of eigenvalues of fractional Sturm-Liouville problems, Iran. J. Numer. Anal. Optim. 11 (2021), 117–133. http://doi.org/10.22067/IJNAO.2020.11305.0 doi: 10.22067/IJNAO.2020.11305.0
![]() |
[9] |
Y. Nakatsukasa, Z. Bai, F. Gygi, Optimizing Halley's iteration for computing the matrix polar decomposition, SIAM J. Matrix Anal. Appl., 31 (2010), 2700–2720. http://doi.org/10.1137/090774999 doi: 10.1137/090774999
![]() |
[10] |
J. D. Roberts, Linear model reduction and solution of the algebraic Riccati equation by use of the sign function, Int. J. Control, 32 (1980), 677–687. http://doi.org/10.1080/00207178008922881 doi: 10.1080/00207178008922881
![]() |
[11] |
A. R. Soheili, F. Toutounian, F. Soleymani, A fast convergent numerical method for matrix sign function with application in SDEs, J. Comput. Appl. Math., 282 (2015), 167–178. http://doi.org/10.1016/j.cam.2014.12.041 doi: 10.1016/j.cam.2014.12.041
![]() |
[12] |
F. Soleymani, F. W. Khdhr, R. K. Saeed, J. Golzarpoor, A family of high order iterations for calculating the sign of a matrix, Math. Meth. Appl. Sci., 43 (2020), 8192–8203. http://doi.org/10.1002/mma.6471 doi: 10.1002/mma.6471
![]() |
[13] |
F. Soleymani, Some efficient seventh-order derivative-free families in root-finding, Opuscula Math., 33 (2013), 163–173. http://doi.org/10.7494/OpMath.2013.33.1.163 doi: 10.7494/OpMath.2013.33.1.163
![]() |
[14] |
F. Soleymani, A three-step iterative method for nonlinear systems with sixth order of convergence, Int. J. Comput. Sci. Math., 4 (2013), 363–373. https://doi.org/10.1504/IJCSM.2013.058057 doi: 10.1504/IJCSM.2013.058057
![]() |
[15] | G. W. Stewart, Introduction to Matrix Computations, New York: Academic Press, 1973. |
[16] | M. Trott, The Mathematica Guide-Book for Numerics, New York: Springer, 2006. |
1. | Qi Liu, Muhammad Zakria Javed, Muhammad Uzair Awan, Loredana Ciurdariu, Badr S. Alkahtani, Hermite-Hadamard's like inequalities via symmetric quantum calculus, 2025, 16, 20904479, 103372, 10.1016/j.asej.2025.103372 |