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


Autoria(s): Gómez Revuelto, Ignacio; Barrio Garrido, Rosa María; García Castillo, Luis Emilio; Salazar Palma, Magdalena
Data(s)

2013

Resumo

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.

Formato

application/pdf

Identificador

http://oa.upm.es/29749/

Idioma(s)

spa

Publicador

E.U.I.T. Telecomunicación (UPM)

Relação

http://oa.upm.es/29749/1/INVE_MEM_2013_169126.pdf

http://www.ursi2013.org/

info:eu-repo/semantics/altIdentifier/doi/null

Direitos

http://creativecommons.org/licenses/by-nc-nd/3.0/es/

info:eu-repo/semantics/openAccess

Fonte

XXVIII Simposium Nacional de la Unión Científica Internacional de Radio URSI 2013 | 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

Palavras-Chave #Matemáticas #Informática
Tipo

info:eu-repo/semantics/conferenceObject

Ponencia en Congreso o Jornada

PeerReviewed