Exponentially Convergent Algorithms for Abstract Differential Equations
Home > Mathematics and Science Textbooks > Mathematics > Calculus and mathematical analysis > Differential calculus and equations > Exponentially Convergent Algorithms for Abstract Differential Equations
Exponentially Convergent Algorithms for Abstract Differential Equations

Exponentially Convergent Algorithms for Abstract Differential Equations

|
     0     
5
4
3
2
1




International Edition


About the Book

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 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 of 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 then can be applied to mathematical models of the real world. The problem class includes initial value problems (IVP) for first order differential equations with constant and variable unbounded operator coefficients in a Banach space (the heat equation is a simple example), boundary value problems for the second order elliptic differential equation with an operator coefficient (e.g. the Laplace equation), IVPs for the second order strongly damped differential equation as well as exponentially convergent methods to IVPs for the first order nonlinear differential equation with unbounded operator coefficients.  For researchers and students of numerical functional analysis, engineering and other sciences this book provides highly efficient algorithms for the numerical solution of differential equations and applied problems.

Table of Contents:
Preface.- 1 Introduction.- 2 Preliminaries.- 3 The first-order equations.- 4 The second-order equations.- Appendix: Tensor-product approximations of the operator exponential.- Bibliography.- Index.


Best Sellers


Product Details
  • ISBN-13: 9783034801188
  • Publisher: Birkhauser Verlag AG
  • Publisher Imprint: Birkhauser Verlag AG
  • Height: 235 mm
  • No of Pages: 180
  • Returnable: Y
  • ISBN-10: 3034801181
  • Publisher Date: 17 Jul 2011
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Exponentially Convergent Algorithms for Abstract Differential Equations
Birkhauser Verlag AG -
Exponentially Convergent Algorithms for Abstract Differential Equations
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Exponentially Convergent Algorithms for Abstract Differential Equations

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!