Results 11 to 20 of about 769,785 (290)
发电技术, 2020 Impedance analysis is the leading method of solving the stability issues of grid-connected renewable energy generation systems. Taking the grid-connected system of direct drive permanent magnet synchronous generator (D-PMSG) as an example, the ...
Yongjun YU +4 more
doaj +1 more source
SN Applied Sciences, 2021 This paper proposes a probabilistic small-signal stability analysis method based on the polynomial approximation approach. Since the correct determination of unknown coefficients has a direct effect on the accuracy of the polynomial approximation method,
Ali Mohammad Tabrizchi +1 more
doaj +1 more source
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
Limitations of the Macaulay matrix approach for using the HHL algorithm to solve multivariate polynomial systems [PDF]
Quantum, 2023 Recently Chen and Gao \cite{ChenGao2017} proposed a new quantum algorithm for Boolean polynomial system solving, motivated by the cryptanalysis of some post-quantum cryptosystems.
Jintai Ding +4 more
doaj +1 more source
Solving parametric polynomial systems
Journal of Symbolic Computation, 2007 The authors present a new algorithm for solving constructible or semi-algebraic systems in the indeterminates \([U,X]\) where \(U=[U_1,\dots ,U_d]\) is the set of parameters and \(X=[X_{d+1},\dots,X_n]\) the set of unknowns. To this end, they study the characterization of open subsets in the parameter space over which the number of solutions is ...
Lazard, Daniel, Rouillier, Fabrice
openaire +5 more sources
Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems [PDF]
, 2019 How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input size)}^{1+o(1)
Lairez, Pierre
core +4 more sources
RESOLUTION OF POLYNOMIAL SYSTEMS [PDF]
Computer Mathematics, 2000 In this talk, the state of the art of solving polynomial system by algebraic methods is sketched, and the main directions where future work is needed are indicated.
openaire +2 more sources
MultiRegeneration for polynomial system solving [PDF]
ACM Communications in Computer Algebra, 2020 We demonstrate our implementation of a continuation method as described in [7] for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software multiregeneration outputs the respective (multi)degree in a wide range of cases and partial multidegree in all others.
Crowley, Colin +3 more
openaire +2 more sources
International Journal of Aerospace Engineering, 2016 The restricted three-body problem (R3BP) and restricted four-body problem (R4BP) are modeled based on the rotating frame. The conservative autonomous system for the R3BP and nonautonomous system with period parametric resonance due to the fourth body are
Ying-Jing Qian +3 more
doaj +1 more source
Explicit Construction of First Integrals with Quasi-monomial Terms from the Painlev\'{e} Series [PDF]
, 2004 The Painlev\'{e} and weak Painlev\'{e} conjectures have been used widely to identify new integrable nonlinear dynamical systems. For a system which passes the Painlev\'{e} test, the calculation of the integrals relies on a variety of methods which are ...
Bountis, Tassos +2 more
core +1 more source