//]]>

Structured Matrix Based Methods for Approximate Polynomial GCD (Record no. 24168)

000 -LEADER
fixed length control field 02447nam a22003975i 4500
003 - CONTROL NUMBER IDENTIFIER
control field OSt
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20140310151501.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 120116s2011 it | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788876423819
978-88-7642-381-9
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA150-272
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 512
Edition number 23
264 #1 -
-- Pisa :
-- Edizioni della Normale,
-- 2011.
912 ## -
-- ZDB-2-SMA
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Boito, Paola.
Relator term author.
245 10 - IMMEDIATE SOURCE OF ACQUISITION NOTE
Title Structured Matrix Based Methods for Approximate Polynomial GCD
Medium [electronic resource] /
Statement of responsibility, etc by Paola Boito.
300 ## - PHYSICAL DESCRIPTION
Extent 250p.
Other physical details online resource.
440 1# - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Tesi/Theses ;
Volume number/sequential designation 15
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note i. Introduction -- ii. Notation -- 1. Approximate polynomial GCD -- 2. Structured and resultant matrices -- 3. The Euclidean algorithm -- 4. Matrix factorization and approximate GCDs -- 5. Optimization approach -- 6. New factorization-based methods -- 7. A fast GCD algorithm -- 8. Numerical tests -- 9. Generalizations and further work -- 10. Appendix A: Distances and norms -- 11. Appendix B: Special matrices -- 12. Bibliography -- 13. Index.
520 ## - SUMMARY, ETC.
Summary, etc Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main results that have been proposed so far in the literature. As usual with polynomial computations, the polynomial GCD problem can be expressed in matrix form: the second part of the book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. New algorithms for the computation of approximate polynomial GCD are presented, along with extensive numerical tests. The use of matrix structure allows, in particular, to lower the asymptotic computational cost from cubic to quadratic order with respect to polynomial degree. 
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Algebra.
Topical term or geographic name as entry element Mathematics.
Topical term or geographic name as entry element Algebra.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9788876423802
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/978-88-7642-381-9
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type E-Book
Copies
Price effective from Permanent location Date last seen Not for loan Date acquired Source of classification or shelving scheme Koha item type Damaged status Lost status Withdrawn status Current location Full call number
2014-04-10AUM Main Library2014-04-10 2014-04-10 E-Book   AUM Main Library512

Languages: 
English |
العربية