Person:
Pinelli, Alfredo

Loading...
Profile Picture
First Name
Alfredo
Last Name
Pinelli
Affiliation
Universidad Complutense de Madrid
Faculty / Institute
Ciencias Matemáticas
Department
Area
Matemática Aplicada
Identifiers
UCM identifierDialnet ID

Search Results

Now showing 1 - 2 of 2
  • Publication
    Block tridiagonal solvers on heterogeneous architectures
    (IEEE, 2012) Valero Lara, P.; Pinelli, Alfredo; Favier, J.; Matías, M.P.
    Modern multi-core and many-core systems offer a very impressive cost/performance ratio. In this paper a set of new parallel implementations for the solution of linear systems with block-tridiagonal coefficient matrix on current parallel architectures is proposed and evaluated: one of them on multi-core, others on many-core and finally, a new heterogeneous implementation on both architectures. The results show a speedup higher than 6 on certain parts of the problem, being the heterogeneous implementation the fastest.
  • Publication
    Immersed-boundary methods for general finite-difference and finite-volume Navier-Stokes solvers
    (Elsevier, 2010) Pinelli, Alfredo; Naqavi, I.Z.; Piomelli, U.; Favier, J.
    We present an immersed-boundary algorithm for incompressible flows with complex boundaries, suitable for Cartesian or curvilinear grid system. The key stages of any immersed-boundary technique are the interpolation of a velocity field given on a mesh onto a general boundary (a line in 2D, a surface in 3D), and the spreading of a force field from the immersed boundary to the neighboring mesh points, to enforce the desired boundary conditions on the immersed-boundary points. We propose a technique that uses the Reproducing Kernel Particle Method [W.K. Liu, S. Jun, Y.F. Zhang, Reproducing kernel particle methods, Int. J. Numer. Methods Fluids 20(8) (1995) 1081-1106] for the interpolation and spreading. Unlike other methods presented in the literature, the one proposed here has the property that the integrals of the force field and of its moment on the grid are conserved, independent of the grid topology (uniform or non-uniform, Cartesian or curvilinear). The technique is easy to implement, and is able to maintain the order of the original underlying spatial discretization. Applications to two- and three-dimensional flows in Cartesian and non-Cartesian grid system, with uniform and non-uniform meshes are presented.