Condition Estimates for Pseudo-Arclength Continuation

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages

Scientific paper

We bound the condition number of the Jacobian in pseudo arclength continuation problems, and we quantify the effect of this condition number on the linear system solution in a Newton GMRES solve. In pseudo arclength continuation one repeatedly solves systems of nonlinear equations $F(u(s),\lambda(s))=0$ for a real-valued function $u$ and a real parameter $\lambda$, given different values of the arclength $s$. It is known that the Jacobian $F_x$ of $F$ with respect to $x=(u,\lambda)$ is nonsingular, if the path contains only regular points and simple fold singularities. We introduce a new characterization of simple folds in terms of the singular value decomposition, and we use it to derive a new bound for the norm of $F_x^{-1}$. We also show that the convergence rate of GMRES in a Newton step for $F(u(s),\lambda(s))=0$ is essentially the same as that of the original problem $G(u,\lambda)=0$. In particular we prove that the bounds on the degrees of the minimal polynomials of the Jacobians $F_x$ and $G_u$ differ by at most 2. We illustrate the effectiveness of our bounds with an example from radiative transfer theory.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Condition Estimates for Pseudo-Arclength Continuation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Condition Estimates for Pseudo-Arclength Continuation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Condition Estimates for Pseudo-Arclength Continuation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-141765

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.