SØG - mellem flere end 8 millioner bøger:
Viser: Direct Methods for Sparse Matrices
Direct Methods for Sparse Matrices Vital Source e-bog
I. S. Duff, A. M. Erisman og J. K. Reid
(2017)
Oxford University Press
499,00 kr.
Leveres umiddelbart efter køb
Direct Methods for Sparse Matrices Vital Source e-bog
I. S. Duff, A. M. Erisman og J. K. Reid
(2017)
Oxford University Press
577,00 kr.
519,30 kr.
Leveres umiddelbart efter køb
Direct Methods for Sparse Matrices Vital Source e-bog
I. S. Duff, A. M. Erisman og J. K. Reid
(2017)
Oxford University Press
698,00 kr.
628,20 kr.
Leveres umiddelbart efter køb
Søgbar e-bog
Direct Methods for Sparse Matrices Vital Source e-bog
I. S. Duff, A. M. Erisman og J. K. Reid
(2017)
Oxford University Press
769,00 kr.
Leveres umiddelbart efter køb
Direct Methods for Sparse Matrices
I. S. Duff, A. M. Erisman og J. K. Reid
(2017)
Sprog: Engelsk
Oxford University Press, Incorporated
1.154,00 kr.
Print on demand. Leveringstid vil være ca 2-3 uger.
Detaljer om varen
- 2. Udgave
- Vital Source 180 day rentals (dynamic pages)
- Udgiver: Oxford University Press (Februar 2017)
- Forfattere: I. S. Duff, A. M. Erisman og J. K. Reid
- ISBN: 9780192507518R180
The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.
Licens varighed:
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 180 dage fra købsdato.
Bookshelf appen: 180 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 2. Udgave
- Vital Source 365 day rentals (dynamic pages)
- Udgiver: Oxford University Press (Februar 2017)
- Forfattere: I. S. Duff, A. M. Erisman og J. K. Reid
- ISBN: 9780192507518R365
The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.
Licens varighed:
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: 365 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: 365 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 2. Udgave
- Vital Source 1460 day rentals (dynamic pages)
- Udgiver: Oxford University Press (Februar 2017)
- Forfattere: I. S. Duff, A. M. Erisman og J. K. Reid
- ISBN: 9780192507518R1460
The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.
Licens varighed:
Bookshelf online: 1460 dage fra købsdato.
Bookshelf appen: 1460 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 1460 dage fra købsdato.
Bookshelf appen: 1460 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 2. Udgave
- Vital Source searchable e-book (Reflowable pages)
- Udgiver: Oxford University Press (Februar 2017)
- Forfattere: I. S. Duff, A. M. Erisman og J. K. Reid
- ISBN: 9780192507518
The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.
Licens varighed:
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Bookshelf online: 365 dage fra købsdato.
Bookshelf appen: ubegrænset dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 2. Udgave
- Hardback: 416 sider
- Udgiver: Oxford University Press, Incorporated (Marts 2017)
- Forfattere: I. S. Duff, A. M. Erisman og J. K. Reid
- ISBN: 9780198508380
The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This second edition is a complete rewrite of the first edition published 30 years ago. Much has changed since that time. Problems have grown greatly in size and complexity; nearly all examples in the first edition were of order less than 5,000 in the first edition, and are often more than a million in the second edition. Computer architectures are now much more complex, requiring new ways of adapting algorithms to parallel environments with memory hierarchies. Because the area is such an important one to all of computational science and engineering, a huge amount of research has been done in the last 30 years, some of it by the authors themselves. This new research is integrated into the text with a clear explanation of the underlying mathematics and algorithms. New research that is described includes new techniques for scaling and error control, new orderings, new combinatorial techniques for partitioning both symmetric and unsymmetric problems, and a detailed description of the multifrontal approach to solving systems that was pioneered by the research of the authors and colleagues. This includes a discussion of techniques for exploiting parallel architectures and new work for indefinite and unsymmetric systems.
1. Introduction2. Sparse matrices: storage schemes and simple operations3. Gaussian elimination for dense matrices: the algebraic problem4. Gaussian elimination for dense matrices: numerical considerations5. Gaussian elimination for sparse matrices: an introduction6. Reduction to block triangular form7. Local pivotal strategies for sparse matrices8. Ordering sparse matrices for band solution9. Orderings based on dissection10. Implementing Gaussian elimination without symbolic factorize11. Implementing Gaussian elimination with symbolic factorize12. Gaussian elimination using trees13. Graphs for symmetric and unsymmetric matrices14. The SOLVE phase15. Other sparsity-oriented issuesA. Matrix and vector normsB. Pictures of sparse matricesC. Solutions to selected exercises
De oplyste priser er inkl. moms
Butikker og åbningstid
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Polyteknisk Boghandel og Forlag A/S - Anker Engelundsvej 1 - 2800 Lyngby
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927