Let R be a ring and J（R） the Jacobson radical. An element a of R is called（strongly） J-clean if there is an idempotent e ∈ R and w ∈ J（R） such that a = e ＋ w（and ew = we）. The ring R is called a（strongly）...Let R be a ring and J（R） the Jacobson radical. An element a of R is called（strongly） J-clean if there is an idempotent e ∈ R and w ∈ J（R） such that a = e ＋ w（and ew = we）. The ring R is called a（strongly） J-clean ring provided that every one of its elements is（strongly） J-clean. We discuss, in the present paper,some properties of J-clean rings and strongly J-clean rings. Moreover, we investigate J-cleanness and strongly J-cleanness of generalized matrix rings. Some known results are also extended.展开更多
Based on a strong inter-diagonal matrix and Taylor series expansions,an oversample reconstruction method was proposed to calibrate the optical micro-scanning error. The technique can obtain regular 2 ×2 microscan...Based on a strong inter-diagonal matrix and Taylor series expansions,an oversample reconstruction method was proposed to calibrate the optical micro-scanning error. The technique can obtain regular 2 ×2 microscanning undersampling images from the real irregular undersampling images,and can then obtain a high spatial oversample resolution image. Simulations and experiments show that the proposed technique can reduce optical micro-scanning error and improve the system＇s spatial resolution. The algorithm is simple,fast and has low computational complexity. It can also be applied to other electro-optical imaging systems to improve their spatial resolution and has a widespread application prospect.展开更多
Let R be a ring with an endomorphismσ,F∪{0}the free monoid generated by U={u1,…,ut}with 0 added,and M a factor of F obtained by setting certain monomials in F to 0 such that M^(n)=0 for some n.Then we can form the ...Let R be a ring with an endomorphismσ,F∪{0}the free monoid generated by U={u1,…,ut}with 0 added,and M a factor of F obtained by setting certain monomials in F to 0 such that M^(n)=0 for some n.Then we can form the non-semiprime skew monoid ring R[M;σ].A local ring R is called bleached if for any j∈J(R)and any u∈U(R),the abelian group endomorphisms l_(u)−r_(j) and l_(j)−r_(u) of R are surjective.Using R[M;σ],we provide various classes of both bleached and non-bleached local rings.One of the main problems concerning strongly clean rings is to characterize the rings R for which the matrix ring M_(n)(R)is strongly clean.We investigate the strong cleanness of the full matrix rings over the skew monoid ring R[M;σ].展开更多
To solve the problem that the choice of softening factor in conventional adaptive strong tracking filter( STF) greatly relies on the experience and computer simulation,a new concept of softening factor matrix is intro...To solve the problem that the choice of softening factor in conventional adaptive strong tracking filter( STF) greatly relies on the experience and computer simulation,a new concept of softening factor matrix is introduced and a fuzzy adaptive strong tracking cubature Kalman filter( FASTCKF) based on fuzzy logic controller is proposed. This method monitors residual absolute mean and standard deviation of each measurement component with fuzzy logic adaptive controller( FLAC),and adjusts the softening factor matrix dynamically by fuzzy rules,which is capable to modify suboptimal fading factor of STF adaptively and improve the filter's robust adaptive capacity. The simulation results show that the improved filtering performance is superior to the conventional square root cubature Kalman filter( SCKF) and the strong tracking square root cubature Kalman filter( STSCKF).展开更多
We propose a new heterogeneous parallel strategy for the density matrix renormalization group(DMRG)method in the hybrid architecture with both central processing unit(CPU)and graphics processing unit(GPU).Focusing on ...We propose a new heterogeneous parallel strategy for the density matrix renormalization group(DMRG)method in the hybrid architecture with both central processing unit(CPU)and graphics processing unit(GPU).Focusing on the two most time-consuming sections in the finite DMRG sweeps,i.e.,the diagonalization of superblock and the truncation of subblock,we optimize our previous hybrid algorithm to achieve better performance.For the former,we adopt OpenMP application programming interface on CPU and use our own subroutines with higher bandwidth on GPU.For the later,we use GPU to accelerate matrix and vector operations involving the reduced density matrix.Applying the parallel scheme to the Hubbard model with next-nearest hopping on the 4-leg ladder,we compute the ground state of the system and obtain the charge stripe pattern which is usually observed in high temperature superconductors.Based on simulations with different numbers of DMRG kept states,we show significant performance improvement and computational time reduction with the optimized parallel algorithm.Our hybrid parallel strategy with superiority in solving the ground state of quasi-two dimensional lattices is also expected to be useful for other DMRG applications with large numbers of kept states,e.g.,the time dependent DMRG algorithms.展开更多
We propose an improved real-space parallel strategy for the density matrix renormalization group(DMRG)method,where boundaries of separate regions are adaptively distributed during DMRG sweeps.Our scheme greatly improv...We propose an improved real-space parallel strategy for the density matrix renormalization group(DMRG)method,where boundaries of separate regions are adaptively distributed during DMRG sweeps.Our scheme greatly improves the parallel efficiency with shorter waiting time between two adjacent tasks,compared with the original real-space parallel DMRG with fixed boundaries.We implement our new strategy based on the message passing interface(MPI),and dynamically control the number of kept states according to the truncation error in each DMRG step.We study the performance of the new parallel strategy by calculating the ground state of a spin-cluster chain and a quantum chemical Hamiltonian of the water molecule.The maximum parallel efficiencies for these two models are 91%and 76%in 4 nodes,which are much higher than the real-space parallel DMRG with fixed boundaries.展开更多
Let {vij}, i, j = 1, 2,…, be i.i.d. random variables with Ev11= 0, Ev112=1 and ai = (ai1,…,aiM) be random vectors with {aij} being i.i.d. random variables. Define XN=(x1,…, XK) and SN= XNXNT, where The spectral dis...Let {vij}, i, j = 1, 2,…, be i.i.d. random variables with Ev11= 0, Ev112=1 and ai = (ai1,…,aiM) be random vectors with {aij} being i.i.d. random variables. Define XN=(x1,…, XK) and SN= XNXNT, where The spectral distribution of SN is proven to converge, with probability one, to a nonrandom distribution function under mild conditions.展开更多
文摘Let R be a ring and J（R） the Jacobson radical. An element a of R is called（strongly） J-clean if there is an idempotent e ∈ R and w ∈ J（R） such that a = e ＋ w（and ew = we）. The ring R is called a（strongly） J-clean ring provided that every one of its elements is（strongly） J-clean. We discuss, in the present paper,some properties of J-clean rings and strongly J-clean rings. Moreover, we investigate J-cleanness and strongly J-cleanness of generalized matrix rings. Some known results are also extended.
基金Supported by the National Natural Science Foundation of China(NSFC 61501396)the Colleges and Universities under the Science and Technology Research Projects of Hebei Province(QN2015021)
文摘Based on a strong inter-diagonal matrix and Taylor series expansions,an oversample reconstruction method was proposed to calibrate the optical micro-scanning error. The technique can obtain regular 2 ×2 microscanning undersampling images from the real irregular undersampling images,and can then obtain a high spatial oversample resolution image. Simulations and experiments show that the proposed technique can reduce optical micro-scanning error and improve the system＇s spatial resolution. The algorithm is simple,fast and has low computational complexity. It can also be applied to other electro-optical imaging systems to improve their spatial resolution and has a widespread application prospect.
文摘Let R be a ring with an endomorphismσ,F∪{0}the free monoid generated by U={u1,…,ut}with 0 added,and M a factor of F obtained by setting certain monomials in F to 0 such that M^(n)=0 for some n.Then we can form the non-semiprime skew monoid ring R[M;σ].A local ring R is called bleached if for any j∈J(R)and any u∈U(R),the abelian group endomorphisms l_(u)−r_(j) and l_(j)−r_(u) of R are surjective.Using R[M;σ],we provide various classes of both bleached and non-bleached local rings.One of the main problems concerning strongly clean rings is to characterize the rings R for which the matrix ring M_(n)(R)is strongly clean.We investigate the strong cleanness of the full matrix rings over the skew monoid ring R[M;σ].
基金National Natural Science Foundations of China(Nos.51175082,60874092,51375088)
文摘To solve the problem that the choice of softening factor in conventional adaptive strong tracking filter( STF) greatly relies on the experience and computer simulation,a new concept of softening factor matrix is introduced and a fuzzy adaptive strong tracking cubature Kalman filter( FASTCKF) based on fuzzy logic controller is proposed. This method monitors residual absolute mean and standard deviation of each measurement component with fuzzy logic adaptive controller( FLAC),and adjusts the softening factor matrix dynamically by fuzzy rules,which is capable to modify suboptimal fading factor of STF adaptively and improve the filter's robust adaptive capacity. The simulation results show that the improved filtering performance is superior to the conventional square root cubature Kalman filter( SCKF) and the strong tracking square root cubature Kalman filter( STSCKF).
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11674139,11834005,and 11904145)the Program for Changjiang Scholars and Innovative Research Team in University,China(Grant No.IRT-16R35).
文摘We propose a new heterogeneous parallel strategy for the density matrix renormalization group(DMRG)method in the hybrid architecture with both central processing unit(CPU)and graphics processing unit(GPU).Focusing on the two most time-consuming sections in the finite DMRG sweeps,i.e.,the diagonalization of superblock and the truncation of subblock,we optimize our previous hybrid algorithm to achieve better performance.For the former,we adopt OpenMP application programming interface on CPU and use our own subroutines with higher bandwidth on GPU.For the later,we use GPU to accelerate matrix and vector operations involving the reduced density matrix.Applying the parallel scheme to the Hubbard model with next-nearest hopping on the 4-leg ladder,we compute the ground state of the system and obtain the charge stripe pattern which is usually observed in high temperature superconductors.Based on simulations with different numbers of DMRG kept states,we show significant performance improvement and computational time reduction with the optimized parallel algorithm.Our hybrid parallel strategy with superiority in solving the ground state of quasi-two dimensional lattices is also expected to be useful for other DMRG applications with large numbers of kept states,e.g.,the time dependent DMRG algorithms.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11674139,11834005,and 11904145)the Program for Changjiang Scholars and Innovative Research Team in Universities,China(Grant No.IRT-16R35).
文摘We propose an improved real-space parallel strategy for the density matrix renormalization group(DMRG)method,where boundaries of separate regions are adaptively distributed during DMRG sweeps.Our scheme greatly improves the parallel efficiency with shorter waiting time between two adjacent tasks,compared with the original real-space parallel DMRG with fixed boundaries.We implement our new strategy based on the message passing interface(MPI),and dynamically control the number of kept states according to the truncation error in each DMRG step.We study the performance of the new parallel strategy by calculating the ground state of a spin-cluster chain and a quantum chemical Hamiltonian of the water molecule.The maximum parallel efficiencies for these two models are 91%and 76%in 4 nodes,which are much higher than the real-space parallel DMRG with fixed boundaries.
文摘Let {vij}, i, j = 1, 2,…, be i.i.d. random variables with Ev11= 0, Ev112=1 and ai = (ai1,…,aiM) be random vectors with {aij} being i.i.d. random variables. Define XN=(x1,…, XK) and SN= XNXNT, where The spectral distribution of SN is proven to converge, with probability one, to a nonrandom distribution function under mild conditions.
