113,833 research outputs found
A Quasi-Random Approach to Matrix Spectral Analysis
Inspired by the quantum computing algorithms for Linear Algebra problems
[HHL,TaShma] we study how the simulation on a classical computer of this type
of "Phase Estimation algorithms" performs when we apply it to solve the
Eigen-Problem of Hermitian matrices. The result is a completely new, efficient
and stable, parallel algorithm to compute an approximate spectral decomposition
of any Hermitian matrix. The algorithm can be implemented by Boolean circuits
in parallel time with a total cost of Boolean
operations. This Boolean complexity matches the best known rigorous parallel time algorithms, but unlike those algorithms our algorithm is
(logarithmically) stable, so further improvements may lead to practical
implementations.
All previous efficient and rigorous approaches to solve the Eigen-Problem use
randomization to avoid bad condition as we do too. Our algorithm makes further
use of randomization in a completely new way, taking random powers of a unitary
matrix to randomize the phases of its eigenvalues. Proving that a tiny Gaussian
perturbation and a random polynomial power are sufficient to ensure almost
pairwise independence of the phases is the main technical
contribution of this work. This randomization enables us, given a Hermitian
matrix with well separated eigenvalues, to sample a random eigenvalue and
produce an approximate eigenvector in parallel time and
Boolean complexity. We conjecture that further improvements of
our method can provide a stable solution to the full approximate spectral
decomposition problem with complexity similar to the complexity (up to a
logarithmic factor) of sampling a single eigenvector.Comment: Replacing previous version: parallel algorithm runs in total
complexity and not . However, the depth of the
implementing circuit is : hence comparable to fastest
eigen-decomposition algorithms know
Joint Source and Relay Optimization for Parallel MIMO Relay Networks
In this article, we study the optimal structure of the source precoding matrix and the relay amplifying matrices for multiple-input multiple-output (MIMO) relay communication systems with parallel relay nodes. Two types of receivers are considered at the destination node: (1) The linear minimal mean-squared error (MMSE) receiver; (2) The nonlinear decision feedback equalizer based on the minimal MSE criterion. We show that for both receiver schemes, the optimal source precoding matrix and the optimal relay amplifying matrices have a beamforming structure. Using such optimal structure, joint source and relay power loading algorithms are developed to minimize the MSE of the signal waveform estimation at the destination. Compared with existing algorithms for parallel MIMO relay networks, the proposed joint source and relay beamforming algorithms have significant improvement in the system bit-error-rate performance
Efficient mining of discriminative molecular fragments
Frequent pattern discovery in structured data is receiving
an increasing attention in many application areas of sciences. However, the computational complexity and the large amount of data to be explored often make the sequential algorithms unsuitable. In this context high performance distributed computing becomes a very interesting and promising approach. In this paper we present a parallel formulation of the frequent subgraph mining problem to discover interesting patterns in molecular compounds. The application is characterized by a highly irregular tree-structured computation. No estimation is available for task workloads, which show a power-law distribution in a wide range. The proposed approach allows dynamic resource aggregation and provides fault and latency tolerance. These features make the distributed application suitable for multi-domain heterogeneous environments, such as computational Grids. The distributed application has been evaluated on the well known National Cancer Institute’s HIV-screening dataset
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 problems with a significant number of complicating, or coupling variables. This structure arises in many important problem classes including multi-scenario optimization, parameter estimation, two-stage stochastic programming, optimal control and power network problems. The structure of these problems induces a block-angular structure in the augmented system, and parallel solution is possible using a Schur-complement decomposition. Three major variants are implemented: a serial, full-space interior-point method, serial and parallel versions of an explicit Schur-complement decomposition, and serial and parallel versions of an implicit PCG-based Schur-complement decomposition. All of these algorithms have been implemented in C++ in an extensible software framework for nonlinear optimization.
The explicit Schur-complement decomposition is typically effective for problems with a few hundred coupling variables. We demonstrate the performance of our implementation on an important problem in optimal power grid operation, the contingency-constrained AC optimal power ow problem. In this dissertation, we present a rectangular IV formulation for the contingency-constrained ACOPF problem and demonstrate that the explicit Schur-complement decomposition can dramatically reduce solution times for a problem with a large number of contingency scenarios. Moreover, a comparison of the explicit Schur-complement decomposition implementation and the Progressive Hedging approach provided by Pyomo is provided, showing that the internal decomposition approach is computationally favorable to the external approach. However, the explicit Schur-complement decomposition approach is not appropriate for problems with a large number of coupling variables because of the high computational cost associated with forming and solving the dense Schur-complement.
We show that this bottleneck can be overcome by solving the Schur-complement equations implicitly using a quasi-Newton preconditioned conjugate gradient method.
This new algorithm avoids explicit formation and factorization of the Schur-complement.
The computational efficiency of the serial and parallel versions of this algorithm are compared with the serial full-space approach, and the serial and parallel explicit
Schur-complement approach on a set of quadratic parameter estimation problems and nonlinear optimization problems. These results show that the PCG implicit Schur-complement approach dramatically reduces the computational expense for problems with many coupling variables
Recommended from our members
Development of novel electrical power distribution system state estimation and meter placement algorithms suitable for parallel processing
This thesis was submitted for the award of Doctor of Philosophy and was awarded by Brunel University LondonThe increasing penetration of distributed generation, responsive loads and emerging smart metering technologies will continue the transformation of distribution systems from passive to active network conditions. In such active networks, State Estimation (SE) tools will be essential in order to enable extensive monitoring and enhanced control technologies. In future distribution management systems, the novel electrical power distribution system SE requires development in a scalable manner in order to accommodate small to massive size networks, be operable with limited real time measurements and a restricted time frame. Furthermore, a significant phase of new sensor deployment is inevitable to enable distribution system SE, since present-day distribution networks lack the required level of measurement and instrumentation. In the above context, the research presented in this thesis investigates five SE optimization solution methods with various case studies related to expected scenarios of future distribution networks to determine their suitability. Hachtel's Augmented Matrix method is proposed and developed as potential SE optimizer for distribution systems due to its potential performance characteristics with regard to accuracy and convergence. Differential Evolution Algorithm (DEA) and Overlapping Zone Approach (OZA) are investigated to achieve scalability of SE tools; followed by which the network division based OZA is proposed and developed. An OZA requiring additional measurements is also proposed to provide a feasible solution for voltage estimation at a reduced computation cost. Realising the requirement of additional measurements deployment to enable distribution system SE, the development of a novel meter placement algorithm that provides economical and feasible solutions is demonstrated. The algorithm is strongly focused on reducing the voltage estimation errors and is capable of reducing the error below desired threshold with limited measurements. The scalable SE solution and meter placement algorithm are applied on a multi-processor system in order to examine effective reduction of computation time. Significant improvement in computation time is observed in both cases by dividing the problem into smaller segments. However, it is important to note that enhanced network division reduces computation time further at the cost of accuracy of estimation. Different networks including both idealised (16, 77, 356 and 711 node UKGDS) and real (40 and 43 node EG) distribution network data are used as appropriate to the requirement of the applications throughout this thesis.‘High Performance Computing Technologies for Smart Distribution Network Operation' (HiPerDNO) project under Grant FP7 - 248135/2007-2013 (European Community's Seventh Framework Programme)
- …