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 205 for “"Decomposition algorithm"”.
-
Analysis of a nonhierarchical decomposition algorithm
… if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some …
-
Parallel alternating explicit implicit domain decomposition algorithm
Explicit-Implicit Domain Decomposition (EIDD) is a class of globally non-iterative, non-overlapping domain decomposition methods for the numerical solution of parabolic problems on parallel computers, which are highly efficient in terms of both computation and communication for each time-step. The …
-
Decomposition algorithm for trading electricity between power companies, A
Includes bibliographical references (page 32).
-
Computer Solution of Linear Programming Problems Using the Decomposition Algorithm
Master of Science (M.S.)
-
A decomposition algorithm of skew-symmetric and skew-symmetrizable exchange matrices
… respectively. Our main resultis an algorithm that determines if a graph, diagram or matrix is block-decomposable or sdecomposable, and, hence associated with a triangulation of a surface. As a corollary, we can determine if a cluster algebra is of fine mutation type. Using the …
-
Stochastic Optimization for Integrated Energy System with Reliability Improvement Using Decomposition Algorithm
… Taking the benefit of models structure, new decomposition strategies are proposed to decompose the stochastic unit commitment problems which are then solved by an enhanced Benders Decomposition algorithm. Compared to the classic Benders Decomposition, this proposed solution approach is able …
-
A Novel Diffusion-based Empirical Mode Decomposition Algorithm for Signal and Image Analysis
… transform are widely applied. Empirical Mode Decomposition(EMD) was proposed as an alternative frequency analysis tool. Although shown to be effective when analyzing non-stationary signals, the algorithmic nature of EMD makes the theoretical analysis and formulation difficult. Futhermore, it …
-
A decomposition algorithm for the state transition lattices of certain non-product queueing protocols
<p>In this thesis, an algorithm is developed to decompose the state transition lattice of a class of non-product form queueing models. Here only the lattices of regular type A structure are considered. By applying the algorithm, the lattice is decomposed into solvable subsets which can be solved …
-
A sampling-based decomposition algorithm with application to hydrothermal scheduling : cut formation and solution quality
… and power interchanges. Sampling-based decomposition algorithms (SBDAs) have been used in the literature to solve HTSPM. SBDAs can be used to approximately solve problem instances with many time stages and with inflows that exhibit interstage dependence. Such dependence requires care in …
-
Design and implementation of a fast Fourier transform architecture using twiddle factor based decomposition algorithm
… the fastest way to achieve transformation. Many algorithms and architectures have been designed over the years in an attempt to make FFT algorithms more efficient and to target many applications; The main objective of our work is to design, simulate and implement an architecture based on the …
-
A THREE-DIMENSIONAL DOMAIN DECOMPOSITION ALGORITHM FOR THE NUMERICAL SOLUTION OF ELLIPTIC AND PARABOLIC PARTIAL DIFFERENTIAL EQUATIONS
A three-dimensional, nonsymmetric, domain decomposition algorithm is developed. The algorithm is based upon the use of a lower dimensional problem as a correction to the preconditioned generalized conjugate residual method using the domain decomposition technique as the overall preconditioner. For …
-
Improving the run time of the decomposition algorithm for fault tolerant Clos interconnection networks through swap re-ordering
… by a matrix, which is then decomposed using an algorithm, and the switch settings are thus assigned. The original decomposition algorithm consisted of four element swaps in the following order: wild swap, simple swap, next simple swap, and successive swap. However, by re-arranging these swaps …
-
An Efficient Interior-Point Decomposition Algorithm for Parallel Solution of Large-Scale Nonlinear Problems with Significant Variable Coupling
In this dissertation we develop multiple algorithms for efficient parallel solution of structured nonlinear programming problems by decomposition of the linear augmented system solved at each iteration of a nonlinear interior-point approach. In particular, we address large-scale, block-structured …
-
Parallel approaches for the the vehicle routing problem
… system architecture and on the strategy for algorithmically decomposing the problem.</p> <p>The objective of this doctoral research is the development of parallel techniques to solve the basic, capacity-constrained VRP. The research includes: (1) definition of an effective decomposition …
-
Applications of Lexicographic Breadth-first Search to Modular Decomposition, Split Decomposition, and Circle Graphs
… the first sub-quadratic circle graph recognition algorithm, and develops improved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two different approaches previously employed …
-
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 …
-
Cubic spline finite element method for solving Poisson's equation on a square
… and then more efficiently using a Matrix Decomposition Algorithm. Cost of the matrix decomposition algorithm is O(N[superscript 3]), where N+1 is the number of subintervals in each coordinate direction. We improve the method still by using an Alternating Direction Implicit Method that …
-
Finite Element Analysis of Multilayer Transmission Lines and Circuit Components
… the 3-D finite element method. Fourth, a domain decomposition algorithm is developed to reduce the computational efforts in the 3-D multilayer circuit component simulation. The domain decomposition algorithm is further accelerated by a new order-reduction method using modal field basis functions …
-
Benders decomposition: an integer-programming extension with further computational enhancements
We extend Benders decomposition in two ways. We begin by introducing a new integer Benders decomposition algorithm (IBDA) that solves pure integer programs (IPs). IBDA solves a mixed-integer relaxation of the IP by Benders decomposition and then conducts a type of local search to identify promising …
Page 1 of 11