ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (8)
  • AMS(MOS): 65H10  (4)
  • AMS(MOS): 65N30  (4)
  • Springer  (8)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
  • 2005-2009
  • 1990-1994
  • 1980-1984  (8)
  • 2008
  • 1982  (8)
  • Mathematics  (8)
Collection
  • Articles  (8)
Source
Keywords
Publisher
  • Springer  (8)
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
Years
  • 2005-2009
  • 1990-1994
  • 1980-1984  (8)
Year
Topic
  • Mathematics  (8)
  • 1
    Electronic Resource
    Electronic Resource
    Some convergence results for asynchronous algorithms (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 325-340 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: 5.15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Description / Table of Contents: 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.
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01407866
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Bisection is optimal (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 111-117 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: 5.15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01459080
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    The finite element method for parabolic equations (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 339-371 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65N30 ; 65M20 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this first of two papers, computable a posteriori estimates of the space discretization error in the finite element method of lines solution of parabolic equations are analyzed for time-independent space meshes. The effectiveness of the error estimator is related to conditions on the solution regularity, mesh family type, and asymptotic range for the mesh size. For clarity the results are limited to a model problem in which piecewise linear elements in one space dimension are used. The results extend straight-forwardly to systems of equations and higher order elements in one space dimension, while the higher dimensional case requires additional considerations. The theory presented here provides the basis for the analysis and adaptive construction of time-dependent space meshes, which is the subject of the second paper. Computational results show that the approach is practically very effective and suggest that it can be used for solving more general problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396451
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Existence and approximation results for nonlinear mixed problems: Application to incompressible finite elasticity (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 365-382 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65N30 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper considers the problems of minimizing Gateaux-differentiable functionals over subsets of real Banach spaces defined by a non-linear equality constraint. The existence of a Lagrange multiplier is proved, together with approximation results on the constrained subset, provided a nonlinear compatibility condition, generalizing the classical inf-sup condition, is satisfied. These ideas are applied to equilibrium problems in incompressible finite elasticity and lead to convergence results for these problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396438
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Some supplementary results on the 1+ $$\sqrt 2 $$ order method for the solution of nonlinear equations (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 383-392 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: 5.15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396439
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    The numerical solutions of interface problems by infinite element method (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 39-50 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65N30 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper we derive error estimates for infinite element method used in the approximation of solutions of interface problems. Furthermore, approximations of stress intensity factors are given. The infinite element method may be considered as a certain scheme of mesh refinement, but it has the advantages that the refinement is easy to be constructed that the stiffness matrix can be calculated efficiently, and that an approximate solution which has a singularity at the singular point can be also obtained.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01399310
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Finite dimensional approximation of nonlinear problems (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 1-30 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65N30 ; CR: 5.17
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In the first two papers of this series [4, 5], we have studied a general method of approximation of nonsingular solutions and simple limit points of nonlinear equations in a Banach space. We derive here general approximation results of the branches of solutions in the neighborhood of a simple bifurcation point. The abstract theory is applied to the Galerkin approximation of nonlinear variational problems and to a mixed finite element approximation of the von Kármán equations.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01395805
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Partitioned variable metric updates for large structured optimization problems (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 119-137 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: 5.15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01399316
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...