𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Iterative system solvers for the frequency analysis of linear mechanical systems

✍ Scribed by A. Feriani; F. Perotti; V. Simoncini

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
405 KB
Volume
190
Category
Article
ISSN
0045-7825

No coin nor oath required. For personal study only.

✦ Synopsis

The paper deals with the numerical treatment of the direct frequency domain (DFD) analysis of linear mechanical systems. Attention is mainly focused on the solution of the complex system of equations needed for each analyzed frequency. Strategies for transforming the system into the ``shifted'' form T Γ€ rIz d are proposed and discussed, where r is related to the frequency. For two formulations of the shifted system the performance of some Krylov sub-space iterative solvers is tested and compared to that of a multi-frontal direct method. Advantage is taken of the shifted form in solving simultaneously a large number of systems resulting from dierent values of the shift (frequency). Numerical experiments on some prototype structural dynamics problems are reported; the results shown demonstrate how the devised strategies for the iterative solution can outperform, in many cases, the direct solver.

πŸ“œ SIMILAR VOLUMES

An iterative solver for a coupled system
An iterative solver for a coupled system of Helmholtz equations
✍ K. D. Cooper; Maurice Yarrow πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 643 KB

An iterative solver for a pair of coupled partial differential equations that are related to the Maxwell equations is discussed. The convergence of the scheme depends on the choice of two parameters. When the first parameter is fixed, the scheme is seen to be a successive under-relaxation scheme in

Discrete mathematical models in the anal
Discrete mathematical models in the analysis of splitting iterative methods for linear systems
✍ BegoΓ±a CantΓ³; Carmen Coll; Elena SΓ‘nchez πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 231 KB

Splitting methods are used to solve most of the linear systems, Ax = b, when the conventional method of Gauss is not efficient. These methods use the factorization of the square matrix A into two matrices M and N as A = M -N where M is nonsingular. Basic iterative methods such as Jacobi or Gauss-Sei

Fast Solvers for the White Noise Analysi
Fast Solvers for the White Noise Analysis of Stochastic Systems
✍ H.G. Matthies; A. Keese πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons βš– 102 KB πŸ‘ 1 views

We consider fast numerical methods for computing the response of stochastic systems. The stochastic discretization is performed via a Karhunen-LoΓ©ve and Wiener's polynomial chaos expansion. In truncating this expansion and using a Galerkin projection, a finite dimensional system of equations remains