The LU factorization (LUF) algorithm is an important kernel used in many Linear Algebra applications such as the resolution of systems of linear equations, the inversion of square matrices and the computation of matri...
详细信息
ISBN:
(纸本)9781538635810
The LU factorization (LUF) algorithm is an important kernel used in many Linear Algebra applications such as the resolution of systems of linear equations, the inversion of square matrices and the computation of matrix eigenvalues. It is also used in the LINPACK benchmark for ranking the Top 500 most powerful supercomputers. We propose in this paper a parallel recursive algorithm for LUF based on the 'Divide and Conquer' paradigm. A theoretical performance study permits to establish an accurate comparison between the designed algorithm and the PBLAS library. We achieved a series of experiments that permits to validate the contribution and lead to efficient performances obtained for large sized matrices i.e. up to 40% faster than SCALAPACK.
With more and more governments and organizations taking Carbon Footprint as the measure of greenhouse gas emission, the study about the calculation of carbon footprint has become a hot spot. The paper analyzed the car...
详细信息
ISBN:
(纸本)9783037857502
With more and more governments and organizations taking Carbon Footprint as the measure of greenhouse gas emission, the study about the calculation of carbon footprint has become a hot spot. The paper analyzed the carbon footprint in different stages of a product life circle, including manufacturing, transporting, using and disposing and also studied the part contributing the largest carbon emission. Especially in the calculation of carbon emission of manufacturing stage, recursive call algorithm was applied. The optimization design model of carbon footprint was also depicted. All the work this paper had undertaken facilitates to formulate specific carbon emission reduction measures.
It is proposed the recursive generator of complex samples of the linear chirp. The generator is characterized by minimum possible memory size and the minimum time of tuning.
ISBN:
(纸本)9781509022212
It is proposed the recursive generator of complex samples of the linear chirp. The generator is characterized by minimum possible memory size and the minimum time of tuning.
Aiming at the problem of quantitative inertia evaluation of new energy electric power system, the system inertia constant tracking method based on system identification is studied. The method is divided into two categ...
详细信息
In this paper a recursive closed-loop PARSIMonious subspace identification method using modified innovation Estimation (PARSIM-E) is proposed, which can significantly improve computational efficiency for practical app...
详细信息
In this paper a recursive closed-loop PARSIMonious subspace identification method using modified innovation Estimation (PARSIM-E) is proposed, which can significantly improve computational efficiency for practical application. By recursively updating the product of the extended observability and controllability matrices, the non-causal parameters included in the triangular Toeplitz matrices are left out to avoid redundant estimation. A propagator is used to extract the system state in order to estimate the system matrices. The convergence of the proposed method is analyzed with a strict proof. Two illustrative examples arc given to demonstrate the effectiveness of proposed algorithm. (C) 2015, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.
Pointing to the optimization layout problem of irregular parts on the rectangular area, this paper proposes a kind of the combined algorithm, which is based on the scan line algorithm and the pre-layout method. The ma...
详细信息
This paper compares the quality of standardly used ON-LINE identification algorithms like directional forgetting and regularized exponential forgetting with the hybrid algorithm of exponential forgetting with an alter...
详细信息
Based on the image method and addition theorem of spherical vector wave functions, a solution to the multiple scattering by a buried concentric spheres is *** iterative process to obtain the scattered field is discuss...
详细信息
ISBN:
(纸本)9781728181813
Based on the image method and addition theorem of spherical vector wave functions, a solution to the multiple scattering by a buried concentric spheres is *** iterative process to obtain the scattered field is discussed in this paper by using boundary conditions on the boundary between the free space and the buried area, inner and outer spheres of the concentric spheres, respectively.
The reliability assessment of generation system including photovoltaic energy has been described in this article. In general, the reliability analysis of power system can be done at three Hierarchical Levels, but here...
详细信息
ISBN:
(纸本)9789811043949;9789811043932
The reliability assessment of generation system including photovoltaic energy has been described in this article. In general, the reliability analysis of power system can be done at three Hierarchical Levels, but here the reliability analysis of power system is performed at generation level. Therefore the reliability is accomplished at Hierarchical Level-I (HL-I). The intermittent nature of solar irradiance and failure rate of the components have been considered for the development of photovoltaic system. The annual solar data has been considered, in which the generation from the photovoltaic system is made into different states using Fuzzy C-Means clustering method. In addition, the Markov process has been implemented not only to obtain the probability of the photovoltaic model but also its frequency and duration for all the specified states. Finally, the recursive algorithm is used to evaluate the indices of the reliability for Roy Billinton Test System including photovoltaic unit.
If the labeling values of edges and vertexs for a graph G(p, q) are mapped to 1, 2, , p+q, and the sum of the labels of any two vertexs and their associated edges is equal to a constant, this labeling is called edge-m...
详细信息
暂无评论