𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Condensation algorithms for the regular mesh substructuring

✍ Scribed by Liu Xiao-Lin; Y. C. Lam


Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
824 KB
Volume
38
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

This paper describes and analyses the implementation of two static condensation algorithms used to exploit the regular patterns created by two schemes of regular mesh substructuring. Computer resources required by the implementation are assessed in terms of the number of multiplications, the total CPU time, the core and the disk storage requirements. It is discovered that, when implemented for the regular mesh substructuring, the newly proposed condensation algorithm is generally more cost effective than the one proposed by Han and Abel, and modified for the regular mesh substructuring by the present authors.


πŸ“œ SIMILAR VOLUMES


Exploiting the physical symmetry of regu
✍ Lam, Y. C. ;Xiao-Lin, Liu πŸ“‚ Article πŸ“… 1992 πŸ› Wiley (John Wiley & Sons) 🌐 English βš– 696 KB

## Abstract A new technique of multi‐level substructuring based on a regular mesh is presented. The technique takes advantage of the physical symmetry and repetitivity generated by the regular mesh. A special node‐numbering/addressing system is developed to exploit the symmetry which results in the

Reconfigurable Mesh Algorithms for the H
✍ J.F. Jenq; S. Sahni πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 675 KB

We develop parallel algorithms to compute the Hough transform on a reconfigurable mesh with buses (RMESH) multiprocessor. The \(p\) angle Hough transform of an \(N \times N\) image can be computed in \(O(p \log (N / p))\) time by an \(N \times N\) RMESH, in \(O((p /\) \(N\) ) \(\log N\) ) time by an