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 102 for “"Iterative algorithm"”.

  1. Efficient Iterative Algorithm for Computing Quasinormal Modes of Black Holes and Information Extraction from Black Hole Ringdown Signal

    The present work shows how black hole information, such as mass and angular momentum, can be extracted via a new theoretical and computational analysis of the hole's so called <italic>ringdown radiation</italic>, which is a gravitational wave emitted by a freely oscillating black hole.

    wfu Repository record for Efficient Iterative Algorithm for Computing Quasinormal Modes of Black Holes and Information Extraction from Black Hole Ringdown Signal (opens in a new tab)

  2. Analysis and Applications of the Km Algorithm in Type-2 Fuzzy Logic Control and Decision Making

    … / enhanced Karnik-Mendel (KM / EKM) iterative algorithm for type-reduction. To perform theoretical study of the IT2 FLC, the mathematical input-output relationship of a class of symmetric IT2 fuzzy PD/PI controller was established. By comparing the derived expressions with its T1 …

    nus Repository record for Analysis and Applications of the Km Algorithm in Type-2 Fuzzy Logic Control and Decision Making (opens in a new tab)

  3. Robust transportation network design under user equilibrium

    … functions of traffic flows. We then use an iterative algorithm to address the case of nonlinear cost functions. While the problem is intractable under probabilistic assumptions on demand uncertainty, we extend the previous model and propose an iterative algorithm using a robust optimization …

    mit Repository record for Robust transportation network design under user equilibrium (opens in a new tab)

  4. A design technique for geometric optimisation of resonant coil sizes in low to mid frequency inductive power transmission systems.

    … numerical value of Pscf is investigated. A novel iterative algorithm has been developed to assist in selection of the most favourable Pscf value, which provides the optimum ACC geometry. Theoretical design examples of two RIPT systems - operating at 10 kHz (low-frequency band) and 300 kHz …

    rgu Repository record for A design technique for geometric optimisation of resonant coil sizes in low to mid frequency inductive power transmission systems. (opens in a new tab)

  5. On the Implementation and Performance of Iterative Methods for Computational Electromagnetics (Scattering, Moment-Method, Conjugate-Gradient)

    … matrix equation. The use of an iterative algorithm to solve the matrix equation sometimes results in a considerable savings in computer memory requirements. For a fixed amount of computer memory, this approach permits the analysis of scatterers that are an order of magnitude …

    uiuc Repository record for On the Implementation and Performance of Iterative Methods for Computational Electromagnetics (Scattering, Moment-Method, Conjugate-Gradient) (opens in a new tab)

  6. On Independent Reference Priors

    … is extended and generalized. We provide an iterative algorithm to derive the general independent reference prior. We also propose a sufficient condition under which a closed form of the independent reference prior is derived without going through the iterations in the iterative algorithm. …

    vt Repository record for On Independent Reference Priors (opens in a new tab)

  7. Over-Relaxation Lloyd Method For Computing Centroidal Voronoi Tessellations

    … this paper, we study acceleration of the classic iterative algorithm-- Lloyd Method for computing CVTs by applying over-relaxation schemes in the iteration process. Optimal choices of the over-relaxation parameter are studies theoretically. We also verify our results and show faster convergence of …

    south-carolina Repository record for Over-Relaxation Lloyd Method For Computing Centroidal Voronoi Tessellations (opens in a new tab)

  8. Spectral-Iterative Analysis of Electromagnetic Radiation and Scattering Problems (radar-Cross-Section, Integral Equation)

    … readily computed by the Fast-Fourier Transform algorithm resulting in a significant reduction in computer time. This spectral domain method of calculating convolutions is incorporated into an iterative algorithm to provide a numerically efficient means of solving integral equations. This thesis …

    uiuc Repository record for Spectral-Iterative Analysis of Electromagnetic Radiation and Scattering Problems (radar-Cross-Section, Integral Equation) (opens in a new tab)

  9. Krylov subspace estimation

    This thesis proposes a new iterative algorithm for the simultaneous computation of linear least-squares estimates and error variances. There exist many iterative methods for computing only estimates. However, most of these will not also compute error variances. A popular method for computing only …

    mit Repository record for Krylov subspace estimation (opens in a new tab)

  10. The use of a non-classical friction law in finite-element analysis of contact problems

    … version. The solution procedure incorporates an iterative algorithm for the determination of the extent of the contact surface. Alternative techniques for the evaluation of the frictional stresses on the contact surface are described and numerical examples are presented.

    cape-town Repository record for The use of a non-classical friction law in finite-element analysis of contact problems (opens in a new tab)

  11. Compound-Gaussian-regularized inverse problems: theory, algorithms, and neural networks

    … such as the image prior distribution, into an iterative estimation algorithm, often, as an example, solving a regularized least squares problem. Instead, data-driven methods learn the inverse reconstruction mapping directly by training a neural network structure on actual signal and signal …

    colostate Repository record for Compound-Gaussian-regularized inverse problems: theory, algorithms, and neural networks (opens in a new tab)

  12. On iterative low-complexity algorithm for optimal antenna selection and joint transmit power allocation under impact pilot contamination in downlink 5g massive MIMO systems

    … to improve EE. The proposed Low–complexity iterative algorithm for antenna selection and transmission power helped to choose an accurate number of active RF chains to reduce circuit power consumption, and minimize the reuse of pilot sequences to improve channel estimation. The optimization …

    uthm Repository record for On iterative low-complexity algorithm for optimal antenna selection and joint transmit power allocation under impact pilot contamination in downlink 5g massive MIMO systems (opens in a new tab)

  13. Unsupervised feature analysis for high dimensional big data

    … limited-memory BFGS based linear time iterative algorithm to efficiently solve the optimization problem. We also study how the choice of norms for data fitting and feature selection terms affect the ultimate unsupervised feature selection performance. Specifically, we propose to use …

    uiuc Repository record for Unsupervised feature analysis for high dimensional big data (opens in a new tab)

  14. In -Network Computation in Wireless Sensor Networks

    … analyze the convergence time of a distributed iterative algorithm to compute the optimal estimates. We also propose ways of exploiting the network connectivity graph structure in order to speed up computation.

    uiuc Repository record for In -Network Computation in Wireless Sensor Networks (opens in a new tab)

  15. FUSE: Multi-faceted set expansion by coherent clustering of skip-grams

    … expands each semantic facet by utilizing an iterative algorithm robust to skip-gram noise. Extensive experiments demonstrate that our algorithm, FUSE, can accurately identify multiple semantic facets of the seed set and generate quality entities for each facet."

    uiuc Repository record for FUSE: Multi-faceted set expansion by coherent clustering of skip-grams (opens in a new tab)

  16. Passive localization of underwater acoustic beacons

    … estimate of the acoustic beacon's position. An iterative algorithm is developed using range difference measurements to solve for the maximum likelihood estimate of a stationary acoustic beacon's position. This algorithm is then _extended to include linear, constant velocity motion of the …

    woods-hole Repository record for Passive localization of underwater acoustic beacons (opens in a new tab)

  17. Interpretable Deep Image Denoiser by Unrolling Graph Laplacian Regularizer

    … the problem for decades and proposed numerous algorithms. In the past ten years, deep learning has produced complex models that deliver high-quality denoised images, but these models require on large numbers of parameters, lack interpretability, and depend heavily on random parameter …

    york Repository record for Interpretable Deep Image Denoiser by Unrolling Graph Laplacian Regularizer (opens in a new tab)

  18. Rao's Quadratic Entropy and Some New Applications

    … large scale data, where a hill-climbing type iterative algorithm is developed based on a new minimum quadratic entropy criterion. The algorithm is illustrated on both simulated and real data.</p>

    odu Repository record for Rao's Quadratic Entropy and Some New Applications (opens in a new tab)

  19. Optimized scheduling of highway work zones

    … minimizing the total project cost by a Genetic Algorithm. An iterative algorithm that integrates the two steps was developed. The optimized work zone schedule and the associated optimal diverted traffic flow can be found simultaneously after multiple iterations. Case studies and extensive …

    njit Repository record for Optimized scheduling of highway work zones (opens in a new tab)

Page 1 of 6