你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada separable type representations of matrices and fast algorithms: volume 2. eigenvalue method
Type
Physical Book
Author
Publisher
Year
2013
Language
English
Pages
359
Format
Hardcover
Dimensions
23.4x16x2.5 cm
Weight
0.66 kg.
ISBN
3034806116
ISBN13
9783034806114
Categories

separable type representations of matrices and fast algorithms: volume 2. eigenvalue method

Israel Gohberg (Author) · Yuli Eidelman (Author) · Iulian Haimovici (Author) · Birkhauser · Hardcover

separable type representations of matrices and fast algorithms: volume 2. eigenvalue method - Eidelman, Yuli ; Gohberg, Israel ; Haimovici, Iulian

Cheaper New Book Imported to Taiwan
Delivery: 06 Oct - 19 Oct Shipping: 13 to 17 business days.
NT$ 1,873
Faster New Book Imported to Taiwan
Delivery: 24 Sep - 02 Oct Shipping: 5 to 6 business days.
NT$ 2,403
NT$ 1,873

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "separable type representations of matrices and fast algorithms: volume 2. eigenvalue method"

This two-volume work presents a systematic theoretical and computational study of several types of generalizations of separable matrices. The main attention is paid to fast algorithms (many of linear complexity) for matrices in semiseparable, quasiseparable, band and companion form. The work is focused on algorithms of multiplication, inversion and description of eigenstructure and includes a large number of illustrative examples throughout the different chapters. The second volume, consisting of four parts, addresses the eigenvalue problem for matrices with quasiseparable structure and applications to the polynomial root finding problem. In the first part the properties of the characteristic polynomials of principal leading submatrices, the structure of eigenspaces and the basic methods to compute eigenvalues are studied in detail for matrices with quasiseparable representation of the first order. The second part is devoted to the divide and conquer method, with the main algorithms being derived also for matrices with quasiseparable representation of order one. The QR iteration method for some classes of matrices with quasiseparable of any order representations is studied in the third part. This method is then used in the last part in order to get a fast solver for the polynomial root finding problem. The work is based mostly on results obtained by the authors and their coauthors. Due to its many significant applications and the accessible style the text will be useful to engineers, scientists, numerical analysts, computer scientists and mathematicians alike.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews