Ir directamente a la navegación principal Ir directamente a la búsqueda Ir directamente al contenido principal

Efficient fill of a nested representation of the EFIE at low frequencies

Producción científica: Conference contributionrevisión exhaustiva

11 Citas (Scopus)

Resumen

A procedure for filling a nested representation of the EFIE impedance matrix is discussed. At low frequencies, the memory complexity of the method is approximately O(N), and the CPU complexity is approximately O(N log N). The reconstruction error is also computed to demonstrate that the fill procedure provides an error-controlled representation over several orders of magnitude.

Idioma originalEnglish
Título de la publicación alojada2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI
DOI
EstadoPublished - 2008
Evento2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI - San Diego, CA, United States
Duración: jul 5 2008jul 12 2008

Serie de la publicación

Nombre2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI

Conference

Conference2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI
País/TerritorioUnited States
CiudadSan Diego, CA
Período7/5/087/12/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Huella

Profundice en los temas de investigación de 'Efficient fill of a nested representation of the EFIE at low frequencies'. En conjunto forman una huella única.

Citar esto