33,947 Hits in 3.7 sec

Efficient simulation for branching linear recursions

Ningyuan Chen, Mariana Olvera-Cravioto
2015 2015 Winter Simulation Conference (WSC)  
We consider a linear recursion of the form  ...  Naive Monte Carlo simulation of R (k) based on the branching recursion has exponential complexity in k, and therefore the need for efficient methods.  ...  Section 2 describes the weighted branching process and the linear recursion. The algorithm itself is given in Section 3 .  ... 
doi:10.1109/wsc.2015.7408378 dblp:conf/wsc/ChenO15 fatcat:wikdcrnvtvdtdfzaanh4ddejai

Efficient Simulation for Branching Linear Recursions [article]

Ningyuan Chen, Mariana Olvera-Cravioto
2015 arXiv   pre-print
Naive Monte Carlo simulation of R^(k) based on the branching recursion has exponential complexity in k, and therefore the need for efficient methods.  ...  We consider a linear recursion of the form R^(k+1) D=∑_i=1^NC_iR^(k)_i+Q, where (Q,N,C_1,C_2,...) is a real-valued random vector with N∈N={0, 1, 2, ...}, {R^(k)_i}_i∈N is a sequence of i.i.d. copies of  ...  Naive Monte Carlo simulation of R (k) based on the branching recursion has exponential complexity in k, and therefore the need for efficient methods.  ... 
arXiv:1503.09150v1 fatcat:m6tbcxs2ivclrooggzicys7iuq

Cumulative subject index volumes 68–71

1986 Information and Control  
, probabilistic analysis, 68, 47 optimally data-efficient, for isomorphism inference:  ...  Aggregation problems, formulation of several versions, analysis from recursion theoretic point of view, 70, 69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and  ...  type, mathematical foundations, 68, 1 ideal, for recursive polymorphic types, 71, 95 lambda calculus, construction, applica- tions of retraction map categories, 71, 33 Networks large, simulation  ... 
doi:10.1016/s0019-9958(86)80014-6 fatcat:hkligygazvcyvdgrhtvhrefpj4

Recursive Path-Summing Simulation of Quantum Computation [article]

Andrew Shi
2017 arXiv   pre-print
To investigate this claim, we present and test an implementation of a known path integral simulation algorithm running in linear space; the method is based on recursively traversing the underlying computation  ...  As of now, the 50 qubit threshold for quantum supremacy has been determined largely by the state vector simulation method's exponential space demands placing an upper bound on simulation memory capabilities  ...  Acknowledgments I would like to thank my uncle, Yaoyun Shi, for his invaluable advice and suggestions as well as my dad, Yanyun Shi, for his encouragement and guiding perspective.  ... 
arXiv:1710.09364v3 fatcat:ltpjp7z37beufhzx45murrmppq

Time/Space Trade-Offs for Reversible Computation

Charles H. Bennett
1989 SIAM journal on computing (Print)  
in linear time and space O(ST).  ...  Using a pebbling argument, this paper shows that, for any e > 0, ordinary multitape Turing machines using time T and space S can be simulated by reversible ones using time O(T +) and space O(S log T) or  ...  I wish to thank Leonid Levin for urging and helping me to strengthen a previous, much weaker version of Theorem 1 and Martin Tompa for pointing out how to reduce the time exponent from 1.585 to 1 + e.  ... 
doi:10.1137/0218053 fatcat:xrpwtgojprdrlgk2twhn2hpmjm

Rare event simulation for stochastic fixed point equations related to the smoothing transformation

Jeffrey F. Collamore, Anand N. Vidyashankar, Jie Xu
2013 2013 Winter Simulations Conference (WSC)  
Recently, methods have been developed for the linear recursion V d = AV + B and some of its extensions, yielding tail estimates and importance sampling methods for these recursions.  ...  Drawing on the techniques from the weighted branching process literature, we describe a modification of the importance sampling algorithm of Collamore et al. (2011) which yields an estimate for the tail  ...  the related linear recursions.  ... 
doi:10.1109/wsc.2013.6721450 dblp:conf/wsc/CollamoreVX13 fatcat:jyvaqzwj7ba73neha5dhugsehm

Adaptive Mesh Refinement and Adaptive Time Integration for Electrical Wave Propagation on the Purkinje System

Wenjun Ying, Craig S. Henriquez
2015 BioMed Research International  
A both space and time adaptive algorithm is presented for simulating electrical wave propagation in the Purkinje system of the heart.  ...  Numerical examples demonstrating efficiency and accuracy of the adaptive algorithm are presented.  ...  The use of a relatively coarse base grid also makes the multigrid/multilevel solver for linear systems more efficient.  ... 
doi:10.1155/2015/137482 pmid:26581455 pmcid:PMC4637156 fatcat:xqwzoqgw2zbu5bv5acnm6k5gym

Highly Parallelizable Low-Order Dynamics Simulation Algorithm for Multi-Rigid-Body Systems

Kurt S. Anderson, Shanzhong Duan
2000 Journal of Guidance Control and Dynamics  
., “Recursive Derivation of Explicit Equations of Motion for the Efficient Dynamic/Control Simulation of Large Multibody Systems,” Ph.D.  ...  When sequential processing is necessary due to limited availability of pro- cessors, gains may be made through the efficient recursive O(n) direct proceduse.  ... 
doi:10.2514/2.4531 fatcat:o5xlgnkc2vhi7dm4kpt4rh6md4

2-Dimensional Spatio-Temporal Signal Processing for Dispersion Compensation in Optical Systems

Alireza Tarighat, Bahram Jalali
2007 IEEE MTT-S International Microwave Symposium Digest  
For instance, the recursive least squares (RLS) algorithm can be used: Figure 3 - 3 SNR versus the signal bandwidth.  ...  This configuration is used to evaluate the SNR on the received quantized signal Simulations are conducted for different scenarios: * "No Processing": single sampling branch is used with no post-sampling  ... 
doi:10.1109/mwsym.2007.380542 fatcat:dmqtfl4fo5h4xoxsvyhl5wfkki

Space-efficient simulation of quantum computers

Michael P. Frank, Uwe H. Meyer-Baese, Irinel Chiorescu, Liviu Oniciuc, Robert A. van Engelen
2009 Proceedings of the 47th Annual Southeast Regional Conference on - ACM-SE 47  
However, more memory-efficient simulations are possible, requiring only polynomial or even linear space in the size of the quantum circuit being simulated.  ...  Traditional algorithms for simulating quantum computers on classical ones require an exponentially large amount of memory, and so typically cannot simulate general quantum circuits with more than about  ...  Output: Welcome to SEQCSIM, the Space-Efficient Quantum Computer SIMulator. (C++ console version) By Michael P. Frank, Uwe Meyer-Baese, Irinel Chiorescu, and Liviu Oniciuc.  ... 
doi:10.1145/1566445.1566554 dblp:conf/ACMse/FrankMCOE09 fatcat:twqbirb4ubd6lmdj7hmyv6e6ce

Dynamics of Complex Mechanical Systems Based on Lie Groups and Lie algebra

Bing Shao, Entao Yuan, S.A. Hamouda, M. Mirzaei, Z. Yu
2016 MATEC Web of Conferences  
Efficient dynamics algorithms for closed-loop systems and flexible systems can be developed. Simulation results show that the dynamic problems can be solved quickly and efficiently using the method.  ...  This study provides a foundation for real-time control based on dynamics.  ...  The kinetic equations by recursive methods can achieve efficient real-time dynamic simulation and control. Some examples show the correctness and efficiency of the method.  ... 
doi:10.1051/matecconf/20166101004 fatcat:iovujx4oojejtcitsg2mflbb6u

Mismatch Calibration in LINC Power Amplifiers Using Modified Gradient Algorithm

Hosein Miar-Naimi, Hamid Rahimpour
2013 International Journal of Intelligent Systems and Applications  
One of the power amplifiers linearization technique is linear amplification with nonlinear components (LINC).The effects of phase and gain imbalances between two signal branches in LINC transmitters have  ...  Many simulations have been performed to validate the proposed self calibrating LINC transmitter. Simulation results have confirmed the analyticalpredictions.  ...  So the recursive relation for x in MGA is as: With these changes convergence process will not be linear, thus the performance of the conventional gradient method will be improved.  ... 
doi:10.5815/ijisa.2013.10.08 fatcat:pqfcixwqengzrgk6es34xxgxpe

Book announcements

1990 Discrete Applied Mathematics  
Chapter 4: Implementation by Substitutional Evaluation-Space Efficiency: Implementations as Simulations of the 0-w-t Network. Basic breadth-first algorithms.  ...  Devices for C' functions.Devices for C* functions. recursive. Nested and nonnested lines). Recursive definition (Standard forms for nonnested recursive definitions).  ... 
doi:10.1016/0166-218x(90)90074-m fatcat:uhwd4fl3wvcetkvers2zklsbry

Efficiency of the Incomplete Enumeration Algorithm for Monte-Carlo Simulation of Linear and Branched Polymers

Sumedha, Deepak Dhar
2005 Journal of statistical physics  
We study the efficiency of the incomplete enumeration algorithm for linear and branched polymers. There is a qualitative difference in the efficiency in these two cases.  ...  The average time to generate an independent sample of n sites for large n varies as n^2 for linear polymers, but as exp(c n^α) for branched (undirected and directed) polymers, where 0<α<1.  ...  Algorithms used for simulating linear polymers can often be adapted for branched polymers, but they are usually found to be less efficient.  ... 
doi:10.1007/s10955-005-5462-2 fatcat:sx6bijhjn5b2xitjn3bid76sw4

Stabbing Planes [article]

Paul Beame, Noah Fleming, Russell Impagliazzo, Antonina Kolokolova, Denis Pankratov, Toniann Pitassi, Robert Robere
2022 arXiv   pre-print
Among our results, we show that Stabbing Planes can efficiently simulate the Cutting Planes proof system, and is equivalent to a tree-like variant of the R(CP) system of Krajicek98.  ...  Since the middle slab contains no integer points it can be safely discarded, and the algorithm proceeds recursively on the other two branches.  ...  For example, since geometric properties of the rational hull formed by the set of constraints can be determined efficiently, an SP-based solver could branch on linear inequalities representing some geometric  ... 
arXiv:1710.03219v2 fatcat:4dedtl7iordyvcmquixcpwmd6y
« Previous Showing results 1 — 15 out of 33,947 results