eBook - ePub
Compact Numerical Methods for Computers
Linear Algebra and Function Minimisation
This is a test
- 278 pages
- English
- ePUB (mobile friendly)
- Available on iOS & Android
eBook - ePub
Book details
Table of contents
Citations
About This Book
This second edition of Compact Numerical Methods for Computers presents reliable yet compact algorithms for computational problems. As in the previous edition, the author considers specific mathematical problems of wide applicability, develops approaches to a solution and the consequent algorithm, and provides the program steps. He emphasizes usefu
Frequently asked questions
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlegoâs features. The only differences are the price and subscription period: With the annual plan youâll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, weâve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Compact Numerical Methods for Computers by John C. Nash in PDF and/or ePUB format, as well as other popular books in Computer Science & Programming Games. We have over one million books available in our catalogue for you to explore.
Information
Table of contents
- Cover
- Half Title
- Title Page
- Copyright Page
- Table of Contents
- Preface to the Second Edition
- Preface to the First Edition
- 1. A STARTING POINT
- 2. FORMAL PROBLEMS IN LINEAR ALGEBRA
- 3. THE SINGULAR-VALUE DECOMPOSITION AND ITS USE TO SOLVE LEAST-SQUARES PROBLEMS
- 4. HANDLING LARGER PROBLEMS
- 5. SOME COMMENTS ON THE FORMATION OF THE CROSS-PRODUCTS MATRIX ATA
- 6. LINEAR EQUATIONSâA DIRECT APPROACH
- 7. THE CHOLESKI DECOMPOSITION
- 8. THE SYMMETRIC POSITIVE DEFINITE MATRIX AGAIN
- 9. THE ALGEBRAIC EIGENVALUE PROBLEM
- 10. REAL SYMMETRIC MATRICES
- 11. THE GENERALISED SYMMETRIC MATRIX EIGENVALUE PROBLEM
- 12. OPTIMISATION AND NONLINEAR EQUATIONS
- 13. ONE-DIMENSIONAL PROBLEMS
- 14. DIRECT SEARCH METHODS
- 15. DESCENT TO A MINIMUM I: VARIABLE METRIC ALGORITHMS
- 16. DESCENT TO A MINIMUM II: CONJUGATE GRADIENTS
- 17. MINIMISING A NONLINEAR SUM OF SQUARES
- 18. LEFT-OVERS
- 19. THE CONJUGATE GRADIENTS METHOD APPLIED TO PROBLEMS IN LINEAR ALGEBRA
- APPENDICES
- BIBLIOGRAPHY
- INDEX