Zero, minimum and maximum relative radial acceleration for planar formation flight dynamics near triangular libration points in the Earth-Moon system

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Natural formations at the Earth-Moon triangular point in perturbed restricted problems

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

A coupling technique for non-matching finite element meshes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Graded meshes in bio-thermal problems with transmission-line modeling method

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Caminhamento fotogramétrico com arranjo triangular de câmaras fotográficas

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.

Performance evaluation of a parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes

[EN]A new parallel algorithm for simultaneous untangling and smoothing of tetrahedral meshes is proposed in this paper. We provide a detailed analysis of its performance on shared-memory many-core computer architectures. This performance analysis includes the evaluation of execution time, parallel scalability, load balancing, and parallelism bottlenecks. Additionally, we compare the impact of three previously published graph coloring procedures on the performance of our parallel algorithm. We use six benchmark meshes with a wide range of sizes. Using these experimental data sets, we describe the behavior of the parallel algorithm for different data sizes. We demonstrate that this algorithm is highly scalable when it runs on two different high-performance many-core computers with up to 128 processors...

Construction of polynomial spline spaces over quadtree and octree T-meshes

[EN]We present a new strategy for constructing tensor product spline spaces over quadtree and octree T-meshes. The proposed technique includes some simple rules for inferring local knot vectors to define spline blending functions. These rules allow to obtain for a given T-mesh a set of cubic spline functions that span a space with nice properties: it can reproduce cubic polynomials, the functions are C2-continuous, linearly independent, and spaces spanned by nested T-meshes are also nested. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0-balanced quadtree or octree. ..

Construction of polynomial spline spaces over quadtree and octree T-meshes

[EN]We present a new strategy for constructing tensor product spline spaces over quadtree and octree T-meshes. The proposed technique includes some simple rules for inferring local knot vectors to define spline blending functions. These rules allow to obtain for a given T-mesh a set of cubic spline functions that span a space with nice properties: it can reproduce cubic polynomials, the functions are C2-continuous, linearly independent, and spaces spanned by nested T-meshes are also nested. In order to span spaces with these properties applying the proposed rules, the T-mesh should fulfill the only requirement of being a 0-balanced quadtree or octree. ..

From carbazole-containing and pi-expanded triangular trinuclear porphyrinoids

Zusammenfassung:rnDie vorliegende Arbeit beschreibt das Design und die Synthese neuartiger Porphyrinoide anhand der Modifikation und der π-Systemausdehnung an der Peripherie des Porphyrin-Gerüsts. Die Darstellung künstlicher Porphyrine ist von Interesse, da neue physiko-chemischen Eigenschaften erhalten und untersucht werden können. Die in dieser Arbeit vorgestellten Porphyrinoide wurden mit Hilfe von modernen Synthesemethoden wie den metallkatalysierten Kreuzkupplungen und somit durch Aryl-Aryl Verknüpfungen aufgebaut.rnDer erste Teil dieser Arbeit befasst sich mit der Modifikation des Porphyrin-Gerüsts. Porphyrine bestehen aus jeweils zwei Pyrrol- und Pyrrolenin-Einheiten, welche systematisch ausgetauscht wurden. Die Pyrrol-Einheiten wurden durch Carbazol ersetzt, das sich formal vom Pyrrol durch Anfügen von zwei Benzogruppen ableitet und deshalb besonders gut geeignet ist. Die Pyrrolenin-Einheiten wurden aus folgenden Gründen durch andere Heterozyklen wie Pyridin, Pyrrol oder Triazol ersetzt: rn* Nachbildung des stabilen Porphyrin trans-NH-Tautomers (Carbazol und Pyridin)rn* Nachbildung von (NH)4-Liganden wie Calix[4]pyrrol (Carbazol und Pyrrol)rn* Vereinigung von N-H und C-H Wasserstoffbrücken-Donor-Einheiten in einem Makrozyklus (Carbazol und Triazol)rnDie Synthese eines drei-Zentren Porphyrinoids mit ausgedehntem π-System wird im zweiten Teil der vorliegenden Arbeit beschrieben. Dieses Thema basiert auf der aktuellen Entwicklung von nicht-Edelmetall basierten Katalysatoren für die Reduktion von Sauerstoff. Hier werden derzeit N4 makrozyklische Metallkomplexe, die mehrere katalytisch aktive Stellen aufweisen, untersucht. In diesem Zusammenhang, hat die Gruppe von Prof. Müllen einen neuartigen drei-Zentren-Komplex entwickelt. Ausgehend von diesen Erkenntnissen, dient diese Arbeit zur Verbesserung der katalytischen Aktivität des drei-Zentren-Komplex durch die Variation von verschieden Substituenten. Hierbei wurden zwei wesentliche Konzepte verfolgt:rn* Vernetzung durch die Bildung von Netzwerken oder durch Pyrolyse in der Mesophasern* Verbesserung des Katalysator-Trägermaterial-KontaktsrnNeben den Synthesen wurden die Eigenschaften und möglichen Anwendungen dieser neuartigen Materialen untersucht, wie z.B. als Liganden für Übergangsmetalle, als Anionenrezeptoren oder als Elektrokatalysatoren für die Reduktion von Sauerstoff. rn

Mesh-based vs. Image-based Statistical Appearance Model of the Human Femur: a Preliminary Comparison Study for the Creation of Finite Element Meshes

Statistical models have been recently introduced in computational orthopaedics to investigate the bone mechanical properties across several populations. A fundamental aspect for the construction of statistical models concerns the establishment of accurate anatomical correspondences among the objects of the training dataset. Various methods have been proposed to solve this problem such as mesh morphing or image registration algorithms. The objective of this study is to compare a mesh-based and an image-based statistical appearance model approaches for the creation of nite element(FE) meshes. A computer tomography (CT) dataset of 157 human left femurs was used for the comparison. For each approach, 30 finite element meshes were generated with the models. The quality of the obtained FE meshes was evaluated in terms of volume, size and shape of the elements. Results showed that the quality of the meshes obtained with the image-based approach was higher than the quality of the mesh-based approach. Future studies are required to evaluate the impact of this finding on the final mechanical simulations.

Topological changes in 2D simplicial meshes for the simulation of fractures

A method for the introduction of strong discontinuities into a mesh will be developed. This method, applicable to a number of eXtended Finite Element Methods (XFEM) with intra-element strong discontinuities will be demonstrated with one specific method: the Generalized Cohesive Element (GCE) method. The algorithm utilizes a subgraph mesh representation which may insert the GCE either adaptively during the course of the analysis or a priori. Using this subgraphing algorithm, the insertion time is O(n) to the number of insertions. Numerical examples are presented demonstrating the advantages of the subgraph insertion method.