Newton's Method with Mesh Refinements for Numerical Solution of Nonlinear Two-Point Boundary Value Problems.
Estimates of the radius of convergence of Newton's methods for variational inclusions in Banach spaces are investigated under a weak Lipschitz condition on the first Fréchet derivative. We establish the linear convergence of Newton's and of a variant of Newton methods using the concepts of pseudo-Lipschitz set-valued map and ω-conditioned Fréchet derivative or the center-Lipschitz condition introduced by the first author.
We use a combination of modified Newton method and Tikhonov regularization to obtain a stable approximate solution for nonlinear ill-posed Hammerstein-type operator equations KF(x) = y. It is assumed that the available data is with , K: Z → Y is a bounded linear operator and F: X → Z is a nonlinear operator where X,Y,Z are Hilbert spaces. Two cases of F are considered: where exists (F’(x₀) is the Fréchet derivative of F at an initial guess x₀) and where F is a monotone operator. The parameter...
We show how the idea behind a formula for π discovered by the Indian mathematician and astronomer Nilakantha (1445-1545) can be developed into a general series acceleration technique which, when applied to the Gregory-Leibniz series, gives the formula with convergence as , in much the same way as the Euler transformation gives with convergence as . Similar transformations lead to other accelerated series for π, including three “BBP-like” formulas, all of which are collected in the Appendix....
Inspired by the growing use of non linear discretization techniques for the linear diffusion equation in industrial codes, we construct and analyze various explicit non linear finite volume schemes for the heat equation in dimension one. These schemes are inspired by the Le Potier’s trick [C. R. Acad. Sci. Paris, Ser. I 348 (2010) 691–695]. They preserve the maximum principle and admit a finite volume formulation. We provide a original functional setting for the analysis of convergence of such methods....
The paper deals with error estimates and lower bound approximations of the Steklov eigenvalue problems on convex or concave domains by nonconforming finite element methods. We consider four types of nonconforming finite elements: Crouzeix-Raviart, , and enriched Crouzeix-Raviart. We first derive error estimates for the nonconforming finite element approximations of the Steklov eigenvalue problem and then give the analysis of lower bound approximations. Some numerical results are presented to...
Low-order nonconforming Galerkin methods will be analyzed for second-order elliptic equations subjected to Robin, Dirichlet, or Neumann boundary conditions. Both simplicial and rectangular elements will be considered in two and three dimensions. The simplicial elements will be based on P1, as for conforming elements; however, it is necessary to introduce new elements in the rectangular case. Optimal order error estimates are demonstrated in all cases with respect to a broken norm in H1(Ω)...
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete norm best approximation error estimates for functions hold for arbitrary triangulations. However, the constants in similar estimates for the error of the Galerkin projection for second-order elliptic problems show a dependence on the maximum angle of all triangles in the triangulation. We demonstrate...