This paper considers the numerical solution of linear generalized Nash equilibrium problems. Since many methods for nonlinear problems require the nonsingularity of some second order derivative, standard convergence conditions are not satisfied in our linear case. We provide new convergence criteria for a potential reduction algorithm that allow its application to linear generalized Nash equili...

Recently, the concept of equal thermodynamic distance (ETD) has been proposed to minimize entropy production in a distillation process using a diabatic column. ETD gives the optimal temperature profile to first-order in N−1, where N is the number of trays. ETD however, does not in general give the true minimum for distillation columns with few trays. We therefore apply a fully numerical, multid...

The question of the nature of the dark matter in the Universe remains one of the most outstanding unsolved problems in basic science. One of the best motivated particle physics candidates is the lightest supersymmetric particle, assumed to be the lightest neutralino a linear combination of the supersymmetric partners of the photon, the Z boson and neutral scalar Higgs particles. Here we describ...

A c++ implementation of the Ds-dimensional unitarity cut algorithm for the numerical evaluation of the virtual contribution to NLO QCD amplitudes is presented. The current version includes an arbitrary number of external gluons with gluonic propagators in the loop. The building blocks are tree level color-ordered amplitudes with gluons and with gluons and two scalars in five dimensions. Numeric...

In our work on frequency estimation based on local signal behavior [15] for testing purposes we needed a signal φ(t) which over some disjoint intervals of (continuous) time In is equal to a corresponding linear combination fn(t) of up to N sine waves, possibly damped and phase shifted, of (normalized) frequencies smaller than π. The signal should also satisfy the following constraints: φ(t) sho...

Training probabilistic finite automata with the EM/Baum-Welch algorithm is computationally very intensive, especially if random ergodic automata are used initially, and additional strategies such as deterministic annealing are used. In this paper we present some optimization and parallelization strategies to the Baum-Welch algorithm that often allow for training of much larger automata with a l...

Given a polynomial system f , a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach of Rouillier, Roy, and Safey El Din, which is based on a classical optimization approach of Seidenberg, to develop a homotopy based approach for computing at...