Library

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 94 (1966), S. 396-414 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 45 (1984), S. 323-343 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65R05 ; CR: G1.8
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary The paper concerns solution manifolds of nonlinear parameterdependent equations (1)F(u, λ)=y0 involving a Fredholm operatorF between (infinite-dimensional) Banach spacesX=Z×Λ andY, and a finitedimensional parameter space Λ. Differntial-geometric ideas are used to discuss the connection between augmented equations and certain onedimensional submanifolds produced by numerical path-tracing procedures. Then, for arbitrary (finite) dimension of Λ, estimates of the error between the solution manifold of (1) and its discretizations are developed. These estimates are shown to be applicable to rather general nonlinear boundaryvalue problems for partial differential equations.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 53 (1988), S. 165-181 
    ISSN: 0945-3245
    Keywords: AMS(MOS):65H10 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A new algorithm is presented for computing vertices of a simplicial triangulation of thep-dimensional solution manifold of a parametrized equationF(x)=0, whereF is a nonlinear mapping fromR n toR m ,p=n−m〉1. An essential part of the method is a constructive algorithm for computing moving frames on the manifold; that is, of orthonormal bases of the tangent spaces that vary smoothly with their points of contact. The triangulation algorithm uses these bases, together with a chord form of the Gauss-Newton process as corrector, to compute the desired vertices. The Jacobian matrix of the mapping is not required at all the vertices but only at the centers of certain local “triangulation patches”. Several numerical examples show that the method is very efficient in computing triangulations, even around singularities such as limit points and bifurcation points. This opens up new possibilities for determining the form and special features of such solution manifolds.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 57 (1990), S. 681-694 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65H10 ; CR: G1.5
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary An algorithm is presented for the computation of the second fundamental tensorV of a Riemannian submanifoldM ofR n . FromV the riemann curvature tensor ofM is easily obtained. Moreover,V has a close relation to the second derivative of certain functionals onM which, in turn, provides a powerful new tool for the computational determination of multiple bifurcation directions. Frequently, in applications, thed-dimensional manifoldM is defined implicitly as the zero set of a submersionF onR n . In this case, the principal cost of the algorithm for computingV(p) at a given pointp∈M involves only the decomposition of the JacobianDF(p) ofF atp and the projection ofd(d+1) neighboring points ontoM by means of a local iterative process usingDF(p). Several numerical examples are given which show the efficiency and dependability of the method.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Computing 36 (1986), S. 81-90 
    ISSN: 1436-5057
    Keywords: 65H10 ; Key words ; Systems of nonlinear equations ; Newton's method ; monotone convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Neue hinreichende Bedingungen für die monotone Konvergenz der Newton-Methode für die Lösung nichtlinearer Gleichung werden gegeben. Diese Bedingungen sind affin-invariant und allgemeiner als die Voraussetzungen des Satzes von Baluev.
    Notes: Abstract New sufficient conditions for the monotone convergence of Newton's method for solving nonlinear systems of equations are given. These conditions are affine-invariant and less restrictive than the hypothesis of Baluev's theorem.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Archive for rational mechanics and analysis 23 (1967), S. 352-365 
    ISSN: 1432-0673
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    BIT 14 (1974), S. 227-239 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In continuation of earlier work on the graph algorithmic language GRAAL, a new type of graph representation is introduced involving solely the arcs and their incidence relations. In line with the set theoretical foundation of GRAAL, the are graph structure is defined in terms of four Boolean mappings over the power set of the ares. A simple data structure is available for are graphs requiring only storage of the order of the cardinality of the are set. As an application, the LU decomposition of large sparse matrices and the solution of the corresponding linear systems are formulated in terms of are graphs and their operators, and experimental results involving these algorithms are presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    BIT 12 (1972), S. 220-241 
    ISSN: 1572-9125
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An algorithmic language, GRAAL, is defined, as an extension of ALGOL 60 (Revised), for describing and implementing graph algorithms of the type arising in applications. It is based on a set algebraic model of graph theory which defines the graph structure in terms of user specified morphisms between certain set algebraic structures over the node and arc set. Several examples of graph algorithms written in GRAAL are included.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 17 (1981), S. 649-662 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The nature of adaptive processes is reviewed using as an example a specific finite element problem. Several possible formulations for the objective of mesh refinement processes are given. For the most natural of these objectives the A*-algorithms of artificial intelligence turn out to provide a solution process which is known to be optimal in a certain sense. But practically, there is insufficient information and these processes tend to be inefficient. On the other hand, if the objective is replaced by a strictly local objective based on Pareto-optimality, the error estimates of the resulting mesh sequence are shown to exhibit the order of convergence which is known to be best possible for the type of elements used.
    Additional Material: 1 Tab.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 25 (1988), S. 269-282 
    ISSN: 0029-5981
    Keywords: Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The goal of mathematical modelling of sheet metal forming processes is to provide predictive tools for use in the design of stamping processes and the selection of sheet materials. Most current approaches to finite element modelling of large deformation, elastic-plastic sheet metal forming problems use a rate form of the virtual work (equilibrium) equations, and a single-field finite element representation of the displacement components. Called the incremental method, this approach does not produce approximations which satisfy the discrete equilibrium equations at all times, and consequently it demands small time steps to insure stability and numerical accuracy. This paper describes a variant of the mixed method in which displacements, stresses, effective strain and pressures are all given separate finite element representations. The equilibrium equations in non-rate form are discretized to produce a system of algebraic equations which are coupled with the constitutive equations and then integrated using state-of-the-art numerical software. When used to model rate sensitive sheet materials in hydrostatic bulging, plane strain punch stretching and hemispherical punch stretching, the new approach proved to be between 6 and 26 times as fast as the old incremental method.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...