Search results for "LYN"
showing 10 items of 910 documents
Analysis of negative-resistance oscillators with piecewise nonlinearity
1977
An iterative method of solution of negative-resistance oscillators with piecewise-analytical characteristics is presented. The method allows the determination of the frequency and the harmonic content of the waveform as a function of the circuit parameters and bias of the nonlinear device. An application of the method, extended to the second order, for a polynomial characteristic limited by two straight lines is also reported. The results are compared with those obtained by numerical integration.
Continuous-Variable Instantaneous Quantum Computing is Hard to Sample
2017
Instantaneous quantum computing is a sub-universal quantum complexity class, whose circuits have proven to be hard to simulate classically in the Discrete-Variable (DV) realm. We extend this proof to the Continuous-Variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of post-selected circuits. In order to treat post-selection in CVs we consider finitely-resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator GKP encoding of quantum information,…
Benchmarking parameter-free AMaLGaM on functions with and without noise.
2013
We describe a parameter-free estimation-of-distribution algorithm (EDA) called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm (AMaLGaM-ID[Formula: see text]A, or AMaLGaM for short) for numerical optimization. AMaLGaM is benchmarked within the 2009 black box optimization benchmarking (BBOB) framework and compared to a variant with incremental model building (iAMaLGaM). We study the implications of factorizing the covariance matrix in the Gaussian distribution, to use only a few or no covariances. Further, AMaLGaM and iAMaLGaM are also evaluated on the noisy BBOB problems and we assess how well multiple evaluations per solution can average ou…
Optimal Impulse Control Problems and Linear Programming
2009
Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the optimal impulse control problem via a binary linear programming proble…
Upper bounds for the zeros of ultraspherical polynomials
1990
AbstractFor k = 1, 2, …, [n2] let xnk(λ) denote the Kth positive zero in decreasing order of the ultraspherical polynomial Pn(λ)(x). We establish upper bounds for xnk(λ). All the bounds become exact when λ = 0 and, in some cases (see case (iii) of Theorem 3.1), also when λ = 1. As a consequence of our results, we obtain for the largest zero xn1(λ)0.. We point out that our results remain useful for large values of λ. Numerical examples show that our upper bounds are quite sharp.
Triangular Bézier Approximations to Constant Mean Curvature Surfaces
2008
We give a method to generate polynomial approximations to constant mean curvature surfaces with prescribed boundary. We address this problem by finding triangular Bezier extremals of the CMC-functional among all polynomial surfaces with a prescribed boundary. Moreover, we analyze the $\mathcal{C}^1$ problem, we give a procedure to obtain solutions once the tangent planes for the boundary curves are also given.
Matroid optimization problems with monotone monomials in the objective
2022
Abstract In this paper we investigate non-linear matroid optimization problems with polynomial objective functions where the monomials satisfy certain monotonicity properties. Indeed, we study problems where the set of non-linear monomials consists of all non-linear monomials that can be built from a given subset of the variables. Linearizing all non-linear monomials we study the respective polytope. We present a complete description of this polytope. Apart from linearization constraints one needs appropriately strengthened rank inequalities. The separation problem for these inequalities reduces to a submodular function minimization problem. These polyhedral results give rise to a new hiera…
Distributed learning automata-based scheme for classification using novel pursuit scheme
2020
Learning Automata (LA) is a popular decision making mechanism to “determine the optimal action out of a set of allowable actions” (Agache and Oommen, IEEE Trans Syst Man Cybern-Part B Cybern 2002(6): 738–749, 2002). The distinguishing characteristic of automata-based learning is that the search for the optimising parameter vector is conducted in the space of probability distributions defined over the parameter space, rather than in the parameter space itself (Thathachar and Sastry, IEEE Trans Syst Man Cybern-Part B Cybern 32(6): 711–722, 2002). Recently, Goodwin and Yazidi pioneered the use of Ant Colony Optimisation (ACO) for solving classification problems (Goodwin and Yazidi 2016). In th…
Superinvolutions on upper-triangular matrix algebras
2018
Let UTn(F) be the algebra of n×n upper-triangular matrices over an algebraically closed field F of characteristic zero. In [18], the authors described all abelian G-gradings on UTn(F) by showing that any G-grading on this algebra is an elementary grading. In this paper, we shall consider the algebra UTn(F) endowed with an elementary Z2-grading. In this way, it has a structure of superalgebra and our goal is to completely describe the superinvolutions which can be defined on it. To this end, we shall prove that the superinvolutions and the graded involutions (i.e., involutions preserving the grading) on UTn(F) are strictly related through the so-called superautomorphisms of this algebra. We …
Darboux Linearization and Isochronous Centers with a Rational First Integral
1997
Abstract In this paper we study isochronous centers of polynomial systems. It is known that a center is isochronous if and only if it is linearizable. We introduce the notion of Darboux linearizability of a center and give an effective criterion for verifying Darboux linearizability. If a center is Darboux linearizable, the method produces a linearizing change of coordinates. Most of the known polynomial isochronous centers are Darboux linearizable. Moreover, using this criterion we find a new two-parameter family of cubic isochronous centers and give the linearizing changes of coordinates for centers belonging to that family. We also determine all Hamiltonian cubic systems which are Darbou…