✦ LIBER ✦

ITERATIVE MATRIX APPROXIMATION FOR MODEL UPDATING

✍ Scribed by S.W. Smith

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 270 KB
Volume: 12
Category: Article
ISSN: 0888-3270
DOI: 10.1006/mssp.1997.0140

No coin nor oath required. For personal study only.

✦ Synopsis

Alternating projection algorithms for matrix approximation are applied for structural model updating. Desired matrix properties such as sparsity, definiteness, and satisfaction of eigenconstraints are imposed as side constraints for a minimisation problem formulated to produce an updated matrix model which better matches measured data. Included are formulations of the update problem and discussion of the determination of solutions, convergence of the alternating projections approach as seen through geometric interpretations, and experimental verification. These approaches are verified through an application to locate damage in a laboratory truss structure using stiffness matrix approximation with experimental vibration measurements.

📜 SIMILAR VOLUMES

A Best Matrix Approximation Method for U

A Best Matrix Approximation Method for Updating the Analytical Model

✍ Zhang Xianmin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 178 KB

A best matrix approximation technique for updating the analytical model is developed using the known modal parameters. Firstly, the known modal matrix is decomposed by means of the singular-value decomposition technique. Secondly, the general updating equations for the analytical model are obtained

A sparse matrix iterative approach for m

A sparse matrix iterative approach for modeling tree scattering

✍ Kung-Hau Ding; Leung Tsang 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 273 KB

## Abstract In this paper we present a computational electromagnetic model for tree scattering at VHF/UHF frequencies. A structure model with dielectric cylinders is being used to simulate trees with bare branches. The method of moments (MoM) solution of the volume integral equation is computed for

Optimal starting approximations for iter

Optimal starting approximations for iterative schemes

✍ G Meinardus; G.D Taylor 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

Approximate implicit subspace iteration

Approximate implicit subspace iteration with alternating directions for LTI system model reduction

✍ Yunkai Zhou; D. C. Sorensen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

REGULARISATION METHODS FOR FINITE ELEMEN

REGULARISATION METHODS FOR FINITE ELEMENT MODEL UPDATING

✍ H. Ahmadian; J.E. Mottershead; M.I. Friswell 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 270 KB

This paper addresses the problem of selecting a side constraint and determining the regularisation parameter in model updating. The weight to be attached to the constraint is determined by the regularisation parameter. Methods based on singular value decomposition, cross-validation, and L-curves are

A model for iterative computation

✍ D. Tsichritzis 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 596 KB