Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-...Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.展开更多
In this paper, we established a connection between a square matrix “A” of order “n” and a matrix defined through a new approach of the recursion relation . (where is any column matrix with n real ...In this paper, we established a connection between a square matrix “A” of order “n” and a matrix defined through a new approach of the recursion relation . (where is any column matrix with n real elements). Now the new matrix gives us a characteristic equation of matrix A and we can find the exact determination of Eigenvalues and its Eigenvectors of the matrix A. This new approach was invented by using Two eigenvector theorems along with some examples. In the subsequent paper we apply this approach by considering some examples on this invention.展开更多
In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by ter...In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.展开更多
In this paper, we consider preconditioners for generalized saddle point systems with a nonsymmetric coefficient matrix. A constraint preconditioner for this systems is constructed, and some spectral properties of the ...In this paper, we consider preconditioners for generalized saddle point systems with a nonsymmetric coefficient matrix. A constraint preconditioner for this systems is constructed, and some spectral properties of the preconditioned matrix are given. Our results extend the corresponding ones in [3] and [4].展开更多
文摘Mixed orthogonal arrays of strength two and size smn are constructed by grouping points in the finite projective geometry PG(mn-1, s). PG(mn-1, s) can be partitioned into [(smn-1)/(sn-1)](n-1)-flats such that each (n-1)-flat is associated with a point in PG(m-1, sn). An orthogonal array Lsmn((sn)(smn-)(sn-1) can be constructed by using (smn-1)/( sn-1) points in PG(m-1, sn). A set of (st-1)/(s-1) points in PG(m-1, sn) is called a (t-1)-flat over GF(s) if it is isomorphic to PG(t-1, s). If there exists a (t-1)-flat over GF(s) in PG(m-1, sn), then we can replace the corresponding [(st-1)/(s-1)] sn-level columns in Lsmn((sn)(smn-)(sn-1) by (smn-1)/( sn-1) st -level columns and obtain a mixed orthogonal array. Many new mixed orthogonal arrays can be obtained by this procedure. In this paper, we study methods for finding disjoint (t-1)-flats over GF(s) in PG(m-1, sn) in order to construct more mixed orthogonal arrays of strength two. In particular, if m and n are relatively prime then we can construct an Lsmn((sm)smn-1/sm-1-i(sn-1)/ (s-1)( sn) i(sm-1)/ s-1) for any 0i(smn-1)(s-1)/( sm-1)( sn-1) New orthogonal arrays of sizes 256, 512, and 1024 are obtained by using PG(7,2), PG(8,2), and PG(9,2) respectively.
文摘In this paper, we established a connection between a square matrix “A” of order “n” and a matrix defined through a new approach of the recursion relation . (where is any column matrix with n real elements). Now the new matrix gives us a characteristic equation of matrix A and we can find the exact determination of Eigenvalues and its Eigenvectors of the matrix A. This new approach was invented by using Two eigenvector theorems along with some examples. In the subsequent paper we apply this approach by considering some examples on this invention.
基金supported by the National Natural Science Foundation of China under Grant No.11171051the Major Research plan of the National Natural Science Foundation of China under Grant No.91230103the Fundamental Research Funds for the Central Universities under Grant No.DUT14RC(3)023
文摘In this paper,a randomized Cayley-Hamilton theorem based method(abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented.It determines the coefficient polynomials term by term from lower to higher degree.By using a random vector and randomly shifting,it requires no condition on the input matrix and works with probability one.In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation,by using the modular technique,a parallelized version of the RCH method is also given.Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.
基金Supported by the Natural Science Foundation of Guangdong Province (06025061, 91510224000002)the National Natural Science Foundation of China (10971075, 10671077)the State Key Laboratory of Scientific and Engineering Computing
文摘In this paper, we consider preconditioners for generalized saddle point systems with a nonsymmetric coefficient matrix. A constraint preconditioner for this systems is constructed, and some spectral properties of the preconditioned matrix are given. Our results extend the corresponding ones in [3] and [4].
