 |
|
|
Item Details
| Title:
|
DISCRETE INVERSE PROBLEMS
INSIGHT AND ALGORITHMS |
| By: |
Per Christian Hansen |
| Format: |
Paperback |
| List price:
|
£75.95 |
|
We believe that this item is permanently unavailable, and so we cannot source
it.
|
|
|
|
|
|
| ISBN 10: |
0898716969 |
| ISBN 13: |
9780898716962 |
| Publisher: |
SOCIETY FOR INDUSTRIAL & APPLIED MATHEMATICS,U.S. |
| Pub. date: |
28 February, 2010 |
| Series: |
Fundamentals of Algorithms |
| Pages: |
225 |
| Description: |
Provides an introduction to the practical treatment of inverse problems by means of numerical methods, with a focus on basic mathematical and computational aspects. To solve inverse problems, the authors demonstrate that insight about them goes hand in hand with algorithms. |
| Synopsis: |
Inverse problems arise when we reconstruct a sharper image from a blurred one or reconstruct the underground mass density from measurements of the gravity above the ground. When we solve an inverse problem, we compute the source that gives rise to some observed data using a mathematical model for the relation between the source and the data. This book gives an introduction to the practical treatment of inverse problems by means of numerical methods, with a focus on basic mathematical and computational aspects. To solve inverse problems, we demonstrate that insight about them goes hand in hand with algorithms. Discrete Inverse Problems includes a number of tutorial exercises that give the reader hands-on experience with the methods, difficulties, and challenges associated with the treatment of inverse problems. It also includes examples and figures that illustrate the theory and algorithms. |
| Illustrations: |
illustrations |
| Publication: |
US |
| Imprint: |
Society for Industrial & Applied Mathematics,U.S. |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|