Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement...Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.展开更多
The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existi...The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existing model has two flaws:incompleteness of program refinement and inadequate automation of formal verification.This paper proposes an automatic algorithm programming model based on the improved Morgan’s refinement calculus.It extends the Morgan’s refinement calculus rules and designs the C++generation system for realizing the complete process of refinement.Meanwhile,the automation tools VCG(Verification Condition Generator)and Isabelle are used to improve the automation of formal verification.An example of a stock’s maximum income demonstrates the effectiveness of the proposed model.Furthermore,the proposed model has some relevance for automatic software generation.展开更多
To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of ...To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051)Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining.展开更多
Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel mo...Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel modelling method for a highly nonlinear system of a hydraulic excavator is presented. Based on the data collected in the excavator＇s arms driving experiments, a data-based excavator dynamic model using Simplified Refined Instrumental Variable （SRIV） identification and estimation algorithms is established. The validity of the proposed data-based model is indirectly demonstrated by the performance of computer simulation and the.real machine motion control exoeriments.展开更多
In electrical impedance tomography （EIT）, distribution of the internal resistivity or conductivity of an unknown object is esti- mated using measured boundary voltage data induced by different current patterns with ...In electrical impedance tomography （EIT）, distribution of the internal resistivity or conductivity of an unknown object is esti- mated using measured boundary voltage data induced by different current patterns with various reconstruction algorithms. The reconstruction algorithms usually employ the Newton-Raphson iteration scheme to visualize the resistivity distribution inside the object. Accuracy of the imaging process depends not only on the algorithm used, but also on the scheme of finite element discretization. In this paper an adaptive mesh refinement is used in a modified reconstruction algorithm for the regularized Err. The method has a major impact on efficient solution of the forward problem as well as on achieving improved image resolution. Computer simulations indicate that the Newton-Raphson reconstruction algorithm for Err using adaptive mesh refinement performs better than the classical Newton-Raphson algorithm in terms of reconstructed image resolution.展开更多
A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in s...A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.展开更多
基金supported by the 973 Program of China 2005CB321702China NSF 10531080.
文摘Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.
基金Supported by the National Natural Science Foundation of China(61862033,61902162)Key Project of Science and Technology Research of Department of Education of Jiangxi Province(GJJ210307)Postgraduate Innovation Fund Project of Education Department of Jiangxi Province(YC2021-S306)。
文摘The automatic algorithm programming model can increase the dependability and efficiency of algorithm program development,including specification generation,program refinement,and formal verification.However,the existing model has two flaws:incompleteness of program refinement and inadequate automation of formal verification.This paper proposes an automatic algorithm programming model based on the improved Morgan’s refinement calculus.It extends the Morgan’s refinement calculus rules and designs the C++generation system for realizing the complete process of refinement.Meanwhile,the automation tools VCG(Verification Condition Generator)and Isabelle are used to improve the automation of formal verification.An example of a stock’s maximum income demonstrates the effectiveness of the proposed model.Furthermore,the proposed model has some relevance for automatic software generation.
文摘To construct a high efficient text clustering algorithm the multilevel graph model and the refinement algorithm used in the uncoarsening phase is discussed. The model is applied to text clustering. The performance of clustering algorithm has to be improved with the refinement algorithm application. The experiment result demonstrated that the multilevel graph text clustering algorithm is available. Key words text clustering - multilevel coarsen graph model - refinement algorithm - high-dimensional clustering CLC number TP301 Foundation item: Supported by the National Natural Science Foundation of China (60173051)Biography: CHEN Jian-bin(1970-), male, Associate professor, Ph. D., research direction: data mining.
文摘Instead of establishing mathematical hydraulic system models from physical laws usually done with the problems of complex modelling processes, low reliability and practicality caused by large uncertainties, a novel modelling method for a highly nonlinear system of a hydraulic excavator is presented. Based on the data collected in the excavator＇s arms driving experiments, a data-based excavator dynamic model using Simplified Refined Instrumental Variable （SRIV） identification and estimation algorithms is established. The validity of the proposed data-based model is indirectly demonstrated by the performance of computer simulation and the.real machine motion control exoeriments.
基金Project supported by National Natural Science Foundation of China（Grant No. 60075009）
文摘In electrical impedance tomography （EIT）, distribution of the internal resistivity or conductivity of an unknown object is esti- mated using measured boundary voltage data induced by different current patterns with various reconstruction algorithms. The reconstruction algorithms usually employ the Newton-Raphson iteration scheme to visualize the resistivity distribution inside the object. Accuracy of the imaging process depends not only on the algorithm used, but also on the scheme of finite element discretization. In this paper an adaptive mesh refinement is used in a modified reconstruction algorithm for the regularized Err. The method has a major impact on efficient solution of the forward problem as well as on achieving improved image resolution. Computer simulations indicate that the Newton-Raphson reconstruction algorithm for Err using adaptive mesh refinement performs better than the classical Newton-Raphson algorithm in terms of reconstructed image resolution.
文摘A complete mesh free adaptive algorithm （MFAA）, with solution adaptation and geometric adaptation, is developed to improve the resolution of flow features and to replace traditional global refinement techniques in structured grids. Unnecessary redundant points and elements are avoided by using the mesh free local clouds refinement technology in shock influencing regions and regions near large curvature places on the boundary. Inviscid compressible flows over NACA0012 and RAE2822 airfoils are computed. Finally numerical results validate the accuracy of the above method.
