A new method for solving interval and fuzzy quadratic equations of dual form

In this paper, we present a numerical method for solving a quadratic interval equation in its dual form. The method is based on the generalized procedure of interval extension called” interval extended zero” method. It is shown that the solution of interval quadratic equation based on the proposed method may be naturally treated as a fuzzy number. An important advantage of the proposed method is that it substantially decreases the excess width defect. Several numerical examples are included to demonstrate the applicability and validity of the proposed method.

Modification Model of Soil Fertility Evaluation FAO-UNESCO on the Slopes of Merapi Volcano, Indonesia

One of the mountains known as active volcanoes in the world was Merapi volcano. From the very active impact of Merapi activity, there was a continuous addition of volcanic material associated with soil fertility, which can be evaluated using the Soil Fertility Evaluation (SFE) system. This study aims to obtain a more adaptive SFE system to the southern slopes of Merapi volcano by modifying the FAO- UNESCO version of SFE system that still uses linear equations. In this research used system of quadratic equation, use of natural logarithm (ln), and modification of new parameter. From the evaluation of soil fertility is then connected with the production component of paddy rice (dry grains crop). There were several indicators that used to see the quality of the model or test the goodness of fit of the model we make, for example from its R2. In this study the quality of a model was seen from: Akaike Info Criterion (AIC) and Schwarz Criterion (SC), and the data was done by using EViews 9. The results showed the parameters that influence big in the model can be seen from the correlation and influence the parameters in single. Quadratic equations can improve the quality of a model over a linear equation. The standard SFE model which is modified by using the nat

Killing Tensor Fields of Third Rank on a Two-Dimensional Riemannian Torus

A rank m symmetric tensor field on a Riemannian manifold is called a Killing field if the symmetric part of its covariant derivative is equal to zero. Such a field determines the first integral of the geodesic flow which is a degree m homogeneous polynomial in velocities. There exist global isothermal coordinates on a two-dimensional Riemannian torus such that the metric is of the form ds^2= λ(z)|dz|^2 in the coordinates. The torus admits a third rank Killing tensor field if and only if the function λ satisfies the equation R(∂/∂z（λ(c∆^-1λ_zz+a))= 0 with some complex constants a and c≠0. The latter equation is equivalent to some system of quadratic equations relating Fourier coefficients of the function λ. If the functions λ and λ + λ_0 satisfy the equation for a real constant λ0, 0, then there exists a non-zero Killing vector field on the torus.

Complex Numbers Related to Semi-Antinorms, Ellipses or Matrix Homogeneous Functionals

We generalize the property of complex numbers to be closely related to Euclidean circles by constructing new classes of complex numbers which in an analogous sense are closely related to semi-antinorm circles, ellipses, or functionals which are homogeneous with respect to certain diagonal matrix multiplication. We also extend Euler’s formula and discuss solutions of quadratic equations for the p-norm-antinorm realization of the abstract complex algebraic structure. In addition, we prove an advanced invariance property of certain probability densities.

BPS black hole entropy and attractors in very special geometry. Cubic forms, gradient maps and their inversion

We consider Bekenstein-Hawking entropy and attractors in extremal BPS black holes of $$ \mathcal{N} $$ N = 2, D = 4 ungauged supergravity obtained as reduction of minimal, matter-coupled D = 5 supergravity. They are generally expressed in terms of solutions to an inhomogeneous system of coupled quadratic equations, named BPS system, depending on the cubic prepotential as well as on the electric-magnetic fluxes in the extremal black hole background. Focussing on homogeneous non-symmetric scalar manifolds (whose classification is known in terms of L(q, P, Ṗ) models), under certain assumptions on the Clifford matrices pertaining to the related cubic prepotential, we formulate and prove an invertibility condition for the gradient map of the corresponding cubic form (to have a birational inverse map which is given by homogeneous polynomials of degree four), and therefore for the solutions to the BPS system to be explicitly determined, in turn providing novel, explicit expressions for the BPS black hole entropy and the related attractors as solution of the BPS attractor equations. After a general treatment, we present a number of explicit examples with Ṗ = 0, such as L(q, P), 1 ⩽ q ⩽ 3 and P ⩾ 1, or L(q, 1), 4 ⩽ q ⩽ 9, and one model with Ṗ = 1, namely L(4, 1, 1). We also briefly comment on Kleinian signatures and split algebras. In particular, we provide, for the first time, the explicit form of the BPS black hole entropy and of the related BPS attractors for the infinite class of L(1, P) P ⩾ 2 non-symmetric models of $$ \mathcal{N} $$ N = 2, D = 4 supergravity.

Efficient Implementations of Rainbow and UOV using AVX2

A signature scheme based on multivariate quadratic equations, Rainbow, was selected as one of digital signature finalists for NIST Post-Quantum Cryptography Standardization Round 3. In this paper, we provide efficient implementations of Rainbow and UOV using the AVX2 instruction set. These efficient implementations include several optimizations for signing to accelerate solving linear systems and the Vinegar value substitution. We propose a new block matrix inversion (BMI) method using the Lower-Diagonal-Upper decomposition of blocks matrices based on the Schur complement that accelerates solving linear systems. Compared to UOV implemented with Gaussian elimination, our implementations with the BMI result in speedups of 12.36%, 24.3%, and 34% for signing at security categories I, III, and V, respectively. Compared to Rainbow implemented with Gaussian elimination, our implementations with the BMI result in speedups of 16.13% and 20.73% at the security categories III and V, respectively. We show that precomputation for the Vinegar value substitution and solving linear systems dramatically improve their signing. UOV with precomputation is 16.9 times, 35.5 times, and 62.8 times faster than UOV without precomputation at the three security categories, respectively. Rainbow with precomputation is 2.1 times, 2.2 times, and 2.8 times faster than Rainbow without precomputation at the three security categories, respectively. We then investigate resilience against leakage or reuse of the precomputed values in UOV and Rainbow to use the precomputation securely: leakage or reuse of the precomputed values leads to their full secret key recoveries in polynomial-time.

Solution of Linear and Quadratic Equations Based on Triangular Linear Diophantine Fuzzy Numbers

This paper is introducing a new concept of triangular linear Diophantine fuzzy numbers (TLDFNs) in a generic way. We first introduce the concept of TLDFNs and then study the arithmetic operations on these numbers. We find a method for the ranking of these TLDFNs. At the end, we formulate the linear and quadratic equations of the types A + X = B , A · X + B = C , and A · X 2 + B · X + C = D where the elements A , B , C , and D are TLDFNs. We provide a procedure for the solution of these equations using s , t , u , v -cut and also provide the examples.

Classification of the Real Roots of the Quartic Equation and their Pythagorean Tunes

Presented is a very detailed two-tier analysis of the location of the real roots of the general quartic equation $$x^4 + a x^3 + b x^2 + c x + d = 0$$ x 4 + a x 3 + b x 2 + c x + d = 0 with real coefficients and the classification of the roots in terms of a, b, c, and d, without using any numerical approximations. Associated with the general quartic, there is a number of subsidiary quadratic equations (resolvent quadratic equations) whose roots allow this systematization as well as the determination of the bounds of the individual roots of the quartic. In many cases the root isolation intervals are found. The second tier of the analysis uses two subsidiary cubic equations (auxiliary cubic equations) and solving these, together with some of the resolvent quadratic equations, allows the full classification of the roots of the general quartic and also the determination of the isolation interval of each root. These isolation intervals involve the stationary points of the quartic (among others) and, by solving some of the resolvent quadratic equations, the isolation intervals of the stationary points of the quartic are also determined. The presented classification of the roots of the quartic equation is particularly useful in situations in which the equation stems from a model the coefficients of which are (functions of) the model parameters and solving cubic equations, let alone using the explicit quartic formulæ , is a daunting task. The only benefit in such cases would be to gain insight into the location of the roots and the proposed method provides this. Each possible case has been carefully studied and illustrated with a detailed figure containing a description of its specific characteristics, analysis based on solving cubic equations and analysis based on solving quadratic equations only. As the analysis of the roots of the quartic equation is done by studying the intersection points of the “sub-quartic” $$x^4 + ax^3 + bx^2$$ x 4 + a x 3 + b x 2 with a set of suitable parallel lines, a beautiful Pythagorean analogy can be found between these intersection points and the set of parallel lines on one hand and the musical notes and the staves representing different musical pitches on the other: each particular case of the quartic equation has its own short tune.