Premium
Fast steepest descent path algorithm for analyzing scattering from two‐dimensional objects
Author(s) -
Michielssen E.,
Chew W. C.
Publication year - 1996
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/96rs01364
Subject(s) - algorithm , strassen algorithm , gradient descent , matrix (chemical analysis) , path (computing) , mathematics , multiplication (music) , matrix multiplication , computational complexity theory , scattering , method of steepest descent , fast multipole method , multipole expansion , computer science , mathematical optimization , physics , combinatorics , optics , artificial intelligence , materials science , quantum mechanics , artificial neural network , composite material , quantum , programming language
A novel algorithm for accelerating the iterative solution of integral equations governing scattering from surfaces is presented. The proposed fast steepest descent path algorithm (FASDPA) complements previously developed fast solvers, notably the fast multipole method (FMM) and the matrix decomposition algorithm (MDA). Whereas the computational complexity per iteration of a two‐level FMM and MDA is O ( N 3/2 ), the FASDPA permits a matrix‐vector multiplication in O ( N 4/3 ) operations.