An efficient radial basis functions mesh deformation with greedy algorithm based on recurrence Choleskey decomposition and parallel computing

Fang, Hong; Hu, Yikun; Yu, Caihui; Tie, Ming; Liu, Jie; Gong, Chunye

doi:10.1016/j.jcp.2018.10.029

Cited by 16 publications

(7 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of parallel computerized models is the LSTM model. Parallel computing is a type of computation in which various process calculations can be carried out simultaneously, while the application of parallel computing can run algorithm more quickly in the appearance of the model used in this study [15], [16]. Based on that study, we choose parallel computing models to researched more deeply.…”

Section: Lstm Modelmentioning

confidence: 99%

Measuring the accuracy of LSTM and BiLSTM models in the application of artificial intelligence by applying chatbot programme

Anki

Bustamam²

2021

IJEECS

View full text Add to dashboard Cite

Python programme contains a question and answer system that derived from data sets that have used and implemented the chatbot in this modern era. where the data collected is in the form of corpuses containing extensive metadata-rich fictional conversations derived from extracted film scripts, commonly called cornell movie dialogue corpus. The various models have been used chatbots in python programmes, and LSTM and BiLSTM models were specifically used in this study. Where the form of accuracy will be reported as a result of the implementation of LSTM and BiLSTM models in the chatbot programme. The programme performance will be influenced by the data from the model selection, because the level of accuracy is determined by the target programme being taken. So this is the main factor that determines which model to choose. Based on considerations required for choosing the programme model, in the end the LSTM and the BiLSTM models are chosen and will be applied to the programme. Based on the LSTM and BiLSTM chatbot programmes that have been tested, it can be concluded that the best parameters come from a pair of BiLSTM chatbots using the BiLTSM model with an average accuracy value of 0.995217.

show abstract

Section: Lstm Modelmentioning

confidence: 99%

Measuring the accuracy of LSTM and BiLSTM models in the application of artificial intelligence by applying chatbot programme

Anki

Bustamam²

2021

IJEECS

View full text Add to dashboard Cite

show abstract

“…The spring analogy method [10,11] is a typical one of connectivity methods. The idea of the spring analogy method is to create a network of springs connecting all nodes in the mesh and the stiffness of springs is inversely proportional to the edge length [12]. The whole mesh can be viewed as a spring system.…”

Section: Introductionmentioning

confidence: 99%

“…Although several strategies have been introduced to improve the ability of the spring analogy method [15][16][17], it is still difficult to guarantee both high efficiency and applicability. In the other classification of the node-based method, each node can be modified independently to its adjacent nodes, and then the deformation of mesh can be adjusted indiscriminately [12]. This method allows for large deformation and does not require connectivity information between mesh nodes.…”

Section: Introductionmentioning

confidence: 99%

Mapping Based Quality Metrics for Mesh Deformation Algorithms Using Radial Basis Functions

Xie

Jia

Li³

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

The mesh deformation method based on radial basis functions is widely used in computational fluid dynamics (CFD) simulation with a moving boundary. The traditional method for generating CFD mesh quality metrics called mesh-based metrics use the information of deformed mesh with specific element node coordinates and a connectivity relationship. This paper develops a new mesh quality, metric evaluating method based on the mapping process between the initial and deformed mesh, which is named mapping-based metrics. Mapping-based metrics are evaluated based on the conception of the deformation principle in continuum mechanics. This method provides a new point for mesh quality evaluation without requirements of deformed mesh coordinates and element connectivity information. Three test cases show that, comparing with indirectly solving by a geometrical method, mapping-based metrics accurately reveal the changes of the angle and area over the whole deformed domain. Additionally, the mapping-based metrics give high applicability to the quality of deformed mesh compared to mesh-based metrics. The quality evaluation method for CFD mesh proposed in this paper is effective.

show abstract

“…Based on it, Selim et al [20] presented an improvement method of lower-upper (LU) decomposition. Afterwards, Fang et al [21] provided an effective method based on recurrence Choleskey decomposition. In addition, in 2017, Kedward et al [22] proposed a form of data reduction that still includes all the points.…”

Section: Introductionmentioning

confidence: 99%

“…Then, Rendall et al [24] proposed a parallel approach applied in multi-bladed rotors. In addition, Li et al [17] and Fang et al [21] proposed parallel computation methods based on the master-slave architecture.…”

Section: Introductionmentioning

confidence: 99%

A Block Iteration with Parallelization Method for the Greedy Selection in Radial Basis Functions Based Mesh Deformation

Zhao

Guo

et al. 2019

Applied Sciences

View full text Add to dashboard Cite

Greedy algorithm is one of the important point selection methods in the radial basis function based mesh deformation. However, in large-scale mesh, the conventional greedy selection will generate expensive time consumption and result in performance penalties. To accelerate the computational procedure of the point selection, a block iteration with parallelization method is proposed in this paper. By the block iteration method, the computational complexities of three steps in the greedy selection are all reduced from O ( n 3 ) to O ( n 2 ) . In addition, the parallelization of two steps in the greedy selection separates boundary points into sub-cores, efficiently accelerating the procedure. Specifically, three typical models of three-dimensional undulating fish, ONERA M6 wing and three-dimensional Super-cavitating Hydrofoil are taken as the test cases to validate the proposed method and the results show that it improves 17.41 times performance compared to the conventional method.

show abstract

An efficient radial basis functions mesh deformation with greedy algorithm based on recurrence Choleskey decomposition and parallel computing

Cited by 16 publications

References 40 publications

Measuring the accuracy of LSTM and BiLSTM models in the application of artificial intelligence by applying chatbot programme

Measuring the accuracy of LSTM and BiLSTM models in the application of artificial intelligence by applying chatbot programme

Mapping Based Quality Metrics for Mesh Deformation Algorithms Using Radial Basis Functions

A Block Iteration with Parallelization Method for the Greedy Selection in Radial Basis Functions Based Mesh Deformation

Contact Info

Product

Resources

About