๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

THE CONVERGENCE OF THE ITERATED IRS METHOD

โœ Scribed by M.I. Friswell; S.D. Garvey; J.E.T. Penny


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
195 KB
Volume
211
Category
Article
ISSN
0022-460X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Static or Guyan reduction is widely used to reduce the number of degrees of freedom in a finite element model, but it is exact only at zero frequency. The Improved Reduced System (IRS) method makes some allowance for the inertia terms and produces a reduced model which more accurately estimates the modal model of the full system. The IRS method may be extended to produce an iterative algorithm for the reduction transformation. It has already been shown that this reduced model reproduces a subset of the modal model of the full system if the algorithm converges. In this paper it is proved that the iterated IRS method converges. It is also shown that the lower modes converge more quickly than the higher modes and that the master co-ordinates should be chosen to give an accurate static reduction.


๐Ÿ“œ SIMILAR VOLUMES


On the convergence of basic iterative me
โœ Jรผrgen Bey; Arnold Reusken ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 2 views

In this paper we analyze convergence of basic iterative Jacobi and Gauss-Seidel type methods for solving linear systems which result from finite element or finite volume discretization of convection-diffusion equations on unstructured meshes. In general the resulting stiffness matrices are neither M

Strong convergence of an iterative metho
โœ Yisheng Song; Rudong Chen ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB

## Abstract Let __E__ be a real reflexive Banach space having a weakly continuous duality mapping __J__~__ฯ†__~ with a gauge function __ฯ†__, and let __K__ be a nonempty closed convex subset of __E__. Suppose that __T__ is a nonโ€expansive mapping from __K__ into itself such that __F__ (__T__) โ‰  โˆ…๏ธ.

A unified framework for accelerating the
โœ Charbel Farhat; Po-Shu Chen; Franck Risler; Francois-Xavier Roux ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 348 KB ๐Ÿ‘ 1 views

The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the รฟnite element discretization of structural engineering, solid mechanics, and structural dynamics

On the convergence of general stationary
โœ Naimin Zhang; Yi-Min Wei ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 142 KB ๐Ÿ‘ 1 views

## Abstract General stationary iterative methods with a singular matrix __M__ for solving rangeโ€Hermitian singular linear systems are presented, some convergence conditions and the representation of the solution are also given. It can be verified that the general Ortegaโ€“Plemmons theorem and Keller