One example of application of sum of squares problem in geometry

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F10%3A00504791" target="_blank" >RIV/49777513:23520/10:00504791 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

One example of application of sum of squares problem in geometry

Original language description

Positivity (or nonnegativity) of a polynomial is one of important characteristics in mathematical proving and deriving. A sum of squares, thanks to the semidefinite programming, can handle this better and faster than classical methods. We concentrate onhow a positive polynomial in one variable can be effectively decomposed to a sum of two squares and show the interesting application of this decomposition.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

South Bohemia Mathematical Letters

ISSN

1804-1450

e-ISSN

—

Volume of the periodical

18

Issue of the periodical within the volume

1

Country of publishing house

CZ - CZECH REPUBLIC

Number of pages

16

Pages from-to

—

UT code for WoS article

—

EID of the result in the Scopus database

—