Performance investigation and constraint stabilization approach for the orthogonal complement-based divide-and-conquer algorithm

2013 ◽  
Vol 67 ◽  
pp. 111-121 ◽  
Author(s):  
I.M. Khan ◽  
K.S. Anderson
Keyword(s):  
Divide And Conquer ◽  
Orthogonal Complement ◽  
Constraint Stabilization ◽  
Divide And Conquer Algorithm

Orthogonal Complement-Based Divide and Conquer Algorithm: A Detailed Investigation of Its Performance

2013 ◽  
Author(s):  
Imad M. Khan ◽  
Kurt S. Anderson
Keyword(s):  
Growth Rate ◽  
Arbitrary Number ◽  
Multibody Systems ◽  
Divide And Conquer ◽  
Orthogonal Complement ◽  
Error Growth ◽  
Stabilization Method ◽  
Constraint Violation ◽  
Divide And Conquer Algorithm ◽  
Kinematic Loops

In this paper, we characterize the orthogonal complement-based divide-and-conquer (ODCA) [1] algorithm in terms of the constraint violation error growth rate and singularity handling capabilities. In addition, we present a new constraint stabilization method for the ODCA architecture. The proposed stabilization method is applicable to general multibody systems with arbitrary number of closed kinematic loops. We compare the performance of the ODCA with augmented [2] and reduction [3] methods. The results indicate that the performance of the ODCA falls between these two traditional techniques. Furthermore, using a numerical example, we demonstrate the effectiveness of the new stabilization scheme.

Generalized Orthogonal Complement Based Divide and Conquer Algorithm for Constrained Multibody Dynamics

2009 ◽  
Author(s):  
Rudranarayan M. Mukherjee ◽  
Kurt S. Anderson
Keyword(s):  
Equations Of Motion ◽  
Divide And Conquer ◽  
Orthogonal Complement ◽  
Assembly Process ◽  
Short Article ◽  
Current Form ◽  
Divide And Conquer Algorithm ◽  
Constrained Multibody Dynamics ◽  
Kinematic Loops ◽  
Generalized Orthogonal

This paper presents an extension of the orthogonal complement based divide and conquer algorithm for constraint multi-rigid body systems containing closed kinematic loops in generalized topologies. In its current form, its a short article demonstrating the methodology for assembling the equations of motion in a hierarchic assembly process for systems containing multiple loops in generalized topologies.

scholarly journals A divide-and-conquer algorithm for quantum state preparation

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Israel F. Araujo ◽  
Daniel K. Park ◽  
Francesco Petruccione ◽  
Adenilton J. da Silva
Keyword(s):  
Computational Cost ◽  
Quantum Circuit ◽  
Divide And Conquer ◽  
Computational Time ◽  
Quantum Computers ◽  
Dimensional Vector ◽  
Quantum Devices ◽  
Divide And Conquer Algorithm ◽  
Quantum State Preparation ◽  
Quantum Device

AbstractAdvantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with exponential time advantage using a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space. We demonstrate a proof of concept on a real quantum device and present two applications for quantum machine learning. We expect that this new loading strategy allows the quantum speedup of tasks that require to load a significant volume of information to quantum devices.

Influence and Information Flow in Online Social Networks

2017 ◽  
Vol 9 (4) ◽  
pp. 1-17
Author(s):  
Afrand Agah ◽  
Mehran Asadi
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Large Data ◽  
Marketing Strategies ◽  
Large Data Sets ◽  
Divide And Conquer ◽  
Data Sets ◽  
Divide And Conquer Algorithm ◽  
Flow Of Information

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.

Sign in / Sign up

Export Citation Format

Share Document