共查询到20条相似文献，搜索用时 15 毫秒
1.
2.
A unified framework of dual‐primal finite element tearing and interconnecting (FETI‐DP) algorithms is proposed for solving the system of linear equations arising from the mixed finite element approximation of incompressible Stokes equations. A distinctive feature of this framework is that it allows using both continuous and discontinuous pressures in the algorithm, whereas previous FETI‐DP methods only apply to discontinuous pressures. A preconditioned conjugate gradient method is used in the algorithm with either a lumped or a Dirichlet preconditioner, and scalable convergence rates are proved. This framework is also used to describe several previously developed FETI‐DP algorithms and greatly simplifies their analysis. Numerical experiments of solving a two‐dimensional incompressible Stokes problem demonstrate the performances of the discussed FETI‐DP algorithms represented under the same framework.Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
3.
Charbel Farhat Jing Li Philip Avery 《International journal for numerical methods in engineering》2005,63(3):398-427
The dual‐primal finite element tearing and interconnecting (FETI‐DP) domain decomposition method (DDM) is extended to address the iterative solution of a class of indefinite problems of the form ( K ?σ2 M ) u = f , and a class of complex problems of the form ( K ?σ2 M +iσ D ) u = f , where K , M , and D are three real symmetric matrices arising from the finite element discretization of solid and shell dynamic problems, i is the imaginary complex number, and σ is a real positive number. A key component of this extension is a new coarse problem based on the free‐space solutions of Navier's equations of motion. These solutions are waves, and therefore the resulting DDM is reminiscent of the FETI‐H method. For this reason, it is named here the FETI‐DPH method. For a practically large σ range, FETI‐DPH is shown numerically to be scalable with respect to all of the problem size, substructure size, and number of substructures. The CPU performance of this iterative solver is illustrated on a 40‐processor computing system with the parallel solution, for various σ ranges, of several large‐scale, indefinite, or complex‐valued systems of equations associated with shifted eigenvalue and forced frequency response structural dynamics problems. Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
4.
Saikat Dey Dibyendu K. Datta 《International journal for numerical methods in engineering》2006,68(5):583-603
This paper describes a parallel three‐dimensional numerical infrastructure for the solution of a wide range of time‐harmonic problems in structural acoustics and vibration. High accuracy and rate of error‐convergence, in the mid‐frequency regime,is achieved by the use of hp‐finite and infinite element approximations. The infrastructure supports parallel computation in both single and multi‐frequency settings. Multi‐frequency solves utilize concurrent factoring of the frequency‐dependent linear algebraic systems and are naturally scalable. Scalability of large‐scale single‐frequency problems is realized by using FETI‐DP—an iterative domain‐decomposition scheme. Numerical examples are presented to cover applications in vibratory response of fluid‐filled elastic structures as well as radiation and scattering from elastic structures submerged in an infinite acoustic medium. We demonstrate both the numerical accuracy as well as parallel scalability of the infrastructure in terms of problem parameters that include wavenumber and number of frequencies, polynomial degree of finite/infinite element approximations as well as the number of processors. Scalability and accuracy is evaluated for both single and multiple frequency sweeps on four high‐performance parallel computing platforms: SGI Altix, SGI Origin, IBM p690 SP and Linux‐cluster. Results show good performance on shared as well as distributed‐memory architecture. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
5.
A. Parret‐Fréaud V. Rey P. Gosselet C. Rey 《International journal for numerical methods in engineering》2017,111(1):69-87
This paper investigates the question of the building of admissible stress field in a substructured context. More precisely, we analyze the special role played by multiple points. This study leads to (1) an improved recovery of the stress field, (2) an opportunity to minimize the estimator in the case of heterogeneous structures (in the parallel and sequential case), and (3) a procedure to build admissible fields for dual‐primal finite element tearing and interconnecting and balancing domain decomposition by constraints methods leading to an error bound that separates the contributions of the solver and of the discretization. Copyright © 2016 John Wiley & Sons, Ltd. 相似文献
6.
Yannis Fragakis 《International journal for numerical methods in engineering》2008,73(13):1865-1884
In recent years, domain decomposition methods (DDMs) have emerged as advanced solvers in several areas of computational mechanics. In particular, during the last decade, in the area of solid and structural mechanics, they reached a considerable level of advancement and were shown to be more efficient than popular solvers, like advanced sparse direct solvers. The present contribution follows the lines of a series of recent publications on the relationship between primal and dual formulations of DDMs. In some of these papers, the effort to unify primal and dual methods led to a family of DDMs that was shown to be more efficient than the previous methods. The present paper extends this work, presenting a new family of related DDMs, thus enriching the theory of the relations between primal and dual methods, with the primal methods, which correspond to the dual DDM that uses the lumped preconditioner. The paper also compares the numerical performance of the new methods with that of the previous ones and focuses particularly on memory requirement issues related to the use of the lumped preconditioner, suggesting a particularly memory‐efficient formulation. Copyright © 2007 John Wiley & Sons, Ltd. 相似文献
7.
Radek Tezaur Antonini Macedo Charbel Farhat 《International journal for numerical methods in engineering》2001,51(10):1175-1193
An extension of the FETI‐H method is designed for the solution of acoustic scattering problems with multiple right‐hand sides. A new local pre‐conditioning of this domain decomposition method is also presented. The potential of the resulting iterative solver is demonstrated by numerical experiments for two‐dimensional problems with high wavenumbers, as many as 2.5 million complex degrees of freedom, and a sweep on the angle of the incident wave. Preliminary results for a three‐dimensional submarine problem are also included. The FETI‐H method, whose numerical scalability with respect to the mesh and subdomain sizes was previously established, is shown here to be also numerically scalable with respect to the wavenumber. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
8.
In Ho Cho Keith A. Porter 《International journal for numerical methods in engineering》2014,100(12):914-932
Multiscale analysis technique became a successful remedy to complicated problems in which nonlinear behavior is linked with microscopic damage mechanisms. For efficient parallel multiscale analyses, hierarchical grouping algorithms (e.g., the two‐level ‘coarse‐grained’ method) have been suggested and proved superior over a simple parallelization. Here, we expanded the two‐level algorithm to give rise to a multilayered grouping parallel algorithm suitable for large‐scale multiple‐level multiscale analyses. With practical large‐scale applications, we demonstrated the superior performance of multilayered grouping over the coarse‐grained method. Notably, we show that the unique data transfer rates of the symmetric multiprocessor cluster system can lead to the seemingly ‘super‐linear speedup’ and that there appears to exist the optimal number of subgroups of three‐tiered multiscale analysis. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
9.
José A. González K.C. Park 《International journal for numerical methods in engineering》2014,99(2):102-128
This work presents a partitioned finite element formulation for flexible multibody systems, based on the floating frame (FF) approach, under the assumption of small deformations but arbitrarily large rotations of the bodies. In classical FF of reference methods, deformational modes are normally computed by modal analysis. In this approach, free‐floating modes are eliminated from the linear model using projection techniques and substituted by a complete set of non‐linear finite rotations. In this way, all deformational modes are retained, and no modal selection is needed. The main difference between this work and a classical FF of reference formulation is an algebraic separation of pure deformational modes from rigid‐body motions. The proposed methodology presents the following advantages. First, the position and orientation of the FF has no restriction and can be freely located in the body with identical results. Second, the formulation uses only the linear finite element matrices of a classical vibration problem; hence, they can be easily obtained from linear FEM packages. Third, no selection of modes is needed, all deformational modes are retained through the filtering process. And finally, thanks to the use of localized Lagrangian multipliers (LLM), a partitioned system is obtained that can be solved iteratively and in a distributed manner by available scalable solvers. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
10.
11.
Julien Cortial Charbel Farhat 《International journal for numerical methods in engineering》2009,77(4):451-470
The parallel implicit time‐integration algorithm (PITA) is among a very limited number of time‐integrators that have been successfully applied to the time‐parallel solution of linear second‐order hyperbolic problems such as those encountered in structural dynamics. Time‐parallelism can be of paramount importance to fast computations, for example, when space‐parallelism is unfeasible as in problems with a relatively small number of degrees of freedom in general, and reduced‐order model applications in particular, or when reaching the fastest possible CPU time is desired and requires the exploitation of both space‐ and time‐parallelisms. This paper extends the previously developed PITA to the non‐linear case. It also demonstrates its application to the reduction of the time‐to‐solution on a Linux cluster of sample non‐linear structural dynamics problems. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
12.
Roberto Molina François-Xavier Roux 《International journal for numerical methods in engineering》2019,118(9):519-535
In this work, we present alternative implementations for the Simultaneous-FETI (S-FETI) method. Developed in recent years, this method has shown to be very robust for highly heterogeneous problems. However, the memory cost in S-FETI is greatly increased and can be a limitation to its use. Our main objective is to reduce this memory usage without losing significant time performance. The algorithm is based on the exploitation of the sparsity patterns found on the block of search directions, allowing to store less vectors per iteration in comparison to a full storage scheme. In addition, different variations for the S-FETI method are also proposed, including a new treatment for the possible dependencies between directions and the use of the Lumped preconditioner. Several tests are performed in order to establish the impact of the modifications presented in this work compared to the original S-FETI algorithm. 相似文献
13.
K. B. Nakshatrala K. D. Hjelmstad D. A. Tortorelli 《International journal for numerical methods in engineering》2008,75(12):1385-1415
We present a novel partitioned coupling algorithm to solve first‐order time‐dependent non‐linear problems (e.g. transient heat conduction). The spatial domain is partitioned into a set of totally disconnected subdomains. The continuity conditions at the interface are modeled using a dual Schur formulation where the Lagrange multipliers represent the interface fluxes (or the reaction forces) that are required to maintain the continuity conditions. The interface equations along with the subdomain equations lead to a system of differential algebraic equations (DAEs). For the resulting equations a numerical algorithm is developed, which includes choosing appropriate constraint stabilization techniques. The algorithm first solves for the interface Lagrange multipliers, which are subsequently used to advance the solution in the subdomains. The proposed coupling algorithm enables arbitrary numeric schemes to be coupled with different time steps (i.e. it allows subcycling) in each subdomain. This implies that existing software and numerical techniques can be used to solve each subdomain separately. The coupling algorithm can also be applied to multiple subdomains and is suitable for parallel computers. We present examples showing the feasibility of the proposed coupling algorithm. Copyright © 2008 John Wiley & Sons, Ltd. 相似文献
14.
Rodrigo R. Paz Mario A. Storti 《International journal for numerical methods in engineering》2005,62(13):1873-1894
In this paper, the efficiency of a parallelizable preconditioner for domain decomposition methods in the context of the solution of non‐symmetric linear equations arising from discretization of the Saint‐Venant equations, is investigated. The proposed interface strip preconditioner (IS) is based on solving a problem in a narrow strip around the interface. It requires much less memory and computing time than classical Neumann–Neumann preconditioner, and handles correctly the flux splitting among sub‐domains that share the interface. The performance of this preconditioner is assessed with an analytical study of Schur complement matrix eigenvalues and numerical experiments conducted in a parallel computational environment (consisting of a Beowulf cluster of 20 nodes). Copyright © 2005 John Wiley & Sons, Ltd. 相似文献
15.
Christoph M. Augustin Gerhard A. Holzapfel Olaf Steinbach 《International journal for numerical methods in engineering》2014,99(4):290-312
High‐resolution and anatomically realistic computer models of biological soft tissues play a significant role in the understanding of the function of cardiovascular components in health and disease. However, the computational effort to handle fine grids to resolve the geometries as well as sophisticated tissue models is very challenging. One possibility to derive a strongly scalable parallel solution algorithm is to consider finite element tearing and interconnecting (FETI) methods. In this study, we propose and investigate the application of FETI methods to simulate the elastic behavior of biological soft tissues. As one particular example, we choose the artery which is—as most other biological tissues—characterized by anisotropic and nonlinear material properties. We compare two specific approaches of FETI methods, classical and all‐floating, and investigate the numerical behavior of different preconditioning techniques. In comparison with classical FETI, the all‐floating approach not only has advantages concerning the implementation but also has advantages concerning the convergence of the global iterative solution method. This behavior is illustrated with numerical examples. We present results of linear elastic simulations to show convergence rates, as expected from the theory, and results from the more sophisticated nonlinear case where we apply a well‐known anisotropic model to the realistic geometry of an artery. Although the FETI methods have a great applicability on artery simulations, we will also discuss some limitations concerning the dependence on material parameters. Copyright © 2014 John Wiley & Sons, Ltd. 相似文献
16.
F. J. Lingen M. G. A. Tijssens 《International journal for numerical methods in engineering》2001,52(8):867-888
Simulations of crack growth that are based on the cohesive surface methodology typically involve ill‐conditioned systems of equations and require much processing time. This paper shows how these systems of equations can be solved efficiently by adopting the domain decomposition approach in which the finite element mesh is partitioned into multiple blocks. The system of equations is then reduced to a much smaller system of equations that is solved with an iterative algorithm in combination with a powerful two‐level preconditioner. Although the solution algorithm is more efficient than a direct solution algorithm on a single‐processor computer, it becomes really attractive when used on a parallel computer. This is demonstrated for a large scale simulation of crack growth in a polymer using a Cray T3E with 64 processors. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
17.
Anthony Gravouil Alain Combescure 《International journal for numerical methods in engineering》2001,50(1):199-225
We present a method with domain decomposition to solve time‐dependent non‐linear problems. This method enables arbitrary numeric schemes of the Newmark family to be coupled with different time steps in each subdomain: this coupling is achieved by prescribing continuity of velocities at the interface. We are more specifically interested in the coupling of implicit/explicit numeric schemes taking into account material and geometric non‐linearities. The interfaces are modelled using a dual Schur formulation where the Lagrange multipliers represent the interfacial forces. Unlike the continuous formulation, the discretized formulation of the dynamic problem is unable to verify simultaneously the continuity of displacements, velocities and accelerations at the interfaces. We show that, within the framework of the Newmark family of numeric schemes, continuity of velocities at the interfaces enables the definition of an algorithm which is stable for all cases envisaged. To prove this stability, we use an energy method, i.e. a global method over the whole time interval, in order to verify the algorithms properties. Then, we propose to extend this to non‐linear situations in the following cases: implicit linear/explicit non‐linear, explicit non‐linear/explicit non‐linear and implicit non‐linear/explicit non‐linear. Finally, we present some examples showing the feasibility of the method. Copyright © 2001 John Wiley & Sons, Ltd. 相似文献
18.
Charbel Farhat Julien Cortial Climne Dastillung Henri Bavestrello 《International journal for numerical methods in engineering》2006,67(5):697-724
The time‐parallel framework for constructing parallel implicit time‐integration algorithms (PITA) is revisited in the specific context of linear structural dynamics and near‐real‐time computing. The concepts of decomposing the time‐domain in time‐slices whose boundaries define a coarse time‐grid, generating iteratively seed values of the solution on this coarse time‐grid, and using them to time‐advance the solution in each time‐slice with embarrassingly parallel time‐integrations are maintained. However, the Newton‐based corrections of the seed values, which so far have been computed in PITA and related approaches on the coarse time‐grid, are eliminated to avoid artificial resonance and numerical instability. Instead, the jumps of the solution on the coarse time‐grid are addressed by a projector which makes their propagation on the fine time‐grid computationally feasible while avoiding artificial resonance and numerical instability. The new PITA framework is demonstrated for a complex structural dynamics problem from the aircraft industry. Its potential for near‐real‐time computing is also highlighted with the solution of a relatively small‐scale problem on a Linux cluster system. Copyright © 2006 John Wiley & Sons, Ltd. 相似文献
19.
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. 相似文献