Granular computing is a very hot research field in recent years. In our previous work an algebraic quotient space model was proposed,where the quotient structure could not be deduced if the granulation was based on an...Granular computing is a very hot research field in recent years. In our previous work an algebraic quotient space model was proposed,where the quotient structure could not be deduced if the granulation was based on an equivalence relation. In this paper,definitions were given and formulas of the lower quotient congruence and upper quotient congruence were calculated to roughly represent the quotient structure. Then the accuracy and roughness were defined to measure the quotient structure in quantification. Finally,a numerical example was given to demonstrate that the rough representation and measuring methods are efficient and applicable. The work has greatly enriched the algebraic quotient space model and granular computing theory.展开更多
The preconditioned iterative solvers for solving Sylvester tensor equations are considered in this paper.By fully exploiting the structure of the tensor equation,we propose a projection method based on the tensor form...The preconditioned iterative solvers for solving Sylvester tensor equations are considered in this paper.By fully exploiting the structure of the tensor equation,we propose a projection method based on the tensor format,which needs less flops and storage than the standard projection method.The structure of the coefficient matrices of the tensor equation is used to design the nearest Kronecker product(NKP) preconditioner,which is easy to construct and is able to accelerate the convergence of the iterative solver.Numerical experiments are presented to show good performance of the approaches.展开更多
An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly.The authors preform a symbolic pre-processing that allows us later to execute all numerica...An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly.The authors preform a symbolic pre-processing that allows us later to execute all numerical computations in an accurate way.展开更多
基金Supported by the National Natural Science Foundation of China(No.61772031)the Special Energy Saving Foundation of Changsha,Hunan Province in 2017
文摘Granular computing is a very hot research field in recent years. In our previous work an algebraic quotient space model was proposed,where the quotient structure could not be deduced if the granulation was based on an equivalence relation. In this paper,definitions were given and formulas of the lower quotient congruence and upper quotient congruence were calculated to roughly represent the quotient structure. Then the accuracy and roughness were defined to measure the quotient structure in quantification. Finally,a numerical example was given to demonstrate that the rough representation and measuring methods are efficient and applicable. The work has greatly enriched the algebraic quotient space model and granular computing theory.
基金supported by National Natural Science Foundation of China (Grant No.10961010)Science and Technology Foundation of Guizhou Province (Grant No. LKS[2009]03)
文摘The preconditioned iterative solvers for solving Sylvester tensor equations are considered in this paper.By fully exploiting the structure of the tensor equation,we propose a projection method based on the tensor format,which needs less flops and storage than the standard projection method.The structure of the coefficient matrices of the tensor equation is used to design the nearest Kronecker product(NKP) preconditioner,which is easy to construct and is able to accelerate the convergence of the iterative solver.Numerical experiments are presented to show good performance of the approaches.
文摘An algorithm is given for computing in a very efficient way the topology of two real algebraic plane curves defined implicitly.The authors preform a symbolic pre-processing that allows us later to execute all numerical computations in an accurate way.
