Results 31 to 40 of about 378,939 (286)
Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems [PDF]
Yugoslav Journal of Operations Research, 2002 A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem.
Lešaja Goran
doaj +1 more source
IEEE Access, 2022 Pseudorandom sequences with large linear complexity have been widely applied in electronic countermeasures, mobile communication and cryptography.
Jiang Ma +3 more
doaj +1 more source
A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term [PDF]
Yugoslav Journal of Operations Research, 2015 In this paper, we propose a large-update interior-point algorithm for linear optimization based on a new kernel function. New search directions and proximity measure are defined based on this kernel function.
Kheirfam B., Moslemi M.
doaj +1 more source
How to determine linear complexity and $k$-error linear complexity in some classes of linear recurring sequences [PDF]
, 2008 Several fast algorithms for the determination of the linear complexity of $d$-periodic sequences over a finite field $\F_q$, i.e. sequences with characteristic polynomial $f(x) = x^d-1$, have been proposed in the literature. In this contribution fast
A. Salagean +20 more
core +2 more sources
Rigid continuation paths II. structured polynomial systems
Forum of Mathematics, Pi, 2023 This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used.
Peter Bürgisser +2 more
doaj +1 more source
Complexity of Ising Polynomials [PDF]
Combinatorics, Probability and Computing, 2012 This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and external field. One may consider such an Ising system as a simple graph together with vertex and edge weights.
openaire +3 more sources
A simulation algorithm for a single server retrial queuing system with batch arrivals
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases.
Florea Ion, Nǎnǎu Corina-Ştefania
doaj +1 more source
Complex factorization by Chebysev polynomials
Le Matematiche, 2018 A sequence \((u_n)\) is called \(r\)-periodic if satisfies the recurrence relation \[u_n=a_tu_{n-1}+b_tu_{n-2},\] with \(n \equiv t \pmod r\), for \(n\geq 2\), and given numbers \(a_0,\ldots,a_{r-1},b_0,\ldots,b_{r-1}\), with initial conditions \(u_0\) and \(u_1\).
Sahin, Murat, Tan, Elif, Yilmaz, Semih
openaire +3 more sources
Mathematical Modelling and Analysis, 2018 An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji +3 more
doaj +1 more source
Research on Linear Complexity of Quaternary Sequences with Period 2pq [PDF]
Jisuanji gongcheng, 2016 Linear complexity is an important index for measuring the randomness properties of the sequences.Based on the theory of generalized cyclotomic,a new class of quaternary balanced generalized cyclotomic sequences with period 2pq over finite field F4 is ...
WEI Wanyin,DU Xiaoni,WANG Guohui
doaj +1 more source