ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (4)
  • AMS(MOS): 65H10  (4)
  • Springer  (4)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
  • 2005-2009
  • 1990-1994
  • 1980-1984  (4)
  • 2008
  • 1982  (4)
  • Mathematik  (4)
Sammlung
  • Artikel  (4)
Verlag/Herausgeber
  • Springer  (4)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
Erscheinungszeitraum
  • 2005-2009
  • 1990-1994
  • 1980-1984  (4)
Jahr
Thema
  • Mathematik  (4)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 39 (1982), S. 325-340 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65H10 ; CR: 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Beschreibung / Inhaltsverzeichnis: Summary In this paper we present convergence results for the asynchronous algorithms based essentially on the notion of classical contraction. We generalize, in particular, all convergence results for those algorithms which are based on the vectorial norm hypothesis, in wide spread use recently. Certain problems, for which the vectorial norm hypothesis can be difficult or even impossible to verify, can nontheless be tackled within the scope of the classical contraction that we adopte.
    Notizen: Resumé Nous présentons dans cet article des résultats de convergence des algorithmes asynchrones basés essentiellement sur la notion classique de contraction. Nous généralisons, en particulier, tous les résultats de convergence de ces algorithmes qui font l'hypothèse de contraction en norme vectorielle qui récemment a été très souvant utilisée. Par ailleurs, l'hypothèse de contraction en norme vectorielle peut se trouver difficile, voire impossible à vérifier pour certains problèmes qui peuvent être cependant abordés dans le cadre de la contraction classique que nous adoptons.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 40 (1982), S. 111-117 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65H10 ; CR: 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary We seek an approximation to a zero of a continuous functionf:[a,b]→ℝ such thatf(a)≦0 andf(b)≧0. It is known that the bisection algorithm makes optimal use ofn function evaluations, i.e., yields the minimal error which is (b−a)/2 n+1, see e.g. Kung [2]. Traub and Wozniakowski [5] proposed using more general information onf by permitting the adaptive evaluations ofn arbitrary linear functionals. They conjectured [5, p. 170] that the bisection algorithm remains optimal even if these general evaluations are permitted. This paper affirmatively proves this conjecture. In fact we prove optimality of the bisection algorithm even assuming thatf is infinitely many times differentiable on [a, b] and has exactly one simple zero.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 38 (1982), S. 383-392 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65H10 ; CR: 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary Recently an iterative method for the solution of systems of nonlinear equations having at leastR-order 1+ $$\sqrt 2 $$ for simple roots has been investigated by the author [7]; this method uses as many function evaluations per step as the classical Newton method. In the present note we deal with several properties of the method such as monotone convergence, asymptotic inclusion of the solution and convergence in the case of multiple roots.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 39 (1982), S. 119-137 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65H10 ; CR: 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary This paper presents a minimization method based on the idea of partitioned updating of the Hessian matrix in the case where the objective function can be decomposed in a sum of convex “element” functions. This situation occurs in a large class of practical problems including nonlinear finite elements calculations. Some theoretical and algorithmic properties of the update are discussed and encouraging numerical results are presented.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...