scholarly journals A fast algorithm for three-dimensional interpretations ofsingle-well electromagnetic data

2004 ◽  
Author(s):  
Hung-Wen Tseng ◽  
Ki Ha Lee
Keyword(s):  
Fast Algorithm ◽  
Three Dimensional ◽  
Electromagnetic Data

Fast algorithm for the three-dimensional Poisson equation in infinite domains

2020 ◽  
Author(s):  
Chunxiong Zheng ◽  
Xiang Ma
Keyword(s):  
Poisson Equation ◽  
Fast Algorithm ◽  
Root Function ◽  
Computational Cost ◽  
Three Dimensional ◽  
Chebyshev Approximation ◽  
Laplacian Operator ◽  
Square Root ◽  
Infinite Domain ◽  
Infinite Domains

Abstract This paper is concerned with a fast finite element method for the three-dimensional Poisson equation in infinite domains. Both the exterior problem and the strip-tail problem are considered. Exact Dirichlet-to-Neumann (DtN)-type artificial boundary conditions (ABCs) are derived to reduce the original infinite-domain problems to suitable truncated-domain problems. Based on the best relative Chebyshev approximation for the square-root function, a fast algorithm is developed to approximate exact ABCs. One remarkable advantage is that one need not compute the full eigensystem associated with the surface Laplacian operator on artificial boundaries. In addition, compared with the modal expansion method and the method based on Pad$\acute{\textrm{e}}$ approximation for the square-root function, the computational cost of the DtN mapping is further reduced. An error analysis is performed and numerical examples are presented to demonstrate the efficiency of the proposed method.

A fast algorithm for the adaptive discretization of 3D parametric curves

2019 ◽  
Vol 37 (5) ◽  
pp. 1663-1682
Author(s):  
Jianming Zhang ◽  
Chuanming Ju ◽  
Baotao Chi
Keyword(s):  
Mesh Generation ◽  
Fast Algorithm ◽  
Design Methodology ◽  
Three Dimensional ◽  
Parametric Curves ◽  
Content Type ◽  
Gaussian Integration ◽  
Optimal Discretization ◽  
Adaptive Discretization ◽  
Conventional Algorithm

Purpose The purpose of this paper is to present a fast algorithm for the adaptive discretization of three-dimensional parametric curves. Design/methodology/approach The proposed algorithm computes the parametric increments of all segments to obtain the parametric coordinates of all discrete nodes. This process is recursively applied until the optimal discretization of curves is obtained. The parametric increment of a segment is inversely proportional to the number of sub-segments, which can be subdivided, and the sum of parametric increments of all segments is constant. Thus, a new expression for parametric increment of a segment can be obtained. In addition, the number of sub-segments, which a segment can be subdivided is calculated approximately, thus avoiding Gaussian integration. Findings The proposed method can use less CPU time to perform the optimal discretization of three-dimensional curves. The results of curves discretization can also meet requirements for mesh generation used in the preprocessing of numerical simulation. Originality/value Several numerical examples presented have verified the robustness and efficiency of the proposed algorithm. Compared with the conventional algorithm, the more complex the model, the more time the algorithm saves in the process of curve discretization.

A fast algorithm for investigations on the three-dimensional Ising model

1984 ◽  
Vol 33 (4) ◽  
pp. 361-366 ◽  
Author(s):  
Michael Creutz ◽  
P. Mitra ◽  
K.J.M. Moriarty
Keyword(s):  
Ising Model ◽  
Fast Algorithm ◽  
Three Dimensional

Three‐dimensional inversion of electromagnetic data

1993 ◽  
Author(s):  
Louise Pellerin ◽  
Jeffery M. Johnston ◽  
Gerald W. Hohmann
Keyword(s):  
Three Dimensional ◽  
Electromagnetic Data
Sign in / Sign up

Export Citation Format

Share Document