Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Geddes K., Czapor S., Labahn G. — Algorithms for computer algebra
Geddes K., Czapor S., Labahn G. — Algorithms for computer algebra



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Algorithms for computer algebra

Авторы: Geddes K., Czapor S., Labahn G.

Аннотация:

Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields.


Язык: en

Рубрика: Математика/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Издание: 1

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

Количество страниц: 585

Добавлена в каталог: 22.01.2014

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Transcendental, exponential extension      525
Transcendental, logarithmic extension      523
Transcendental, over      514
Transformation function      82
Transitive closure      435
Trial division      122
Triangular idempotent form      354—355 357
TRIGMAN      8
Trudi, N.      285
Truncation degree      90 104
Unary operation      154
Uniform word problem      448
Unique factorization domain (UFD)      28
UNIT      26
Unit, normal      27 39 49 67
Unit, normal, factorization      29
Unit, normal, GCD      27 67
Unit, normal, LCM      28
Unit, normal, prime      28
Unit, part      27
Universal algebra      153
Unlucky, evaluation      310
Unlucky, homomorphism      301—303 306 308 318
Unlucky, prime      308 310 403
Unsolvable      454
Upper echelon form      398
Upper-triangular matrix      390
Valuation      30 39 64
Valuation, trivial      31
Vandermonde matrix      16 128 185
Variable, auxiliary      48
Variable, main      48
Vector space      431 452
Word      93
Workspace      100
WWGCD algorithm      282
Yun, D.      317 342 347
Zassenhaus construction      232
Zassenhaus, H.      360 371
Zero, divisors      24
Zero, exponents      85 96
Zero-equivalence, problem      81 430—1 439
Zero-equivalence, simplifier      430
1 2 3
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте