Topics in Numerical Analysis
With Special Emphasis on Nonlinear Problems (Computing Supplementa)
1 edition
Our rough guess is there are 62,250 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 9 minutes to read. With a half hour per day, this will take 9 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- G. Alefeld (Editor) - Contributor
- Xiaojun Chen (Editor) - Contributor
Publication
2001-10-19 - Springer
Language
English
Word Count
62,250 words, Guess
Page Count
249 pages
Physical Format
Paperback
Identifiers
- Open LibraryOL12678625M
- ISBN-139783211836736
- ISBN-10321183673X
- OCLC Control Number48253599
Classifications
- LCCQA297-299.4
Description
This collection of papers on numerical analysis with special emphasis on nonlinear problems covers a broad spectrum of fields. Several papers are involved in applying numerical methods for proving the existence of solutions of nonlinear problems, e.g. of boundary problems or of obstacle problems. Naturally the solution of linear and nonlinear problems by iterative methods is the subject of a couple of papers. Here topics like the fast verification of solutions of monotone matrix equations, the convergence of linear asynchronous iteration with spectral radius of modulus one or aggregation and disaggregation methods for p-cyclic Markov chains are treated. On the other hand papers involved in optimization problems can be found. Nearly all fields of modern numerical analysis are touched by at least one paper.
Subjects
Topics
Other Editions
- Topics in Numerical Analysis: With Special Emphasis on Nonlinear Problems (Computing Supplementa)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!