Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
ANDERSON-ACCELERATED CONVERGENCE OF PICARD ITERATIONS FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
by
REBHOLZ, LEO G.
, POLLOCK, SARA
, XIAO, MENGYING
2019
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
ANDERSON-ACCELERATED CONVERGENCE OF PICARD ITERATIONS FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
by
REBHOLZ, LEO G.
, POLLOCK, SARA
, XIAO, MENGYING
2019
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
ANDERSON-ACCELERATED CONVERGENCE OF PICARD ITERATIONS FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
Journal Article
ANDERSON-ACCELERATED CONVERGENCE OF PICARD ITERATIONS FOR INCOMPRESSIBLE NAVIER-STOKES EQUATIONS
2019
Request Book From Autostore
and Choose the Collection Method
Overview
We propose, analyze, and test Anderson-accelerated Picard iterations for solving the incompressible Navier-Stokes equations (NSE). Anderson acceleration has recently gained interest as a strategy to accelerate linear and nonlinear iterations, based on including an optimization step in each iteration. We extend the Anderson acceleration theory to the steady NSE setting and prove that the acceleration improves the convergence rate of the Picard iteration based on the success of the underlying optimization problem. The convergence is demonstrated in several numerical tests, with particularly marked improvement in the higher Reynolds number regime. Our tests show it can be an enabling technology in the sense that it can provide convergence when both usual Picard and Newton iterations fail.
Publisher
Society for Industrial and Applied Mathematics
MBRLCatalogueRelatedBooks
Related Items
Related Items
We currently cannot retrieve any items related to this title. Kindly check back at a later time.
This website uses cookies to ensure you get the best experience on our website.