Advanced search options

You searched for `subject:(Matrix Projection Algorithms)`

. One record found.

▼ Search Limiters

University of Illinois – Urbana-Champaign

1.
Sarathy, Aditya.
Fast *algorithms* for small particle scattering problems.

Degree: MS, 1200, 2014, University of Illinois – Urbana-Champaign

URL: http://hdl.handle.net/2142/50498

In scattering problems, commonly used techniques are surface and volume integral equations. Discrete dipole approximation (DDA) is an alternate and useful discretization technique to solve these problems where the continuum scatterer is replaced by a set of polarizable dipoles. It is an alternative to volume integral equations and produces a dense matrix equation to be solved. Computationally, the method requires the solution of large dense systems of linear equations, and various iterative methods have been employed in the literature for the purpose. In this work, two distinct methods are proposed that can reduce the cost of computation.
The first method to reduce the computation time of the solution is using matrix decomposition methods. The idea in this method is using randomized algorithms for low rank approximating of matrices. When implemented using special kinds of random matrices, the computational complexity of the multilevel solver is comparable to that of the fast multipole method. These methods, however, require visiting every entry of the interaction matrix at least once, thereby incurring a computational bottleneck of 𝓞(N^{2}). They are error controllable and a greater error margin can reduce the computation time.
The second method to reduce the computational complexity is the fast multipole method (FMM). This is based on the factorization of the Green's function and is useful only in those cases where the Green's function of the system can be decomposed into a product of special functions. The decomposition of the free space Green's function is well known using the addition theorem. However, in more complicated cases, this factorization is extremely complicated. In the case considered in this thesis, however, the scattering problem is formulated using the free space Green's function and can be sped up using the FMM also, which requires much less computational time than the matrix decomposition method.
*Advisors/Committee Members: Chew, Weng Cho (advisor).*

Subjects/Keywords: Method of Moments; Computational Electromagnetics; Fast Multipole Method; Matrix Projection Algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Sarathy, A. (2014). Fast algorithms for small particle scattering problems. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/50498

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sarathy, Aditya. “Fast algorithms for small particle scattering problems.” 2014. Thesis, University of Illinois – Urbana-Champaign. Accessed October 21, 2019. http://hdl.handle.net/2142/50498.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sarathy, Aditya. “Fast algorithms for small particle scattering problems.” 2014. Web. 21 Oct 2019.

Vancouver:

Sarathy A. Fast algorithms for small particle scattering problems. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2014. [cited 2019 Oct 21]. Available from: http://hdl.handle.net/2142/50498.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sarathy A. Fast algorithms for small particle scattering problems. [Thesis]. University of Illinois – Urbana-Champaign; 2014. Available from: http://hdl.handle.net/2142/50498

Not specified: Masters Thesis or Doctoral Dissertation