scholarly journals Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e x

2020 ◽  
Vol 46 (3) ◽  
pp. 1-22
Author(s):  
Timothée Ewart ◽  
Francesco Cremonesi ◽  
Felix Schürmann ◽  
Fabien Delalondre
Keyword(s):  
Elementary Function ◽  
Polynomial Evaluation

Protein expression, purification, and elementary function of Dmrt1 in half-smooth tongue sole (Cynoglossus semilae-vis)

2013 ◽  
Vol 20 (6) ◽  
pp. 1132-1138 ◽  
Author(s):  
Qiaomu HU ◽  
Kailin WANG ◽  
Songlin CHEN
Keyword(s):  
Protein Expression ◽  
Elementary Function ◽  
Tongue Sole ◽  
Half Smooth Tongue Sole

scholarly journals Optimal Random Packing of Spheres and Extremal Effective Conductivity

Symmetry ◽  
2021 ◽  
Vol 13 (6) ◽  
pp. 1063
Author(s):  
Vladimir Mityushev ◽  
Zhanat Zhunussova
Keyword(s):  
Effective Conductivity ◽  
Dimensional Space ◽  
Elementary Function ◽  
Voronoi Tessellation ◽  
Random Packing ◽  
Periodicity Cell ◽  
Algebraic Equations ◽  
Optimal Packing ◽  
Linear Algebraic Equations ◽  
Initial Location

A close relation between the optimal packing of spheres in Rd and minimal energy E (effective conductivity) of composites with ideally conducting spherical inclusions is established. The location of inclusions of the optimal-design problem yields the optimal packing of inclusions. The geometrical-packing and physical-conductivity problems are stated in a periodic toroidal d-dimensional space with an arbitrarily fixed number n of nonoverlapping spheres per periodicity cell. Energy E depends on Voronoi tessellation (Delaunay graph) associated with the centers of spheres ak (k=1,2,…,n). All Delaunay graphs are divided into classes of isomorphic periodic graphs. For any fixed n, the number of such classes is finite. Energy E is estimated in the framework of structural approximations and reduced to the study of an elementary function of n variables. The minimum of E over locations of spheres is attained at the optimal packing within a fixed class of graphs. The optimal-packing location is unique within a fixed class up to translations and can be found from linear algebraic equations. Such an approach is useful for random optimal packing where an initial location of balls is randomly chosen; hence, a class of graphs is fixed and can dynamically change following prescribed packing rules. A finite algorithm for any fixed n is constructed to determine the optimal random packing of spheres in Rd.

scholarly journals W-representation of Rainbow tensor model

2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
Bei Kang ◽  
Lu-Yao Wang ◽  
Ke Wu ◽  
Jie Yang ◽  
Wei-Zhong Zhao
Keyword(s):  
Partition Function ◽  
Matrix Model ◽  
Crucial Role ◽  
Elementary Function ◽  
Tensor Model ◽  
Witt Algebra ◽  
Virasoro Constraints ◽  
Compact Expression ◽  
Non Gaussian ◽  
Dual Expression

Abstract We analyze the rainbow tensor model and present the Virasoro constraints, where the constraint operators obey the Witt algebra and null 3-algebra. We generalize the method of W-representation in matrix model to the rainbow tensor model, where the operators preserving and increasing the grading play a crucial role. It is shown that the rainbow tensor model can be realized by acting on elementary function with exponent of the operator increasing the grading. We derive the compact expression of correlators and apply it to several models, i.e., the red tensor model, Aristotelian tensor model and r = 4 rainbow tensor model. Furthermore, we discuss the case of the non-Gaussian red tensor model and present a dual expression for partition function through differentiation.

Polynomial Evaluation

2016 ◽  
pp. 81-100
Author(s):  
Jean-Michel Muller
Keyword(s):  
Polynomial Evaluation

scholarly journals Twin-width I: Tractable FO Model Checking

2022 ◽  
Vol 69 (1) ◽  
pp. 1-46
Author(s):  
Édouard Bonnet ◽  
Eun Jung Kim ◽  
Stéphan Thomassé ◽  
Rémi Watrigant
Keyword(s):  
Model Checking ◽  
Elementary Function ◽  
First Order ◽  
Fpt Algorithm ◽  
Fixed Parameter ◽  
Dimension 2 ◽  
Bounded Size ◽  
Map Graphs ◽  
Dimensional Ball ◽  
Bounded Width

Inspired by a width invariant defined on permutations by Guillemot and Marx [SODA’14], we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map graphs, K t -free unit d -dimensional ball graphs, posets with antichains of bounded size, and proper subclasses of dimension-2 posets all have bounded twin-width. On all these classes (except map graphs without geometric embedding) we show how to compute in polynomial time a sequence of d -contractions , witness that the twin-width is at most d . We show that FO model checking, that is deciding if a given first-order formula ϕ evaluates to true for a given binary structure G on a domain D , is FPT in |ϕ| on classes of bounded twin-width, provided the witness is given. More precisely, being given a d -contraction sequence for G , our algorithm runs in time f ( d ,|ϕ |) · |D| where f is a computable but non-elementary function. We also prove that bounded twin-width is preserved under FO interpretations and transductions (allowing operations such as squaring or complementing a graph). This unifies and significantly extends the knowledge on fixed-parameter tractability of FO model checking on non-monotone classes, such as the FPT algorithm on bounded-width posets by Gajarský et al. [FOCS’15].

scholarly journals Toward Accurate Polynomial Evaluation in Rounded Arithmetic

2010 ◽  
pp. 36-105
Author(s):  
James Demmel ◽  
Ioana Dumitriu ◽  
Olga Holtz
Keyword(s):  
Polynomial Evaluation

A pipelined computer architecture for unified elementary function evaluation

1978 ◽  
Vol 5 (2) ◽  
pp. 189-202 ◽  
Author(s):  
Michael Andrews ◽  
Daniel A. Eggerding
Keyword(s):  
Computer Architecture ◽  
Elementary Function ◽  
Function Evaluation
Sign in / Sign up

Export Citation Format

Share Document