ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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

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

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (24)
  • Stability  (13)
  • 68C25
  • AMS(MOS): 65D15
  • Springer  (24)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Wiley
  • 2005-2009
  • 1990-1994  (5)
  • 1980-1984  (19)
  • 2008
  • 1994  (5)
  • 1982  (19)
  • Mathematik  (18)
  • Informatik  (7)
Sammlung
  • Artikel  (24)
Verlag/Herausgeber
  • Springer  (24)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • +
Erscheinungszeitraum
  • 2005-2009
  • 1990-1994  (5)
  • 1980-1984  (19)
Jahr
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Computing 52 (1994), S. 89-96 
    ISSN: 1436-5057
    Schlagwort(e): 65C10 ; 68C25 ; Random number generation ; log-concave distributions ; rejection method ; simulation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Wir erklären einen Algorithmus, der Stichproben von beliebigen log-konkaven Verteilungen (z.B. Binomial- und Hypergeometrische Verteilung) erzeugt. Er basiert auf Verwerfung von einer diskreten dominierenden Verteilung, die aus Teilen der geometrischen Verteilung zusammengesetzt wird. Der Algorithmus is gleichmäßig schnell für alle diskreten log-konkaven Verteilungen und nicht viel langsamer als Algorithmen, die nur für eine bestimmte Verteilung verwendet werden können.
    Notizen: Abstract We give an algorithm that can be used to sample from any discrete log-concave distribution (e.g. the binomial and hypergeometric distributions). It is based on rejection from a discrete dominating distribution that consists of parts of the geometric distribution. The algorithm is uniformly fast for all discrete log-concave distributions and not much slower than algorithms designed for a single distribution.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Computing 29 (1982), S. 373-380 
    ISSN: 1436-5057
    Schlagwort(e): 68C25 ; 68C20 ; Analysis of algorithms ; computational complexity ; cost complexity ; Ruffini-Horner method ; polynomial evaluation ; polynomial translation ; computer algebra ; unlimited precision arithmetic
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Die Verminderung der Zahl der Multiplikationen bei der Berechnung eines Polynoms und seinen Ableitungen bringt nicht unbedingt eine entsprechende Verminderung der gesamten Berechnungskosten. In dieser Arbeit werden Kosten-Analysen einer Algorithmen-Familie vorgestellt, die alle Ableitungen eines Polynoms mit 3n−2 Multiplikationen oder Divisionen berechnet. Dies repräsentiert eine Verbesserung im Vergleich mit den klassischen Methoden, die 1/2n(n+1) Multiplikationen benötigen. Jedoch offenbart die Analyse die Gegenwart eines Ausgleichs zwischen den Kosten der Multiplikationen bzw. Divivionen und den übrigen Kosten. Dadurch bleibt die Komplexität für alle AlgorithmenO(ξ2 n 3), wie stark auch immer die Verminderung der Zahl der arithmetischen Operationen ist.
    Notizen: Abstract Reducing the number of multiplications for the evaluation of a polynomial and its derivatives does not necessarily mean that one should expect a commensurate reduction of the total cost of computation. In this paper we present a cost analysis for a family of algorithms, which computes all derivatives of a polynomial in 3n−2 multiplications or divisions. This represents an improvement over the classical methods, which require 1/2n(n+1) multiplications. The analysis, however, reveals the presence of a multiplications-divisions cost trade-off due to which the cost complexity remainsO(ξ2 n 3) for all algorithms irrespective of any reduction in the number of arithmetic operations.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 181-192 
    ISSN: 1436-4646
    Schlagwort(e): Linear Complementarity Problem ; Stability ; Classes of Matrices
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract It has been shown previously that the Linear Complementarity Problem is stable when the defining matrix is positive semidefinite and when (locally) the set of solutions is nonempty and bounded. We enlarge the class of matrices for which this is true and also demonstrate how the boundedness condition leads to other stability type questions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Computing 29 (1982), S. 11-29 
    ISSN: 1436-5057
    Schlagwort(e): 68C25 ; 68E99 ; Binary search trees ; height-balanced trees ; AVL trees ; weight-balanced trees
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Eine Methode, die von Yao formuliert und von Brown angewendet wurde, gestattet es, schranken für den Anteil von Knoten mit bestimmten Eigenschaften in Bäumen anzugeben, die durch eine Folge von zufälligen Einfügungen entstehen. Für den Fall von AVL-Bäumen (höhenbalanziert) zeigen wird, daß solche Methoden nicht erweitert werden können, um bessere Schranken als die bisher bekannten zu berechnen. Dann wenden wir diese Methode auf gewichtsbalanzierte Bäume und auf eine Art von “schwach balanzierten” Bäumen an und bestimmen die Verteilung der gewichtsbalanzierten Faktoren der inneren Knoten in einem Zufallsbaum, der durch binäre Suche und Einfügen entsteht; ferner zeigen wir, daß in einem solchen Baum ungefähr 72% der inneren Knoten gewichtsbalanzierte Faktoren zwischen $$1 - \sqrt 2 /2$$ und $$\sqrt 2 /2$$ haben.
    Notizen: Abstract A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We then apply these methods to weight-balanced trees and to a type of “weakly balanced” trees. We determine the distribution of the weight-balance factors of the internal nodes in a random tree built by binary search and insertion and show that in such a tree about 72% of all internal nodes have weight balance factors lying between $$1 - \sqrt 2 /2$$ and $$\sqrt 2 /2$$ .
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Computing 29 (1982), S. 227-239 
    ISSN: 1436-5057
    Schlagwort(e): 68C25 ; Bin packing ; approximation algorithms ; stochastic algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Beim eindimensionalen Packungsproblem besteht die Aufgabe darin, eine Liste vonn Eingabegrößen in möglichst wenige “Behälter” der Höhe 1 zu packen. Es wird eine Klasse von linearen Online-Algorithmen zur näherungsweisen Lösung des Packungsproblems mit Eingabegrößen, die einer bekannten Wahrscheinlichkeitsverteilung unterliegen, vorgestellt. Jeder dieser Algorithmen hängt von der Wahrscheinlichkeitsverteilung und einem Parameter ab, der die Güte des Algorithmus beeinflußt. Es wird gezeigt, daß sich der Erwartungswert der relativen Packungsdichte bei wachsender Anzahl der Eingabegrößen beliebig dicht dem Optimum nähert.
    Notizen: Abstract In the one-dimensional bin packing problem a list ofn items has to be packed into a minimum number of unit-capacity bins. A class of linear online algorithms for the approximate solution of bin packing with items drawn from a known probability distribution is presented. Each algorithm depends on the distribution and on a parameter controlling the performance of the algorithm. It is shown that with increasing number of items the expected performance ratio has an arbitrary small deviation from optimum.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Mathematics of control, signals, and systems 7 (1994), S. 331-350 
    ISSN: 1435-568X
    Schlagwort(e): Time-varying systems ; Linear systems ; Stability ; Stochastic stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Elektrotechnik, Elektronik, Nachrichtentechnik , Mathematik , Technik allgemein
    Notizen: Abstract New conditions are given in both deterministic and stochastic settings for the stability of the system x=A(t)x when A(t) is slowly varying. Roughly speaking, the eigenvalues of A(t) are allowed to “wander” into the right half-plane as long as “on average” they are strictly in the left half-plane.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Order 11 (1994), S. 197-210 
    ISSN: 1572-9273
    Schlagwort(e): 06A10 ; 68C25 ; On-line algorithm ; lattice of maximal antichains
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We consider the on-line computation of the lattice of maximal antichains of a finite poset $$\tilde P$$ . This on-line computation satisfies what we call the “linear extension hypothesis”: the new incoming vertex is always maximal in the current subposet of $$\tilde P$$ . In addition to its theoretical interest, this abstraction of the lattice of antichains of a poset has structural properties which give it interesting practical behavior. In particular, the lattice of maximal antichains may be useful for testing distributed computations, for which purpose the lattice of antichains is already widely used. Our on-line algorithm has a run time complexity of $$\mathcal{O}((\left| P \right| + \omega ^2 (P))\omega (P)\left| {MA(P)} \right|),$$ , where |P| is the number of elements of the poset, $$\tilde P$$ , |MA(P)| is the number of maximal antichains of $$\tilde P$$ and ω(P) is the width of $$\tilde P$$ . This is more efficient than the best off-line algorithms known so far.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Queueing systems 15 (1994), S. 239-260 
    ISSN: 1572-9443
    Schlagwort(e): Stability ; queue ; Jackson network ; stochastic ordering
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Abstract Using stochastic dominance, in this paper we provide a new characterization of point processes. This characterization leads to a unified proof for various stability results of open Jackson networks where service times are i.i.d. with a general distribution, external interarrivai times are i.i.d. with a general distribution and the routing is Bernoulli. We show that if the traffic condition is satisfied, i.e., the input rate is smaller than the service rate at each queue, then the queue length process (the number of customers at each queue) is tight. Under the traffic condition, the pth moment of the queue length process is bounded for allt if the p+lth moment of the service times at all queues are finite. If, furthermore, the moment generating functions of the service times at all queues exist, then all the moments of the queue length process are bounded for allt. When the interarrivai times are unbounded and non-lattice (resp. spreadout), the queue lengths and the remaining service times converge in distribution (resp. in total variation) to a steady state. Also, the moments converge if the corresponding moment conditions are satisfied.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    ISSN: 1572-9125
    Schlagwort(e): 65G05 ; 65D05 ; 68C25 ; 65D99 ; Evaluation of polynomials ; Lagrange form of a polynomial ; error analysis ; error norm ; numerical stability ; Lebesgue constant
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract For evaluation schemes based on the Lagrangian form of a polynomial with degreen, a rigorous error analysis is performed, taking into account that data, computation and even the nodes of interpolation might be perturbed by round-off. The error norm of the scheme is betweenn 2 andn 2+(3n+7)λ n , where λ n denotes the Lebesgue constant belonging to the nodes. Hence, the error norm is of least possible orderO(n 2) if, for instance, the nodes are chosen to be the Chebyshev points or the Fekete points.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 40 (1982), S. 39-46 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65D15 ; CR: 5.13
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary In the univariate case the ɛ-algorithm of Wynn is closely related to the Padé-table in the following sense: if we apply the ɛ-algorithm to the partial sums of the power series $$f(x) = \sum\limits_{i = 0}^\infty {c_i x^i } $$ then ε 2m l−m is the (l, m) Padé-approximant tof(x) wherel is the degree of the numerator andm is the degree of the denominator [1 pp. 66–68]. Several generalizations of the ɛ-algorithm exist but without any connection with a theory of Padé-approximants. Also several definitions of the Padé-approximant to a multivariate function exist, but up till now without any connection with the ɛ-algorithm. In this paper, we see that the multivariate Padé-approximants introduced in [3], satisfy the same property as the univariate Padé-approximants: if we apply the ɛ-algorithm to the partial sums of the power series $$f\left( {x_1 ,...,x_n } \right) = \sum\limits_{i_1 + ... + i_n = 0}^\infty {c_{i_1 ...i_n } x_1^{i_1 } ...x_n^{i_n } } $$ then ε 2m (l−m) is the (l, m) multivariate Padé-approximant tof(x 1, ...,x n ).
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Digitale Medien
    Digitale Medien
    Springer
    Distributed computing 8 (1994), S. 65-80 
    ISSN: 1432-0452
    Schlagwort(e): Linearizable ; Concurrent data object ; Consensus ; Wait-free ; Memory management ; Correctness ; Invariant ; Stability ; Space complexity ; Time complexity
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Notizen: Summary Given a sequential implementation of an arbitrary data object, a wait-free, linearizable concurrent implementation is constructed with space complexity quadratic in the number of processes. If processes do not concurrently invoke, the amortized time complexity of the invocations is independent of the number of processes. The worst case time complexity is linear in the number of processes. The construction is based on a compare&swap register. The correctness is proved by means of invariants and stability properties. Since it concerns memory reallocation by concurrent processes in a fault-tolerant setting, this proof is highly nontrivial.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 39 (1982), S. 411-420 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65D15 ; CR: 5.13
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary We transform a complex approximation problem into an equivalent semiinfinite optimization problem whose constraints are described in terms of a quantity ϕ∈[0,2π[=I. We study the effect of disturbing the problem by replacingI by a compact subsetM⊂I which includes as special case the discrete case whereM consists only of finitely many points. We introduce a measure ɛ for the deviation ofM fromI and show that in any complex approximation problem the minimal distance of the disturbed problem converges quadratically with ɛ→0 to the minimal distance of the undisturbed problem which is a generalization of a result by Streit and Nuttall. We also show that in a linear finite dimensional approximation problem the convergence of the coefficients of the disturbed problem is in general at most linear. There are some graphical representations of best complex approximations computed with the described method.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 40 (1982), S. 93-98 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65D15 ; CR: 5.15
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Der Quotienten-Differenzen-Algorithmus nach Rutishauser ist geeignet zur Bestimmung von Polen meromorpher Funktionen, gegeben durch eine Taylorreihe. Sind mehrere Pole betragsgleich, so kann eine Polynomfolge bestimmt werden, deren Grenzpolynom diese Pole als Nullstellen hat. Die Konvergenz wurde von Rutishauser jedoch nicht bewiesen. Ein Beweis wird in der vorliegenden Arbeit präsentiert.
    Notizen: Summary The Quotient-Difference Algorithm of Rutishauser can be used for the determination of poles of a meromorphic function given by its power series. If some of the poles have same modulus, a sequence of polynomials can be determined such that the limiting polynomial has exactly these poles as zeros. The convergence has not been proved by Rutishauser, however. A proof is presented in this paper.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 40 (1982), S. 229-243 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65D15 ; CR: 5.13
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary This paper deals with the problem of uniqueness in one-sidedL 1-approximation. The chief purpose is to characterize finite dimensional subspacesG of the space of continuous or differentiable functions which have a unique best one-sidedL 1-approximation. In addition, we study a related problem in moment theory. These considerations have an important application to the uniqueness of quadrature formulae of highest possible degree of precision.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Digitale Medien
    Digitale Medien
    Springer
    Numerische Mathematik 39 (1982), S. 65-84 
    ISSN: 0945-3245
    Schlagwort(e): AMS(MOS): 65D15 ; CR: 5.13
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Summary The problem of finding optimal cycles in a doubly weighted directed graph (Problem A) is closely related to the problem of approximating bivariate functions by the sum of two univariate functions with respect to the supremum norm (Problem B). The close relationship between Problem A and Problem B is detected by the characterization (7.4) of the distance dist (f, t) of Problem B. In Part 1 we construct an algorithm for Problem A where the essential role is played by the minimal lengthsy j(k) defined by (2.3). If weight functiont≡1 then the minimum of Problem A is computed by equality (2.4). Ift≡1 then the minimum is obtained by a binary search procedure, Algorithm 3. In Part 2 we construct our algorithms for solving Problem B by following exactly the ideas of Part 1. By Algorithm 4 we compute the minimal pseudolengthsh k(y, M) defined by (7.5). If weight functiont≡1 then the infimum dist(f,t) of Problem B is obtained by equality (7.12) which is closely related to (2.4). Ift≢1 we compute the infimum dist(f,t) by the binary search procedure Algorithm 5. Additionally, Algorithm 4 leads to a constructive proof of the existence of continuous optimal solutions of Problem B (see Theorem 7.1e) which is already known in caset≡1 but unknown in caset≢1. Interesting applications to the steady-state behaviour of industrial processes with interference (Sect. 3) and the solution of integral equations (Problem C) are included.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 16 (1982), S. 49-55 
    ISSN: 1432-1416
    Schlagwort(e): Stability ; Diffusion ; Parabolic equations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract Models for a single species that inhabits an environment that is spatially varying are presented. Simple necessary and sufficient conditions for stability, which are independent of the exact details of the dispersal process, are developed in the case of large diffusion rates. The results highlight the important stabilizing nature of diffusion in a spatially varying environment.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 14 (1982), S. 71-75 
    ISSN: 1432-1416
    Schlagwort(e): Epidemiology ; Two host models ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract An epidemic model is derived for a two host infectious disease. It is shown that if a non-trivial equilibrium solution exists, it is globally stable. This result is also proved for a similar one host model.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 16 (1982), S. 33-48 
    ISSN: 1432-1416
    Schlagwort(e): Sterile insect release ; Predation ; Stability ; Limit cycles ; Optimal control
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract A model for the sterile insect release method of pest control in which the target species is under predatory or parasitic regulation is analyzed. The equations are nondimensionalized and the rescaled parameters are interpreted. There are four types of equilibria, whose existence and stability depend on which of ten regions of parameter space contain the rescaled parameters, and in turn give minimal release rates to achieve eradication of the pest. In at least one region, Hopf bifurcation theory shows the existence of limit cycles, but they are found to be unstable. In addition, the optimal release rate to minimize a total cost functional for pest control by the sterile release method is studied. Both approaches show that when predation accounts for a large fraction of the natural deaths, the necessary release rate and total cost are higher than for weak predation. If the predators are removed without being replaced by any other source of mortality, the cost rises in all cases but rises much more dramatically for cases with strong predation. A definite danger of the sterile release method when some predatory control exists is that the predators are frequently driven extinct before the prey, so that the target species could explode to much higher levels and be more difficult to eradicate again after the sterile release is terminated.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 12 (1982), S. 101-114 
    ISSN: 1432-1416
    Schlagwort(e): Predator-prey systems ; Harvesting ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract The global behaviour of a class of predator-prey systems, modelled by a pair of non-linear ordinary differential equations, under constant rate harvesting and/or stocking of both species, is presented. Theoretically possible structures and transitions are developed and validated by computer simulations. The results are presented as transition loci in the F-G (prey harvest rate-predator harvest rate) plane.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 14 (1982), S. 231-250 
    ISSN: 1432-1416
    Schlagwort(e): Predator-prey ; Age structure ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract A general predator-prey model is considered in which the predator population is assumed to have an age structure which significantly affects its fecundity. The model equations are derived from the general McKendrick equations for age structured populations. The existence, stability and destabilization of equilibria are studied as they depend on the prey's natural carrying capacity and the maturation periodm of the predator. The main result of the paper is that for a broad class of maturation functions positive equilibria are either unstable for smallm or are destabilized asm decreases to zero. This is in contrast to the usual rule of thumb that increasing (not decreasing) delays in growth rate responses cause instabilities.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 15 (1982), S. 37-50 
    ISSN: 1432-1416
    Schlagwort(e): Reaction-diffusion system ; Stationary solution ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract We consider a spatial population growth process which is described by a reaction-diffusion equation c(x)u t = (a 2(x)u x ) x +f(u), c(x) 〉0, a(x) 〉 0, defined on an interval [0, 1] of the spatial variable x. First we study the stability of nonconstant stationary solutions of this equation under Neumann boundary conditions. It is shown that any nonconstant stationary solution (if it exists) is unstable if a xx⩽0 for all xε[0, 1], and conversely ifa xx〉0 for some xε[0, 1], there exists a stable nonconstant stationary solution. Next we study the stability of stationary solutions under Dirichlet boundary conditions. We consider two types of stationary solutions, i.e., a solution u 0(x) which satisfies u 0 x≠0 for all xε[0, 1] (type I) and a solution u 0(x) which satisfies u 0x = 0 at two or more points in [0, 1] (type II). It is shown that any stationary solution of type I [type II] is stable [unstable] if a xx ⩾0 [a xx ⩽0] for all xε[0, 1]. Conversely, there exists an unstable [a stable] stationary solution of type I [type II] if a xx 〈0 [a xx 〉0] for some xε[0, 1].
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 15 (1982), S. 239-247 
    ISSN: 1432-1416
    Schlagwort(e): Predator-prey model ; Behavioral adaptation ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract The Volterra-Lotka predator-prey equations are modified so that the predator's ability to utilize the prey varies in proportion to the average number of encounters between the two species in the past. The behavior of this adaptive system is then described in terms of three parameters — the carrying capacity of the prey, the relative death rate of the predator, and the predator's memoryspan. The most stable situation is shown to occur when the carrying capacity of the prey is large, the predator's death rate is close to zero, and the predator is able to adapt quickly to changing levels of prey density.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 16 (1982), S. 25-31 
    ISSN: 1432-1416
    Schlagwort(e): Stability ; Community matrix ; Lotka-Volterra models
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract The explicit function of the community matrix of a three dimensional Lotka-Volterra model is delineated by a set of necessary and sufficient conditions for a positive equilibrium to be asymptotically stable. In the special case that the community matrix is quasi weakly diagonally dominant, it is shown that a positive determinant for the community matrix is not only necessary but is also sufficient for stability. The results are specific to three dimensional models and do not extend to communities of dimension greater than three.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Digitale Medien
    Digitale Medien
    Springer
    Journal of mathematical biology 16 (1982), S. 103-112 
    ISSN: 1432-1416
    Schlagwort(e): Bifurcation ; Competition ; Diffusive Lotka-Volterra system ; Predator-prey interaction ; Stability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie , Mathematik
    Notizen: Abstract Three examples of the diffusive 3-species Lotka-Volterra system with constant interaction parameters are given, and by bifurcation techniques shown to have stable spatially non-constant equilibrium solutions. One example is competitive; the second one predator-two-competing prey and the third involves two predators and a single prey.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...