Results 11 to 20 of about 250,497 (280)
INEQUALITIES FOR ALGEBRAIC POLYNOMIALS ON AN ELLIPSE [PDF]
Ural Mathematical Journal, 2020 The paper presents new solutions to two classical problems of approximation theory. The first problem is to find the polynomial that deviates least from zero on an ellipse. The second one is to find the exact upper bound of the uniform norm on an ellipse
Tatiana M. Nikiforova
doaj +4 more sources
The basic polynomial algebra subprograms [PDF]
ACM Communications in Computer Algebra, 2016 The Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over common types of coefficients (prime fields, complex rational numbers, rational functions, etc.). The code is mainly written in CilkPlus [10] targeting multicore processors.
Chen, Changbo +6 more
+5 more sources
Efficient calculation of all steady states in large-scale overlapping generations models [PDF]
Mathematics and Modeling in Finance, 2023 In this paper, we address the problem of analyzing and computing all steady states of an overlapping generation (OLG) model with production and many generations.
Monireh Riahi +3 more
doaj +1 more source
Denumerability of the Algebraic Numbers
Davao Research Journal, 2000 An algebraic number is a real number that is a root of a polynomial equation anXn + an-1Xn-1…+a0 where ai are integers. In this paper, using the fact that a polynomial equation of degree n has at most n roots, together with some results, the ...
Marleonie Bauyot
doaj +1 more source
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one ...
Christian Herrmann +2 more
doaj +1 more source
Algebraic independence of polynomials [PDF]
Acta Arithmetica, 2000 Let k be an algebraically closed field, K a field over k and f, g polynomials over K. We give necessary and sufficient conditions for f, g to be algebraically dependent over k.
openaire +3 more sources
Polynomial Invariants by Linear Algebra [PDF]
, 2016 We present in this paper a new technique for generating polynomial invariants, divided in two independent parts : a procedure that reduces polynomial assignments composed loops analysis to linear loops under certain hypotheses and a procedure for generating inductive invariants for linear loops. Both of these techniques have a polynomial complexity for
Oliveira, S., Bensalem, S., Prevosto, V.
openaire +3 more sources
Composition algebras of polynomials [PDF]
Pacific Journal of Mathematics, 1985 A composition algebra A has two operations defined on it, namely, addition and composition (substitution of polynomials). The ring C[x,y,...] of polynomials in the indeterminates x,y,... with coefficients in a commutative ring C is commutative with respect to addition, associative under composition, and one-sided distributive over addition.
openaire +2 more sources
On some inequalities for derivatives of algebraic polynomials in unbounded regions with angles
MANAS: Journal of Engineering, 2021 In this work we study Bernstein-Walsh-type estimations for the derivative of an arbitrary algebraic polynomial in regions with interior zero and exterior non zero angles.
Cevahir Doğanay Gün
doaj +1 more source
Characteristic Min-Polynomial and Eigen Problem of a Matrix over Min-Plus Algebra
JTAM (Jurnal Teori dan Aplikasi Matematika), 2023 Let R_ε=R∪{-∞}, with R being a set of all real numbers. The algebraic structure (R_ε,⊕,⊗) is called max-plus algebra. The task of finding the eigenvalue and eigenvector is called the eigenproblem.
Sahmura Maula Al Maghribi +2 more
doaj +1 more source