Medidas experimentales de la complejidad computacional de un código autoadaptativo HP para problemas abiertos acelerado mediante ACA

Gómez Revuelto, Ignacio and Barrio Garrido, Rosa María and García Castillo, Luis Emilio and Salazar Palma, Magdalena (2013). Medidas experimentales de la complejidad computacional de un código autoadaptativo HP para problemas abiertos acelerado mediante ACA. In: "XXVIII Simposium Nacional de la Unión Científica Internacional de Radio. URSI 2013 . Santiago de Compostela, España, septiembre 2013.", 11/09/2013 - 13/09/2013, Santiago de Compostela, España. pp. 1-4.

Description

Title: Medidas experimentales de la complejidad computacional de un código autoadaptativo HP para problemas abiertos acelerado mediante ACA
Author/s:
  • Gómez Revuelto, Ignacio
  • Barrio Garrido, Rosa María
  • García Castillo, Luis Emilio
  • Salazar Palma, Magdalena
Item Type: Presentation at Congress or Conference (Article)
Event Title: XXVIII Simposium Nacional de la Unión Científica Internacional de Radio. URSI 2013 . Santiago de Compostela, España, septiembre 2013.
Event Dates: 11/09/2013 - 13/09/2013
Event Location: Santiago de Compostela, España
Title of Book: XXVIII Simposium Nacional de la Unión Científica Internacional de Radio URSI 2013
Date: 2013
Subjects:
Faculty: E.U.I.T. Telecomunicación (UPM)
Department: Ingeniería Audiovisual y Comunicaciones [hasta 2014]
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (269kB) | Preview

Abstract

The aim of the novel experimental measures presented in this paper is to show the improvement achieved in the computation time for a 2D self-adaptive hp finite element method (FEM) software accelerated through the Adaptive Cross Approximation (ACA) method. This algebraic method (ACA) was presented in an previous paper in the hp context for the analysis of open region problems, where the robust behaviour, good accuracy and high compression levels of ACA were demonstrated. The truncation of the infinite domain is settled through an iterative computation of the Integral Equation (IE) over a ficticious boundary, which, regardless its accuracy and efficiency, turns out to be the bottelneck of the code. It will be shown that in this context ACA reduces drastically the computational effort of the problem.

More information

Item ID: 29749
DC Identifier: http://oa.upm.es/29749/
OAI Identifier: oai:oa.upm.es:29749
Official URL: http://www.ursi2013.org/
Deposited by: Memoria Investigacion
Deposited on: 17 Jul 2014 18:00
Last Modified: 22 Apr 2016 00:08
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM