We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 21-40 of 42 results
  1. On the local convergence of a family of Euler-Halley type iterations with a parameter

    This paper aims to study the local convergence of a family of Euler-Halley type methods with a parameter α for solving nonlinear operator equations...

    Huang Zhengda, Ma Guochun in Numerical Algorithms
    Article 18 March 2009
  2. An analysis of 4D variational data assimilation and its application

    In this paper, we give an analysis and a general procedure for 4D variational data assimilation (4D-Var). In functional partial differential equation...

    L. Jiang, C. C. Douglas in Computing
    Article 08 January 2009
  3. A Semi-smooth Newton Method for Regularized State-constrained Optimal Control of the Navier-Stokes Equations

    In this paper, we study semi-smooth Newton methods for the numerical solution of regularized pointwise state-constrained optimal control problems...

    J. C. de los Reyes, K. Kunisch in Computing
    Article 27 November 2006
  4. Computing Stability of Differential Equations with Bounded Distributed Delays

    This paper deals with the stability analysis of scalar delay integro-differential equations (DIDEs). We propose a numerical scheme for computing the...

    T. Luzyanina, K. Engelborghs, D. Roose in Numerical Algorithms
    Article 01 September 2003
  5. Numerical Computation of Connecting Orbits in Delay Differential Equations

    We discuss the numerical computation of homoclinic and heteroclinic orbits in delay differential equations. Such connecting orbits are approximated...

    Giovanni Samaey, Koen Engelborghs, Dirk Roose in Numerical Algorithms
    Article 01 August 2002
  6. Newton iteration for partial differential equations and the approximation of the identity

    It is known that the critical condition which guarantees quadratic convergence of approximate Newton methods is an approximation of the identity...

    Gregory E. Fasshauer, Eugene C. Gartland Jr., Joseph W. Jerome in Numerical Algorithms
    Article 01 September 2000
  7. Nonlinear multiscale decompositions: The approach of A. Harten

    Data‐dependent interpolatory techniques can be used in the reconstruction step of a multiresolution scheme designed “à la Harten”. In this paper we...

    Francesc Aràndiga, Rosa Donat in Numerical Algorithms
    Article 01 June 2000
  8. Denoising with higher order derivatives of bounded variation and an application to parameter estimation

    Regularization with functions of bounded variation has been proven to be effective for denoising signals and images. This nonlinear regularization...

    O. Scherzer in Computing
    Article 01 March 1998
  9. On the rate of convergence of 2-term recursions in ℝ d

    Let G be a compact set in ℝ d d ≥1, M = G × G and ϕ : M G a map in C 3 ( M ). Suppose that ϕ has a fixed point ξ , i.e. ϕ ( ξ, ξ )= ξ . We investigate the rate of...

    L. Rocha in Computing
    Article 01 September 1997
  10. Successive continuation for locating connecting orbits

    A successive continuation method for locating connecting orbits in parametrized systems of autonomous ODEs is considered. A local convergence...

    E. J. Doedel, M. J. Friedman, B. I. Kunin in Numerical Algorithms
    Article 01 April 1997
  11. The convex-decomposable operator equation and its monotonic inclusive iteration

    In this paper we discuss a class of nonlinear operators, that we name convex-decomposable operators, which have the nature: Fy−Fx≤(D 1 (x, y)+D 2 (x,...

    Y. Ling in Computing
    Article 01 December 1996
  12. On a numerical Liapunov-Schmidt method for operator equations

    Let, for a higher singular point x 0 of an operator equation G(x 0 )=0 and the kernels of the respective derivatives G ′( x 0 ) and G ′( x 0 ) * , see [1],...

    K. Böhmer in Computing
    Article 01 September 1993
  13. A projection method for computing turning points of nonlinear equations

    A direct method for determining simple turning points of nonlinear parameterdependent equations is presented. Applications are discussed and...

    I. Moret in Computing
    Article 01 June 1992
  14. A comparison of point and ball iterations in the contractive map** case

    In applications, one of the basic problems is to solve the fixed point equation x=Tx with T a contractive map**. Two theorems which can be...

    Zongben Xu, **ngzhong Shi in Computing
    Article 01 March 1992
  15. Path following around corank-2 bifurcation pints of a semi-linear elliptic problem with symmetry

    Bifurcating solution branches and their numerical approximations of a semi-linear elliptic problem are considered at corank-2 bifurcaton points....

    Z. Mei in Computing
    Article 01 March 1991
  16. Recurrence relations for rational cubic methods II: The Chebyshev method

    We continue the analysis of rational cubic methods, initiated in [7]. In this paper, we obtain a system of a priori error bounds for the Chebyshev...

    V. Candela, A. Marquina in Computing
    Article 01 December 1990
  17. A mesh-independence principle for nonlinear operator equations and their discretizations under mild differentiability conditions

    In this note we extend the validity of the mesh-independence principle for nonlinear operator equations and their discretizations to include...

    I. K. Argyros in Computing
    Article 01 September 1990
  18. Recurrence relations for rational cubic methods I: The Halley method

    In this paper we present a system of a priori error bounds for the Halley method in Banach spaces. Our theorem supplies sufficient conditions on the...

    V. Candela, A. Marquina in Computing
    Article 01 June 1990
  19. Splitting iteration method for simple singular points and simple bifurcation points

    A splitting iteration method is introduced to compute the simple singular points and the simple bifurcation points of nonlinear problems. It needs...

    Mei Zhen in Computing
    Article 01 March 1989
  20. A continuation procedure based on projected Newton steps

    In this paper we present and discuss a continuation method for solving certain fixed point problems in Hilbert spaces. The procedure allows to reduce...

    I. Moret in Computing
    Article 01 March 1989
Did you find what you were looking for? Share feedback.