ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

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  (39)
  • stability  (39)
  • Springer  (39)
  • Blackwell Publishing Ltd
  • 1995-1999  (35)
  • 1980-1984  (4)
  • 1925-1929
  • Informatik  (39)
  • 1
    Digitale Medien
    Digitale Medien
    Technical Note: Bias and the Quantification of Stability (1995)
    Springer
    Machine learning 20 (1995), S. 23-33 
    Details
    ISSN: 0885-6125
    Schlagwort(e): stability ; bias ; accuracy ; repeatability ; agreement ; similarity
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should also play a role in the evaluation of bias. One such factor is the stability of the algorithm; in other words, the repeatability of the results. If we obtain two sets of data from the same phenomenon, with the same underlying probability distribution, then we would like our learning algorithm to induce approximately the same concepts from both sets of data. This paper introduces a method for quantifying stability, based on a measure of the agreement between concepts. We also discuss the relationships among stability, predictive accuracy, and bias.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1022682001417
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Technical note: Bias and the quantification of stability (1995)
    Springer
    Machine learning 20 (1995), S. 23-33 
    Details
    ISSN: 0885-6125
    Schlagwort(e): stability ; bias ; accuracy ; repeatability ; agreement ; similarity
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should also play a role in the evaluation of bias. One such factor is the stability of the algorithm; in other words, the repeatability of the results. If we obtain two sets of data from the same phenomenon, with the same underlying probability distribution, then we would like our learning algorithm to induce approximately the same concepts from both sets of data. This paper introduces a method for quantifying stability, based on a measure of the agreement between concepts. We also discuss the relationships among stability, predictive accuracy, and bias.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00993473
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    Forward Assembly Planning Based on Stability (1997)
    Springer
    Journal of intelligent and robotic systems 19 (1997), S. 411-436 
    Details
    ISSN: 1573-0409
    Schlagwort(e): assembly planning ; stability ; robot ; forward ; operations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau
    Notizen: Abstract The paper presents an approach to sequence planning consisting in determining assembly sequences defined in terms of mating and non-mating operations and based on a dynamic expansion of the assembly tree obtained using a knowledge base management system. The planner considers the case of a single-robot assembly workcell. The use of stability and the detailed definition of sequences also by means of several non-mating operations are shown to be powerful instruments in the control of the tree expansion. Forward assembly planning has been chosen, in order to minimize the number of stability checks. Backtracking is avoided by combining precedence relations and stability analysis. Hard and soft constrains are introduced to drive the tree expansion. Hard constraints are precedence relations and stability analysis. All operations are associated to costs, which are used as soft constraints. The operation based approach enables one to manage even non-mating operations and to easily overcome the linearity constraint. Costs enable the planner to manage the association among tools and components. The first section of the paper concerns Stability Analysis that is subdivided into Static and Dynamic Stability Analysis. The former is mainly involved in analyzing gravity effects; the latter is mainly involved in evaluate inertia effects due to manipulation. Stability Analysis is implemented in a simplified form. Fundamental assumptions are: no rotational equilibrium condition is considered; for each reaction force only direction and versus, but not magnitude, are considered; friction is neglected. The second section discusses the structure of the planner and its implementation. The planner is a rule based system. Forward chaining and hypothetical reasoning are the inference strategies used. The knowledge base and the data base of the system are presented and the advantages obtained using a rule based system are discussed. The third section shows two planning examples, showing the performance of the system in a simple case and in an industrial test case, the assembly of a microwave branching filter composed of 26 components.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007928631050
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    Robust Regulator for Flexible-Joint Robots Using Integrator Backstepping (1998)
    Springer
    Journal of intelligent and robotic systems 22 (1998), S. 23-38 
    Details
    ISSN: 1573-0409
    Schlagwort(e): robot dynamic model ; stiffness matrix ; constant disturbance ; integrator backstepping ; Liapunov functions ; Barbalat lemma ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau
    Notizen: Abstract A robust regulator for flexible-joint robots is proposed, which yields constant torque disturbance rejection acting on the links. The design uses the integrator backstepping technique [4,5] to cancel nonlinearities and disturbance not in the range space of the control. Stability of the closed loop system is shown using iterative Liapunov functions.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007947416837
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 5
    Digitale Medien
    Digitale Medien
    Stable Sampled-data Adaptive Control of Robot Arms Using Neural Networks (1997)
    Springer
    Journal of intelligent and robotic systems 20 (1997), S. 131-155 
    Details
    ISSN: 1573-0409
    Schlagwort(e): robot adaptive control ; basis function-like networks ; stability ; discrete variable structure
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau
    Notizen: Abstract Stable neural network-based sampled-data indirect and direct adaptivecontrol approaches, which are the integration of a neural network (NN)approach and the adaptive implementation of the discrete variable structurecontrol, are developed in this paper for the trajectory tracking control ofa robot arm with unknown nonlinear dynamics. The robot arm is assumed tohave an upper and lower bound of its inertia matrix norm and its states areavailable for measurement. The discrete variable structure control servestwo purposes, i.e., one is to force the system states to be within the stateregion in which neural networks are used when the system goes out of neuralcontrol; and the other is to improve the tracking performance within the NNapproximation region. Main theory results for designing stable neuralnetwork-based sampled data indirect and direct adaptive controllers aregiven, and the extension of the proposed control approaches to the compositeadaptive control of a flexible-link robot is discussed. Finally, theeffectiveness of the proposed control approaches is illustrated throughsimulation studies.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007900125801
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 6
    Digitale Medien
    Digitale Medien
    Stable Neuro-Adaptive Control for Robots with the Upper Bound Estimation on the Neural Approximation Errors (1999)
    Springer
    Journal of intelligent and robotic systems 26 (1999), S. 91-100 
    Details
    ISSN: 1573-0409
    Schlagwort(e): robots ; neural networks ; adaptiveness ; stability ; approximation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau
    Notizen: Abstract An indirect adaptive control approach is developed in this paper for robots with unknown nonlinear dynamics using neural networks (NNs). A key property of the proposed approach is that the actual joint angle values in the control law are replaced by the desired joint angles, angle velocities and accelerators, and the bound on the NN reconstruction errors is assumed to be unknown. Main theoretical results for designing such a neuro-controller are given, and the control performance of the proposed controller is verified with simulation studies.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1008195720685
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 7
    Digitale Medien
    Digitale Medien
    Autonomous Intelligent Cruise Control with Actuator Delays (1998)
    Springer
    Journal of intelligent and robotic systems 23 (1998), S. 27-43 
    Details
    ISSN: 1573-0409
    Schlagwort(e): autonomous control ; actuator delays ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau
    Notizen: Abstract In this paper, we consider the control design problem of vehicle following systems with actuator delays. An upper bound for the time delays is first constructed to guarantee the vehicle stability. Second, sufficient conditions are presented to avoid slinky-effects in the vehicle following. Next, zero steady state achieved by the proposed controller is proven. Finally, simulations are given to examine our claims.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1007946007601
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 8
    Digitale Medien
    Digitale Medien
    Difference schemes for the dispersive equation (1983)
    Springer
    Computing 31 (1983), S. 261-267 
    Details
    ISSN: 1436-5057
    Schlagwort(e): 65M10 ; Dispersive equation ; finite difference ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Dieser Artikel beinhaltet eine Zusammenstellung von Differenzenverfahren für die Dispersionsgleichungu 1=au xxx. Es werden Kriterien zur Herleitung von Stabilitätsbedingungen für Differenzenverfahren angegeben und auf die angegebenen Differenzenverfahren angewendet.
    Notizen: Abstract In this paper a table of difference schemes for the dispersive equationu i=au xxx is presented. A collection of criterions for deriving stability conditions of difference schemes is given and applied to these difference schemes.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02263436
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 9
    Digitale Medien
    Digitale Medien
    D-stability and Kaps-Rentrop-methods (1984)
    Springer
    Computing 32 (1984), S. 229-237 
    Details
    ISSN: 1436-5057
    Schlagwort(e): 65L05 ; 65L07 ; Stiff system ; Rosenbroek method ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung In dieser Arbeit wird die Stabilität des Kaps-Rentrop-Verfahrens in die Anwesenheit nichtlinearer Steifheit (Stiffness) analysiert. Dazu werden mittels eines einfachen Modells zwei Größen introduziert. Die Werte dieser Größen reflektieren gewissermaßen das Verhalten eines Kaps-Rentrop-Verfahrens in die Anwesenheit einer bestimmten Kopplung zwischen die beiden Komponenten in das steife System gewöhnlicher Differentialgleichungen. Einige numerische Beispiele veranschaulichen die Analyse.
    Notizen: Abstract In this paper we give an analysis of the effect of stiff nonlinearities on the behavior of a Kaps-Rentrop method. To that end we introduce two quantities related to a simple model. The values of these quantities determine to some extent the behavior of a Kaps-Rentrop method in case of a strong coupling between the smooth component and the transient one. Numerical examples illustrate the theoretical results.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02243574
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 10
    Digitale Medien
    Digitale Medien
    On the stability of retrial queues (1997)
    Springer
    Queueing systems 26 (1997), S. 343-363 
    Details
    ISSN: 1572-9443
    Schlagwort(e): retrial queues ; stability ; ergodicity ; renovation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We consider the following Type of problems. Calls arrive at a queue of capacity K (which is called the primary queue), and attempt to get served by a single server. If upon arrival, the queue is full and the server is busy, the new arriving call moves into an infinite capacity orbit, from which it makes new attempts to reach the primary queue, until it finds it non-full (or it finds the server idle). If the queue is not full upon arrival, then the call (customer) waits in line, and will be served according to the FIFO order. If λ is the arrival rate (average number per time unit) of calls and μ is one over the expected service time in the facility, it is well known that μ 〉 λ is not always sufficient for stability. The aim of this paper is to provide general conditions under which it is a sufficient condition. In particular, (i) we derive conditions for Harris ergodicity and obtain bounds for the rate of convergence to the steady state and large deviations results, in the case that the inter-arrival times, retrial times and service times are independent i.i.d. sequences and the retrial times are exponentially distributed; (ii) we establish conditions for strong coupling convergence to a stationary regime when either service times are general stationary ergodic (no independence assumption), and inter-arrival and retrial times are i.i.d. exponentially distributed; or when inter-arrival times are general stationary ergodic, and service and retrial times are i.i.d. exponentially distributed; (iii) we obtain conditions for the existence of uniform exponential bounds of the queue length process under some rather broad conditions on the retrial process. We finally present conditions for boundedness in distribution for the case of nonpatient (or non persistent) customers.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019193527040
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 11
    Digitale Medien
    Digitale Medien
    Stability and performance analysis of rate-based feedback flow controlled ATM networks (1998)
    Springer
    Queueing systems 29 (1998), S. 129-159 
    Details
    ISSN: 1572-9443
    Schlagwort(e): rate-based feedback control ; ATM networks ; stability ; optimal algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Motivated by ABR class of service in ATM networks, we study a continuous time queueing system with a feedback control of the arrival rate of some of the sources. The feedback about the queue length or the total workload is provided at regular intervals (variations on it, especially the traffic management specification TM 4.0, are also considered). The propagation delays can be nonnegligible. For a general class of feedback algorithms, we obtain the stability of the system in the presence of one or more bottleneck nodes in the virtual circuit. Our system is general enough that it can be useful to study feedback control in other network protocols. We also obtain rates of convergence to the stationary distributions and finiteness of moments. For the single botterneck case, we provide algorithms to compute the stationary distributions and the moments of the sojourn times in different sets of states. We also show analytically (by showing continuity of stationary distributions and moments) that for small propagation delays, we can provide feedback algorithms which have higher mean throughput, lower probability of overflow and lower delay jitter than any open loop policy. Finally these results are supplemented by some computational results.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019127929282
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 12
    Digitale Medien
    Digitale Medien
    Recurrence and transience properties of some neural networks: an approach via fluid limit models (1999)
    Springer
    Queueing systems 32 (1999), S. 99-130 
    Details
    ISSN: 1572-9443
    Schlagwort(e): neural network ; inhibition ; stability ; Markov process ; fluid limit ; Harris-recurrence ; transience
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The subject of the paper is the stability analysis of some neural networks consisting of a finite number of interacting neurons. Following the approach of Dai [5] we use the fluid limit model of the network to derive a sufficient condition for positive Harris-recurrence of the associated Markov process. This improves the main result in Karpelevich et al. [11] and, at the same time, sheds some new light on it. We further derive two different conditions that are sufficient for transience of the state process and illustrate our results by classifying some examples according to positive recurrence or transience.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019135020138
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 13
    Digitale Medien
    Digitale Medien
    Stability of a three‐station fluid network (1999)
    Springer
    Queueing systems 33 (1999), S. 293-325 
    Details
    ISSN: 1572-9443
    Schlagwort(e): stability ; fluid models ; multiclass queueing networks ; piecewise linear Lyapunov functions ; linear Lyapunov functions ; monotone global stability ; static buffer priority disciplines
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract This paper studies the stability of a three‐station fluid network. We show that, unlike the two‐station networks in Dai and Vande Vate [18], the global stability region of our three‐station network is not the intersection of its stability regions under static buffer priority disciplines. Thus, the “worst” or extremal disciplines are not static buffer priority disciplines. We also prove that the global stability region of our three‐station network is not monotone in the service times and so, we may move a service time vector out of the global stability region by reducing the service time for a class. We introduce the monotone global stability region and show that a linear program (LP) related to a piecewise linear Lyapunov function characterizes this largest monotone subset of the global stability region for our three‐station network. We also show that the LP proposed by Bertsimas et al. [1] does not characterize either the global stability region or even the monotone global stability region of our three‐station network. Further, we demonstrate that the LP related to the linear Lyapunov function proposed by Chen and Zhang [11] does not characterize the stability region of our three‐station network under a static buffer priority discipline.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019184331042
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 14
    Digitale Medien
    Digitale Medien
    Stability of non-Markovian polling systems (1995)
    Springer
    Queueing systems 21 (1995), S. 67-95 
    Details
    ISSN: 1572-9443
    Schlagwort(e): Polling systems ; stability ; stationary regime
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A stationary regime for polling systems with general ergodic (G/G) arrival processes at each station is constructed. Mutual independence of the arrival processes is not required. It is shown that the stationary workload so constructed is minimal in the stochastic ordering sense. In the model considered the server switches from station to station in a Markovian fashion, and a specific service policy is applied to each queue. Our hypotheses cover the purely gated, thea-limited, the binomial-gated and other policies. As a by-product we obtain sufficient conditions for the stationary regime of aG/G/1/∞ queue with multiple server vacations (see Doshi [11]) to be ergodic.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01158575
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 15
    Digitale Medien
    Digitale Medien
    Pathwise rate- stability for input-output processes (1996)
    Springer
    Queueing systems 22 (1996), S. 47-63 
    Details
    ISSN: 1572-9443
    Schlagwort(e): Sample-path analysis ; stability ; rate stability ; ω-rate stability ; input-output process ; queueing ; infinite-server queues
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract An input-output processZ = {Z(t), t ⩾ 0} is said to beω-rate stable ifZ(t) = o(ω(t)) for some non-negative functionω(t). We prove that the processZ is ω-rate stable under weak conditions that include the assumption that input satisfies a linear burstiness condition and Z is asymptotically average stable. In many cases of interest, the conditions forω-rate-stability can be verified from input data. For example, using input information, we establishω-rate stability of the workload for multiserver queues, an ATM multiplexer, andω-rate stability of queue-length processes for infinite server queues.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01159392
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 16
    Digitale Medien
    Digitale Medien
    On Whitt's conjecture for queues in which service times and interarrival times depend linearly and randomly upon waiting times (1996)
    Springer
    Queueing systems 22 (1996), S. 345-366 
    Details
    ISSN: 1572-9443
    Schlagwort(e): State-dependent service and interarrival times ; Lindley equation ; recursive stochastic equations ; stability ; normal approximations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We consider a modification of the standardG/G/1 queueing system with infinite waiting space and the first-in-first-out discipline in which the service times and interarrival times depend linearly and randomly on the waiting times. In this model the waiting times satisfy a modified version of the classical Lindley recursion. When the waiting-time distributions converge to a proper limit, Whitt [10] proposed a normal approximation for this steady-state limit. In this paper we prove a limit theorem for the steady-state limit of the system. Thus, our result provides a solid foundation for Whitt's normal approximation of the steady-state distribution of the system.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01149178
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 17
    Digitale Medien
    Digitale Medien
    Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates (1996)
    Springer
    Queueing systems 24 (1996), S. 37-57 
    Details
    ISSN: 1572-9443
    Schlagwort(e): dam ; storage process ; saturation rule ; intermittent production ; state dependent rates ; state dependent jumps ; stability ; positive Harris recurrence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We consider a dam process with a general (state dependent) release rule and a pure jump input process, where the jump sizes are state dependent. We give sufficient conditions under which the process has a stationary version in the case where the jump times and sizes are governed by a marked point process which is point (Palm) stationary and ergodic. We give special attention to the Markov and Markov regenerative cases for which the main stability condition is weakened. We then study an intermittent production process with state dependent rates. We provide sufficient conditions for stability for this process and show that if these conditions are satisfied, then an interesting new relationship exists between the stationary distribution of this process and a dam process of the type we explore here.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01149079
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 18
    Digitale Medien
    Digitale Medien
    Piecewise linear test functions for stability and instability of queueing networks (1997)
    Springer
    Queueing systems 27 (1997), S. 205-226 
    Details
    ISSN: 1572-9443
    Schlagwort(e): multiclass queueing networks ; ergodicity ; stability ; performance analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We develop the use of piecewise linear test functions for the analysis of stability of multiclass queueing networks and their associated fluid limit models. It is found that if an associated LP admits a positive solution, then a Lyapunov function exists. This implies that the fluid limit model is stable and hence that the network model is positive Harris recurrent with a finite polynomial moment. Also, it is found that if a particular LP admits a solution, then the network model is transient.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019166115653
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 19
    Digitale Medien
    Digitale Medien
    On the guaranteed throughput and efficiency of closed re-entrant lines (1998)
    Springer
    Queueing systems 28 (1998), S. 33-54 
    Details
    ISSN: 1572-9443
    Schlagwort(e): queueing networks ; throughput ; closed networks ; efficiency ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A closed network is said to be “guaranteed efficient” if the throughput converges under all non-idling policies to the capacity of the bottlenecks in the network, as the number of trapped customers increases to infinity. We obtain a necessary condition for guaranteed efficiency of closed re-entrant lines. For balanced two-station systems, this necessary condition is almost sufficient, differing from it only by the strictness of an inequality. This near characterization is obtained by studying a special type of virtual station called “alternating visit virtual station”. These special virtual stations allow us to relate the necessary condition to certain indices arising in heavy traffic studies using a Brownian network approximation, as well as to certain policies proposed as being extremal with respect to the asymptotic loss in the throughput. Using the near characterization of guaranteed efficiency we also answer the often pondered question of whether an open network or its closed counterpart has greater throughput - the answer is that neither can assure a greater guaranteed throughput.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019199022922
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 20
    Digitale Medien
    Digitale Medien
    On the stability of a partially accessible multi‐station queue with state‐dependent routing (1998)
    Springer
    Queueing systems 29 (1998), S. 55-73 
    Details
    ISSN: 1572-9443
    Schlagwort(e): multi‐server queue ; customer class ; state‐dependent routing ; stability ; Markov chain ; fluid limit
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We consider a multi‐station queue with a multi‐class input process when any station is available for the service of only some (not all) customer classes. Upon arrival, any customer may choose one of its accessible stations according to some state‐dependent policy. We obtain simple stability criteria for this model in two particular cases when service rates are either station‐ or class‐independent. Then, we study a two‐station queue under general assumptions on service rates. Our proofs are based on the fluid approximation approach.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019175812444
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 21
    Digitale Medien
    Digitale Medien
    A stability criterion via fluid limits and its application to a polling system (1999)
    Springer
    Queueing systems 32 (1999), S. 131-168 
    Details
    ISSN: 1572-9443
    Schlagwort(e): stability ; positive recurrence ; fluid limit ; polling system ; exhaustive service policy
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We introduce a generalized criterion for the stability of Markovian queueing systems in terms of stochastic fluid limits. We consider an example in which this criterion may be applied: a polling system with two stations and two heterogeneous servers.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019187004209
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 22
    Digitale Medien
    Digitale Medien
    Dynamic scheduling in multiclass queueing networks: Stability under discrete-review policies (1999)
    Springer
    Queueing systems 31 (1999), S. 171-206 
    Details
    ISSN: 1572-9443
    Schlagwort(e): scheduling ; open multiclass queueing networks ; discrete-review policies ; fluid models ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract This paper describes a family of discrete-review policies for scheduling open multiclass queueing networks. Each of the policies in the family is derived from what we call a dynamic reward function: such a function associates with each queue length vector q and each job class k a positive value r k (q), which is treated as a reward rate for time devoted to processing class k jobs. Assuming that each station has a traffic intensity parameter less than one, all policies in the family considered are shown to be stable. In such a policy, system status is reviewed at discrete points in time, and at each such point the controller formulates a processing plan for the next review period, based on the queue length vector observed. Stability is proved by combining elementary large deviations theory with an analysis of an associated fluid control problem. These results are extended to systems with class dependent setup times as well as systems with alternate routing and admission control capabilities.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019106213778
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 23
    Digitale Medien
    Digitale Medien
    Window flow control in FIFO networks with cross traffic (1999)
    Springer
    Queueing systems 32 (1999), S. 195-231 
    Details
    ISSN: 1572-9443
    Schlagwort(e): window flow control ; TCP ; stability ; multiclass networks ; stationary ergodic point processes ; (max,+)-linear system
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We focus on window flow control as used in packet-switched communication networks. The approach consists in studying the stability of a system where each node on the path followed by the packets of the controlled connection is modeled by a FIFO (First-In-First-Out) queue of infinite capacity which receives in addition some cross traffic represented by an exogenous flow. Under general stochastic assumptions, namely for stationary and ergodic input processes, we show the existence of a maximum throughput allowed by the flow control. Then we establish bounds on the value of this maximum throughput. These bounds, which do not coincide in general, are reached by time-space scalings of the exogenous flows. Therefore, the performance of the window flow control depends not only on the traffic intensity of the cross flows, but also on fine statistical characteristics such as the burstiness of these flows. These results are illustrated by several examples, including the case of a nonmonotone, nonconvex and fractal stability region.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019191105117
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 24
    Digitale Medien
    Digitale Medien
    Emergence of symmetric, modular, and reciprocal connections in recurrent networks with Hebbian learning (1999)
    Springer
    Biological cybernetics 81 (1999), S. 211-225 
    Details
    ISSN: 1432-0770
    Schlagwort(e): Key words: Hebbian learning rule ; attractor dynamics ; symmetric connections ; multiplicative normalization ; self-organization ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Informatik , Physik
    Notizen: Abstract. While learning and development are well characterized in feedforward networks, these features are more difficult to analyze in recurrent networks due to the increased complexity of dual dynamics – the rapid dynamics arising from activation states and the slow dynamics arising from learning or developmental plasticity. We present analytical and numerical results that consider dual dynamics in a recurrent network undergoing Hebbian learning with either constant weight decay or weight normalization. Starting from initially random connections, the recurrent network develops symmetric or near-symmetric connections through Hebbian learning. Reciprocity and modularity arise naturally through correlations in the activation states. Additionally, weight normalization may be better than constant weight decay for the development of multiple attractor states that allow a diverse representation of the inputs. These results suggest a natural mechanism by which synaptic plasticity in recurrent networks such as cortical and brainstem premotor circuits could enhance neural computation and the generation of motor programs.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/s004220050557
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 25
    Digitale Medien
    Digitale Medien
    A New ADI Scheme for Solving Three-Dimensional Parabolic Differential Equations (1997)
    Springer
    Journal of scientific computing 12 (1997), S. 361-369 
    Details
    ISSN: 1573-7691
    Schlagwort(e): Alternating-direction implicit ; difference scheme ; stability ; convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A new alternating-direction implicit (ADI) scheme for solving three-dimensional parabolic differential equations has been developed based on the idea of regularized difference scheme. It is unconditionally stable and second-order accurate. Further, it overcomes the drawback of the Douglas scheme and is to be very well to simulate fast transient phenomena and to efficiently capture steady state solutions of parabolic differential equations. Numerical example is illustrated.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1025620828055
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 26
    Digitale Medien
    Digitale Medien
    Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials (1998)
    Springer
    Neural processing letters 7 (1998), S. 5-14 
    Details
    ISSN: 1573-773X
    Schlagwort(e): constrained learning ; factorization ; feedforward networks ; IIR filters ; polynomials ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a constrained learning algorithm that achieves minimization of the usual mean square error criterion along with simultaneous satisfaction of multiple equality and inequality constraints between the polynomial coefficients. Using this method, we are able to obtain good approximate solutions for non-factorable polynomials. By incorporating stability constraints into the formalism, our method can be successfully used for the realization of stable 2-D second order IIR filters in cascade form.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1009655902122
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 27
    Digitale Medien
    Digitale Medien
    Splitting Methods for Three-Dimensional Transport Models with Interaction Terms (1997)
    Springer
    Journal of scientific computing 12 (1997), S. 215-231 
    Details
    ISSN: 1573-7691
    Schlagwort(e): Transport models ; shallow water ; splitting methods ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract We investigate the use of splitting methods for the numerical integration of three-dimensional transport-chemistry models. In particular, we investigate various possibilities for the time discretization that can take advantage of the parallelization and vectorization facilities offered by multi-processor vector computers. To suppress wiggles in the numerical solution, we use third-order, upwind-biased discretization of the advection terms, resulting in a five-point coupling in each direction. As an alternative to the usual splitting functions, such as co-ordinate splitting or operator splitting, we consider a splitting function that is based on a three-coloured hopscotch-type splitting in the horizontal direction, whereas full coupling is retained in the vertical direction. Advantages of this splitting function are the easy application of domain decomposition techniques and unconditional stability in the vertical, which is an important property for transport in shallow water. The splitting method is obtained by combining the hopscotch-type splitting function with various second-order splitting formulae from the literature. Although some of the resulting methods are highly accurate, their stability behaviour (due to horizontal advection) is quite poor. Therefore we also discuss several new splitting formulae with the aim to improve the stability characteristics. It turns out that this is possible indeed, but the price to pay is a reduction of the accuracy. Therefore, such methods are to be preferred if accuracy is less crucial than stability; such a situation is frequently encountered in solving transport problems. As part of the project TRUST (Transport and Reactions Unified by Splitting Techniques), preliminary versions of the schemes are implemented on the Cray C98 4256 computer and are available for benchmarking.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1025645326705
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 28
    Digitale Medien
    Digitale Medien
    A Generalized Peaceman–Rachford ADI Scheme for Solving Two-Dimensional Parabolic Differential Equations (1997)
    Springer
    Journal of scientific computing 12 (1997), S. 353-360 
    Details
    ISSN: 1573-7691
    Schlagwort(e): Alternating-direction implicit ; difference scheme ; stability ; convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A generalized Peaceman–Rachford alternating-direction implicit (ADI) scheme for solving two-dimensional parabolic differential equations has been developed based on the idea of regularized difference scheme. It is to be very well to simulate fast transient phenomena and to efficiently capture steady state solutions of parabolic differential equations. Numerical example is illustrated.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1025631211217
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 29
    Digitale Medien
    Digitale Medien
    Modified Conjugate Gradient Method for the Solution of Ax=b (1998)
    Springer
    Journal of scientific computing 13 (1998), S. 173-183 
    Details
    ISSN: 1573-7691
    Schlagwort(e): Modified conjugate gradient method ; conjugate gradient method ; Krylov space ; convergence rate ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract In this note, we examine a modified conjugate gradient procedure for solving $$A\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{x} = \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ in which the approximation space is based upon the Krylov space ( $$A\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{x} = \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ ) associated with $$\sqrt A$$ and $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ . We show that, given initial vectors $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ and $$\sqrt A \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ (possibly computed at some expense), the best fit solution in $$K^k \sqrt A ,\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{b}$$ can be computed using a finite-term recurrence requiring only one multiplication by A per iteration. The initial convergence rate appears, as expected, to be twice as fast as that of the standard conjugate gradient method, but stability problems cause the convergence to be degraded.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1023222110984
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 30
    Digitale Medien
    Digitale Medien
    Stability of traffic patterns in broadband networks (1995)
    Springer
    Journal of network and systems management 3 (1995), S. 371-380 
    Details
    ISSN: 1573-7705
    Schlagwort(e): Telephone traffic ; network management ; control theory ; dynamic flows ; stability ; routing algorithms ; broadband networks ; simulation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract The control of telephony traffic is the task of network management and routing algorithms. In this paper, a study of two trunk groups carrying telephony traffic is used to show that instabilities can arise if there is a delay in getting feedback information for a network controller. The network controller seeks to balance the traffic in the two trunk groups, which may represent two paths from a source to a destination. An analysis shows how factors such as holding time, controller gain and feedback delay influence stability. Simulation of a two service case is also carried out to show that the same instabilities can arise.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02139530
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 31
    Digitale Medien
    Digitale Medien
    Convergence of Delayed Dynamical Systems (1999)
    Springer
    Neural processing letters 10 (1999), S. 267-271 
    Details
    ISSN: 1573-773X
    Schlagwort(e): recurrent neural networks ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract In this paper, we point out that the conditions given in [1] are sufficient but unnecessary for the global asymptotically stable equilibrium of a class of delay differential equations. Instead, we prove that under weaker conditions, it is still global asymptotically stable.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1018753013035
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 32
    Digitale Medien
    Digitale Medien
    Stability analysis of a general toeplitz systems solver (1995)
    Springer
    Numerical algorithms 10 (1995), S. 225-244 
    Details
    ISSN: 1572-9265
    Schlagwort(e): Cholesky factorization error analysis ; Hankel matrix ; least squares ; normal equations ; orthogonal factorization ; QR factorization ; semi-normal equations ; stability ; Toeplitz matrix ; weak stability ; Primary 65F25 ; Secondary 47B35 ; 65F05 ; 65F30 ; 65Y05 ; 65Y10
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We show that a fast algorithm for theQR factorization of a Toeplitz or Hankel matrixA is weakly stable in the sense thatR T R is close toA T A. Thus, when the algorithm is used to solve the semi-normal equationsR TRx=AT b, we obtain a weakly stable method for the solution of a nonsingular Toeplitz or Hankel linear systemAx=b. The algorithm also applies to the solution of the full-rank Toeplitz or Hankel least squares problem min ||Ax-b||2.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02140770
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 33
    Digitale Medien
    Digitale Medien
    Progressive stable interpolation (1997)
    Springer
    Numerical algorithms 14 (1997), S. 343-359 
    Details
    ISSN: 1572-9265
    Schlagwort(e): progressive interpolation ; stability ; spline ; shape parameters ; geometric continuity ; 41A05 ; 41A15 ; 65D05 ; 65D07
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper, we study several interpolating and smoothing methods for data which are known “progressively”. The algorithms proposed are governed by recurrence relations and our principal goal is to study their stability. A recurrence relation will be said stable if the spectral radius of the associated matrix is less than one. The iteration matrices depend on shape parameters which come either from the connection at the knots, or from the nature of the interpolant between two knots. We obtain various stability domains. Moving the parameters inside these domains leads to interesting shape effects.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1019129400864
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 34
    Digitale Medien
    Digitale Medien
    Multistep methods for differential algebraic equations (1995)
    Springer
    Numerical algorithms 10 (1995), S. 245-260 
    Details
    ISSN: 1572-9265
    Schlagwort(e): Multistep methods ; differential-algebraic equations ; stability ; existence and uniqueness ; convergence of iterative method ; 65L06 ; 65L20 ; 65N22
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Multistep methods for the differential/algebraic equations (DAEs) in the form of $$F_1 (x) = 0, F_2 (x,x',z) = 0$$ are presented, whereF 1 maps from ℝ n to ℝ ′ ,F 2 from ℝ n x ℝ n x ℝ m to ℝ s andr〈n≤r+s=n+m. By employing the deviations of the available existence theories, a new form of the multistep method for solutions of (1) is developed. Furthermore, it is shown that this method has no typical instabilities such as those that may occur in the application of multistep method to DAEs in the traditional manner. A proof of the solvability of the multistep system is provided, and an iterative method is developed for solving these nonlinear algebraic equations. Moreover, a proof of the convergence of this iterative method is presented.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02140771
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 35
    Digitale Medien
    Digitale Medien
    Making Beliefs Coherentl. The Subtraction and Addition Strategies. (1998)
    Springer
    Journal of logic, language and information 7 (1998), S. 143-163 
    Details
    ISSN: 1572-9583
    Schlagwort(e): Belief revision ; consolidation ; coherence ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Allgemeine und vergleichende Sprach- und Literaturwissenschaft. Indogermanistik. Außereuropäische Sprachen und Literaturen , Informatik
    Notizen: Abstract The notion of epistemic coherence is interpreted as involving not only consistency but also stability. The problem how to consolidate a belief system, i.e., revise it so that it becomes coherent, is studied axiomatically as well as in terms of set-theoretical constructions. Representation theorems are given for subtractive consolidation (where coherence is obtained by deleting beliefs) and additive consolidation (where coherence is obtained by adding beliefs).
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1023/A:1008274704871
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 36
    Digitale Medien
    Digitale Medien
    Time separation technique for large databases (1983)
    Springer
    International journal of parallel programming 12 (1983), S. 193-209 
    Details
    ISSN: 1573-7640
    Schlagwort(e): Database ; characteristic frequency ; aggregated model ; decomposition ; stability ; dynamic distribution
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract A time decomposition technique is suggested for large-database (DB) models. The problem of network aggregation is studied and the results used to create a meaningful decomposed model. Decomposition conditions and assumptions are discussed and illustrated by examples. A practical operating schedule is presented for the time-separated DB model. The schedule uses a sequence of decomposed models, which are to be constructed recursively. The application of the time separation technique for large-DB models is presented in the form of a closed-loop algorithm. The problem of decomposition stability with respect to variations in time constants is considered as well. Two alternative approaches to the problem are suggested. For a probabilistic approach, practical approximate formulas are obtained for subsystem time constants and recommendations are made with respect to the decomposition structure. An approximate performance analysis is done for both standard and time-decomposed models. A comparison of the results is given.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF00995891
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 37
    Digitale Medien
    Digitale Medien
    A note on stability investigations for Rosenbrock-type methods for quasilinear-implicit differential equations (1996)
    Springer
    Computing 56 (1996), S. 47-59 
    Details
    ISSN: 1436-5057
    Schlagwort(e): 65 L 05 ; Rosenbrock-type methods ; quasilinear-implicit differential equations ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Bei der Lösung quasilinear-impliziter ODEs mittels Rosenbrock-Typ-Methoden können trotz guter Stabilitätseigenschaften (A- bzw. L-Stabilität) des Grundverfahrens Stabilitätsprobleme auftreten. Diese Schwierigkeiten sind auf Ungenauigkeiten bei der Berechnung künstlich eingeführter Komponenten (Überführung in DAEs) zurückzuführen. Die Arbeit untersucht die Ursachen für diese Effekte und zeigt Möglichkeiten, diese zu überwinden.
    Notizen: Abstract The solution of quasilinear-implicit ODEs using Rosenbrock type methods may suffer from stability problems despite stability properties such as A-stability or L-stability, respectively. These problems are caused by inexact computation of artificial introduced components (transformation to DAE system). The paper investigates the source of the numerical difficulties and shows modifications to overcome them.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02238291
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 38
    Digitale Medien
    Digitale Medien
    On the stability of multistep formulas for Volterra integral equations of the second kind (1980)
    Springer
    Computing 24 (1980), S. 341-347 
    Details
    ISSN: 1436-5057
    Schlagwort(e): Numerical analysis ; Volterra integral equations of the second kind ; stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Ziel dieser Arbeit ist es, die Stabilitätseigenschaften einer Klasse Volterrascher Integralgleichungen zweiter Art zu untersuchen. Unsere Behandlung ist der üblichen Stabilitätsanalyse ähnlich, in der die Kernfunktionen zu einer im voraus beschränkten Klasse von Testfunktionen gehören. Wir haben die Klasse der “endlich zerlegbaren” Kerne betrachtet. Stabilitätsbedingungen werden abgeleitet und verglichen mit den Bedingungen für die einfache Testgleichung. Es zeigt sich, daß die neuen Kriteria einschränkender sind als die konventionellen Bedingungen. Der praktische Wert wird getestet durch numerische Experimente mit der Trapezregel.
    Notizen: Abstract The purpose of this paper is to analyse the stability properties of a class of multistep methods for second kind Volterra integral equations. Our approach follows the usual analysis in which the kernel function is a priori restricted to a special class of test functions. We consider the class of finitely decomposable kernels. Stability conditions will be derived and compared with those obtained with the simple test equation. It turns out that the new criteria are more severe than the conventional conditions. The practical value is tested by numerical experiments with the trapezoidal rule.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02237819
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 39
    Digitale Medien
    Digitale Medien
    The finite volume element method with quadratic basis functions (1996)
    Springer
    Computing 57 (1996), S. 281-299 
    Details
    ISSN: 1436-5057
    Schlagwort(e): 65N15 ; 65N99 ; 35A40 ; Finite volume method ; box scheme ; stability ; error estimates
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Es wird eine Box-Methode mit quadratischen Ansatzfunktionen zur Diskretisierung elliptischer Randwertaufgaben vorgestellt. Die entstehende Diskretisierungsmatrix ist nichsymmetrisch. Die Stabilitätsanalyse basiert auf einer elementweisen Abschätzung des Skalarproduktes 〈A h u h ,u h 〉. Hinreichende Bedingungen an die Geometrie der Dreiecke der Triangulierung führen zur diskreten Elliptizität. Unter diesen Voraussetzungen wird eineO(h 2)-Fehlerabschätzung bewiesen.
    Notizen: Abstract The paper presents a box scheme with quadratic basis functions for the discretisation of elliptic boundary value problems. The resulting discretisation matrix is non-symmetrical (and also not an M-matrix). The stability analysis is based on an elementwise estimation of the scalar product 〈A h u h ,u h 〉. Sufficient conditions placed on the triangles of the triangulation lead to discrete ellipticity. Proof of anO(h 2) error estimate is given for these conditions.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF02252250
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...