Applications: Complexity of algorithms, superpositions of algebraic functions and interpolation theory

1992 ◽  
pp. 43-76
Keyword(s):  
Interpolation Theory ◽  
Algebraic Functions ◽  
Complexity Of Algorithms

Replication of Quantum Computing towards an Unconventional Environment using QuIDE

2019 ◽  
Vol 8 (4) ◽  
pp. 9461-9464
Keyword(s):  
Quantum Computer ◽  
Source Code ◽  
Circuit Diagram ◽  
Quantum Computers ◽  
Coordinated Development ◽  
Development Environment ◽  
Integrated Development ◽  
Complexity Of Algorithms ◽  
Performance Results ◽  
Exponential Complexity

Current quantum computer simulation strategies are inefficient in simulation and their realizations are also failed to minimize those impacts of the exponential complexity for simulated quantum computations. We proposed a Quantum computer simulator model in this paper which is a coordinated Development Environment – QuIDE (Quantum Integrated Development Environment) to support the improvement of algorithm for future quantum computers. The development environment provides the circuit diagram of graphical building and flexibility of source code. Analyze the complexity of algorithms shows the performance results of the simulator and used for simulation as well as result of its deployment during simulation

scholarly journals Thermodynamic compatibility conditions of a new class of hysteretic materials

2021 ◽  
Author(s):  
Salvatore Sessa
Keyword(s):  
Constitutive Model ◽  
Dynamic Analysis ◽  
Closed Form ◽  
Iterative Procedure ◽  
Displacement Amplitude ◽  
Compatibility Conditions ◽  
Algebraic Functions ◽  
New Class ◽  
Thermodynamic Compatibility ◽  
Constitutive Parameters

AbstractThe thermodynamic compatibility defined by the Drucker postulate applied to a phenomenological hysteretic material, belonging to a recently formulated class, is hereby investigated. Such a constitutive model is defined by means of a set of algebraic functions so that it does not require any iterative procedure to compute the response and its tangent operator. In this sense, the model is particularly feasible for dynamic analysis of structures. Moreover, its peculiar formulation permits the computation of thermodynamic compatibility conditions in closed form. It will be shown that, in general, the fulfillment of the Drucker postulate for arbitrary displacement ranges requires strong limitations of the constitutive parameters. Nevertheless, it is possible to determine a displacement compatibility range for arbitrary sets of parameters so that the Drucker postulate is fulfilled as long as the displacement amplitude does not exceed the computed threshold. Numerical applications are provided to test the computed compatibility conditions.

Normal approximations for distributions arising in the stochastic approach to chemical reaction kinetics

1981 ◽  
Vol 18 (01) ◽  
pp. 263-267 ◽  
Author(s):  
F. D. J. Dunstan ◽  
J. F. Reynolds
Keyword(s):  
Reaction Kinetics ◽  
Chemical Reactions ◽  
Chemical Reaction ◽  
Stochastic Approach ◽  
Algebraic Functions ◽  
Chemical Reaction Kinetics ◽  
Normal Approximations ◽  
Formal Solutions

Earlier stochastic analyses of chemical reactions have provided formal solutions which are unsuitable for most purposes in that they are expressed in terms of complex algebraic functions. Normal approximations are derived here for solutions to a variety of reactions. Using these, it is possible to investigate the level at which the classical deterministic solutions become inadequate. This is important in fields such as radioimmunoassay.

Statistical Complexity of Algorithms for Boolean Function Minimization

1965 ◽  
Vol 12 (3) ◽  
pp. 364-375 ◽  
Author(s):  
Franco Mileto ◽  
Gianfranco Putzolu
Keyword(s):  
Boolean Function ◽  
Function Minimization ◽  
Complexity Of Algorithms ◽  
Statistical Complexity

scholarly journals Algebraic independence of multipliers of periodic orbits in the space of polynomial maps of one variable

2014 ◽  
Vol 36 (4) ◽  
pp. 1156-1166 ◽  
Author(s):  
IGORS GORBOVICKIS
Keyword(s):  
Periodic Orbits ◽  
Moduli Space ◽  
Algebraic Independence ◽  
Complex Polynomials ◽  
Generic Point ◽  
Algebraic Functions ◽  
Polynomial Maps ◽  
Affine Subspaces

We consider the space of complex polynomials of degree $n\geq 3$ with $n-1$ distinct marked periodic orbits of given periods. We prove that this space is irreducible and the multipliers of the marked periodic orbits, considered as algebraic functions on that space, are algebraically independent over $\mathbb{C}$. Equivalently, this means that at its generic point the moduli space of degree-$n$ polynomial maps can be locally parameterized by the multipliers of $n-1$ arbitrary distinct periodic orbits. We also prove a similar result for a certain class of affine subspaces of the space of complex polynomials of degree $n$.

Sign in / Sign up

Export Citation Format

Share Document