Exponentially Convergent Algorithms for Abstract Differential Equations
Our rough guess is there are 45,000 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 0 minutes to read. With a half hour per day, this will take 6 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.
We earn a commission on purchases
Author
Contributions
- Makarov, Volodymyr - Contributor
- Vasylyk, Vitalii - Contributor
- SpringerLink (Online service) - Contributor
Publication
2011 - Springer Basel AG, Basel
Language
English
Word Count
45,000 words, Guess
Page Count
180 pages
Physical Format
[electronic resource] /
Identifiers
- Open LibraryOL25546318M
- ISBN-139783034801188
- OCLC Control Number760321597
- OCLC Control Numberexponentiallycon00gavr
- Library of Congress Control Number2011932317
Classifications
- LCCQA371 .G38 2011
Description
This book presents new accurate and efficient exponentially convergent methods for abstract differential equations with unbounded operator coefficients in Banach space. These methods are highly relevant for the practical scientific computing since the equations under consideration can be seen as the meta-models of systems of ordinary differential equations (ODE) as well as the partial differential equations (PDEs) describing various applied problems. The framework of functional analysis allows one to obtain very general but at the same time transparent algorithms and mathematical results which
Subjects
Series Statement
- Frontiers in Mathematics
Other Editions
- Exponentially Convergent Algorithms for Abstract Differential Equations
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!