Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 155 for “"Fast algorithm"”.
-
A fast algorithm for modelling multiple bubbles dynamics
… of a numerical strategy to combine the Fast Fourier Transforms on Multipoles (FFTM) method and the Boundary Element Method (BEM) to study the dynamics of multiple bubbles physics in a moving boundary problem. The disadvantage of the BEM is to solve the boundary integral equation by …
-
Fast Algorithm for Electrically Small Inhomogeneous Medium Structures
With the above accomplishments, electrically small composite structures involving lossless or lossy materials can be solved with O( N) computational cost.
-
Fast Algorithm for Modeling of Rain Events in Weather Radar Imagery
Weather radar imagery is important for several remote sensing applications including tracking of storm fronts and radar echo classification. In particular, tracking of precipitation events is useful for both forecasting and classification of rain/non-rain events since non-rain events usually appear …
-
A fast algorithm for approximating hydrodynamic lubrication interactions between elastic particles
Made available in DSpace on 2010-08-20T17:56:31Z (GMT). No. of bitstreams: 3 Higa_Kenneth.pdf: 2312620 bytes, checksum: ec5ce7a5b2725293e6f6bfeb9258614c (MD5) 1_Higa_Kenneth.pdf: 2312665 bytes, checksum: aef11826adce2877b64cc45c9460c85f (MD5) license.txt: 4059 bytes, checksum: …
-
Fast algorithm and surface integral equations for two-dimensional materials modeling
… dissertation, a wide-band two-dimensional (2D) fast multipole algorithm (FMA) with a novel diagonalization form is presented. The conventional diagonalization of 2D FMA can be derived based on the interpretation of Parseval's theorem. The performance of FMA in the twilight zone (between the …
-
Fast algorithm for joint unicast and multicast beamforming in large-scale systems
… direction method of multipliers (ADMM)-based fast algorithm that efficiently obtains the beamforming solutions for unicast and multicast users to minimize the transmit power subject to quality-of-service constraints. Utilizing the optimal multicast beamforming structure obtained recently, we …
-
Multilevel Multipole -Free Fast Algorithm for Electromagnetic Scattering Problems in Layered Media
Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs
-
MPI parallelization of fast algorithm codes developed using SIE/VIE and P-FFT method
… how to parallelize the Precorrected-FFT algorithm in the field of electromagnetic scattering. The background of parallelizing the Precorrected-FFT is introduced at first. Then the parallel method of surface integral equation with the Precorrected-FFT algorithm is given and the results of …
-
Fast Algorithm for Invariant Circle and their Stable Manifolds: Rigorous Results and Efficient Implementations
… and implement a quadratically convergent algorithm to compute the invariant circle and the foliation by stable manifolds for 2-dimensional maps. The 2-dimensional maps we are considering are motivated by oscillators subject to periodic perturbation. The algorithm is based on solving an …
-
OVNI (Object Virtual Network Integrator) : a new fast algorithm for the simulation of very large electric networks in real time
A portable fast algorithm for solving power electric and electronic networks, and its implementation in the real-time simulator OVNI, are introduced. The implementation of OVNI, object virtual network integrator, on an off-the-shelf hardware platform, a 400 MHz Pentium-II workstation is presented. …
-
Development of the Fast Multipole Method for Stratified Medium
… part of this thesis is devoted to developing a fast algorithm to calculate the scattering by a perfect electrically conducting (PEC) body embedded in a single layer of a layered medium. A symmetric form of the dyadic Green's function is derived. All image scalar Green's functions within the …
-
NUMERICAL SIMULATION AND ERROR ESTIMATION OF INCHWORM MONTE CARLO METHOD FOR OPEN QUANTUM SYSTEMS
… In Part I, we establish the validity of the algorithm rigorously based on resummation of Dyson series. Moreover, we introduce an integro-differential equation formulation for open quantum systems, which leads to an improvement of the inchworm algorithm by introducing classical deterministic …
-
A Fast Minimal Infrequent Itemset Mining Algorithm
A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in run-time relative to the state of the art and the scalability of the algorithm to realistically-sized datasets up to …
-
Coordinated multicast beamforming for multi-cell massive MIMO systems
… concex approximation (SCA). To further design a fast algorithm applicable to massive MIMO systems, we apply the alternating direction method of multipliers (ADMM) technique and propose an ADMM-based first-order algorithm to solve the quality of service (QoS) problem, which decompose the QoS …
-
A hybrid algorithm for terrain simplification
… and not necessarily, large nowadays. A fast algorithm that can produce compact yet highly accurate model would be desirable. In this thesis, a hybrid algorithm integrating greedy insertion and quadric error based approximation is given. This algorithm is designed to provide a highquality …
-
Fast Inhomogeneous Plane Wave Algorithm for Electromagnetic Scattering Problems
The fast inhomogeneous plane wave algorithm (FIPWA) has been developed and successfully applied to solving large-scale electromagnetic scattering problems, both in free space and in the presence of a multilayered medium. A multilevel program has been implemented. The resultant computational …
-
Fast Algorithms for Sampled Multiband Signals
… properties. However, prior to this research, no fast algorithms for working with the Slepian basis had been developed. As such, practitioners often overlooked the Slepian basis vectors for more computationally efficient tools, such as the FFT, even in problems for which the Slepian basis vectors …
Page 1 of 8