✍ Scribed by M. Morandi Cecchi; F. Marcuzzi
No coin nor oath required. For personal study only.
A numerical homogenization method is presented here to solve problems governed by partial di erential equations with coe cients that are generic functions in R 2 . It consists of a recursive ÿnite elements discretization and an algebraic homogenization. This method takes advantages of speed and memory occupation from the hierarchy of elements and nodes deÿned by the recursive discretization. It turns out that using the state-of-the-art general linear algebra techniques, all non-numerical data manipulations that are typically done before real computations, can be avoided.
📜 SIMILAR VOLUMES
We present an algorithmic procedure for the ÿnite element solution of structural problems for no-tension materials. The approach is based upon a suitable modiÿcation of the tangent strategy which is shown to be computationally superior to conventional procedures for non-linear material models, namel
A new contact search algorithm (Inside-Outside Algorithm) for the sheet forming simulation has been developed and implemented in the dynamic explicit FE code: ' DYNAMIC '. The inside-outside algorithm is derived based on the feature of the inside-outside status of a nodal 'mesh normal vector' in res
The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional dir
This paper studies and compares the domain partitioning algorithms presented by Farhat, Al-Nasra and Nguyen, Malone, and Simon/Hsieh et al. for load balancing in parallel finite element analysis. Both the strengths and weaknesses of these algorithms are discussed. Some possible improvements to the p
The analysis of radiation and scattering from a multiregion ( ) quasiplanar structure using the con¨entional method of moments MoM is computationally expensi¨e. To circum¨ent this difficulty, a computational scheme that supplements the classical MoM with the steepest descent fast-multipole algorithm