A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative met...A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative method in an interface problem is improved by increasing an accuracy of a solution of an iterative method of a subdomain problem.However,it is difficult to improve the convergence by using a small convergence criterion in the subdomain problem.Therefore,authors propose a method to introduce double-double precision into the interface problem and the subdomain problem.This proposed method improves the convergence of the interface problem.In this paper,first,we describe proposed method.Second,we confirm validity of the method by using Team Workshop Problem 7,standard model for eddy current analysis.Finally,we show effectiveness of the method from two numerical results.展开更多
In this paper,we present a phase multiplication algorithm(PMA)to obtain scalable fringe precision in laser self-mixing interferometer under a weak feedback regime.Merely by applying the double angle formula on the sel...In this paper,we present a phase multiplication algorithm(PMA)to obtain scalable fringe precision in laser self-mixing interferometer under a weak feedback regime.Merely by applying the double angle formula on the self-mixing signal multiple times,the continuously improved fringe precision will be obtained.Theoretical analysis shows that the precision of the fringe could be improved toλ/2^(n+1).The validity of the proposed method is demonstrated by means of simulated SMI signals and confirmed by experiments under different amplitudes.A fringe precision ofλ/128 at a sampling rate of 500 k S/s has been achieved after doing 6 th the PMA.Finally,an amplitude of 50 nm has been proved to be measurable and the absolute error is 3.07 nm,which is within the theoretical error range.The proposed method for vibration measurement has the advantage of high accuracy and reliable without adding any additional optical elements in the optical path,thus it will play an important role in nanoscale measurement field.展开更多
To evaluate the performance of real time kinematic (RTK) network algorithms without applying actual measurements, a new method called geometric precision evaluation methodology (GPEM) based on covariance analysis was ...To evaluate the performance of real time kinematic (RTK) network algorithms without applying actual measurements, a new method called geometric precision evaluation methodology (GPEM) based on covariance analysis was presented. Three types of multiple reference station interpolation algorithms, including partial derivation algorithm (PDA), linear interpolation algorithms (LIA) and least squares condition (LSC) were discussed and analyzed. The geometric dilution of precision (GDOP) was defined to describe the influence of the network geometry on the interpolation precision, and the different GDOP expressions of above-mentioned algorithms were deduced. In order to compare geometric precision characteristics among different multiple reference station network algorithms, a simulation was conducted, and the GDOP contours of these algorithms were enumerated. Finally, to confirm the validation of GPEM, an experiment was conducted using data from Unite State Continuously Operating Reference Stations (US-CORS), and the precision performances were calculated according to the real test data and GPEM, respectively. The results show that GPEM generates very accurate estimation of the performance compared to the real data test.展开更多
This paper presents a new method of improving Global Positioning System(GPS)positioning precision. Based on the altitude hold mode, the method does not need any other equipment. Under this constraint condition, the To...This paper presents a new method of improving Global Positioning System(GPS)positioning precision. Based on the altitude hold mode, the method does not need any other equipment. Under this constraint condition, the Total Least Squares(TLS) algorithm is used to prove that the method is effective. Theoretical analysis shows that the algorithm can significantly improve the GPS positioning precision.展开更多
This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using prec...This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.展开更多
The paper combines a self-adaptive precise algorithm in the time domain with Meshless Element Free Galerkin Method （EFGM） for solving viscoelastic problems with rotationally periodic symmetry. By expanding variables...The paper combines a self-adaptive precise algorithm in the time domain with Meshless Element Free Galerkin Method （EFGM） for solving viscoelastic problems with rotationally periodic symmetry. By expanding variables at a discretized time interval, the variations of variables can be described more precisely, and iteration is not required for non-linear cases. A space-time domain coupled problem with initial and boundary values can be converted into a series of linear recursive boundary value problems, which are solved by a group theory based on EFGM. It has been proved that the coefficient matrix of the global EFG equation for a rotationally periodic system is block-circulant so long as a kind of symmetry-adapted reference coordinate system is adopted, and then a partitioning algorithm for facilitating parallel processing was proposed via a completely orthogonal group transformation. Therefore instead of solving the original system, only a series of independent small sub-problems need to be solved, leading to computational convenience and a higher computing efficiency. Numerical examples are given to illustrate the full advantages of the proposed algorithm.展开更多
By modeling direct transient heat conduction problems via finite element method (FEM) and precise integral algorithm, a new approach is presented to solve transient inverse heat conduction problems with multi-variable...By modeling direct transient heat conduction problems via finite element method (FEM) and precise integral algorithm, a new approach is presented to solve transient inverse heat conduction problems with multi-variables. Firstly, the spatial space and temporal domain are discretized by FEM and precise integral algorithm respectively. Then, the high accuracy semi-analytical solution of direct problem can be got. Finally, based on the solution, the computing model of inverse problem and expression of sensitivity analysis are established. Single variable and variables combined identifications including thermal parameters, boundary conditions and source-related terms etc. are given to validate the approach proposed in 1-D and 2-D cases. The effects of noise data and initial guess on the results are investigated. The numerical examples show the effectiveness of this approach.展开更多
Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integratio...Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solution. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithra and the second term is computed by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms.展开更多
In order to find stable, accurate, and computationally efficient methods for performing the inverse Laplace transform, a new double transformation approach is proposed. To validate and improve the inversion solution o...In order to find stable, accurate, and computationally efficient methods for performing the inverse Laplace transform, a new double transformation approach is proposed. To validate and improve the inversion solution obtained using the Gaver-Stehfest algorithm, direct Laplace transforms are taken of the numerically inverted transforms to compare with the original function. The numerical direct Laplace transform is implemented with a composite Simpson’s rule. Challenging numerical examples involving periodic and oscillatory functions, are investigated. The numerical examples illustrate the computational accuracy and efficiency of the direct Laplace transform and its inverse due to increasing the precision level and the number of terms included in the expansion. It is found that the number of expansion terms and the precision level selected must be in a harmonious balance in order for correct and stable results to be obtained.展开更多
To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convo...To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convolution architecture built on a field-programmable gate array using integer multipliers and addition trees is used.With the help of the Winograd algorithm,the optimization of convolution and multiplication is realized to reduce the computational complexity.The LUT-based operator is further optimized to construct a processing unit(PE).Simultaneously optimized storage streams improve memory access efficiency and solve bandwidth constraints.The data toggle rate is reduced to optimize power consumption.The experimental results show that the use of the Winograd algorithm to build basic processing units can significantly reduce the number of multipliers and achieve hardware deployment acceleration,while the time-division multiplexing of processing units improves resource utilization.Under this experimental condition,compared with the traditional convolution method,the architecture optimizes computing resources by 2.25 times and improves the peak throughput by 19.3 times.The LUT-based Winograd accelerator can effectively solve the deployment problem caused by limited hardware resources.展开更多
The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance...The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance of the NBMCPA under varying sample sizes and locations of true change points. Various performance metrics are calculated based on the change point estimates and used to assess how well the model correctly identifies change points. Errors in estimation of change points are obtained as absolute deviations of known change points from the change points estimated under the algorithm. Algorithm robustness is evaluated through error analysis and visualization techniques including kernel density estimation and computation of metrics such as change point location accuracy, precision, sensitivity and false positive rate. The results show that the model consistently detects change points that are present and does not erroneously detect changes where there are none. Change point location accuracy and precision of the NBMCPA increases with sample size, with best results for medium and large samples. Further model accuracy and precision are highest for changes located in the middle of the dataset compared to changes located in the periphery.展开更多
利用中国区域2023年夏季945个地基全球导航卫星系统(GNSS)测站的观测数据,分别采用双差网解法与精密单点定位法(Precise Point Positioning,PPP)对大气可降水量(Precipitable Water Vapor,PWV)进行了反演,以同址探空站和ERA5再分析资料...利用中国区域2023年夏季945个地基全球导航卫星系统(GNSS)测站的观测数据,分别采用双差网解法与精密单点定位法(Precise Point Positioning,PPP)对大气可降水量(Precipitable Water Vapor,PWV)进行了反演,以同址探空站和ERA5再分析资料的PWV为参考值,研究分析了两种方法在中国不同气候区域反演PWV的精度及稳定性特征。结果表明:与PPP解相比,双差解与探空和ERA5资料的PWV的相关性更强,偏差(Bias)频率分布更集中,峰值区概率更高,偏差范围更小。以探空资料获取的RS-PWV为参考值时,双差解与PPP解的平均Bias分别为-0.1 mm和1.1 mm,平均均方根误差(RMSE)分别为2.4 mm和3.1 mm,以ERA5-PWV为参考值时,双差解与PPP解的平均Bias分别为-0.2 mm和0.1 mm,平均RMSE分别为2.7 mm和3.2 mm,双差解的平均RMSE均小于3 mm,这表明双差网解法反演的PWV具有更高的精度和稳定性。GNSS探测水汽的精度总体表现为西部非季风区优于东部季风区,双差解在各气候区域的RMSE都更集中于中位数附近,而PPP解在不同测站多表现出不同的精度水平,在水汽充足且探测精度偏低的温带和亚热带季风气候区域精度离散程度较大,具有较强的不稳定性。展开更多
文摘A matrix equation solved in an eddy current analysis,??-??method based on a domain decomposition method becomes a complex symmetric system.In general,iterative method is used as the solver.Convergence of iterative method in an interface problem is improved by increasing an accuracy of a solution of an iterative method of a subdomain problem.However,it is difficult to improve the convergence by using a small convergence criterion in the subdomain problem.Therefore,authors propose a method to introduce double-double precision into the interface problem and the subdomain problem.This proposed method improves the convergence of the interface problem.In this paper,first,we describe proposed method.Second,we confirm validity of the method by using Team Workshop Problem 7,standard model for eddy current analysis.Finally,we show effectiveness of the method from two numerical results.
基金supported by the Natural Science Foundation of Fujian Province(No.2020J01705)the School Foundation of Jimei University(No.C150345)。
文摘In this paper,we present a phase multiplication algorithm(PMA)to obtain scalable fringe precision in laser self-mixing interferometer under a weak feedback regime.Merely by applying the double angle formula on the self-mixing signal multiple times,the continuously improved fringe precision will be obtained.Theoretical analysis shows that the precision of the fringe could be improved toλ/2^(n+1).The validity of the proposed method is demonstrated by means of simulated SMI signals and confirmed by experiments under different amplitudes.A fringe precision ofλ/128 at a sampling rate of 500 k S/s has been achieved after doing 6 th the PMA.Finally,an amplitude of 50 nm has been proved to be measurable and the absolute error is 3.07 nm,which is within the theoretical error range.The proposed method for vibration measurement has the advantage of high accuracy and reliable without adding any additional optical elements in the optical path,thus it will play an important role in nanoscale measurement field.
基金Project(61273055) supported by the National Natural Science Foundation of ChinaProject(CX2010B012) supported by Hunan Provincial Innovation Foundation for Postgraduate Students, ChinaProject(B100302) supported by Innovation Foundation for Postgraduate Students of National University of Defense Technology, China
文摘To evaluate the performance of real time kinematic (RTK) network algorithms without applying actual measurements, a new method called geometric precision evaluation methodology (GPEM) based on covariance analysis was presented. Three types of multiple reference station interpolation algorithms, including partial derivation algorithm (PDA), linear interpolation algorithms (LIA) and least squares condition (LSC) were discussed and analyzed. The geometric dilution of precision (GDOP) was defined to describe the influence of the network geometry on the interpolation precision, and the different GDOP expressions of above-mentioned algorithms were deduced. In order to compare geometric precision characteristics among different multiple reference station network algorithms, a simulation was conducted, and the GDOP contours of these algorithms were enumerated. Finally, to confirm the validation of GPEM, an experiment was conducted using data from Unite State Continuously Operating Reference Stations (US-CORS), and the precision performances were calculated according to the real test data and GPEM, respectively. The results show that GPEM generates very accurate estimation of the performance compared to the real data test.
文摘This paper presents a new method of improving Global Positioning System(GPS)positioning precision. Based on the altitude hold mode, the method does not need any other equipment. Under this constraint condition, the Total Least Squares(TLS) algorithm is used to prove that the method is effective. Theoretical analysis shows that the algorithm can significantly improve the GPS positioning precision.
文摘This paper presents a finite element procedure for solving transient, multidimensional convection-diffusion equations. The procedure is based on the characteristic Galerkin method with an implicit algorithm using precise integration method. With the operator splitting procedure, the precise integration method is introduced to determine the material derivative in the convection-diffusion equation, consequently, the physical quantities of material points. An implicit algorithm with a combination of both the precise and the traditional numerical integration procedures in time domain in the Lagrange coordinates for the characteristic Galerkin method is formulated. The stability analysis of the algorithm shows that the unconditional stability of present implicit algorithm is enhanced as compared with that of the traditional implicit numerical integration procedure. The numerical results validate the presented method in solving convection-diffusion equations. As compared with SUPG method and explicit characteristic Galerkin method, the present method gives the results with higher accuracy and better stability.
基金The project supported by the National Natural Science Foundation of China （10421002. 10472019 and 10172024） NKBRSF （2005CB321704） and the Fund of Disciplines Leaders of Young and Middle Age Faculty in Colleges of Liaoning Province. The English text was polished by Yunming Chen.
文摘The paper combines a self-adaptive precise algorithm in the time domain with Meshless Element Free Galerkin Method （EFGM） for solving viscoelastic problems with rotationally periodic symmetry. By expanding variables at a discretized time interval, the variations of variables can be described more precisely, and iteration is not required for non-linear cases. A space-time domain coupled problem with initial and boundary values can be converted into a series of linear recursive boundary value problems, which are solved by a group theory based on EFGM. It has been proved that the coefficient matrix of the global EFG equation for a rotationally periodic system is block-circulant so long as a kind of symmetry-adapted reference coordinate system is adopted, and then a partitioning algorithm for facilitating parallel processing was proposed via a completely orthogonal group transformation. Therefore instead of solving the original system, only a series of independent small sub-problems need to be solved, leading to computational convenience and a higher computing efficiency. Numerical examples are given to illustrate the full advantages of the proposed algorithm.
文摘By modeling direct transient heat conduction problems via finite element method (FEM) and precise integral algorithm, a new approach is presented to solve transient inverse heat conduction problems with multi-variables. Firstly, the spatial space and temporal domain are discretized by FEM and precise integral algorithm respectively. Then, the high accuracy semi-analytical solution of direct problem can be got. Finally, based on the solution, the computing model of inverse problem and expression of sensitivity analysis are established. Single variable and variables combined identifications including thermal parameters, boundary conditions and source-related terms etc. are given to validate the approach proposed in 1-D and 2-D cases. The effects of noise data and initial guess on the results are investigated. The numerical examples show the effectiveness of this approach.
基金the National Natural Science Foundation of China(No.60273048).
文摘Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solution. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithra and the second term is computed by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms.
文摘In order to find stable, accurate, and computationally efficient methods for performing the inverse Laplace transform, a new double transformation approach is proposed. To validate and improve the inversion solution obtained using the Gaver-Stehfest algorithm, direct Laplace transforms are taken of the numerically inverted transforms to compare with the original function. The numerical direct Laplace transform is implemented with a composite Simpson’s rule. Challenging numerical examples involving periodic and oscillatory functions, are investigated. The numerical examples illustrate the computational accuracy and efficiency of the direct Laplace transform and its inverse due to increasing the precision level and the number of terms included in the expansion. It is found that the number of expansion terms and the precision level selected must be in a harmonious balance in order for correct and stable results to be obtained.
基金The Academic Colleges and Universities Innovation Program 2.0(No.BP0719013)。
文摘To solve the hardware deployment problem caused by the vast demanding computational complexity of convolutional layers and limited hardware resources for the hardware network inference,a look-up table(LUT)-based convolution architecture built on a field-programmable gate array using integer multipliers and addition trees is used.With the help of the Winograd algorithm,the optimization of convolution and multiplication is realized to reduce the computational complexity.The LUT-based operator is further optimized to construct a processing unit(PE).Simultaneously optimized storage streams improve memory access efficiency and solve bandwidth constraints.The data toggle rate is reduced to optimize power consumption.The experimental results show that the use of the Winograd algorithm to build basic processing units can significantly reduce the number of multipliers and achieve hardware deployment acceleration,while the time-division multiplexing of processing units improves resource utilization.Under this experimental condition,compared with the traditional convolution method,the architecture optimizes computing resources by 2.25 times and improves the peak throughput by 19.3 times.The LUT-based Winograd accelerator can effectively solve the deployment problem caused by limited hardware resources.
文摘The Negative Binomial Multiple Change Point Algorithm is a hybrid change detection and estimation approach that works well for overdispersed and equidispersed count data. This simulation study assesses the performance of the NBMCPA under varying sample sizes and locations of true change points. Various performance metrics are calculated based on the change point estimates and used to assess how well the model correctly identifies change points. Errors in estimation of change points are obtained as absolute deviations of known change points from the change points estimated under the algorithm. Algorithm robustness is evaluated through error analysis and visualization techniques including kernel density estimation and computation of metrics such as change point location accuracy, precision, sensitivity and false positive rate. The results show that the model consistently detects change points that are present and does not erroneously detect changes where there are none. Change point location accuracy and precision of the NBMCPA increases with sample size, with best results for medium and large samples. Further model accuracy and precision are highest for changes located in the middle of the dataset compared to changes located in the periphery.
