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 110 for “"Decomposition Algorithms"”.
-
Distributed graph decomposition algorithms on Apache Spark
… as cliques and quasi cliques. Unfortunately, the algorithms for solving most of the above tasks are quite costly, which makes them not-scalable to large real-life networks. Two such very popular decompositions, k-core and k-truss of a graph give very useful insight about the graph vertex and edges …
-
Realizations and applications of MIMO channel decomposition algorithms
… realizations and applications of MIMO channel decomposition algorithms. The first part of the work, Chapters 2 and 3, are based on three channel decomposition methods proposed by Yi Jiang et. al., including the Geometric Mean Decomposition (GMD), the Uniform Channel Decomposition (UCD) and the …
-
Decomposition algorithms for multi-area power system analysis
… of other areas. This dissertation investigates decomposition algorithms for multi-area power system transfer capability analysis and economic dispatch analysis. All of the proposed algorithms assume that areas do not share their network operating and economic information among themselves, while …
-
Decomposition Algorithms for Certain Integer Problems over Networks
… expensive to solve directly. Instead, decomposition is a more computationally tractable means in many cases. In this thesis, we focus on a few integer problems over networks. In Chapter 2, we investigate the airport flight-to-gate assignment problem, where the goal is to minimize the …
-
Block decomposition algorithms for matrices in dual angular form
Two algorithms for solving large sparse linear least squares problems, <p> <sup>min</sup>⁄<sub>x</sub> | | b - Ax | |<sub>2</sub> <p> where A is a real m x n matrix of rank n , are presented. The observation matrix A is assumed to be in dual angular form: <p> A = <p> Such matrices arise, for …
-
Facility Location and Relocation Problem: Models and Decomposition Algorithms
… the block-angular structure of the model, a decomposition algorithm is proposed to solve the problem. The second problem is the robust facility relocation problem. Suppose we already have a set of facilities and the demand distribution over the network has changed, however, we do not know the …
-
Benders Decomposition Algorithms To Solve Bi-objective Linear Programs
… power. But there is no research where Benders Decomposition (BD) is employed to explicitly solve Bi-objective Linear Programmes (BLPs). In this thesis, we incorporate the use of BD to bi-objective optimisation problems. We propose a bi-objective Benders reformulation of a non-decomposed BLP and …
-
Decomposition Algorithms in Stochastic Integer Programming: Applications and Computations.
… In third chapter, we propose partition-based decomposition algorithms for solving two-stage stochastic integer program with continuous recourse. The partition-based decomposition method enhance the classical decomposition methods (such as Benders decomposition) by utilizing the inexact cuts …
-
Decomposition algorithms based on the nonconvex augmented Lagrangian framework
… structures. The design of efficient optimization algorithms when non-convexity is present, either in constraints or in the objective, has always been a difficult task. Meanwhile, the sheer amount of data that need to be considered in applications nowadays bring in new computational challenges. In …
-
Model-based Decomposition Algorithms for Complex Routing and Scheduling Problems
… methods. To overcome this difficulty, we develop decomposition approaches that hybridize multiple solution methods from various algorithmic domains including constraint programming (CP), mathematical programming, quadratic unconstrained binary optimization (QUBO), and domain-independent dynamic …
-
Graph decomposition algorithms for analyzing social and large complex networks
… from the linear algebraic approach to graph algorithms for counting triangles, triangle enumeration, the k-count algorithm, and triangle centrality calculation. This thesis will present both serial and parallel algorithms for solving these problems.
-
Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions
… a class of combinatorial optimization models and algorithms in which some of the data are subject to significant uncertainty and evolve over time, and often discrete decisions need to be made before observing complete future data. Therefore, under such circumstances it becomes necessary to develop …
-
Efficient domain decomposition algorithms for the solution of the helmholtz equation
… of scattering problems based on the domain decomposition approach. This work is divided into three parts. In the first part, a new domain decomposition method for the perfectly matched layer system of equations is presented. Analysis of a simple model problem shows that the convergence of …
-
Efficient Domain Decomposition Algorithms and Applications in Transportation and Structural Engineering
Domain decomposition is a divide-and-conquer strategy. In the first part of this dissertation, a new/simple/efficient domain decomposition partitioning algorithm is proposed to break a large domain into smaller sub-domains, in such a way as to minimize the number of system boundary nodes and to …
-
Matrix decomposition algorithms for modified quadratic spline collocation for Helmholtz problems
Includes bibliographical references (pages 111-112).
-
Scalable Domain Decomposition Algorithms for Uncertainty Quantification in High Performance Computing
… chaos expansion (PCE) based two-level domain decomposition (DD) algorithms for stochastic partial differential equations (PDEs) are extended to handle high resolution numerical models using an in-house scalable parallel solvers toolkit. First, the attention is given to facilitate the numerical …
-
Approximate credibility intervals on electromyographic decomposition algorithms within a Bayesian framework
… is not concerned with the correctness of these algorithms, but with the uncertainty of their results arising from existing uncertainty in their inputs. This is achieved using a Bayesian approach. This framework is then demonstrated using independent component analysis with electromyographic …
-
Domain decomposition algorithms for the solution of sparse symmetric generalized eigenvalue problems
… design, implementation, and evaluation of domain decomposition techniques for the solution of large and sparse algebraic symmetric generalized eigenvalue problems. Domain decomposition techniques begin by partitioning the global (discretized) domain into a number of subdomains. The solution of the …
Page 1 of 6