[petsc-dev] How do you get RIchardson?

[Matthew Knepley]

On Fri, Sep 16, 2011 at 5:16 PM, Barry Smith <bsmith at mcs.anl.gov> wrote:

>
> On Sep 16, 2011, at 3:00 PM, Jed Brown wrote:
>
> > On Fri, Sep 16, 2011 at 18:58, Matthew Knepley <knepley at gmail.com>
> wrote:
> > I am sure it does (Jed's bastard usage notwithstanding), however I could
> be fine with
> > Richardson as long as the documentation clearly notes that this is
> Picard's method.
> >
> > http://scholar.google.com/scholar?hl=en&q=picard+newton
>
>    I looked at the first page of all of these and still don't have a clue
> of what Newton-Picard is
>
> >
> > http://scholar.google.com/scholar?hl=en&q=picard+solver
> >
>
>    I looked at the first page of all of these and still don't have a clue
> what Picard is; can someone show me a single publication that explicitly and
> concretely defines the Picard iteration which is an algorithm of solving
> nonlinear systems; is it anything you want it to be?


It is defined in the Louis Rall book. I have it at home

http://books.google.com/books/about/Computational_solution_of_nonlinear_oper.html?id=dexQAAAAMAAJ

I will bring it in to ANL.

   Matt


>
>   Barry
>
> > Which of these use your "standard" definition of "Picard"?
>
>


-- 
What most experimenters take for granted before they begin their experiments
is infinitely more interesting than any results to which their experiments
lead.
-- Norbert Wiener
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/petsc-dev/attachments/20110916/839616ab/attachment.html>