Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Workshop on Computer Algebra in Scientific Computing, CASC 2021

Год издания: 2021

Идентификатор DOI: 10.1007/978-3-030-85165-1_17

Ключевые слова: computer algebra systems, nested radicals, simplification

Аннотация: The problem of simplification of nested radicals over arbitrary number fields was studied by many authors. The case of real radicals over real number fields is somewhat easier to study (at least, from theoretical point of view). In particular, an efficient (i.e., a polynomial-time) algorithm of simplification of at most doubly nested radicals is known. However, this algorithm does not guarantee complete simplification for the case of radicals with nesting depth more than two. In the paper, we give a detailed presentation of the theory that provides an algorithm which simplifies triply nested reals radicals over Q. Some examples of triply nested real radicals that cannot be simplified are also given. © 2021, Springer Nature Switzerland AG.

Журнал: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Выпуск журнала: Vol. 12865 LNCS

Номера страниц: 293-313

ISSN журнала: 03029743

Издатель: Springer Science and Business Media Deutschland GmbH

• Osipov N.N. (Siberian Federal University, Svobodny 79, Krasnoyarsk, 660041, Russian Federation)
• Kytmanov A.A. (Siberian Federal University, Svobodny 79, Krasnoyarsk, 660041, Russian Federation)

• Scopus
• Ядро РИНЦ (eLIBRARY.RU)