Search

This paper presents an automatic reconstruction algorithm of surfaces of revolution (SORs) with a self-adaptive method for generatrix line extraction from point clouds. The proposed method does not need to calculate the normal of point clouds, which can greatly improve the efficiency and accuracy of SORs reconstruction. Firstly, the rotation axis of a SOR is automatically extracted by a minimum relative deviation among the three axial directions for both tall-thin and short-wide SORs. Secondly, the projection profile of a SOR is extracted by the triangulated irregular network (TIN) model and random sample consensus (RANSAC) algorithm. Thirdly, the point set of a generatrix line of a SOR is determined by searching for the extremum of coordinate Z, together with overflow points processing, and further determines the type of generatrix line by the smaller RMS errors between linear fitting and quadratic curve fitting. In order to validate the efficiency and accuracy of the proposed method, two kinds of SORs, simple SORs with a straight generatrix line and complex SORs with a curved generatrix line are selected for comparison analysis in the paper. The results demonstrate that the proposed method is robust and can reconstruct SORs with a higher accuracy and efficiency based on the point clouds. [ABSTRACT FROM AUTHOR]

This paper formulates, analyses and discusses 2D and 3D static and dynamic model problems in the orthopaedic practice. Finite element approximations, algorithms and iterative methods for constrained optimization are discussed. Since the conjugate gradient method is one of the most effective methods for both unconstrained and constrained optimization, it can be applied without or with preconditioning for solving the basic step of the discretized problem. A comparison of several preconditioned conjugate gradient methods is discussed. The problems discussed are applied to analyses of real patients. Finally, the the numerical results are discussed. Copyright © 1999 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

The mortar methods are based on domain decomposition and they allow for the coupling of different variational approximations in different subdomains. The resulting methods are nonconforming but still yield optimal approximations. In this paper, we will discuss iterative substructuring algorithms for the algebraic systems arising from the discretization of symmetric, second-order, elliptic equations in two dimensions. Both spectral and finite element methods, for geometrically conforming as well as nonconforming domain decompositions, are studied. In each case, we obtain a polylogarithmic bound on the condition number of the preconditioned matrix. [ABSTRACT FROM AUTHOR]

In the first part of the paper, we introduce an overlapping mortar finite element method for solving two-dimensional elliptic problems discretized on overlapping nonmatching grids. We prove an optimal error bound and estimate the condition numbers of certain overlapping Schwarz preconditioned systems for the two-subdomain case. We show that the error bound is independent of the size of the overlap and the ratio of the mesh parameters. In the second part, we introduce three additive Schwarz preconditioned conjugate gradient algorithms based on the trivial and harmonic extensions. We provide estimates for the spectral bounds on the condition numbers of the preconditioned operators. We show that although the error bound is independent of the size of the overlap, the condition number does depend on it. Numerical examples are presented to support our theory. [ABSTRACT FROM AUTHOR]

This paper describes an analytical model for a beam system, based on a modified Timoshenko theory, where the beam is pinned to a hub driven by an actuator at one end and is subject to a heavy load at the other end. A new efficient computational algorithm is then proposed for solving the higher-order non-canonical partial differential equation model, which is developed based on the generalized difference method. This allows a suitable selection of different trial and test spaces, so as to improve the computational efficiency while preserving the high convergence rate of the standard finite element method. With the trial space of cubic Hermite finite elements and the test space of piecewise linear functions, the computational scheme reduces to a semi-discretized or even fully discretized computational algorithm. A numerical simulation result is included to visualize the theoretical modelling and computational results. Copyright © 1999 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

This paper presents a general method to associate the operator splitting for the Peaceman-Rachford procedure with a decomposition of the domain in problems arising from finite element discretization of partial differential equations. The algorithm is provably convergent without any symmetry requirement. Moreover, this method possesses the significant advantage of making the linear systems of the Peaceman-Rachford iteration block diagonal and therefore perfectly appropriate for parallel processing. Not only is sparsity not affected but a reduction of the bandwidth occurs. In fact, for appropriate choices of nonconforming finite element spaces, this method makes directly possible elementwise processing. This option remains available in general for higher-dimensional problems by applying the splitting algorithm recursively. Practical implementation requires nothing more than the standard finite element assembly procedure and some bookkeeping to relate a few different orderings of the nodes. In addition to all these attractive features, the method is rapidly convergent and remains highly competitive even when used on a serial machine. [ABSTRACT FROM AUTHOR]

In this paper, we study the additive Schwarz method for the h-p version of the finite element method in three dimensions. The main idea is to treat separately the h-version (linear) components and the p-version (high-order) components by a vertex-based method. It can also be viewed as a three-level method with the level being the linear finite element approximation on the coarse mesh, the linear finite element approximation on the fine mesh, and the high-order finite element approximation on the fine mesh, respectively. The resulting algorithm can be implemented in parallel on the subdomain level for the h-version components and on the element level for the p-version components. The condition number is of order [This symbol cannot be presented in ASCII format](1 + ln Hipi/hi)⇔2, where Hi stands for the diameter of the subdomain Ωi, hi is the diameter of the elements in Ωi, and pi is the maximum of the polynomial degrees used in Ωi. [ABSTRACT FROM AUTHOR]

In the paper the author presents a novel point of view for the refinement and derefinement algorithms of triangular nested meshes using fractal concepts and iterated function systems (IFS). The fractal behaviour can be understood in the sense that these meshes feature a remarkable amplifying invariance under changes of magnification. Here we compare the meshes obtained by the combination of these algorithms with those presented by Bova and Carey (1992). Although both of the meshes are very similar, the current algorithms automatically build and manage sequences of nested irregular discretizations of the domain. The author illustrates here how the application of IFS families is equivalent to the use of an adaptive strategy that combines the refinement procedure with the derefinement one. [ABSTRACT FROM AUTHOR]

The paper is devoted to the analysis of two- or three-dimensional contact problems with Coulomb friction and large deformation. The classical approach is based on two minimum principles or two variational inequalities: the first for unilateral contact and the second for friction. A coupled approach using only one principle or one inequality is presented. This new approach allows us to extend the notion of normality law to dissipative behaviors with a non-associated flow rule, such as surface friction. Non-differentiable contact potentials are regularized by means of the augmented Lagrangian method. Using the C++ language, an object-oriented finite element database is created, which allows us to implement the contact and friction in an existing code in a very simple and neat way. Numerical examples are carried out in many difficult cases such as shock absorber and three-dimensional contact. The numerical results prove that this approach is robust and efficient concerning numerical stability. [ABSTRACT FROM AUTHOR]

Explicit finite-element programs, such as DYNA3D, are frequently used to solve large structural problems, such as automobile impacts, that involve tens of thousands of shell elements. Since the explicit finite-element programs do not use a stiffness matrix, the major cost of the calculation is the evaluation of the force vector. A significant part of that cost is the evaluation of the constitutive models. The standard algorithm for integrating J2 plasticity at the stress points is the radial return method. An iterative variation of radial return is commonly used to impose the zero normal stress condition within the shell elements. In this paper we explore several different non-iterative methods that impose the zero normal stress condition in an approximate manner. We show that the cost of the constitutive evaluation can be reduced by 25 per cent without introducing significant errors. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm with a guaranteed accuracy for the finite-dimensional nonlinear equation. First, an algorithm is shown which can determine the interval containing the true solution, based on the given approximate solution. This method is based on the interval analysis and considers the representation error of the equation. Then the interval iteration method is shown which can arbitrarily reduce the interval. The rational number arithmetic is used and the rounding of the rational number us utilized effectively. Finally, an experimental implementation of the algorithm on a computer is presented, together with some numerical examples. [ABSTRACT FROM AUTHOR]

The finite element method (FEM) with local absorbing boundary conditions has been recently applied to compute electromagnetic scattering from large 3-D geometries. In this paper, we present details pertaining to code implementation and optimization. Various types of sparse matrix storage schemes are discussed and their performance is examined in terms of vectorization and net storage requirements. The system of linear equations is solved using a preconditioned biconjugate gradient (BCG) algorithm and a fairly detailed study of existing point and block preconditioners (diagonal and incomplete LU) is carried out. A modified ILU preconditioning scheme is also introduced which works better than the traditional version for our matrix systems. The parallelization of the iterative sparse solver and the matrix generation/assembly as implemented on the KSR1 multiprocessor is described and the interprocessor communication patterns are analysed in detail. Near-linear speed-up is obtained for both the iterative solver and the matrix generation/assembly phases. Results are presented for a problem having 224,476 unknowns and validated by comparison with measured data. [ABSTRACT FROM AUTHOR]

In this paper, we construct a second order algorithm based on the semi-implicit spectral deferred correction method for the non-stationary coupled Navier–Stokes/Darcy equations with the Beavers–Joseph–Saffman's interface condition. We present a complete theoretical analysis to prove that this algorithm is stable and possesses second order accuracy in time. Numerical examples confirm the convergence rate and the effectiveness of our algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a method for checking the connectivity of a set of finite elements and for dividing the set into simply connected subsets. The algorithm is based on expansion from a simply connected subset. The algorithm could be used to determine cut surfaces, but it is shown that simply connected subsets are more suitable in practice. [ABSTRACT FROM AUTHOR]

There is inconsistency between the existing remote sensing cropland products, whose accuracy of estimated cropland area and spatial positioning needs to be improved. The existing generalized methods of generating synergy cropland products for improving the accuracy of existing products do not consider the overall consistency difference between the different products in each grid cell in the fusion process. To reduce the impact of the abnormal estimated cropland areas of the individual cropland products on the results, this paper proposes a method of generating a synergy cropland product by fusing the multiple existing cropland products, based on the overall consistency difference. In the proposed method, the process of fusing the multiple existing cropland products is based on the overall consistency difference of the estimated cropland area of all the cropland products in each grid cell. The synergy cropland product is then generated after determining the best combination level with the cropland statistics. In this study, we set 2010 as the base year, and used the proposed method to conduct experiments with four remote sensing cropland products: GlobCover 2009, MODIS Cropland, MCD12Q1, and FROM-GLC within China, and national cropland statistics. The results show that the synergy cropland product generated by the proposed method has a higher accuracy of cropland area estimation and spatial positioning than the results obtained by the generalized model, as well as the original products. [ABSTRACT FROM AUTHOR]

The Power Take-Off (PTO) system is the key component of a Wave Energy Converter (WEC) that distinguishes it from a simple floating body because the uptake of the energy by the PTO system modifies the wave field surrounding the WEC. Consequently, the choice of a proper PTO model of a WEC is a key factor in the accuracy of a numerical model that serves to validate the economic impact of a wave energy project. Simultaneously, the given numerical model needs to simulate many WEC units operating in close proximity in a WEC farm, as such conglomerations are seen by the wave energy industry as the path to economic viability. A balance must therefore be struck between an accurate PTO model and the numerical cost of running it for various WEC farm configurations to test the viability of any given WEC farm project. Because hydrodynamic interaction between the WECs in a farm modifies the incoming wave field, both the power output of a WEC farm and the surface elevations in the 'near field' area will be affected. For certain types of WECs, namely heaving cylindrical WECs, the PTO system strongly modifies the motion of the WECs. Consequently, the choice of a PTO system affects both the power production and the surface elevations in the 'near field' of a WEC farm. In this paper, we investigate the effect of a PTO system for a small wave farm that we term 'WEC array' of 5 WECs of two types: a heaving cylindrical WEC and an Oscillating Surge Wave Energy Converter (OSWEC). These WECs are positioned in a staggered array configuration designed to extract the maximum power from the incident waves. The PTO system is modelled in WEC-Sim, a purpose-built WEC dynamics simulator. The PTO system is coupled to the open-source wave structure interaction solver NEMOH to calculate the average wave field η in the 'near-field'. Using a WEC-specific novel PTO system model, the effect of a hydraulic PTO system on the WEC array power production and the near-field is compared to that of a linear PTO system. Results are given for a series of regular wave conditions for a single WEC and subsequently extended to a 5-WEC array. We demonstrate the quantitative and qualitative differences in the power and the 'near-field' effects between a 5-heaving cylindrical WEC array and a 5-OSWEC array. Furthermore, we show that modeling a hydraulic PTO system as a linear PTO system in the case of a heaving cylindrical WEC leads to considerable inaccuracies in the calculation of average absorbed power, but not in the near-field surface elevations. Yet, in the case of an OSWEC, a hydraulic PTO system cannot be reduced to a linear PTO coefficient without introducing substantial inaccuracies into both the array power output and the near-field effects. We discuss the implications of our results compared to previous research on WEC arrays which used simplified linear coefficients as a proxy for PTO systems. [ABSTRACT FROM AUTHOR]

As the core component and main power source for aircrafts, the reliability of an aero engine is vital for the security operation of aircrafts. Degradation tendency measurement on an engine can not only improve its safety, but effectively reduce the maintenance costs. In this paper, a hybrid method using multi-sensor data based on fast ensemble empirical mode decomposition permutation entropy (FEEMD-PE) and regularized extreme learning machine (RELM), systematically blending the signal processing technology and trend prediction approach, is proposed for aircraft engine degradation tendency measurement. Firstly, a synthesized degradation index was designed utilizing multi-sensor data and a data fusion technique to evaluate the degradation level of the engine unit. Secondly, in order to eliminate the irregular data fluctuation, FEEMD was employed to efficiently decompose the constructed degradation index series. Subsequently, considering the complexity of intrinsic mode functions (IMFs) obtained through sequence decomposition, a permutation entropy-based reconstruction strategy was innovatively developed to generate the refactored IMFs (RIMFs), which have stronger ability for describing the degradation states and contribute to improving the prediction accuracy. Finally, RIMFs were used as the inputs of the RELM model to measure the degradation tendency. The proposed method was applied to the degradation tendency measurement of aircraft engines. The results confirm the effectiveness and superiority of the proposed method, and it is more suitable for actual applications compared with other existing approaches. [ABSTRACT FROM AUTHOR]

Static correction is an essential step in seismic processing and it has an effect on the later steps of seismic processing, including velocity analysis, data stacking, and seismic inversion. During seismic data acquisition, a receiving point usually sets a geophone several times to receive the seismic data. The same geophone cannot be set at the same receiving point every time. If the geophones have different delay time, then the common receiving-point gather (CRG) will have multiple receiver statics. However, the receiver statics of a CRG are considered the same in conventional static correction. In this paper, based on common attitude gather (CAG), a novel static correction method is proposed to analyze the receiver statics of a CRG. Attitude indicates the tilt angles of the three components of a geophone. According to the different attitudes of geophones, CRG can be divided into multiple CAGs. When the difference technique is used to the novel method and the conventional method, the statics are analyzed with CAGs and CRGs, respectively. A field example demonstrates that the proposed method cannot only enhance the continuity of the event in the shot gather, but also smooth the gaps of the event in the CRG. The results suggest that the proposed method can eliminate the effect of differences in delay time of geophones on static correction. [ABSTRACT FROM AUTHOR]