Elimination methods (Record no. 54199)

MARC details
000 -LEADER
fixed length control field 02238 a2200229 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 201225b ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783211832417
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 512.9434
Item number WAN
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Wang, D.
245 ## - TITLE STATEMENT
Title Elimination methods
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2001.
Place of publication, distribution, etc Wien:
300 ## - PHYSICAL DESCRIPTION
Extent xiii, 244 p. ;
Other physical details pb;
Dimensions 25 cm.
365 ## - TRADE PRICE
Price type code EURO
Price amount 109.99
440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Texts and monographs in symbolic computation, 0943-853X
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliographical references and index.
520 ## - SUMMARY, ETC.
Summary, etc The development of polynomial-elimination techniques from classical theory to modern algorithms has undergone a tortuous and rugged path. This can be observed L. van der Waerden's elimination of the "elimination theory" chapter from from B. his classic Modern Algebra in later editions, A. Weil's hope to eliminate "from algebraic geometry the last traces of elimination theory," and S. Abhyankar's sug­ gestion to "eliminate the eliminators of elimination theory. " The renaissance and recognition of polynomial elimination owe much to the advent and advance of mod­ ern computing technology, based on which effective algorithms are implemented and applied to diverse problems in science and engineering. In the last decade, both theorists and practitioners have more and more realized the significance and power of elimination methods and their underlying theories. Active and extensive research has contributed a great deal of new developments on algorithms and soft­ ware tools to the subject, that have been widely acknowledged. Their applications have taken place from pure and applied mathematics to geometric modeling and robotics, and to artificial neural networks. This book provides a systematic and uniform treatment of elimination algo­ rithms that compute various zero decompositions for systems of multivariate poly­ nomials. The central concepts are triangular sets and systems of different kinds, in terms of which the decompositions are represented. The prerequisites for the concepts and algorithms are results from basic algebra and some knowledge of algorithmic mathematics.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algebra
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algebra-Data Processing
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Elimination
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Copy number Cost, replacement price Koha item type
    Dewey Decimal Classification     General IIT Gandhinagar IIT Gandhinagar General Stacks 25/12/2020 Himanshu Books 9991.49   512.9434 WAN 029844 25/12/2020 1 9991.49 Books


Copyright ©  2022 IIT Gandhinagar Library. All Rights Reserved.

Powered by Koha