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 45 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 …
-
Decomposition algorithms for global solution of deterministic and stochastic pooling problems in natural gas value chains
In this thesis, a Benders decomposition algorithm is designed and implemented to solve both deterministic and stochastic pooling problems to global optimality. Convergence of the algorithm to a global optimum is proved and then it is implemented both in GAMS and C++ to get the best performance. A …
-
Learning Algorithms for Mixtures of Linear Dynamical Systems: A Practical Approach
… work, we give the first implementation of an algorithm to learn a mixture of linear dynamical systems (LDS’s), and an analysis of algorithms to learn a single linear dynamical system. Following the work of Bakshi et al. ([1]), we implement a recent polynomial-time algorithm based on a tensor …
-
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 …
-
Three Essays On Applied General Equilibrium Analysis
… equilibrium (GE) closure rule and formulating a decomposition algorithm for GE models with proper structure. While the questions addressed are somewhat unrelated to each other, the essays involve issues related to models which are essentially Walrasian in nature. The three essays are: (1) "On the …
-
Distributionally robust solution schemes for two-stage optimization and interdiction problems under uncertainty
… under uncertainty. In addition, solution algorithms are designed for optimization problems to further reduce computational cost. The first part of the dissertation studies two-stage stochastic optimization problems with random recourse, where the adaptive decisions are multiplied by the …
-
Computational Testing and Improvement of a Multilevel Decomposition Model for the Resource Allocation Problem
… deals with the study of the efficiency of a decomposition algorithm called: The Generalized Decomposition Model (GDM) as a resource allocation procedure and its improvement. There are several mathematical algorithms in the literature that deal with the problem of resource allocation, however …
-
Um algoritmo paralelo para a solução direta de sistemas de equações do MEF em redes de transputers
… distributed memory machines. The standard Crout decomposition algorithm is employed and the coefficient matrix is stored in skyline format (i.e., the active column reduction method). The factorization phase is carried out in parallel and a special data structure was developed to handle the …
-
Thanos: High-performance CPU-GPU based balanced graph partitioning using cross-decomposition
… graph partitioning tool which uses the cross-decomposition algorithm that iteratively partitions a graph. It also produces balanced loads of partitions. The algorithm is well suited for parallel GPU programming which leads to fast and high-quality graph partitioning solutions. Experimental …
-
Query processing in heterogeneous distributed database management systems
… work is to present an advanced query processing algorithm formulated and developed in support of heterogeneous distributed database management systems. Heterogeneous distributed database management systems view the integrated data through an uniform global schema. The query processing algorithm …
-
Learning force fields for limb control in character animation
… control through a concise parameter space. A decomposition algorithm is presented that takes a set of limb motions and generates a set of torque fields, whose various linear combinations can generate each member of the input set, and other plausible motions. Unlike other motion extrapolators, …
-
Otimização de redes de distribuição de água: estudo de dois modelos
… problem, which is solved by implicit enumeration algorithm and by dual decomposition algorithm. The other model seeks optimization of the network by heuristic search of optimal diameters, based on energy costs necessary to elevation of piezometric height of the network source nodes. In case of …
-
Spectral Integral Method and Spectral Element Method Domain Decomposition Method for Electromagnetic Field Analysis
… method (SEM)- finite element method (FEM) domain decomposition method (DDM) for solving inhomogeneous multi-scale problems. The proposed SIM-SEM-FEM domain decomposition algorithm can efficiently handle problems with multi-scale structures, </p><p>by using FEM to model electrically small …
-
Comprehensive analysis of metabolic pathways through the combined use of multiple isotopic tracers
… (EMU) framework is based on a highly efficient decomposition algorithm identifies the minimum amount of information needed to simulate isotopic labeling within a reaction network using knowledge of atomic transitions occurring in the network reactions. The developed computational and …
-
System reliability analysis methods for rapid multi-scale network risk assessment and decision making
… applications of deterministic network analysis algorithms, yet hampers rapid risk assessment and effective decision-making. Even though a non-simulation based algorithm, termed as a recursive decomposition algorithm (RDA), was recently proposed to identify disjoint cut sets and link sets and to …
-
Robust Inventory Induction under Demand Uncertainty
… the local and daily level. We develop a Benders decomposition algorithm, iterating between a lower-bounding master problem and an upper-bounding subproblem. We accelerate the Quadratically Constrained Quadratic Problem (QCQP) subproblem with primal heuristics and dual-bounding …
-
Study On Endurance Of Flash Memory Ssds
… goal in this work is to provide analysis and algorithms for efficiently managing data storage for endurance in flash memory. We present update codes, a class of floating codes, which encodes data updates as flash memory cell increments that results in reduced block erases and longer lifespan …
-
TransBooster:black box optimisation of machine translation systems
… the complexity of the MT input by a recursive decomposition algorithm which produces simple input chunks that are spoon-fed to a baseline MT system TransBooster is not an MT system itself: it does not perform automatic translation, but operates on top of an existing MT system, gulding it …
-
Nonuniform subbard coding of high quality audio signals employing frequency warping
… for audio compress10n. A new generic nonuniform decomposition algorithm, relying on cascading frequency warping and a uniform filter bank, is developed. Detailed analyses of frequency warped signals are carried out. The effect of truncation of the original signal and the warped signal is …
-
Approximation algorithms for the minimum congestion routing problem via k-route flows
… flows is extended by presenting efficient algorithms to calculate exact and approximate decompositions of k-route flows into their constituent elementary k-flows. In addition, such decomposition algorithms are shown to prove useful in developing approximation algorithms for the well-studied …
Page 1 of 3