Pasar al contenido principal

REDUCCION DE CARACTERISTICAS Y COMPUTACION DE ALTAS PRESTACIONES EN PROBLEMAS DE ALTA DIMENSIONALIDAD

TIN2010-14971

•
Nombre agencia financiadora Ministerio de Ciencia e Innovación
Acrónimo agencia financiadora MICINN
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2010
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Subdirección General de Proyectos de Investigación
Centro beneficiario UNIVERSIDAD DE OVIEDO
Identificador persistente http://dx.doi.org/10.13039/501100004837

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A multicore solution to Block-Toeplitz linear systems of equations

  • Alonso-Jordá, Pedro|||0000-0002-6882-6592
  • Vidal Maciá, Antonio Manuel
  • Argüelles, Daniel
  • Ranilla, José
There exist algorithms, also called "fast" algorithms, which exploit the special structure of Toeplitz matrices so that, e.g., allow to solve a linear system of equations in O(n2) flops. However, some implementations of classical algorithms that do not use this structure (O(n3) flops) highly reduce the time to solution when several cores are available. That is why it is necessary to work on "fast" algorithms so that they do not lose track of the benefits of new hardware/software. In this work, we propose a new approach to the Generalized Schur Algorithm, a very known al- gorithm for the solution of Toeplitz systems, to work on a Block-Toeplitz matrix. Our algorithm is based on matrix-matrix multiplications, thus allowing to exploit an efficient implementation of this operation if it exists. Our algorithm also makes use of the thread level parallelism featured by multicores to decrease execution time., PROMETEO/2009/013, Generalitat Valenciana. Projects TEC2009-13741, TIN2010-14971 and TIN2011-15734-E of the Ministerio Espanol de Ciencia e Innovacion, and TEC2012-38142-C04 of the Ministerio Espanol de Economia y Competitividad.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Non-linear parallel solver for detecting point sources in CMB maps using Bayesian techniques

  • Alonso, P.
  • Argüeso, F.
  • Cortina, R.
  • Ranilla, J.
  • Vidal Maciá, Antonio Manuel
Abstract In this work we present a suitable computational tool to deal with large matrices and solve systems of non-linear equations. This technique is applied to a very interesting problem: the detection and flux estimation of point sources in Cos- mic Microwave Background (CMB) maps, which allows a good determination of CMB primordial fluctuations and leads to a better knowledge of the chemistry at the early stages of the Universe. The method uses previous information about the statis- tical properties of the sources, so that this knowledge is incorporated in a Bayesian scheme. Simulations show that our approach allows the detection of more sources than previous non-Bayesian techniques, with a small computation time, This work was financially supported by the Spanish Ministerio de Ciencia e Innovacion and by FEDER Projects (TEC2012-38142-C04, TIN2010-14971, TEC2009-13741 and CAPAP-H4 TIN2011-15734-E) Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-11) and Generalitat Valenciana through project PROMETEO/2009/013. We thank Diego Herranz for his help with the CMB simulations.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An efficient and scalable block parallel algorithm of Neville elimination as a tool for the CMB maps problem

  • Alonso, P.
  • Cortina, R.
  • Ranilla, J.
  • Vidal Maciá, Antonio Manuel
Abstract This paper analyses the performance of several versions of a block parallel algorithm in order to apply Neville elimination in a distributed memory parallel computer. Neville elimination is a procedure to transform a square matrix A into an upper triangular one. This analysis must take into account the algorithm behaviour as far as execution time, efficiency and scalability are concerned. Special attention has been paid to the study of the scalability of the algorithms trying to establish the relationship existing between the size of the block and the performance obtained in this metric. It is important to emphasize the high efficiency achieved in the studied cases and that the experimental results confirm the theoretical approximation. Therefore, we have obtained a high predicting ability tool of analysis. Finally, we will present the elimination of Neville as an efficient tool in detecting point sources in cosmic microwave background maps.© Springer Science+Business Media, LLC 2010, This work has been partially supported by the Spanish Research Grants TIN2007-61273, TIN2008-06570-C04-02 and TIN2010-14971, and by Valencia Regional Government Grant PRO-METEO/2009/013. Also, we would like to give special thanks to Professor Francisco Argueso of University of Oviedo for his help.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Detecting point sources in CMB maps using an efficient parallel algorithm

  • Alonso, P.
  • Argüeso, F.
  • Cortina, R.
  • Ranilla, J.
  • Vidal Maciá, Antonio Manuel
The Cosmic Microwave Background (CMB) is a diffuse radiation which is contaminated by the radiation emitted by point sources. The precise knowledge of CMB fluctuations can lead to a better knowledge of the chemistry at the early stages of the Universe. In this work, we present an efficient algorithm, with a high degree of parallelism, which can improve, from the computational point of view, the classical approaches for detecting point sources in Cosmic Microwave Background maps. High performance computing libraries and parallel computing techniques have allowed to construct a portable, fast and numerically stable algorithm. To check the performance of the new method, we have carried out several simulations resembling the observational data collected by the Low Frequency Instrument of the Planck satellite. The sources are detected in their real positions. © 2011 Springer Science+Business Media, LLC., This work was financially supported by the Spanish Ministerio de Ciencia e Innovacion and by FEDER (Projects TIN2010-14971, TIN2008-06570-C04-02, TEC2009-13741 and CAPAP-H3 TIN2010-12011-E), Universitat Politecnica de Valencia through Programa de Apoyo a la Investigacion y Desarrollo (PAID-05-10) and Generalitat Valenciana through project PROMETEO/2009/013. We thank Diego Herranz for his help with the CMB simulations.