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...

Duality in complex stochastic boolean systems

[EN]Many different complex systems depend on a large number n of mutually independent random Boolean variables. The most useful representation for these systems –usually called complex stochastic Boolean systems (CSBSs)– is the intrinsic order graph. This is a directed graph on 2n vertices, corresponding to the 2n binary n-tuples (u1, . . . , un) ∈ {0, 1} n of 0s and 1s. In this paper, different duality properties of the intrinsic order graph are rigorously analyzed in detail. The results can be applied to many CSBSs arising from any scientific, technical or social area…

Normalized Frobenius condition number of the orthogonal projections of the identity

[EN]This paper deals with the orthogonal projection (in the Frobenius sense) AN of the identity matrix I onto the matrix subspace AS (A ? Rn×n, S being an arbitrary subspace of Rn×n). Lower and upper bounds on the normalized Frobenius condition number of matrix AN are given. Furthermore, for every matrix subspace S ? Rn×n, a new index bF (A, S), which generalizes the normalized Frobenius condition number of matrix A, is defined and analyzed...

Adaptive finite element simulation of stack pollutant emissions over complex terrains

[EN]A three-dimensional finite element model for the pollutant dispersion is presented. In these environmental processes over a complex terrain, a mesh generator capable of adapting itself to the topographic characteristics is essential. The first stage of the model consists on the construction of an adaptive tetrahedral mesh of a rectangular region bounded in its lower part by the terrain and in its upper part by a horizontal plane. Once the mesh is constructed, an adaptive local refinement of tetrahedra is used in order to capture the plume rise. Wind measurements are used to compute an interpolated wind field, that is modified by using a mass-consistent model and perturbing its vertical component to introduce the plume rise effect...

Improving approximate inverses based on Frobenius norm minimization

[EN]Approximate inverses, based on Frobenius norm minimization, of real nonsingular matrices are analyzed from a purely theoretical point of view. In this context, this paper provides several sufficient conditions, that assure us the possibility of improving (in the sense of the Frobenius norm) some given approximate inverses. Moreover, the optimal approximate inverses of matrix A ∈ R n×n , among all matrices belonging to certain subspaces of R n×n , are obtained. Particularly, a natural generalization of the classical normal equations of the system Ax = b is given, when searching for approximate inverses N 6= AT such that AN is symmetric and kAN − IkF < AAT − I F …

Geometrical and Spectral Properties of the Orthogonal Projections of the Identity

[EN]We analyze the best approximation

A generalization of the optimal diagonal approximate inverse preconditioner

[EN ]The classical optimal (in the Frobenius sense) diagonal preconditioner for large sparse linear systems Ax = b is generalized and improved. The new proposed approximate inverse preconditioner N is based on the minimization of the Frobenius norm of the residual matrix AM − I, where M runs over a certain linear subspace of n × n real matrices, defined by a prescribed sparsity pattern. The number of nonzero entries of the n×n preconditioning matrix N is less than or equal to 2n, and n of them are selected as the optimal positions in each of the n columns of matrix N. All theoretical results are justified in detail…

A new method for T-spline parameterization of complex 2D geometries

[EN]We present a new strategy, based on the idea of the meccano method and a novel T-mesh optimization procedure, to construct a T-spline parameterization of 2D geometries for the application of isogeometric analysis. The proposed method only demands a boundary representation of the geometry as input data. The algorithm obtains, as a result, high quality parametric transformation between 2D objects and the parametric domain, the unit square. First, we define a parametric mapping between the input boundary of the object and the boundary of the parametric domain. Then, we build a T-mesh adapted to the geometric singularities of the domain in order to preserve the features of the object boundary with a desired tolerance...

Complex stochastic boolean systems: comparing bitstrings with the same hamming weight

[EN]A complex stochastic Boolean system (CSBS) is a complex system depending on an arbitrarily large number

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. ..

Complex sochastic boolean systems : new properties of the intrinsic order graph

[EN]A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of stochastic Boolean variables. The analysis of CSBSs is mainly based on the intrinsic order: a partial order relation defined on the set f0; 1gn of binary n-tuples. The usual graphical representation for a CSBS is the intrinsic order graph: the Hasse diagram of the intrinsic order. In this paper, some new properties of the intrinsic order graph are studied. Particularly, the set and the number of its edges, the degree and neighbors of each vertex, as well as typical properties, such as the symmetry and fractal structure of this graph, are analyzed…

Intrinsic Order and Hamming Weight

[EN]The intrinsic order is a partial order relation defined on the set {0, 1} n of all binary n-tuples. This ordering enables one to automatically compare binary n-tuple probabilities without computing them, just looking at the relative positions of their 0s & 1s. In this paper, new relations between the intrinsic ordering and the Hamming weight (i.e., the number of 1-bits in a binary n-tuple) are derived. All theoretical results are rigorously proved and illustrated through the intrinsic order graph…

Solar radiation estimation using a numerical model

[EN]A solar radiation numerical model is presented. It is intented to be useful for different purposes like the evaluation of the suitability of possible locations for solar power stations. This model allows the user to evaluate the radiation values in any location easily, and estimate the solar power generation taking into account not only the radiation level, but also the terrain surface conditions considering the cast shadows. The solar radiation model is implemented taking into account the terrain surface using 2-D adaptive meshes of triangles, which are constructed using a refinement/derefinement procedure in accordance with the variations of terrain surface and albedo...

Generating multiple random exams using mathematica package and LATEX

[EN]In the framework of the European Higher Education Area, the assessment has been one of the most important aspects considered. In the Spanish Universities, one of the main differences with regard to the previous system is the incorporation of the continuous assessment to the evaluation process that is understood in several ways depending on the Universities, the courses and the lecturers. Focus on our context, a course of Mathematics of the first academic year in the Faculty of Business Administration at the University of Las Palmas de Gran Canaria (Spain), the continuous assessment has brought the preparation of a large amount of different tests to evaluate the students enrolled in it, therefore the incorporation of new tools and skills in order to make the teaching–learning process easier and more dynamic has become a need mainly in those degrees with a large number of students as the case we consider here. In this work we provide an efficient and effective way to elaborate random multiple-choice examina tion tests (although essay exams are also possible) by using Mathematica package and LATEXin order to make easier to the lectures the preparation of a large number of mid-term tests for a large number of students.

El sistema numérico D en la formación del maestro: estudio de un programa de formación

Programa de doctorado: Formación del profesorado