Degree of a polynomial

In mathematics, the degree of a polynomial is the highest of the degrees of the polynomial's monomials (individual terms) with non-zero coefficients. The degree of a term is the sum of the exponents of the variables that appear in it, and thus is a non-negative integer. For a univariate polynomial, the degree of the polynomial is simply the highest exponent occurring in the polynomial. The term order has been used as a synonym of degree but, nowadays, may refer to several other concepts (see Order of a polynomial (disambiguation)). For example, the polynomial 7x^2y^3 + 4x - 9, which can also be written as 7x^2y^3 + 4x^1y^0 - 9x^0y^0, has three terms. The first term has a degree of 5 (the sum of the powers 2 and 3), the second term has a degree of 1, and the last term has a degree of 0. Therefore, the polynomial has a degree of 5, which is the highest degree of any term. To determine the degree of a polynomial that is not in standard form, such as (x+1

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (20)

Related publications

Related people (4)

Related people

Related units (3)

Related units

Related concepts (44)

Related concepts

Related courses (25)

Related courses

Related lectures (40)

Related lectures

Polynomial

In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and po

Field (mathematics)

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined and behave as the corresponding operations on rational and real numbers do. A field is thus

Polynomial ring

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterm

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised.

FIN-472: Computational finance

Participants of this course will master computational techniques frequently used in mathematical finance applications. Emphasis will be put on the implementation and practical aspects.

MATH-106(a): Analysis II

Étudier les concepts fondamentaux d'analyse, et le calcul différentiel et intégral des fonctions réelles de plusieurs variables.

Coupling non-conforming discretizations of PDEs by spectral approximation of the Lagrange multiplier space

Simone Deparis, Antonio Iubatti, Luca Pegolotti

This work focuses on the development of a non-conforming method for the coupling of PDEs based on weakly imposed transmission conditions: the continuity of the global solution is enforced by a finite number of Lagrange multipliers defined over the interfaces of adjacent subdomains. The method falls into the class of primal hybrid methods, which include also the well-known mortar method. Differently from the mortar method, we discretize the space of basis functions on the interface by spectral approximation independently of the discretization of the two adjacent domains. In particular, our approach can be regarded as a specialization of the three-field method in which the spaces used to enforce the continuity of the solution and its conormal derivative across the interface are taken equal. One of the possible choices to approximate the interface variational space – which we consider here – is by Fourier basis functions. As we show in the numerical simulations, the method is well-suited for the coupling of problems defined on globally non-conforming meshes or discretized with basis functions of different polynomial degree in each subdomain. We also investigate the possibility of coupling solutions obtained with incompatible numerical methods, namely the finite element method and isogeometric analysis.

2019

A Hybrid High-Order Method for Highly Oscillatory Elliptic Problems

Simon Clément Damien Lemaire

We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh; those attached to the cells can be eliminated locally using static condensation. The main building ingredient is a reconstruction operator, local to each coarse cell, that maps onto a fine-scale space spanned by oscillatory basis functions. The present HHO method generalizes the ideas of some existing multiscale approaches, while providing the first complete analysis on general meshes. It also improves on those methods, taking advantage of the flexibility granted by the HHO framework. The method handles arbitrary orders of approximation k >= 0. For face unknowns that are polynomials of degree k, we devise two versions of the method, depending on the polynomial degree (k - 1) or k of the cell unknowns. We prove, in the case of periodic coefficients, an energy-error estimate of the form (epsilon(1/2) + Hk+1 + (epsilon/H)(1/2)), and we illustrate our theoretical findings on some test-cases.

WALTER DE GRUYTER GMBH2019

Computational Performance of a Parallelized Three-Dimensional High-Order Spectral Element Toolbox

Christoph Bosshard, Roland Bouffanais, Christian Clémençon, Michel Deville, Nicolas Fietier, Sohrab Jairo Kehtari, Vincent Keller, Jonas Marcel Lätt

In this paper, a comprehensive performance review of all MPI-based high-order three-dimensional spectral element method C++ toolbox is presented. The focus is put on the performance evaluation of aspects with a particular emphasis on the parallel efficiency. The performance evaluation is analyzed with help of a time prediction model based on a parameterization of the application and the hardware resources. A tailor-made CFD computation benchmark case is introduced and used to carry out this review, stressing the particular interest for clusters with up to 8192 cores. Some problems in the parallel implementation have been detected and corrected. The theoretical complexities with respect, to the number of elements, to the polynomial degree, and to communication needs are correctly reproduced. It is concluded that this type of code has a nearly perfect speed up on machines with thousands of crores, and is ready to make the step to next-generation petaflop machines

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009