Fr. 77.00

Efficient numerical methods to compute unsteady subsonic flows - A new refinement strategy for grid adaptation and a tailored Jacobian-free Newton-Krylov algorithm for unsteady flow problems

English, German · Paperback / Softback

Shipping usually within 2 to 3 weeks (title will be printed to order)

Description

Read more

Despite the large increase in computer power and the advances in solver technology, unsteady flow problems still may require a vast amount of computing time. In this work two approaches are investigated that should lead to a reduction in computing times for unsteady subsonic flows. In the first part of this work a new refinement strategy for grid adaptation is proposed that enables the user to a priori define the maximum usable computer resources. In the second part of this work a Jacobian-free Newton-Krylov algorithm is tailored for unsteady subsonic flow problems. With this algorithm computing times are reduced with one order of magnitude compared to the traditional used solver.

About the author










Peter Lucas as well as Hester Bijl both have been awarded the degree of doctor at the Delft University of Technology. Their expertise lies in the field of computational fluid dynamics. Hester Bijl is currently a full professor at the Delft University of Technology.

Product details

Authors Hester Bijl, Pete Lucas, Peter Lucas
Publisher LAP Lambert Academic Publishing
 
Languages English, German
Product format Paperback / Softback
Released 21.07.2010
 
EAN 9783838385761
ISBN 978-3-8383-8576-1
No. of pages 148
Dimensions 150 mm x 220 mm x 8 mm
Weight 213 g
Subject Natural sciences, medicine, IT, technology > Technology > Aviation and space engineering

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.