ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Numerische Mathematik 11 (1968), S. 175-180 
    ISSN: 0945-3245
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Palo Alto, Calif. : Annual Reviews
    Annual Review of Fluid Mechanics 5 (1973), S. 405-428 
    ISSN: 0066-4189
    Source: Annual Reviews Electronic Back Volume Collection 1932-2001ff
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Physics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    [S.l.] : American Institute of Physics (AIP)
    Journal of Applied Physics 81 (1997), S. 3057-3063 
    ISSN: 1089-7550
    Source: AIP Digital Archive
    Topics: Physics
    Notes: Combining hardness indentation tests and micro-Raman spectroscopy it is shown that metallic Si-II is produced near the interface of a diamond indenter and silicon to a depth of about 0.5 μm, where the highest stresses (hydrostatic and deviatoric) exist. At fast unloading rates Si-II transforms to the amorphous state, whereas a mixture of the r8 high pressure polymorph Si-XII and the bc8 phase Si-III forms upon a slow load release. The region of Si-III+Si-XII is surrounded by the wurtzite structured Si-IV, where the stresses during the indentation had not been high enough to cause the transition to the metallic state. Thus, because of shear deformation a direct transformation to Si-IV takes place. Outside the phase-transformed regions the classical aspects of indentation-induced deformation by dislocation glide, twinning and crack formation are observed. Annealing of the high pressure phases leads to the formation of Si-IV at moderate temperatures and to the reversal to the original diamond structure (Si-I) at temperatures above 500 °C. Using the laser beam of the Raman spectrometer to anneal the samples the phase transitions could be monitored directly. The formation of silicon polymorphs other than amorphous or metallic structures during hardness indentation is, to the best of our knowledge, reported here for the first time. The results compare well with the polymorphism in Si that is known from diamond anvil cell experiments. © 1997 American Institute of Physics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Computing 23 (1979), S. 247-265 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es sei û die Lösung eines Randwertproblems mit einer gewöhnlichen Differentialgleichung zweiter Ordnung. Zu û werden Schrankenfunktionenv undw konstruiert mitv ≦ û ≦w, daraus folgen ähnliche Aussagen für die Ableitungen û′ und û″. Es wird ein Kollokationsverfahren mit finiten Elementen benutzt; die Schrankeneigenschaften werden durch Differential-Ungleichungs-Sätze gesichert. Isth die maximale Schrittweite undk eine beliebige natürliche Zahl, so lassen sich beliebig hohe Genauigkeitsordnungenw−v=O(h 2k ) erzielen.
    Notes: Abstract Let û be the solution of a boundary value problem for an ordinary differential equation of the second order. Function boundsv andw are constructed to û such thatv ≦ û ≦w. From this other bounds are derived for the derivatives û′ and û″. To this end a collocation method with finite elements is used. The inclusion property is proven with the aid of theorems on differential inequalities. Leth be the maximal step size and letk be an arbitrary natural number. Then the accuracy can be made to have arbitrarily high order such thatw−v=C(h 2k ).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Computing 24 (1980), S. 97-105 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es sei $$\mathbb{I}$$ (ℝ) die Menge reeller abgeschlossener Intervalle undΩ 1:= {+, −, ×, /} die Menge der arithmetischen Operationen auf ℝ. Erweitert man dannΩ 1 von ℝ auf $$\mathbb{I}$$ (ℝ) wie üblich, dann ist $$\mathbb{I}$$ (ℝ) abgeschlossen gegenüber den Operationen vonΩ 1 (R. E. Moore [9]). In der Literatur werden verschiedene Möglichkeiten vorgeschlagen, um von komplexen Zahlen zu “komplexen Intervallen” überzugehen: Rechtecke (Alefeld [1] et al.), Kreise (Henrici [4] et al.), Ellipsen (Kahan [5] et al.). In allen drei Fällen sind die entstehenden Mengen nicht mehr abgeschlossen gegenüberΩ 1, weil die Multiplikation und Division solcher “Intervalle” nicht wieder auf Mengen derselben Art führt. Im folgenden wird die Frage behandelt, ob es Klassen von komplexen Mengen (“verallgemeinerte Intervalle”) gibt, die abgeschlossen sind gegenüberΩ 1 oder Teilmengen vonΩ 1. Außerdem wird untersucht, welche “Gestalt” solche Mengen besitzen. Während man solche Klassen sofort angeben kann, wird sich zeigen lassen, daß die Abgeschlossenheitnicht mehr erreichbar ist, wenn man noch zusätzlich fordert, daß diese Mengen (nur) durch endlich viele Parameter beschrieben werden.
    Notes: Abstract Let $$\mathbb{I}$$ (ℝ) be the set of all real closed intervals and letΩ 1:= {+, −, ×, /} be the set of arithmetic operators of ℝ. By extendingΩ 1 from ℝ to $$\mathbb{I}$$ (ℝ) as usual one finds that $$\mathbb{I}$$ (ℝ) is closed with respect to the operations fromΩ 1 (R. E. Moore [9]). In the literature several possibilities are discussed to go over from complex numbers to “complex intervals”: rectangles (Alefeld [1] et al.), discs (Henrici [4] et al.) or ellipses (Kahan [5] et al.). In all three cases the resulting sets are not closed with respect toΩ 1, since the multiplication and division of such “intervals” does not lead to sets of the same kind. In what follows the question is treated whether there are classes of complex sets (“generalized intervals”) which are closed with respect toΩ 1 or to subsets ofΩ 1. One such class is easy to find. Also the shape of the sets involved is discussed. If it is assumed however that the sets under consideration are described by a finite number of parameters then there isno such class closed underΩ 1.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Computing 3 (1968), S. 47-64 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary With the aid of an errorbound arithmetic (see [4]), formulas are given for the computation of approximate valuesplus errorbounds for integrals. In the simplest case,no further information is required about the integrand (e. g. bounds for derivatives, etc.). The formulas can be given for each order of exactitude, the order for the approximate value being, in general, one higher than the order of the errorbounds. Examples show that the errorbounds are generally very sharp. It is possible to use the information given by the errorbounds for the fully automatic ending of the quadrature at the “optimal” point.
    Notes: Zusammenfassung Mit Hilfe einer Fehlerschrankenarithmetik (vgl. [4]) werden Formeln zur Berechnung von Näherungswertenplus Fehlerschranken für bestimmte Integrale angegeben. Im einfachsten Fall werdenkeine weiteren Informationen über den Integranden gefordert (wie etwa Schranken für Ableitungen, etc.). Die Formeln lassen sich für jede Genauigkeitsordnung aufstellen, die Ordnung für den Näherungswert ist i. a. um Eins höher als für die Fehlerschranken. Beispiele zeigen, daß die Schranken sehr scharf sind. Man kann die durch die Schranken vermittelte Information zum vollautomatischen Abbrechen der Quadratur an der “günstigsten” Stelle benutzen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Computing 28 (1982), S. 117-137 
    ISSN: 1436-5057
    Keywords: 04A05 ; 41A25 ; 41A35 ; 47H05 ; 65G10 ; Centered form ; interval arithmetic ; quadratic convergence ; inclusion isotonicity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Letf: ℝ n →ℝ be Lipschitz continuous. The corresponding centered form off is considered and appropriate interval inclusionsF are given. At first the phenomenon of the “quadratic convergence” ofF is treated. Subsequently functionsF are constructed which are inclusion isotone.
    Notes: Zusammenfassung Zu einer lipschitzstetigen Funktionf: ℝ n →ℝ wird die zentrische Form betrachtet und es werden zugehörige Intervall-EinschließungenF angegeben. Es wird einerseits das Phänomen der “quadratischen Konvergenz” vonF behandelt. Andererseits werden Funktionen vonF angegeben, die inklusionsisoton sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 291-309 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We introduce the concept of a (numerical) algorithm and the following properties: consistency, local and global stability, numerical convergence. We exhibit classes of such algorithms with the following property: consistency and local stability together with a suitable termination criterion imply numerical convergence. It is shown that all known results in the literature may be deduced from two theorems on monotone algorithms.
    Notes: Zusammenfassung Es wird der Begriff des (numerischen) Algorithmus eingeführt und es werden dazu die folgenden Eigenschaften definiert: Konsistenz, lokale und globale Stabilität, numerische Konvergenz. Es werden Klassen solcher Algorithmen angegeben mit der folgenden Eigenschaft: Aus Konsistenz und lokaler Stabilität, zusammen mit einem passenden Abbrechkriterium, folgt numerische Konvergenz. Es wird gezeigt, daß alle bis heute bekannten Ergebnisse aus zwei Sätzen über monotone Algorithmen ableitbar sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 311-328 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We derive explicit bounds for the termination index and for the error bound of algorithms as they were studied in part I. Furthermore, we analyze a relation between the theory of part I and the theory of Dahlquist.
    Notes: Zusammenfassung Es werden explizite Schranken angegeben für den Abbrechindex und für die Fehlerschranke von Algorithmen, wie sie in Teil I untersucht wurden. Weiterhin wird ein Zusammenhang zwischen der Theorie von Teil I und der Theorie von Dahlquist untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Interval arithmetic was introduced by R. E. Moore in [1966]. It helps to get bounds for the range of function. Sometimes—but not always—these bounds overestimate the range, sometimes they are even extremely pessimistic. In what follows the reasons for this behaveour will be shown. Furthermore criteria are developed which show if a function is “optimal”, i. e. not overestimating the range. An application of this theory to linear systems of equations is given. It produces classes of matrices and of righthand sides for which the Gauss elimination method has this optimality.
    Notes: Zusammenfassung Die von R. E. Moore [1966] eingeführte Intervallrechnung gestattet es, Schranken für den Wertebereich einer Funktion anzugeben. Diese Schranken überschätzen oft—aber nicht immer—den tatsächlichen Wertebereich und sind gelegentlich sehr pessimistisch. Die Ursachen für dieses Verhalten werden aufgezeigt und es werden Kriterien für „optimale” Funktionen ohne Überschätzung angegeben. Eine Anwendung auf lineare Intervall-Gleichungssysteme liefert Klassen von Matrizen und rechten Seiten, in denen das Gauß-Verfahren diese Optimalität besitzt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...