scholarly journals Efficient and Memory Saving Method Based on Pseudoskeleton Approximation for Analysis of Finite Periodic Structures

2018 ◽  
Vol 2018 ◽  
pp. 1-6
Author(s):  
Chunbei Luo ◽  
Yong Zhang ◽  
Hai Lin

An efficient and memory saving method based on pseudoskeleton approximation (PSA) is presented for the effective and accurate analysis of finite periodic structures. Different from the macro basis function analysis model, our proposed method uses the formulations derived by the local Rao-Wilton-Glisson basis functions. PSA is not only used to accelerate the matrix-vector product (MVP) inside the single unit but also adopted to decrease the calculation burden of the coupling between the different cells. Moreover, the number of decomposed coupling matrices is minimized due to the displacement invariance of the periodic property. Consequently, even compared with the multilevel fast multipole algorithm (MLFMA), the new method saves much more memory resources and computation time, which is also demonstrated by the numerical examples.

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Yao Han ◽  
Hanru Shao ◽  
Jianfeng Dong

An improved generalized single-source tangential equivalence principle algorithm (GSST-EPA) is proposed for analyzing array structures with connected elements. In order to use the advantages of GSST-EPA, the connected array elements are decomposed and computed by a contact-region modeling (CRM) method, which makes that each element has the same meshes. The unknowns of elements can be transferred onto the equivalence surfaces by GSST-EPA. The scattering matrix in GSST-EPA needs to be solved and stored only once due to the same meshes for each element. The shift invariant of translation matrices is also used to reduce the computation of near-field interaction. Furthermore, the multilevel fast multipole algorithm (MLFMA) is used to accelerate the matrix-vector multiplication in the GSST-EPA. Numerical results are shown to demonstrate the accuracy and efficiency of the proposed method.


2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Qin Su ◽  
Yingyu Liu ◽  
Xunwang Zhao ◽  
Zongjing Gu ◽  
Chang Zhai ◽  
...  

In this paper, a parallel nonoverlapping and nonconformal domain decomposition method (DDM) is proposed for fast and accurate analysis of electrically large objects in the condition of limited resources. The formulation of nonoverlapping DDM for PEC bodies is derived from combined-field integral equation (CFIE), and an explicit boundary condition is applied to ensure the continuity of electric currents across the boundary. A parallel multilevel fast multipole algorithm (MLFMA) is extended to accelerate matrix-vector multiplications of subdomains as well as the coupling between them, and the coupling between different subdomains is computed in the manner of near field to avoid the storage of the mutual impedance. An improved adaptive direction partitioning scheme is applied to the oct-tree of MLFMA to achieve high parallel efficiency. Numerical examples demonstrate that the proposed method is able to simulate realistic problems with a maximum dimension greater than 2000 wavelengths.


2020 ◽  
Vol 11 (1) ◽  
pp. 148
Author(s):  
Mingjie Pang ◽  
Han Wang ◽  
Hai Lin

A hybrid technique combining the multi-level fast multipole algorithm (MLFMA) and the modified adaptive division beam tracing (MADBT) is presented to analyze the radiation patterns of the antennas mounted on large-scale complex platforms. In this technique, the MLFMA is used to characterize the antenna and the transition region that cannot be analyzed accurately by high-frequency asymptotic methods. The MADBT method is used to analyze the contribution of the platforms to the entire radiation pattern by tracing all beams effectively. By applying the beam-based MADBT method instead of the conventional current-based physical optics (PO) method to the platforms, the multi-bounce effects inside the platforms are considered, which enhances the accuracy of the radiation patterns, especially for the complex platforms with corner reflector. An iteration method is proposed to model the interaction between the antennas and the platforms strictly. The proposed iterative MLFMA-MADBT method is mesh-independent and can avoid the matrix-vector production (MVP) of the iterative MLFMA-PO method in each iteration. These characters significantly reduce the memory and time consumption in computation while keeping high accuracy. Numerical results are presented to demonstrate the accuracy and efficiency of the proposed hybrid technique.


2020 ◽  
Author(s):  
John Stevenson

We study numerically the electromagnetic scattering properties of three dimensional (3D),arbitrary shaped composite dielectric metamaterials. Using integral equation techniques, we firstderive a surface integral equation formulation which produces well-conditioned matrix equation.To solve the obtained integral equations, we apply a Galerkin scheme and choose the basis andtesting functions as Rao-Wilton-Glisson defined on planar patches. We then develop an algorithmto speed up the matrix-vector multiplications by employing the well-known method of moments(MoM) and the multilevel fast multipole algorithm on personal computer (PC) clusters. Some 3Dnumerical examples are presented to demonstrate the validity and accuracy of the proposedapproach.


Open Physics ◽  
2020 ◽  
Vol 18 (1) ◽  
pp. 751-760
Author(s):  
Lei Lei

AbstractTraditional testing algorithm based on pattern matching is impossible to effectively analyze the heat transfer performance of heat pipes filled with different concentrations of nanofluids, so the testing algorithm for heat transfer performance of a nanofluidic heat pipe based on neural network is proposed. Nanofluids are obtained by weighing, preparing, stirring, standing and shaking using dichotomy. Based on this, the heat transfer performance analysis model of the nanofluidic heat pipe based on artificial neural network is constructed, which is applied to the analysis of heat transfer performance of nanofluidic heat pipes to achieve accurate analysis. The experimental results show that the proposed algorithm can effectively analyze the heat transfer performance of heat pipes under different concentrations of nanofluids, and the heat transfer performance of heat pipes is best when the volume fraction of nanofluids is 0.15%.


Author(s):  
Ernesto Dufrechou ◽  
Pablo Ezzatti ◽  
Enrique S Quintana-Ortí

More than 10 years of research related to the development of efficient GPU routines for the sparse matrix-vector product (SpMV) have led to several realizations, each with its own strengths and weaknesses. In this work, we review some of the most relevant efforts on the subject, evaluate a few prominent routines that are publicly available using more than 3000 matrices from different applications, and apply machine learning techniques to anticipate which SpMV realization will perform best for each sparse matrix on a given parallel platform. Our numerical experiments confirm the methods offer such varied behaviors depending on the matrix structure that the identification of general rules to select the optimal method for a given matrix becomes extremely difficult, though some useful strategies (heuristics) can be defined. Using a machine learning approach, we show that it is possible to obtain unexpensive classifiers that predict the best method for a given sparse matrix with over 80% accuracy, demonstrating that this approach can deliver important reductions in both execution time and energy consumption.


Interest in computer-assisted image analysis in increasing among the radiologist as it provides them the additional information to take decision and also for better disease diagnosis. Traditionally, MR image is manually examined by medical practitioner through naked eye for the detection and diagnosis of tumor location, size, and intensity; these are difficult and not sufficient for accurate analysis and treatment. For this purpose, there is need for additional automated analysis system for accurate detection of normal and abnormal tumor region. This paper introduces the new semi-automated image processing method to identify the brain tumor region in Magnetic Resonance Image (MRI) using c means clustering technique along with meta-heuristic optimization, based on Jaya optimization algorithm. The resultant performance of the proposed algorithm (FCM +JA) is examined with the help of key analyzing parameters, MSE-Mean Square Error, PSNR-Peak Signal to Noise Ratio, DOI-Dice Overlap Index and CPU memory utilization. The experimental results of this method show better and enhanced tumor region display in reduced computation time.


2003 ◽  
Vol 19 (2) ◽  
pp. 319-326 ◽  
Author(s):  
Lai-Yun Wu ◽  
Yang-Tzung Chen

ABSTRACTIn this paper, spline collocation method (SCM) is successfully extended to solve the generalized problems of beam structures. The spline functions in SCM are re-formulated by finite difference method in a systematical way that is easily understood by engineers. The manipulation of SCM is further simplified by the introduction of quintic table so that the matrix-vector governing equation can be easily formulated to solve the weighting coefficients. SCM is first examined by the problems of a generalized single-span beam undergoing various types of loadings and boundary conditions, and it is then extended to the problems of continuous beam with multiple spans. By comparing with available analytical results, differential quadrature method (DQM), if any, excellent accuracy in deflection is achieved.


Author(s):  
Chaojian Chen ◽  
Mikhail Kruglyakov ◽  
Alexey Kuvshinov

Summary Most of the existing three-dimensional (3-D) electromagnetic (EM) modeling solvers based on the integral equation (IE) method exploit fast Fourier transform (FFT) to accelerate the matrix-vector multiplications. This in turn requires a laterally-uniform discretization of the modeling domain. However, there is often a need for multi-scale modeling and inversion, for instance, to properly account for the effects of non-uniform distant structures, and at the same time, to accurately model the effects from local anomalies. In such scenarios, the usage of laterally-uniform grids leads to excessive computational loads, both in terms of memory and time. To alleviate this problem, we developed an efficient 3-D EM modeling tool based on a multi-nested IE approach. Within this approach, the IE modeling is first performed at a large domain and on a (laterally-uniform) coarse grid, and then the results are refined in the region of interest by performing modeling at a smaller domain and on a (laterally-uniform) denser grid. At the latter stage, the modeling results obtained at the previous stage are exploited. The lateral uniformity of the grids at each stage allows us to keep using the FFT for the matrix-vector multiplications. An important novelty of the paper is a development of a “rim domain” concept which further improves the performance of the multi-nested IE approach. We verify the developed tool on both idealized and realistic 3-D conductivity models, and demonstrate its efficiency and accuracy.


Sign in / Sign up

Export Citation Format

Share Document