Results 21 to 30 of about 51,455 (264)
Completeness of Bethe ansatz for Gaudin models associated with gl(1|1)
Nuclear Physics B, 2022 We study the Gaudin models associated with gl(1|1). We give an explicit description of the algebra of Hamiltonians (Gaudin Hamiltonians) acting on tensor products of polynomial evaluation gl(1|1)[t]-modules.
Kang Lu
doaj +1 more source
Point-evaluation functionals on algebras of symmetric functions on $(L_\infty)^2$
Karpatsʹkì Matematičnì Publìkacìï, 2019 It is known that every continuous symmetric (invariant under the composition of its argument with each Lebesgue measurable bijection of $[0,1]$ that preserve the Lebesgue measure of measurable sets) polynomial on the Cartesian power of the complex Banach
T.V. Vasylyshyn
doaj +1 more source
Interactive Verifiable Polynomial Evaluation [PDF]
IEEE Journal on Selected Areas in Information Theory, 2020 Cloud computing platforms have created the possibility for computationally limited users to delegate demanding tasks to strong but untrusted servers. Verifiable computing algorithms help build trust in such interactions by enabling the server to provide a proof of correctness of his results which the user can check very efficiently.
Saeid Sahraei +2 more
openaire +2 more sources
UNCERTAINTY EVALUATION METHOD FOR NONLINEAR SYSTEM TEST BASED ON POLYNOMIAL CHAOS EXPANSION
Jixie qiangdu, 2022 The uncertainty analysis of test results of nonlinear system shows the dispersion of test results. In this paper, an evaluation method of test uncertainty of nonlinear system based on polynomial chaos expansion is suggested.
YU HuiJie +5 more
doaj
Accurate Evaluation of Polynomials in Legendre Basis
Journal of Applied Mathematics, 2014 This paper presents a compensated algorithm for accurate evaluation of a polynomial in Legendre basis. Since the coefficients of the evaluated polynomial are fractions, we propose to store these coefficients in two floating point numbers, such as double ...
Peibing Du, Hao Jiang, Lizhi Cheng
doaj +1 more source
Analysis of modified discretization methods for the measurement volume
Aviation, 2004 The analysis performed in the paper shows that the effectiveness of discretization methods depends on the accuracy of the evaluation of the parameters of local surface errors and on the characteristics of the regression polynomial describing them.
Darius Mariūnas, Vytautas Giniotis
doaj +1 more source
MECHANICAL STRUCTURAL RELIABILITY ANALYSIS BASED ON POLYNOMIAL CHAOS EXPANSIONS
Jixie qiangdu, 2022 Reliability is one of important index in the analysis and evaluation of mechanical structure. Aiming at the problems of various failure modes and low efficiency of reliability evaluation for complex mechanical structures, the reliability analysis method ...
WANG ZhiMing +4 more
doaj
On the Elementary Affine Lambda-Calculus with and Without Fixed Points [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates.
Lê Thành Dũng Nguyen
doaj +1 more source
On Computational Aspects of Krawtchouk Polynomials for High Orders
Journal of Imaging, 2020 Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property.
Basheera M. Mahmmod +3 more
doaj +1 more source
Evaluation of polynomials with super-preconditioning
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976 AbstractCertain questions concerning the arithmetic complexity of univariate polynomial evaluation are considered. The principal technical results show that there exist polynomials f,g, and h with h = fg, such that h requires substantially fewer arithmetic operations than either f or g.
Richard J. Lipton, Larry J. Stockmeyer
openaire +2 more sources