In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not gen...Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.展开更多
The theory of Schur complement plays an important role in many fields such as matrix theory, control theory and computational mathematics. In this paper, some new estimates of diagonally, α-diagonally and product α-...The theory of Schur complement plays an important role in many fields such as matrix theory, control theory and computational mathematics. In this paper, some new estimates of diagonally, α-diagonally and product α-diagonally dominant degree on the Schur complement of matrices are obtained, which improve some relative results. As an application, we present several new eigenvalue inclusion regions for the Schur complement of matrices. Finally, we give a numerical example to illustrate the advantages of our derived results.展开更多
The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covarian...The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.展开更多
To solve the symmetric positive definite linear system Ax = b on parallel and vector machines, multisplitting methods are considered. Here the s.p.d. (symmetric positive definite) matrix A need not be assumed in a spe...To solve the symmetric positive definite linear system Ax = b on parallel and vector machines, multisplitting methods are considered. Here the s.p.d. (symmetric positive definite) matrix A need not be assumed in a special form (e.g. the dissection form [11]). The main tool for deriving our methods is the diagonally compensated reduction (cf. [1]). The convergence of such methods is also discussed by using this tool. [WT5,5”HZ]展开更多
In this paper, we provide some new criteria conditions for generalized strictly diagonally dominant matrices, such that the corresponding results in [1] are generalized and improved.
In this paper we first give an a priori estimate of maximum modulus ofsolutions for a class of systems of diagonally degenerate elliptic equations in the case of p > 2.
The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random mis...The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random missing(RM)that differs significantly from common missing patterns of RTT-AT.The method for solving the RM may experience performance degradation or failure when applied to RTT-AT imputation.Conventional autoregressive deep learning methods are prone to error accumulation and long-term dependency loss.In this paper,a non-autoregressive imputation model that addresses the issue of missing value imputation for two common missing patterns in RTT-AT is proposed.Our model consists of two probabilistic sparse diagonal masking self-attention(PSDMSA)units and a weight fusion unit.It learns missing values by combining the representations outputted by the two units,aiming to minimize the difference between the missing values and their actual values.The PSDMSA units effectively capture temporal dependencies and attribute correlations between time steps,improving imputation quality.The weight fusion unit automatically updates the weights of the output representations from the two units to obtain a more accurate final representation.The experimental results indicate that,despite varying missing rates in the two missing patterns,our model consistently outperforms other methods in imputation performance and exhibits a low frequency of deviations in estimates for specific missing entries.Compared to the state-of-the-art autoregressive deep learning imputation model Bidirectional Recurrent Imputation for Time Series(BRITS),our proposed model reduces mean absolute error(MAE)by 31%~50%.Additionally,the model attains a training speed that is 4 to 8 times faster when compared to both BRITS and a standard Transformer model when trained on the same dataset.Finally,the findings from the ablation experiments demonstrate that the PSDMSA,the weight fusion unit,cascade network design,and imputation loss enhance imputation performance and confirm the efficacy of our design.展开更多
A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are con...A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.展开更多
In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical...In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical at all. Zeno’s paradoxes indirectly prove that distances are not composed of extensionless points and, in general, that a higher dimension cannot be completely composed of lower ones. Conversely, lower dimensions can be understood as special cases of higher dimensions. To illustrate this approach, I consider Cantor’s only apparent proof that the real numbers are uncountable. However, his widely accepted indirect proof has the disadvantage that it depends on whether there is another way to make the real numbers countable. Cantor rightly assumes that there can be no smallest number between 0 and 1, and therefore no beginning of counting. For this reason he arbitrarily lists the real numbers in order to show with his diagonal method that this list can never be complete. The situation is different if we start with the largest number between 0 and 1 (0.999…) and use the method of an inverted triangle, which can be understood as a special fractal form. Here we can construct a vertical and a horizontal stratification with which it is actually possible to construct all real numbers between 0 and 1 without exception. Each column is infinite, and each number in that column is the starting point of a new triangle, while each row is finite. Even in a simple sine curve, we experience finiteness with respect to the y-axis and infinity with respect to the x-axis. The first parts of this article show that Zeno’s assumptions contradict the concept of motion as such, so it is not surprising that this misconstruction leads to contradictions. In the last part, I discuss Cantor’s diagonal method and explain the method of an inverted triangle that is internally structured like a fractal by repeating this inverted triangle at each column. The consequence is that we encounter two very different methods of counting. Vertically it is continuous, horizontally it is discrete. While Frege, Tarski, Cantor, Gödel and the Vienna Circle tried to derive the higher dimension from the lower, a procedure that always leads to new contradictions and antinomies (Tarski, Russell), I take the opposite approach here, in which I derive the lower dimension from the higher. This perspective seems to fail because Tarski, Russell, Wittgenstein, and especially the Vienna Circle have shown that the completeness of the absolute itself is logically contradictory. For this reason, we agree with Hegel in assuming that we can never fully comprehend the Absolute, but only its particular manifestations—otherwise we would be putting ourselves in the place of the Absolute, or even God. Nevertheless, we can understand the Absolute in its particular expressions, as I will show with the modest example of the triangle proof of the combined horizontal and vertical countability of the real numbers, which I developed in rejection of Cantor’s diagonal proof. .展开更多
By applying an existence theorem of maximal elements of set-valued mappings in FC-spaces proposed by the author, some new existence theorems of solutions for systems of generalized quasi-variational inclusion (disclu...By applying an existence theorem of maximal elements of set-valued mappings in FC-spaces proposed by the author, some new existence theorems of solutions for systems of generalized quasi-variational inclusion (disclusion) problems are proved in FC-spaces without convexity structures. These results improve and generalize some results in recent publications from closed convex subsets of topological vector spaces to FC-spaces under weaker conditions.展开更多
In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci(x)-FC-partially diagonally quasico...In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci(x)-FC-partially diagonally quasiconvex, Ci(x)-FC-quasiconvex, and Ci(x)-FC- quasiconvex-like for set-valued mappings are also introduced in FC-spaces. By applying these notions and a maximal element theorem, the nonemptyness and compactness of solution sets for four classes of systems of generalized vector quasi-equilibrium problems are proved in noncompact FC-spaces. As applications, some new existence theorems of solutions for mathematical programs with system of generalized vector quasi-equilibrium constraints are obtained in FC-spaces. These results improve and generalize some recent known results in literature.展开更多
Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the nu...Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.展开更多
It is well known that the matrix equations play a significant role in engineering and applicable sciences. In this research article, a new modification of the homotopy perturbation method (HPM) will be proposed to obt...It is well known that the matrix equations play a significant role in engineering and applicable sciences. In this research article, a new modification of the homotopy perturbation method (HPM) will be proposed to obtain the approximated solution of the matrix equation in the form AX = B. Moreover, the conditions are deduced to check the convergence of the homotopy series. Numerical implementations are adapted to illustrate the properties of the modified method.展开更多
A parallel diagonally iterated Runge Kutta (PDIRK) method is constructed to solve stiff initial value problems for delay differential equations. The order and stability of this PDIRK method has been analyzed, and the ...A parallel diagonally iterated Runge Kutta (PDIRK) method is constructed to solve stiff initial value problems for delay differential equations. The order and stability of this PDIRK method has been analyzed, and the iteration parameters of the method are tuned in such a way that fast convergence to the value of corrector is achieved.展开更多
From the concept of α diagonally dominant matrix, two sufficient conditions of nonsingular H-matrices were obtained in this paper. An example was given to show that these results improve the known results.
The purpose of this research is to investigate the effciency of explicit diagonally implicit multi-stage integration methods with extrapolation. The author gave detailed explanation of explicit diagonally implicit mul...The purpose of this research is to investigate the effciency of explicit diagonally implicit multi-stage integration methods with extrapolation. The author gave detailed explanation of explicit diagonally implicit multi-stage integration method and compared the base method with a technique known as extrapolation to improve the effciency. Extrapolation for symmetric Runge-Kutta method is proven to improve the accuracy since with extrapolation the solutions exhibit asymptotic error expansion, however for General linear methods, it is not known whether extrapolation can improve the effciency or not. Therefore this research focuses on the numerical experimental results of the explicit diagonally implicit multistage integration with and without extrapolation for solving some ordinary differential equations. The numerical results showed that the base method with extrapolation is more effcient than the method without extrapolation.展开更多
H-tensor plays an important role in identifying positive definiteness of even order real symmetric tensors.In this paper,some definitions and theorems related to H-tensors are introducedfirstly.Secondly,some new criteria...H-tensor plays an important role in identifying positive definiteness of even order real symmetric tensors.In this paper,some definitions and theorems related to H-tensors are introducedfirstly.Secondly,some new criteria for identifying nonsingular H-tensors are proposed,moreover,a new theorem for identifying positive definiteness of even order real symmetric tensors is obtained.Finally,some numerical examples are given to illustrate our results.展开更多
文摘In this paper, we provide some new necessary and sufficient conditions for generalized diagonally dominant matrices and also obtain some criteria for nongeneralized dominant matrices.
基金Supported by the National Natural Science Foundation of China(71261010)
文摘Generalized strictly diagonally dominant matrices play a wide and important role in computational mathematics, mathematical physics, theory of dynamical systems, etc.But it is difficult to judge a matrix is or not generalized strictly diagonally dominant matrix.In this paper, by using the properties of α-chain diagonally dominant matrix, we obtain new criteria for judging generalized strictly diagonally dominant matrix, which enlarge the identification range.
文摘The theory of Schur complement plays an important role in many fields such as matrix theory, control theory and computational mathematics. In this paper, some new estimates of diagonally, α-diagonally and product α-diagonally dominant degree on the Schur complement of matrices are obtained, which improve some relative results. As an application, we present several new eigenvalue inclusion regions for the Schur complement of matrices. Finally, we give a numerical example to illustrate the advantages of our derived results.
文摘The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e.LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.
文摘To solve the symmetric positive definite linear system Ax = b on parallel and vector machines, multisplitting methods are considered. Here the s.p.d. (symmetric positive definite) matrix A need not be assumed in a special form (e.g. the dissection form [11]). The main tool for deriving our methods is the diagonally compensated reduction (cf. [1]). The convergence of such methods is also discussed by using this tool. [WT5,5”HZ]
基金Supported by the Nature Science Foundation of Henan Province(2003110010)
文摘In this paper, we provide some new criteria conditions for generalized strictly diagonally dominant matrices, such that the corresponding results in [1] are generalized and improved.
文摘In this paper we first give an a priori estimate of maximum modulus ofsolutions for a class of systems of diagonally degenerate elliptic equations in the case of p > 2.
基金supported by Graduate Funded Project(No.JY2022A017).
文摘The frequent missing values in radar-derived time-series tracks of aerial targets(RTT-AT)lead to significant challenges in subsequent data-driven tasks.However,the majority of imputation research focuses on random missing(RM)that differs significantly from common missing patterns of RTT-AT.The method for solving the RM may experience performance degradation or failure when applied to RTT-AT imputation.Conventional autoregressive deep learning methods are prone to error accumulation and long-term dependency loss.In this paper,a non-autoregressive imputation model that addresses the issue of missing value imputation for two common missing patterns in RTT-AT is proposed.Our model consists of two probabilistic sparse diagonal masking self-attention(PSDMSA)units and a weight fusion unit.It learns missing values by combining the representations outputted by the two units,aiming to minimize the difference between the missing values and their actual values.The PSDMSA units effectively capture temporal dependencies and attribute correlations between time steps,improving imputation quality.The weight fusion unit automatically updates the weights of the output representations from the two units to obtain a more accurate final representation.The experimental results indicate that,despite varying missing rates in the two missing patterns,our model consistently outperforms other methods in imputation performance and exhibits a low frequency of deviations in estimates for specific missing entries.Compared to the state-of-the-art autoregressive deep learning imputation model Bidirectional Recurrent Imputation for Time Series(BRITS),our proposed model reduces mean absolute error(MAE)by 31%~50%.Additionally,the model attains a training speed that is 4 to 8 times faster when compared to both BRITS and a standard Transformer model when trained on the same dataset.Finally,the findings from the ablation experiments demonstrate that the PSDMSA,the weight fusion unit,cascade network design,and imputation loss enhance imputation performance and confirm the efficacy of our design.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62105004 and 52174141)the College Student Innovation and Entrepreneurship Fund Project(Grant No.202210361053)+1 种基金Anhui Mining Machinery and Electrical Equipment Coordination Innovation Center,Anhui University of Science&Technology(Grant No.KSJD202304)the Anhui Province Digital Agricultural Engineering Technology Research Center Open Project(Grant No.AHSZNYGC-ZXKF021)。
文摘A novel color image encryption scheme is developed to enhance the security of encryption without increasing the complexity. Firstly, the plain color image is decomposed into three grayscale plain images, which are converted into the frequency domain coefficient matrices(FDCM) with discrete cosine transform(DCT) operation. After that, a twodimensional(2D) coupled chaotic system is developed and used to generate one group of embedded matrices and another group of encryption matrices, respectively. The embedded matrices are integrated with the FDCM to fulfill the frequency domain encryption, and then the inverse DCT processing is implemented to recover the spatial domain signal. Eventually,under the function of the encryption matrices and the proposed diagonal scrambling algorithm, the final color ciphertext is obtained. The experimental results show that the proposed method can not only ensure efficient encryption but also satisfy various sizes of image encryption. Besides, it has better performance than other similar techniques in statistical feature analysis, such as key space, key sensitivity, anti-differential attack, information entropy, noise attack, etc.
文摘In contrast to the solutions of applied mathematics to Zeno’s paradoxes, I focus on the concept of motion and show that, by distinguishing two different forms of motion, Zeno’s apparent paradoxes are not paradoxical at all. Zeno’s paradoxes indirectly prove that distances are not composed of extensionless points and, in general, that a higher dimension cannot be completely composed of lower ones. Conversely, lower dimensions can be understood as special cases of higher dimensions. To illustrate this approach, I consider Cantor’s only apparent proof that the real numbers are uncountable. However, his widely accepted indirect proof has the disadvantage that it depends on whether there is another way to make the real numbers countable. Cantor rightly assumes that there can be no smallest number between 0 and 1, and therefore no beginning of counting. For this reason he arbitrarily lists the real numbers in order to show with his diagonal method that this list can never be complete. The situation is different if we start with the largest number between 0 and 1 (0.999…) and use the method of an inverted triangle, which can be understood as a special fractal form. Here we can construct a vertical and a horizontal stratification with which it is actually possible to construct all real numbers between 0 and 1 without exception. Each column is infinite, and each number in that column is the starting point of a new triangle, while each row is finite. Even in a simple sine curve, we experience finiteness with respect to the y-axis and infinity with respect to the x-axis. The first parts of this article show that Zeno’s assumptions contradict the concept of motion as such, so it is not surprising that this misconstruction leads to contradictions. In the last part, I discuss Cantor’s diagonal method and explain the method of an inverted triangle that is internally structured like a fractal by repeating this inverted triangle at each column. The consequence is that we encounter two very different methods of counting. Vertically it is continuous, horizontally it is discrete. While Frege, Tarski, Cantor, Gödel and the Vienna Circle tried to derive the higher dimension from the lower, a procedure that always leads to new contradictions and antinomies (Tarski, Russell), I take the opposite approach here, in which I derive the lower dimension from the higher. This perspective seems to fail because Tarski, Russell, Wittgenstein, and especially the Vienna Circle have shown that the completeness of the absolute itself is logically contradictory. For this reason, we agree with Hegel in assuming that we can never fully comprehend the Absolute, but only its particular manifestations—otherwise we would be putting ourselves in the place of the Absolute, or even God. Nevertheless, we can understand the Absolute in its particular expressions, as I will show with the modest example of the triangle proof of the combined horizontal and vertical countability of the real numbers, which I developed in rejection of Cantor’s diagonal proof. .
基金Project supported by the Scientific Research Fund of Sichuan Normal University (No. 09ZDL04)the Sichuan Province Leading Academic Discipline Project (No. SZD0406)
文摘By applying an existence theorem of maximal elements of set-valued mappings in FC-spaces proposed by the author, some new existence theorems of solutions for systems of generalized quasi-variational inclusion (disclusion) problems are proved in FC-spaces without convexity structures. These results improve and generalize some results in recent publications from closed convex subsets of topological vector spaces to FC-spaces under weaker conditions.
基金supported by the Scientific Research Fun of Sichuan Normal University (09ZDL04)the Sichuan Province Leading Academic Discipline Project (SZD0406)
文摘In this article, four new classes of systems of generalized vector quasi-equilibrium problems are introduced and studied in FC-spaces without convexity structure. The notions of Ci(x)-FC-partially diagonally quasiconvex, Ci(x)-FC-quasiconvex, and Ci(x)-FC- quasiconvex-like for set-valued mappings are also introduced in FC-spaces. By applying these notions and a maximal element theorem, the nonemptyness and compactness of solution sets for four classes of systems of generalized vector quasi-equilibrium problems are proved in noncompact FC-spaces. As applications, some new existence theorems of solutions for mathematical programs with system of generalized vector quasi-equilibrium constraints are obtained in FC-spaces. These results improve and generalize some recent known results in literature.
文摘Let DD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(jj)|≥A_iA_j,i≠j,i,j∈N}.PD_0(R)={A∈C^(n×#)||Rea_(ii)Rea_(kk)|≥A_iA_jA_k,i≠j≠k,i,j,k∈N}. In this paper,we show DD_0(R)PD_0(R),and the conditions under which the numbers of eigen vance of A∈PD_0(R)\DD_0(R)are equal to the numbers of a_(ii),i∈N in positive and negative real part respectively.Some couter examples are given which present the condnions can not be omitted.
文摘It is well known that the matrix equations play a significant role in engineering and applicable sciences. In this research article, a new modification of the homotopy perturbation method (HPM) will be proposed to obtain the approximated solution of the matrix equation in the form AX = B. Moreover, the conditions are deduced to check the convergence of the homotopy series. Numerical implementations are adapted to illustrate the properties of the modified method.
文摘A parallel diagonally iterated Runge Kutta (PDIRK) method is constructed to solve stiff initial value problems for delay differential equations. The order and stability of this PDIRK method has been analyzed, and the iteration parameters of the method are tuned in such a way that fast convergence to the value of corrector is achieved.
文摘From the concept of α diagonally dominant matrix, two sufficient conditions of nonsingular H-matrices were obtained in this paper. An example was given to show that these results improve the known results.
文摘The purpose of this research is to investigate the effciency of explicit diagonally implicit multi-stage integration methods with extrapolation. The author gave detailed explanation of explicit diagonally implicit multi-stage integration method and compared the base method with a technique known as extrapolation to improve the effciency. Extrapolation for symmetric Runge-Kutta method is proven to improve the accuracy since with extrapolation the solutions exhibit asymptotic error expansion, however for General linear methods, it is not known whether extrapolation can improve the effciency or not. Therefore this research focuses on the numerical experimental results of the explicit diagonally implicit multistage integration with and without extrapolation for solving some ordinary differential equations. The numerical results showed that the base method with extrapolation is more effcient than the method without extrapolation.
基金supported by the National Natural Science Foundations of China(Grant No.31600299)The Natural Science Foundation of Shaanxi province(Grant No.2020JM-622).
文摘H-tensor plays an important role in identifying positive definiteness of even order real symmetric tensors.In this paper,some definitions and theorems related to H-tensors are introducedfirstly.Secondly,some new criteria for identifying nonsingular H-tensors are proposed,moreover,a new theorem for identifying positive definiteness of even order real symmetric tensors is obtained.Finally,some numerical examples are given to illustrate our results.