共查询到20条相似文献，搜索用时 15 毫秒
1.
X. Antoine A. Bendali M. Darbas 《International journal for numerical methods in engineering》2004,61(8):1310-1331
Since the advent of the fast multipole method, large‐scale electromagnetic scattering problems based on the electric field integral equation (EFIE) formulation are generally solved by a Krylov iterative solver. A well‐known fact is that the dense complex non‐hermitian linear system associated to the EFIE becomes ill‐conditioned especially in the high‐frequency regime. As a consequence, this slows down the convergence rate of Krylov subspace iterative solvers. In this work, a new analytic preconditioner based on the combination of a finite element method with a local absorbing boundary condition is proposed to improve the convergence of the iterative solver for an open boundary. Some numerical tests precise the behaviour of the new preconditioner. Moreover, comparisons are performed with the analytic preconditioner based on the Calderòn's relations for integral equations for several kinds of scatterers. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
2.
Camille Negrello Pierre Gosselet Christian Rey Julien Pebrel 《International journal for numerical methods in engineering》2016,107(13):1083-1105
We investigate the use of non‐overlapping domain decomposition (DD) methods for nonlinear structure problems. The classic techniques would combine a global Newton solver with a linear DD solver for the tangent systems. We propose a framework where we can swap Newton and DD so that we solve independent nonlinear problems for each substructure and linear condensed interface problems. The objective is to decrease the number of communications between subdomains and to improve parallelism. Depending on the interface condition, we derive several formulations that are not equivalent, contrarily to the linear case. Primal, dual and mixed variants are described and assessed on a simple plasticity problem. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
3.
Daniel J. Rixen Charbel Farhat Radek Tezaur Jan Mandel 《International journal for numerical methods in engineering》1999,46(4):501-533
In this paper, we prove that the Algebraic A‐FETI method corresponds to one particular instance of the original one‐level FETI method. We also report on performance comparisons on an Origin 2000 between the one‐ and two‐level FETI methods and an optimized sparse solver, for two industrial applications: the stress analysis of a thin shell structure, and that of a three‐dimensional structure modelled by solid elements. These comparisons suggest that for topologically two‐dimensional problems, sparse solvers are effective when the number of processors is relatively small. They also suggest that for three‐dimensional applications, scalable domain decomposition methods such as FETI deliver a superior performance on both sequential and parallel hardware configurations. Copyright © 1999 John Wiley & Sons, Ltd. 相似文献
4.
就一类离散非线性系统的迭代学习控制 ,提出了最优迭代因果学习律的存在性条件 .如果迭代初态严格重复 ,则迭代输出收敛于期望输出 .该结论直接推广了线性离散系统最优迭代学习相关结果 相似文献
5.
The paper presents a Generalized Aggregation Multilevel (GAM) solver, which automatically constructs nearly optimal auxiliary coarse models based on the information available in the source grid only. GAM solver is a hybrid solution scheme where approximation space of each aggregate (group of neighbouring elements) is adaptively and automatically selected depending on the spectral characteristics of individual aggregates. Adaptive features include automated construction of auxiliary aggregated model by tracing ‘stiff’ and ‘soft’ elements, adaptive selection of intergrid transfer operators, and adaptive smoothing. An obstacle test consisting of nine industry problems, such as ring–strut–ring structure, casting setup in airfoil, nozzle for turbines, turbine blade and diffuser casing as well as on poor conditioned shell problems, such as High Speed Civil Transport, automobile body and canoe, was designed to test the performance of GAM solver. Comparison to the state of the art direct and iterative (PCG with Incomplete Cholesky preconditioner) is carried out. Numerical experiments indicate that GAM solver possesses an optimal rate of convergence by which the CPU time grows linearly with the problem size, and at the same time, robustness is not compromised, as its performance is almost insensitive to problem conditioning. © 1997 John Wiley & Sons, Ltd. 相似文献
6.
José Manuel Navarro-Jiménez Enrique Nadal Manuel Tur José Martínez-Casas Juan José Ródenas 《International journal for numerical methods in engineering》2020,121(13):3004-3020
Fictitious domain methods, like the Cartesian grid finite element method (cgFEM), are based on the use of unfitted meshes that must be intersected. This may yield to ill-conditioned systems of equations since the stiffness associated with a node could be small, thus poorly contributing to the energy of the problem. This issue complicates the use of iterative solvers for large problems. In this work, we present a new stabilization technique that, in the case of cgFEM, preserves the Cartesian structure of the mesh. The formulation consists in penalizing the free movement of those nodes by a smooth extension of the solution from the interior of the domain, through a postprocess of the solution via a displacement recovery technique. The numerical results show an improvement of the condition number and a decrease in the number of iterations of the iterative solver while preserving the problem accuracy. 相似文献
7.
Since the contribution from the closed-form solution (CFS) of the number of control-related states (CRSs) of the variant k-th order system can enumerate the number of each type of CRS in real time, we can apply this real-time information to enhance the capability for dynamic modeling of such systems. For example, allocating a non-sharing waiting dummy resource (known as a deadlock thread-holder [DTH]) in each forbidden substate at that location will increase the maximum number of reachable states that can be derived using a CFS in real time. We can thus avoid the occurrence of deadlock without implementing an additional controller. To extend this capability to model a k-th order system with one non-sharing circle subnet allocated at the top position of the left-hand process (denoted as a top non-sharing circle subnet [TNCS] k-th order system) by Petri net (PN), which is the fundamental manufacturing model for different products sharing common parts, this paper extends the existing research on CFS for PNs to an insufficient k-th order system, which is the essential element for a TNCS system with one non-sharing resource. The proposed deadlock avoidance algorithm can be employed to realize the allocation of dynamic non-sharing processes. 相似文献
8.
Oreste S. Bursi David P. Stoten Nicola Tondini Leonardo Vulcan 《International journal for numerical methods in engineering》2010,82(9):1158-1179
Adaptive control techniques can be applied to dynamical systems whose parameters are unknown. We propose a technique based on control and numerical analysis approaches to the study of the stability and accuracy of adaptive control algorithms affected by time delay. In particular, we consider the adaptive minimal control synthesis (MCS) algorithm applied to linear time‐invariant plants, due to which, the whole controlled system generated from state and control equations discretized by the zero‐order‐hold (ZOH) sampling is nonlinear. Hence, we propose two linearization procedures for it: the first is via what we term as physical insight and the second is via Taylor series expansion. The physical insight scheme results in useful methods for a priori selection of the controller parameters and of the discrete‐time step. As there is an inherent sampling delay in the process, a fixed one‐step delay in the discrete‐time MCS controller is introduced. This results in a reduction of both the absolute stability regions and the controller performance. Owing to the shortcomings of ZOH sampling in coping with high‐frequency disturbances, a linearly implicit L‐stable integrator is also used within a two degree‐of‐freedom controlled system. The effectiveness of the methodology is confirmed both by simulations and by experimental tests. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
9.
Massimiliano Ferronato Luca Bergamaschi Giuseppe Gambolati 《International journal for numerical methods in engineering》2010,81(3):381-402
Block constraint preconditioners are a most recent development for the iterative solution to large‐scale, often ill‐conditioned, coupled consolidation problems. A major limitation to their practical use, however, is the somewhat difficult selection of a number of user‐defined parameters (at least 4) in a more or less optimal way. The present paper investigates the robustness of three variants of the block constraint preconditioning in relation to the above parameters. A theoretical analysis of the eigenspectrum of the preconditioned matrix provides relatively simple bounds of the eigenvalues as a function of these parameters. A number of test problems used to validate the theoretical results show that both the mixed constraint preconditioner (MCP) combined with the symmetric quasi‐minimal residual (SQMR) solver and the MCP triangular variant (T‐MCP) combined with the bi‐conjugate gradient stabilized (Bi‐CGSTAB) are efficient and robust tools for the solution to difficult Finite Element‐discretized coupled consolidation problems. Moreover, the practical selection of the user‐defined parameters is relatively easy as a stable behavior is observed for a wide range of fill‐in degree values. The theoretical bounds on the eigenspectrum of the preconditioned matrix may help to suggest the most appropriate parameter combination. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
10.
A. Hadoush A.H. van den Boogaard 《International journal for numerical methods in engineering》2012,90(5):597-612
In single point incremental forming (SPIF), the sheet is incrementally deformed by a small spherical tool following a lengthy tool path. The simulation by the finite element method of SPIF requires extremely long computing times that limit the application to simple academic cases. The main challenge is to perform thousands of load increments modelling the lengthy tool path with elements that are small enough to model the small contact area. Because of the localised deformation in the process, a strong nonlinearity is observed in the vicinity of the tool. The rest of the sheet experiences an elastic deformation that introduces only a weak nonlinearity because of the change of shape. The standard use of the implicit time integration scheme is inefficient because it applies an iterative update (Newton–Raphson) strategy for the entire system of equations. The iterative update is recommended for the strong nonlinearity that is active in a small domain but is not required for the large part with only weak nonlinearities. It is proposed in this paper to split the finite element mesh into two domains. The first domain models the plastically deforming zone that experiences the strong nonlinearity. It applies a full nonlinear update for the internal force vector and the stiffness matrix every iteration. The second domain models the large elastically deforming zone of the sheet. It applies a pseudolinear update strategy based on a linearization at the beginning of each increment. Within the increment, it reuses the stiffness matrix and linearly updates the internal force vector. The partly linearized update strategy is cheaper than the full nonlinear update strategy, resulting in a reduction of the overall computing. Furthermore, in this paper, adaptive refinement is combined with the two domain method. It results in accelerating the standard SPIF implicit simulation of 3200 shell elements by a factor of 3.6. Copyright © 2011 John Wiley & Sons, Ltd. 相似文献
11.
M. Pari W. Swart M.B. van Gijzen M.A.N. Hendriks J.G. Rots 《International journal for numerical methods in engineering》2020,121(10):2128-2146
Sequentially linear analysis (SLA), an event-by-event procedure for finite element (FE) simulation of quasi-brittle materials, is based on sequentially identifying a critical integration point in the FE model, to reduce its strength and stiffness, and the corresponding critical load multiplier (λcrit), to scale the linear analysis results. In this article, two strategies are proposed to efficiently reuse previous stiffness matrix factorisations and their corresponding solutions in subsequent linear analyses, since the global system of linear equations representing the FE model changes only locally. The first is based on a direct solution method in combination with the Woodbury matrix identity, to compute the inverse of a low-rank corrected stiffness matrix relatively cheaply. The second is a variation of the traditional incomplete LU preconditioned conjugate gradient method, wherein the preconditioner is the complete factorisation of a previous analysis step's stiffness matrix. For both the approaches, optimal points at which the factorisation is recomputed are determined such that the total analysis time is minimised. Comparison and validation against a traditional parallel direct sparse solver, with regard to a two-dimensional (2D) and three-dimensional (3D) benchmark study, illustrates the improved performance of the Woodbury-based direct solver over its counterparts, especially for large 3D problems. 相似文献
12.
Akira Imakura 《East Asian journal on applied mathematics.》2014,4(3):267-282
Subspace projection methods based on the Krylov subspace using powers of a
matrix $A$ have often been standard for solving large matrix computations in many areas
of application. Recently, projection methods based on the extended Krylov subspace
using powers of $A$ and $A^{−1}$ have attracted attention, particularly for functions of a matrix
times a vector and matrix equations. In this article, we propose an efficient algorithm
for constructing an orthonormal basis for the extended Krylov subspace. Numerical
experiments indicate that this algorithm has less computational cost and approximately
the same accuracy as the traditional algorithm. 相似文献
13.
R. Kechroud X. Antoine A. Soulaïmani 《International journal for numerical methods in engineering》2005,64(10):1275-1302
The present text deals with the numerical solution of two‐dimensional high‐frequency acoustic scattering problems using a new high‐order and asymptotic Padé‐type artificial boundary condition. The Padé‐type condition is easy‐to‐implement in a Galerkin least‐squares (iterative) finite element solver for arbitrarily convex‐shaped boundaries. The method accuracy is investigated for different model problems and for the scattering problem by a submarine‐shaped scatterer. As a result, relatively small computational domains, optimized according to the shape of the scatterer, can be considered while yielding accurate computations for high‐frequencies. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
14.
Louis Kovalevsky Pierre Gosselet 《International journal for numerical methods in engineering》2016,107(11):903-922
The variational theory of complex rays (VTCR) is an indirect Trefftz method designed to study systems governed by Helmholtz‐like equations. It uses wave functions to represent the solution inside elements, which reduces the dispersion error compared with classical polynomial approaches, but the resulting system is prone to be ill‐conditioned. This paper gives a simple and original presentation of the VTCR using the discontinuous Galerkin framework, and it traces back the ill‐conditioning to the accumulation of eigenvalues near zero for the formulation written in terms of wave amplitude. The core of this paper presents an efficient solving strategy that overcomes this issue. The key element is the construction of a search subspace where the condition number is controlled at the cost of a limited decrease of attainable precision. An augmented LSQR solver is then proposed to solve efficiently and accurately the complete system. The approach is successfully applied to different examples. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
15.
B. Chetouane F. Dubois M. Vinches C. Bohatier 《International journal for numerical methods in engineering》2005,64(1):65-94
The aim of this paper is to present a discrete element approach for the study of stonework. In the present work, a masonry structure is considered as a collection of rigid or deformable blocks, interacting together by contact laws. In this paper, we use the non‐smooth contact dynamics (NSCD) resolution method mainly used for the modelling of granular media. In the considered masonry structures we define, on an elementary cell, average local strain and stress tensors. These definitions are valid under dynamical loading of the structure, taking into account rotations. We present their use on academic and on real masonry structures. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
16.
Axel Gerstenberger Raymond S. Tuminaro 《International journal for numerical methods in engineering》2013,94(3):248-272
This article proposes an algebraic multigrid (AMG) approach to solve linear systems arising from applications where strong discontinuities are modeled by the extended finite element method. The application of AMG methods promises optimal scalability for solving large linear systems. However, the straightforward (or ‘black‐box’) use of existing AMG techniques for extended finite element method problems is often problematic. In this paper, we highlight the reasons for this behavior and propose a relatively simple adaptation that allows one to leverage existing AMG software mostly unchanged. Numerical tests demonstrate that optimal iterative convergence rates can be attained that are comparable with AMG convergence rates associated with linear systems for standard finite element approximations without discontinuities. Published 2012. This article is a US Government work and is in the public domain in the USA. 相似文献
17.
系统研究了基于神经网络的离散变结构控制系统设计方法，提出了几种具体设计方案．神经网络的引入可以使滑模（变结构）控制具备学习与自适应能力，使控制信号得以柔化，从而能够减轻或避免困扰常规滑模控制器的抖振现象，改善控制效果． 相似文献
18.
非线性Ｇａｌｅｒｋｉｎ算法是长时间范围内求解非线性发展方程的一种新的数值格式。我们在这篇文章里,提供了全离散非线性Ｇａｌｅｒｋｉｎ算法的有界性和稳定性结果。 相似文献
19.
本文以 Poisson 方程为例,在不对节点进行重新排列的前提下,通过求解较低维数的矩阵方程,对交替方向隐式迭代格式进行了改进,降低了程序实现难度．以 Gauss 消去法为例,对改进的交替方向隐式迭代格式的计算量进行估计,发现改进的交替方向隐式迭代格式大大减少了计算量,并进一步证明了改进的交替方向隐式迭代格式与经典的交替方向隐式迭代格式的等价性．数值算例验证了改进的交替方向隐式迭代格式与经典的交替方向隐式迭代格式的等价性和改进的交替方向隐式迭代格式在计算量等方面的优越性． 相似文献
20.
An efficient and simple approach for handling linear multipoint constraints in a class of substructure‐based solvers, namely the finite element tearing and interconnecting (FETI) method, is proposed. Previously, it was argued that multipoint constraints should be handled in FETI by adding a second level iteration on a coarse grid such that the FETI iterates satisfy the multipoint constraints exactly. The procedure presented here does not require an additional coarse grid but instead takes account of the multipoint constraints in the preconditioning step. The preconditioning strategy is shown to be mechanically consistent and to incur only a small additional computational cost. This strategy is simpler and computationally less expensive than the two‐level FETI procedure. Its numerical scalability even for highly heterogeneous problems is demonstrated in several test examples. Copyright © 2002 John Wiley & Sons, Ltd. 相似文献