ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Books
  • Articles  (80)
  • stability  (43)
  • optimization  (37)
  • 2010-2014
  • 2005-2009
  • 1995-1999  (66)
  • 1980-1984  (9)
  • 1975-1979  (5)
  • 1960-1964
  • 1935-1939
  • 1925-1929
  • 2014
  • 1997  (28)
  • 1995  (38)
  • 1984  (3)
  • 1983  (6)
  • 1979
  • 1978  (2)
  • 1977  (3)
  • 1938
  • 1925
  • Mathematics  (80)
Collection
  • Books
  • Articles  (80)
Publisher
Years
  • 2010-2014
  • 2005-2009
  • 1995-1999  (66)
  • 1980-1984  (9)
  • 1975-1979  (5)
  • +
Year
  • 1
    ISSN: 1436-6304
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; Latin hypercube ; optimization ; sampling ; sensitivity analysis ; Stichprobenverfahren ; Permutationsmatrizen ; implizite Funktionen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Zusammenfassung Lateinische Hyperwürfel Stichprobenverfahren (LHS) dienen dazu, in geeigneter Weise die Verteilungsfunktion (zumindest angenähert) der Funktionswerte einer komplexen (impliziten) Funktion, in Abhängigkeit ihrer Variablen werte, zu schätzen. Anwendungen finden sich in Modellen, in denen erforderliche Variablenumformungen nicht möglich sind und in denen die Zahl der Simulationsläufe aus zeitlichen Gründen gering zu halten oder fixiert ist. Es stellt sich die Frage, welche Werte in jedem Lauf den Variablen zuzuordnen sind. Herkömmliche Vorgehensweisen benutzen ausgefeilte, geschichtete Stichprobenverfahren, die jedoch Fehler bei der Bestimmung von Varianz und Kovarianz, aufgrund der Korrelation der Stichprobenpaare, beinhalten können. In dieser Arbeit wird eine Methode beschrieben, den absoluten Fehler zwischen dem tatsächlichen und dem korrelierenden Stichprobenpaar so klein wie möglich zu halten. Selbst für kleine Stichprobenumfänge können dabei schon optimale Pläne erzielt werden. Permutationsmatrizen haben die Eigenschaft, die Summe der Korrelationen zwischen Spaltenpaaren zu minimieren. Die vorgestellte Heuristik ist in der Lage, in allen getesteten Fällen das Optimum zu finden.
    Notes: Abstract The objective of Latin Hypercube Sampling is to determine an effective procedure for sampling from a (possibly correlated) multivariate population to estimate the distribution function (or at least a significant number of moments) of a complicated function of its variables. The typical application involves a computer-based model in which it is largely impossible to find a way (closed form or numerical) to do the necessary transformation of variables and where it is expensive to run in terms of computing resources and time. Classical approaches to hypercube sampling have used sophisticated stratified sampling techniques; but such sampling may provide incorrect measures of the output parameters' variances or covariances due to correlation between the sampling pairs. In this work, we offer a strategy which provides a sampling specification minimizing the sum of the absolute values of the pairwise differences between the true and sampled correlation pairs. We show that optimal plans can be obtained for even small sample sizes. We consider the characteristics of permutation matrices which minimize the sum of correlations between column pairs and then present an effective heuristic for solution. This heuristic generally finds plans which match the correlation structure exactly. When it does not, we provide a hybrid lagrangian/heuristic method, which empirically has found the optimal solution for all cases tested.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Positivity 1 (1997), S. 319-330 
    ISSN: 1572-9281
    Keywords: delay equations ; stability ; positive solutions ; spectral growth condition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We prove stability for a semilinear delay equation, whose nonlinearity is majorized by a linear positive operator. The key ingredients are a spectral condition, positivity of solutions to the linear problem, and lattice properties of the Banach space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 5 (1997), S. 73-88 
    ISSN: 1572-932X
    Keywords: differential inclusion ; invariance ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The properties of invariance, stability, asymptotic stability and attainability of a given compact set $$K \subset \mathbb{R}^n $$ with respect to a differential inclusion, have weak and strong versions: the weak version requires existence of a trajectory with the corresponding property, while the strong one requires this property for all trajectories. The following statement is proven in the paper (under slight restrictions) for each of the above-mentioned properties: if K has the weak property with respect to $$\dot x \in F(x) $$ , then there is a (regulation) mapping G such that G(x) ⊂ F(x) ∀ x and G has the strong property with respect to $${\dot x}$$ ε G(x). In addition, certain regularity of the set of solutions of the last inclusion is claimed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 5 (1997), S. 365-375 
    ISSN: 1572-932X
    Keywords: set-valued mappings ; vector optimization ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We establish optimization results for set-valued mappings, with the image space given by a topological vector space partially ordered by a cone. Moreover, we obtain stability results relative to parametrized optimization problems. We use a weak semicontinuity concept related to the order structure of the image space and show how compactness assumptions used in previous papers can be lightened.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 379-402 
    ISSN: 1572-9338
    Keywords: Optimal control ; stochastic control ; dynamic systems ; economics ; public-sector applications ; optimization ; budgetary policies ; monetary policy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper, we determine optimal budgetary and monetary policies for Austria using a small macroeconometric model. We use a Keynesian model of the Austrian economy, called FINPOL1, estimated by ordinary least squares, which relates the main objective variables of Austrian economic policies, such as the growth rate of real gross domestic product, the rate of unemployment, the rate of inflation, the balance of payments, and the ratio of the federal budget deficit to GDP, to fiscal and monetary policy instruments, namely expenditures and revenues of the federal budget and money supply. Optimal fiscal and monetary policies are calculated for the model under a quadratic objective function using the algorithm OPTCON for the optimum control of nonlinear stochastic dynamic systems. Several control experiments are performed in order to assess the influence of different kinds of uncertainty on optimal budgetary and monetary policies. Apart from deterministic optimization runs, different assumptions about parameter uncertainties are introduced; the results of these different stochastic optimum control experiments are compared and interpreted.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 79-93 
    ISSN: 1572-9338
    Keywords: Multistage stochastic programs ; optimization in Banach spaces ; stability ; approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Multistage stochastic programs are regarded as mathematical programs in a Banach spaceX of summable functions. Relying on a result for parametric programs in Banach spaces, the paper presents conditions under which linearly constrained convex multistage problems behave stably when the (input) data process is subjected to (small) perturbations. In particular, we show the persistence of optimal solutions, the local Lipschitz continuity of the optimal value and the upper semicontinuity of optimal sets with respect to the weak topology inX. The linear case with deterministic first-stage decisions is studied in more detail.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 56 (1995), S. 287-311 
    ISSN: 1572-9338
    Keywords: Probability functions ; gradient of integral ; sensitivity analysis ; optimization ; discrete event dynamic systems ; shut-down problem ; probabilistic risk analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Probability functions depending upon parameters are represented as integrals over sets given by inequalities. New derivative formulas for the intergrals over a volume are considered. Derivatives are presented as sums of integrals over a volume and over a surface. Two examples are discussed: probability functions with linear constraints (random right-hand sides), and a dynamical shut-down problem with sensors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 3 (1997), S. 63-81 
    ISSN: 1572-9397
    Keywords: Large-step Markov chain ; optimization ; simulated annealing ; traveling salesman problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The large-step Markov chain (LSMC) approach is the most effective known heuristic for large symmetric TSP instances; cf. recent results of [Martin, Otto and Felten, 1991] and [Johnson, 1990]. In this paper, we examine relationships among (i) the underlying local optimization engine within the LSMC approach, (ii) the “kick move” perturbation that is applied between successive local search descents, and (iii) the resulting LSMC solution quality. We find that the traditional “double-bridge” kick move is not necessarily optimum: stronger local optimization engines (e.g., Lin-Kernighan) are best matched with stronger kick moves. We also propose use of an adaptive temperature schedule to allow escape from deep basins of attraction; the resulting hierarchical LSMC variant outperforms traditional LSMC implementations that use uniformly zero temperatures. Finally, a population-based LSMC variant is studied, wherein multiple solution paths can interact to achieve improved solution quality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of dynamics and differential equations 9 (1997), S. 463-505 
    ISSN: 1572-9222
    Keywords: Difference equations ; random perturbation ; averaging ; diffusion approximation ; randomly perturbed iterations ; stability ; 3SR60 ; 60H15 ; 60J99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let (X, ℬ) and (Y,C) be two measurable spaces withX being a linear space. A system is determined by two functionsf(X): X→ X andϕ:X×Y→X, a (small) positive parameterε and a homogeneous Markov chain {y n } in (Y,C) which describes random perturbations. States of the system, say {x n ɛ ∈X, n=0, 1,⋯}, are determined by the iteration relations:x n+1 ɛ =f(x n ɛ )+ɛϕ(x n ɛ ,Yn+1) forn≥0, wherex 0 ɛ =x 0 is given. Here we study the asymptotic behavior of the solutionx n ɛ asε → 0 andn → ∞ under various assumptions on the data. General results are applied to some problems in epidemics, genetics and demographics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Set-valued analysis 5 (1997), S. 377-390 
    ISSN: 1572-932X
    Keywords: differential inclusions ; stability ; boundedness of solutions ; Lyapunov functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For Lipschitzian differential inclusions, we prove that the existence of suitable Lyapunov functions is necessary for uniform stability and uniform boundedness of solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 57 (1995), S. 217-232 
    ISSN: 1572-9338
    Keywords: Scheduling ; robotic cell ; tandem machines ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper deals with the scheduling of a robotic cell in which jobs are processed on two tandem machines. The job transportation between the machines is done by a transportation robot. The robotic cell has limitations on the intermediate space between the machines for storing the work-in-process. What complicates the scheduling problem is that the loading/unloading operation times are non-negligible. Given the total number of operationsn, an optimalO(n logn)-time algorithm is proposed together with the proof of optimality.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 58 (1995), S. 243-260 
    ISSN: 1572-9338
    Keywords: Assignment problem ; computer models ; distribution sampling ; estimation ; integer programming ; large-scale modelling ; latin hypercube ; optimization ; sampling ; sensitivity analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Latin hypercube sampling is often used to estimate the distribution function of a complicated function of many random variables. In so doing, it is typically necessary to choose a permutation matrix which minimizes the correlation among the cells in the hypercube layout. This problem can be formulated as a generalized, multi-dimensional assignment problem. For the two-dimensional case, we provide a polynomial algorithm. For higher dimensions, we offer effective heuristic and bounding procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    BIT 17 (1977), S. 321-328 
    ISSN: 1572-9125
    Keywords: 5.15 ; nonlinear equation ; root finding ; multiple root ; secant method ; Steffensen procedure ; order of convergence ; efficiency ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A superlinear procedure for finding a multiple root is presented. In it the secant method is applied to the given function divided by a divided difference whose increment shrinks toward zero as the root is approached. Two function evaluations per step are required, but no derivatives need be calculated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Advances in computational mathematics 4 (1995), S. 1-26 
    ISSN: 1572-9044
    Keywords: Wavelets ; biorthogonal wavelets ; stability ; primary 15A12 ; 65F35 ; secondary 42C15
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For orthogonal wavelets, the discrete wavelet and wave packet transforms and their inverses are orthogonal operators with perfect numerical stability. For biorthogonal wavelets, numerical instabilities can occur. We derive bounds for the 2-norm and average 2-norm of these transforms, including efficient numerical estimates if the numberL of decomposition levels is small, as well as growth estimates forL → ∞. These estimates allow easy determination of numerical stability directly from the wavelet coefficients. Examples show that many biorthogonal wavelets are in fact numerically well behaved.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Annals of global analysis and geometry 13 (1995), S. 141-148 
    ISSN: 1572-9060
    Keywords: Gauss curvature ; stability ; 53
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We prove that a domain on a surface of constant curvature is stable provided the integral of the mean curvature is small enough.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Annals of global analysis and geometry 15 (1997), S. 277-297 
    ISSN: 1572-9060
    Keywords: mean curvature ; $$r$$ -mean curvature ; sphere ; stability ; stable
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We deal with compact hypersurfaces immersed in space forms with constant $$r$$ -mean curvature. They are critical points for a variational problem. We show they are stable if and only if they are geodesic spheres, generalizing results on constant curvature hypersurfaces.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    ISSN: 1572-9125
    Keywords: finite difference methods ; wave equation ; accuracy ; stability ; Padé approximants ; order stars ; Riemann surface
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider three time-level difference schemes, symmetric in time and space, for the solution of the wave equation,u tt =c 2 u xx , given by $$\sum\limits_{j = - S}^S {b_j U_{n + 1,m + j} + } \sum\limits_{j = - S}^S {a_j U_{n,m + j} + } \sum\limits_{j = - S}^S {b_j U_{n - 1,m + j} } = 0.$$ It has already been proved that the maximal order of accuracyp of such schemes is given byp ≤ 2(s + S). In this paper we show that the requirement of stability does not reduce this maximal order for any choice of the pair (s, S). The result is proved by introducing an order star on the Riemann surface of the algebraic function associated with the scheme. Furthermore, Padé schemes, withS = 0,s 〉 0, ands = 0,S 〉 0, are proved to be stable for 0 〈 μ 〈 1, where μ is the Courant number. These schemes can be implemented with high-order absorbing boundary conditions without reducing the range of μ for which stable solutions are obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 48 (1997), S. 13-32 
    ISSN: 1572-9036
    Keywords: limit cycles ; vector fields ; oscillation theory ; second-order dynamic systems ; qualitative theory of dynamic systems ; phase portrait ; optimization ; 16th Hilbert Problem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a solution to the problem to find isolated closed trajectories of two-dimensional dynamic systems. In contrast to the method of Bendixson’s ring regions, the new method is constructive. It allows the determination of the location of closed trajectories and therefore gives an upper bound for their number. The method is based on the idea to use inherent geometrical and physical extremal properties of these trajectories to transform the problem into an optimization task (isoperimetric problem of variational calculus) that can be solved by numerical algorithms, e.g., by hillclimbing.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 49 (1997), S. 35-54 
    ISSN: 1572-9036
    Keywords: dynamical systems ; stability ; pseudo orbit tracing property ; nonstandard analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is known that it is not possible to introduce C0 -structural stability for whole systems in topological dynamics. Using the methods of Nonstandard Analysis, we suggest four different purely topological stability concepts for dynamical systems on compact subsets of Rn. Classically these amount to considering the space of all systems on a given subset of Rn as the fundamental entity when deforming a continuous system (instead of the space of all continuous systems as is normally done in topological dynamics). For two of the introduced stability concepts, we will show that all minimal flows are stable in this sense. Besides this, we will show that one of our stability concepts is related to what is called the pseudo orbit tracing property in a recently published book by Aoki and Hiraide and compare some of our results to the theory of dynamical systems as presented there.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Journal of nonlinear science 5 (1995), S. 373-418 
    ISSN: 1432-1467
    Keywords: Hamiltonian system with symmetry ; relative equilibria ; perturbation ; linearization ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Notes: Summary A relative equilibrium of a Hamiltonian system with symmetry is a point of phase space giving an evolution which is a one-parameter orbit of the action of the symmetry group of the system. The evolutions of sufficiently small perturbations of a formally stable relative equilibrium are arbitrarily confined to that relative equilibrium's orbit under the isotropy subgroup of its momentum. However, interesting evolution along that orbit, here called drift, does occur. In this article, linearizations of relative equilibria are used to construct a first order perturbation theory explaining drift, and also to determine when the set of relative equilibria near a given relative equilibrium is a smooth symplectic submanifold of phase space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of nondestructive evaluation 14 (1995), S. 127-136 
    ISSN: 1573-4862
    Keywords: Nondestructive evaluation ; corrosion monitoring ; electrical impedance tomography ; stability ; numerical methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology , Mathematics
    Notes: Abstract We investigate the problem of detecting and assessing, by means of static electrical measurements, damage due to corrosion in a structure. Corrosion damage, which is assumed to occur in an inaccessible part of a specimen, is modelled as material loss. The detection device consists of electrodes which inject DC current and measure voltage potentials in the accessible part of the specimen. The topography of the damaged surface is estimated from the measured data. This research is meant to evaluate if a method based on static electrical measurements has the potential to be developed into a useful nondestructive evaluation tool. We propose computational methods that take the measured data and estimate the unknown damaged surface. The methods are studied in order to understand their properties. Several example calculations from synthetic data are presented. Our findings indicate that such a device has limited resolution. However, it offers several advantages that make it worthwhile to pursue further research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 20 (1984), S. 259-276 
    ISSN: 1432-1416
    Keywords: Age-structured population dynamics ; equilibria ; stability ; bifurcation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract The existence of positive equilibrium solutions of the McKendrick equations for the dynamics of an age-structured population is studied as a bifurcation phenomenon using the inherent net reproductive rate n as a bifurcation parameter. The local existence and uniqueness of a branch of positive equilibria which bifurcates from the trivial (identically zero) solution at the critical value n=1 are proved by implicit function techniques under very mild smoothness conditions on the death and fertility rates as functional of age and population density. This first requires the development of a suitable linear theory. The lowest order terms in the Liapunov-Schmidt expansions are also calculated. This local analysis supplements earlier global bifurcation results of the author. The stability of both the trivial and the positive branch equilibria is studied by means of the principle of linearized stability. It is shown that in general the trivial solution losses stability as n increases through one while the stability of the branch solution is stable if and only if the bifurcation is supercritical. Thus the McKendrick equations exhibit, in the latter case, a standard exchange of stability with regard to equilibrium states as they depend on the inherent net reproductive rate. The derived lower order terms in the Liapunov-Schmidt expansions yield formulas which explicitly relate the direction of bifurcation to properties of the age-specific death and fertility rates as functionals of population density. Analytical and numerical results for some examples are given which illustrate these results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical biology 21 (1984), S. 25-34 
    ISSN: 1432-1416
    Keywords: Predator-prey ; density dependence ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology , Mathematics
    Notes: Abstract The Gurtin and Levine model5 is studied in this paper under the assumption that the fecundity of prey depends on age as well as on the total population sizes of prey and predators. The purpose of this study is to see the effect of this density dependence on the stability criteria for the equilibria of the model equations. It is shown that there are cases when, due to density dependence, the model which is originally neutrally stable becomes stable.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Acta mathematicae applicatae sinica 13 (1997), S. 176-187 
    ISSN: 1618-3932
    Keywords: Spherical surface ; pseudospectral method ; vorticity equations ; stability ; convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The pseudospectral method for solving vorticity equations on spherical surface is discussed. An interpolation procedure, which is different from the usual ones, is proposed. Based on such an interpolation, the pseudospectral scheme is constructed. Its generalized stability and convergence are analyzed rigorously. The theoretical analysis and computational skills can also be applied to other nonlinear partial differential equations defined on spherical surface.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 10 (1995), S. 225-244 
    ISSN: 1572-9265
    Keywords: 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
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 14 (1997), S. 343-359 
    ISSN: 1572-9265
    Keywords: progressive interpolation ; stability ; spline ; shape parameters ; geometric continuity ; 41A05 ; 41A15 ; 65D05 ; 65D07
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 10 (1995), S. 245-260 
    ISSN: 1572-9265
    Keywords: Multistep methods ; differential-algebraic equations ; stability ; existence and uniqueness ; convergence of iterative method ; 65L06 ; 65L20 ; 65N22
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Acta mathematicae applicatae sinica 13 (1997), S. 33-44 
    ISSN: 1618-3932
    Keywords: Inverse problem ; hyperbolic equations ; eigenvalue problem ; spectral function ; integral kernel ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the inverse boundary value problem of the hyperbolic system of first-order differential equations is discussed. The estimate of the solution and the quantitative analysis about its stability are obtained, and some stability criteria are established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 16 (1995), S. 195-202 
    ISSN: 1573-2754
    Keywords: nonlinear ; stability ; Lyapunov function
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract In the paper Lyapumov function for a fourth order linear system is given and stability of the trivial solutions to a class of fourth order nonlinear systems is studied.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 16 (1995), S. 635-642 
    ISSN: 1573-2754
    Keywords: analytic mechanics ; nonholonomic system ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract The stability for the equilibrium states of Chaplygin's systems is considered. The equations of motion of Chaplygin's systems and the existence conditions of their equilibrium states are given. Some criteria of stability for the equilibrium. states of Chaplygin's systems are obtained. Two examples are finally given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Discrete event dynamic systems 5 (1995), S. 383-403 
    ISSN: 1573-7594
    Keywords: Discrete event systems ; stability ; boundedness ; Petri nets ; manufacturing systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Recently it has been shown that the conventional notions of stability in the sense of Lyapunov and asymptotic stability can be used to characterize the stability properties of a class of “logical” discrete event systems (DES). Moreover, it has been shown that stability analysis via the choice of appropriate Lyapunov functions can be used for DES and can be applied to several DES applications including manufacturing systems and computer networks (Passino et al. 1994, Burgess and Passino 1994). In this paper we extend the conventional notions and analysis of uniform boundedness, uniform ultimate boundedness, practical stability, finite time stability, and Lagrange stability so that they apply to the class of logical DES that can be defined on a metric space. Within this stability-theoretic framework we show that the standard Petri net-theoretic notions of boundedness are special cases of Lagrange stability and uniform boundedness. In addition we show that the Petri ent-theoretic approach to boundedness analysis is actually a Lyapunov approach in that the net-theoretic analysis actually produces an appropriate Lyapunov function. Moreover, via the Lyapunov approach we provide a sufficient condition for the uniform ultimate boundedness of General Petri nets. To illustrate the Petri net results, we study the boundedness properties of a rate synchronization network for manufacturing systems. In addition, we provide a detailed analysis of the Lagrange stability of a single-machine manufacturing system that uses a priority-based part servicing policy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    ISSN: 1573-7594
    Keywords: optimization ; standard clock ; ordinal optimization ; communication network ; voice/data integration ; simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we apply the ideas of ordinal optimization and the technique of Standard Clock (SC) simulation to the voice-call admission-control problem in integrated voice/data multihop radio networks. This is an important problem in networking that is not amenable to exact analysis by means of the usual network modeling techniques. We first describe the use of the SC approach on sequential machines, and quantify the speedup in simulation time that is achieved by its use in a number of queueing examples. We then develop an efficient simulation model for wireless integrated networks based on the use of the SC approach, which permits the parallel simulation of a large number of admission-control policies, thereby reducing computation time significantly. This model is an extension of the basic SC approach in that it incorporates fixed-length data packets, whereas SC simulation is normally limited to systems with exponentially distributed interevent times. Using this model, we demonstrate the effectiveness of ordinal-optimization techniques, which provide a remarkably good ranking of admission-control policies after relatively short simulation runs, thereby facilitating the rapid determination of good policies. Moreover, we demonstrate that the use of crude, inaccurate analytical and simulation models can provide highly accurate policy rankings that can be used in conjunction with ordinal-optimization methods, provided that they incorporate the key aspects of system operation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Discrete event dynamic systems 7 (1997), S. 209-232 
    ISSN: 1573-7594
    Keywords: Stochastic recurrence equations ; performance evaluation ; ergodicity ; stability ; subadditive ergodic theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the asymptotic behavior of the stochastic dynamics of discrete event systems. In this paper we focus on a wide class of models arising in several fields and particularly in computer science. This class of models may be characterized by stochastic recurrence equations in ℝK of the form T(n+1) = φ n+1(T(n)) where φ n is a random operator monotone and 1—linear. We establish that the behaviour of the extremas of the process T(n) are linear. The results are an application of the sub-additive ergodic theorem of Kingman. We also give some stability properties of such sequences and a simple method of estimating the limit points.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Journal of mathematical imaging and vision 7 (1997), S. 309-323 
    ISSN: 1573-7683
    Keywords: relaxation labeling processes ; consistency ; growth transformations ; Liapunov functions ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present some new results which definitively explain thebehavior of the classical, heuristic nonlinear relaxation labelingalgorithm of Rosenfeld, Hummel, and Zucker in terms of theHummel-Zucker consistency theory and dynamical systems theory. Inparticular, it is shown that, when a certain symmetry condition is met,the algorithm possesses a Liapunov function which turns out to be (thenegative of) a well-known consistency measure. This follows almostimmediately from a powerful result of Baum and Eagon developed in thecontext of Markov chain theory. Moreover, it is seen that most of theessential dynamical properties of the algorithm are retained when thesymmetry restriction is relaxed. These properties are also shown tonaturally generalize to higher-order relaxation schemes. Someapplications and implications of the presented results are finallyoutlined.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    ISSN: 1573-7594
    Keywords: Decentralized scheduling ; manufacturing systems ; corridor policies ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Sharifnia, Caramanis, and Gershwin [1991] introduced a class of policies for manufacturing systems, called by themlinear corridor policies. They proved that their stability can be discussed by the study of a simpler subset of such policies (cone policies). This paper revisits their work presenting a different description of the dynamics of the systems under study and explores it to device a necessary and sufficient condition for stability, obtained by the strengthening of the assumptions in Sharifnia et al. (1991). This condition is shown to be simply tested (M −1≥0) and valid for various realizations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 253-264 
    ISSN: 1573-2878
    Keywords: Geometric programs ; optimization ; generalized reduced gradient method ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes the performance of a general-purpose GRG code for nonlinear programming in solving geometric programs. The main conclusions drawn from the experiments reported are: (i) GRG competes well with special-purpose geometric programming codes in solving geometric programs; and (ii) standard time, as defined by Colville, is an inadequate means of compensating for different computing environments while comparing optimization algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 143-149 
    ISSN: 1573-2878
    Keywords: Laguerre polynomials ; variational problems ; Ritz direct method ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A direct method for solving variational problems via Laguerre series is presented. First, an operational matrix for the integration of Laguerre polynomials is introduced. The variational problems are reduced to the solution of algebraic equations. An illustrative example is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 40 (1983), S. 349-378 
    ISSN: 1573-2878
    Keywords: Convexity ; subdifferentials ; cones of directions of constancy ; equality set of constraints ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present an algorithm which solves a convex program with faithfully convex (not necessarily differentiable) constraints. While finding a feasible starting point, the algorithm reduces the program to an equivalent program for which Slater's condition is satisfied. Included are algorithms for calculating various objects which have recently appeared in the literature. Stability of the algorithm is discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 40 (1983), S. 77-83 
    ISSN: 1573-2878
    Keywords: Parameterized decision-making problems ; utopia point ; compromise solutions ; Hausdorff distance ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Stability is a desirable attribute of the nondominated solution in the decision-making problem with multiple noncommensurable objectives. It is assumed that the decision space is given by a system of inequalitiesG(x)≤b, b ∈ R N . In this paper, sufficient conditions are determined for a compromise solution to be stable with respect to the changes ofb.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 549-574 
    ISSN: 1573-2878
    Keywords: Boundary control ; wave and plate equations ; optimization ; nonstandard Riccati equations ; input dynamics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An optimization problem for a control system governed by an analytic generator with unbounded control actions is considered. The solution to this problem is synthesized in terms of the Riccati operator, arising from a nonstandard Riccati equation. Solvability and uniqueness of the solutions to this Riccati equation are established. This theory is applied to a boundary control problem governed by damped wave and plate equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 415-431 
    ISSN: 1573-2878
    Keywords: Kalman filtering ; Karhunen-Loève expansion ; stability ; observability ; controllability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Several state-space models for estimating a second-order stochastic process are proposed in this paper on the basis of the approximate Karhunen-Loève expansion. Properties of these models are studied and then the Kalman filtering method is applied. The accuracy of the models on the basis of two different situations, deterministic or random inputs, is studied by means of a simulation of a Brownian motion.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 199-222 
    ISSN: 1573-2878
    Keywords: Routing ; optimization ; queueing systems ; robustness ; distributed algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the effect of arrival model uncertainties on the optimal routing in a system of parallel queues. For exponential service time distributions and Bernoulli routing, the optimal mean system delay generally depends on the interarrival time distribution. Any error in modeling the arriving process will cause a model-based optimal routing algorithm to produce a mean system delay higher than the true optimum. In this paper, we present an asymptotic analysis of the behavior of this error under heavy traffic conditions for a general renewal arrival process. An asymptotic analysis of the error in optimal mean delay due to uncertainties in the service time distribution for Poisson arrivals was reported in Ref. 6, where it was shown that, when the first moment of the service time distribution is known, this error in performance vanishes asymptotically as the traffic load approaches the system capacity. In contrast, this paper establishes the somewhat surprising result that, when only the first moment of the arrival distribution is known, the error in optimal mean delay due to uncertainties in the arrival model is unbounded as the traffic approaches the system capacity. However, when both first and second moments are known, the error vanishes asymptotically. Numerical examples corroborating the theoretical results are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 28 (1984), S. 193-260 
    ISSN: 1432-5217
    Keywords: Analytic behaviour of strategies ; continuous strategies ; ES strategies ; MES strategies ; machine idleness ; monotonicity behaviour ; optimal strategies ; preselectivity ; regular measure of performance ; scheduling problems ; stability ; stochastic dynamic optimization ; stochastically ordered distributions ; stochastic scheduling
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The paper contains an introduction to recent developments in the theory of non-preemptive stochastic scheduling problems. The topics covered are: arbitrary joint distributions of activity durations, arbitrary regular measures of performance and arbitrary precedence and resource constraints. The possible instability of the problem is demonstrated and hints are given on stable classes of strategies available, including the combinatorial vs. analytical characterization of such classes. Given this background, the main emphasis of the paper is on the monotonicity behaviour of the model and on the existence of optimal strategies. Existing results are presented and generalized, in particular w.r.t. the cases of lower semicontinuous performance measures or joint duration distributions having a Lebesgue density.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics and mechanics 16 (1995), S. 1161-1169 
    ISSN: 1573-2754
    Keywords: shell ; stability ; critical load
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics , Mathematics , Physics
    Notes: Abstract This paper gives the resultant forces and moments, strain energy and work of external forces on the basis of the deformation theory of flexible body. Therefore, in accordance with the principle of virtual displacement, the energy criterion of critical load is obtained and the equilibrium equation and boundary conditions of stability problem are derived.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 23 (1977), S. 101-109 
    ISSN: 1573-2878
    Keywords: Operations research ; optimization ; allocation ; location-allocation ; existence ; uniqueness
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Some mathematical aspects are studied for a wide class of problems called continuous allocation problems: Find a mapping, from one given continuous set onto another, to minimize a given function on these sets. Many problems of assortments, catalogs, scheduling, location-allocation, search, etc., fall in this class. Theorems on existence, uniqueness, and continuity of solution are given. A solution technique is given for then-dimensional generalized location-allocation problem, and it is shown to converge on a solution. Finally, an expression is found for the facility density in multiple-facility location-allocation problems when the range of the mapping is continuous (as the number of facilities tends to infinity).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 23 (1977), S. 277-284 
    ISSN: 1573-2878
    Keywords: n-person games ; stability ; grand coalition ; taxation systems ; nondominated imputation ; multicriteria framework
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In formulating solutions forn-person cooperative games, the concept of stability has played a dominant role. Although the core concept has the strongest stability, the core of a game is often empty. In this paper, the taxation system is incorporated into our framework, so that a modified solution concept, which enjoys the stability of core, can be developed. Various formulations based on principles such astaxation proportional to income andequity after tax are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 25 (1978), S. 485-505 
    ISSN: 1573-2878
    Keywords: Game theory ; stability ; contraction mappings
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with a class of noncooperative games ofn players that are defined byn reward functions which depend continuously on the action variables of the players. This framework provides a realistic model of many interactive situations, including many common models in economics, sociology, engineering, and political science. The concept of Nash equilibrium is a suitable companion to such models. A variety of different sufficient conditions for existence, uniqueness, and stability of a Nash equilibrium point have been previously proposed. By sharpening the noncooperative aspect of the framework (which is really only implicit in the original framework), this paper attempts to isolate one set of “natural” conditions that are sufficient for existence, uniqueness, and stability. It is argued thatl ∞ quasicontraction is such a natural condition. The concept of complete stability is introduced to reflect the full character of noncooperation. It is then shown that, in the linear case, the condition ofl ∞ quasicontraction is both necessary and sufficient for complete stability.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 299-307 
    ISSN: 1573-2878
    Keywords: Shifted Legendre polynomials ; operational matrix ; variational problems ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The shifted Legendre polynomial series is employed to solve variational problems. The solution is carried out by using an operational matrix for integrating the shifted Legendre polynomial vector. Variational problems are reduced to solving algebraic equations. Two illustrative examples are given, and the computational results obtained by Legendre series direct method are compared with the exact solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 187-214 
    ISSN: 1573-2878
    Keywords: Self-interest maximization ; self-interest stable solutions ; self-interest cooperative games ; self-interest noncooperative games ; monotonic games ; decomposition theory ; reframing game payoffs ; full cooperation ; targeted solutions ; Pareto optimality ; collective group interest ; stability ; structural departure ; incentives for adopting a new game ; habitual domain
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Human beings have a prevailing drive to achieve their self-interest goals or equilibrium states, which may subsume their social interests. An ideal working environment or cooperative game situation would be one in which each participant or player maximizes his/her own interest while maximizing his/her contribution to the collective group interest. This paper addresses the feasibility, methods, and bounds for reframing a generaln-person game into an ideal game in which full cooperation or a targeted solution can be induced and maintained by the players' self-interest maximization. Criteria for good reframing are introduced. Monotonic games, self-interest cooperative and noncooperative games, and a decomposition theory of general games are also introduced to facilitate the study. It is shown that everyn-person game can be written as the sum of a self-interest cooperative game and a self-interest noncooperative game. Everyn-person game can be reframed so that full cooperation can be achieved by the players' self-interest maximization. Everyn-person game can be reframed so that a targeted solution can be obtained and maintained through the players' self-interest maximization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 145-169 
    ISSN: 1573-2878
    Keywords: Stackelberg problem ; multifunctions ; Γ-limits ; existence ; stability ; ε-solutions ; strict ε-solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The aim of this paper is to study, in a topological framework, existence and stability for the solutions to a parametrized Stackelberg problem. To this end, approximate solutions are used, more precisely, ε-solutions and strict ε-solutions. The results given are of minimal character and the standard types of constraints are considered, that is, constant constraints, constraints defined by a finite number of inequalities, and more generally constraints defined by an arbitrary multifunction.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 84 (1995), S. 339-360 
    ISSN: 1573-2878
    Keywords: Approximations ; algorithmic convergence ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In an earlier paper, the authors introduced epigraphical nesting of objective functions as a means to characterize the convergence of global optimization algorithms. Epigraphical nesting of objective functions may be looked upon as a relaxation of epigraphical convergence of objective functions, whereby one ensures that epigraphs of the approximations contain asymptotically the epigraph of the objective function of the original optimization problem. In this paper, we show that, for algorithms which seek only a stationary point, convergence can be assured by objective function approximations whose directional derivatives attain an epigraphical nesting property. We demonstrate that epigraphical nesting provides a unifying thread that ties together a number of different algorithms, including those for the solution of variational inequalities and smooth as well as nonsmooth optimization. We show that the Newton method and its variants for unconstrained optimization, successive quadratic programming methods for constrained optimization, and proximal point algorithms (deterministic and stochastic) all construct approximations in which the directional derivatives attain an epigraphical nesting property, even though the approximations themselves fail to attain such a property.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 705-726 
    ISSN: 1573-2878
    Keywords: Nonlinear allocation problems ; networks ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem considered is as follows:m resources are to be allocated ton activities, with resourcei contributing linearly to the potential for activityj according to the coefficientE(i,j). The objective is to minimize some nonlinear function of the potentials. If the objective function is sufficiently well behaved, the problem can be solved in finitely many steps using the method described in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 635-638 
    ISSN: 1573-2878
    Keywords: Polynomial theory ; robustness ; Kharitonov theorem ; stability ; Hurwitz polynomials ; inverse Kharitonov problem ; Rouché theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of the robust stability of a Hurwitz polynomial which is the characteristic polynomial of a discrete-time linear time-invariant system is investigated. A new approach based on the Rouché theorem of classical complex analysis is adopted. An interesting sufficient condition for robust stability is derived. Three examples are included to support the theoretical result.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 597-607 
    ISSN: 1573-2878
    Keywords: Optimal control ; gradient flows ; optimization ; decentralized systems ; performance index
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the problem of computing the suboptimal output feedback gains of decentralized control systems is investigated. First, the problem is formulated. Then, the gradient matrices based on the index function are derived and a new algorithm is established based on some nice properties. This algorithm shows that a suboptimal gain can be computed by solving several ordinary differential equations (ODEs). In order to find an initial condition for the ODEs, an algorithm for finding a stabilizing output feedback gain is exploited, and the convergence of this algorithm is discussed. Finally, an example is given to illustrate the proposed algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 95 (1997), S. 467-499 
    ISSN: 1573-2878
    Keywords: Flight mechanics ; astrodynamics ; celestial mechanics ; Earth-to-Mars missions ; departure window ; arrival window ; optimization ; sequential gradient-restoration algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with the optimal transfer of a spacecraft from a low Earth orbit (LEO) to a low Mars orbit (LMO). The transfer problem is formulated via a restricted four-body model in that the spacecraft is considered subject to the gravitational fields of Earth, Mars, and Sun along the entire trajectory. This is done to achieve increased accuracy with respect to the method of patched conics. The optimal transfer problem is solved via the sequential gradient-restoration algorithm employed in conjunction with a variable-stepsize integration technique to overcome numerical difficulties due to large changes in the gravitational field near Earth and near Mars. The optimization criterion is the total characteristic velocity, namely, the sum of the velocity impulses at LEO and LMO. The major parameters are four: velocity impulse at launch, spacecraft vs. Earth phase angle at launch, planetary Mars/Earth phase angle difference at launch, and transfer time. These parameters must be determined so that ΔV is minimized subject to tangential departure from circular velocity at LEO and tangential arrival to circular velocity at LMO. For given LEO and LMO radii, a departure window can be generated by changing the planetary Mars/Earth phase angle difference at launch, hence changing the departure date, and then reoptimizing the transfer. This results in a one-parameter family of suboptimal transfers, characterized by large variations of the spacecraft vs. Earth phase angle at launch, but relatively small variations in transfer time and total characteristic velocity. For given LEO radius, an arrival window can be generated by changing the LMO radius and then recomputing the optimal transfer. This leads to a one-parameter family of optimal transfers, characterized by small variations of launch conditions, transfer time, and total characteristic velocity, a result which has important guidance implications. Among the members of the above one-parameter family, there is an optimum–optimorum trajectory with the smallest characteristic velocity. This occurs when the radius of the Mars orbit is such that the associated period is slightly less than one-half Mars day.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 39 (1983), S. 403-416 
    ISSN: 1573-2878
    Keywords: Liapunov function ; reachability ; optimization ; quantitative control ; qualitative control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we find sufficient conditions that do not rely upon any Liapunov stability results for the reachability of the target set by an admissible control from ana priori specified set of states. The conditions found are less restrictive than those obtained by Sticht, Vincent, and Schultz in Ref. 1. For control problems with specific integral performance index, we also show that, if a quantitative Liapunov function for optimization exists, then it may also serve as a qualitative Liapunov function ensuring the reachability of the target. The results are illustrated by examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 649-676 
    ISSN: 1573-2878
    Keywords: Subdifferentials ; convex functions ; quasiconvex functions ; optimization ; minima ; maxima ; necessary conditions ; sufficient conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the γ-subdifferential ∂γ is introduced for investigating the global behavior of real-valued functions on a normed spaceX. Iff: D⊂X → ℝ attains its global minimum onD atx *, then 0∈∂γ f(x *). This necessary condition always holds, even iff is not continuous orx * is at the boundary of its domain. Nevertheless, it is useful because, by choosing a suitable γ∈ℝ+, many local minima cannot satisfy this necessary condition. For the sufficient conditions, the so-called γ-convex functions are defined. The class of these functions is rather large. For example, every periodic function on the real line is a γ-convex function. There are γ-convex functions which are not continuous everywhere. Every function of bounded variation can be represented as the difference of two γ-convex functions. For all that, γ-convex functions still have properties similar to those of convex functions. For instance, each γ-local minimizer off is at the same time a global one. Iff attains its global minimum onD, then it does so at least at one point of its γ-boundary.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 87 (1995), S. 403-417 
    ISSN: 1573-2878
    Keywords: Lyapunov functions ; uncertain systems ; structured uncertainties ; optimization ; multidimensional systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The robust stability problem of a nominally linear system with nonlinear, time-varying structured perturbationsp j ,j=1,...,q, is considered. The system is of the form $$\dot x = A_N x + \sum\limits_{j = 1}^q {p_j A_j x} .$$ When the Lyapunov direct method is utilized to solve the problem, the most frequently chosen Lyapunov function is some quadratic form. The paper presents a procedure of optimization of Lyapunov functions. Under some simple conditions, the weak convergence of the procedure is ensured, making the procedure effective in solving the robust stability problem. The procedure is simple, requiring only numerical routines such as inverting positive-definite symmetric matrices and determining the eigenvalues and eigenvectors of symmetric matrices. It is expected that the optimal Lyapunov function may be used in a robust linear feedback controller design. The examples demonstrate the effectiveness of the method. As shown when considering a system of dimension 24, the method is effective for large-scale systems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 5 (1995), S. 175-190 
    ISSN: 1573-1375
    Keywords: Image analysis ; MAP estimation ; optimization ; simulated annealing ; multi-resolution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We describe an image reconstruction problem and the computational difficulties arising in determining the maximum a posteriori (MAP) estimate. Two algorithms for tackling the problem, iterated conditional modes (ICM) and simulated annealing, are usually applied pixel by pixel. The performance of this strategy can be poor, particularly for heavily degraded images, and as a potential improvement Jubb and Jennison (1991) suggest the cascade algorithm in which ICM is initially applied to coarser images formed by blocking squares of pixels. In this paper we attempt to resolve certain criticisms of cascade and present a version of the algorithm extended in definition and implementation. As an illustration we apply our new method to a synthetic aperture radar (SAR) image. We also carry out a study of simulated annealing, with and without cascade, applied to a more tractable minimization problem from which we gain insight into the properties of cascade algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Nonlinear dynamics 7 (1995), S. 11-35 
    ISSN: 1573-269X
    Keywords: Periodic solutions ; stability ; local bifurcations ; Fourier series
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper explores the application of the method of variable-coefficient harmonic balance to nonautonomous nonlinear equations of the form XsF(X, t:λ), and in particular, a one-degree-of-freedom nonlinear oscillator equation describing escape from a cubic potential well. Each component of the solution, X(t), is expressed as a truncated Fourier series of superharmonics, subharmonics and ultrasubharmonics. Use is then made of symbolic manipulation in order to arrange the oscillator equation as a Fourier series and its coefficient are evaluated in the traditional way. The time-dependent coefficients permit the construction of a set of amplitude evolution equations with corresponding stability criteria. The technique enables detection of local bifurcations, such as saddle-node folds, period doubling flips, and parts of the Feigenbaum cascade. This representation of the periodic solution leads to local bifurcations being associated with a term in the Fourier series and, in particular, the onset of a period doubled solution can be detected by a series of superharmonics only. Its validity is such that control space bifurcation diagrams can be obtained with reasonable accuracy and large reductions in computational expense.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Nonlinear dynamics 14 (1997), S. 193-210 
    ISSN: 1573-269X
    Keywords: Perturbation methods ; stability ; bifurcation ; codimension two ; periodic and quasi-periodic solutions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is shown that the logical bases of the static perturbation method, which is currently used in static bifurcation analysis, can also be applied to dynamic bifurcations. A two-time version of the Lindstedt–Poincaré Method and the Multiple Scale Method are employed to analyze a bifurcation problem of codimension two. It is found that the Multiple Scale Method furnishes, in a straightforward way, amplitude modulation equations equal to normal form equations available in literature. With a remarkable computational improvement, the description of the central manifold is avoided. The Lindstedt–Poincaré Method can also be employed if only steady-state solutions have to be determined. An application is illustrated for a mechanical system subjected to aerodynamic excitation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Nonlinear dynamics 7 (1995), S. 285-299 
    ISSN: 1573-269X
    Keywords: Strongly nonlinear oscillators ; nonlinear scales method ; limit cycle ; stability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A non-linear seales method is presented for the analysis of strongly non-linear oseillators of the form % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaamXvP5wqonvsaeHbfv3ySLgzaGqbdiqb-Hha4zaadaGaey4kaSIa% am4zaiaacIcacqWF4baEcaGGPaGae8xpa0JaeqyTduMaamOzaiaacI% cacqWF4baEcqWFSaalcuWF4baEgaGaaiaabMcaaaa!4FEC!\[\ddot x + g(x) = \varepsilon f(x,\dot x{\text{)}}\], where g(x) is an arbitrary non-linear function of the displacement x. We assumed that % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaamXvP5wqonvsaeHbfv3ySLgzaGqbdiab-Hha4jaacIcacqWF0baD% cqWFSaalcqaH1oqzcaGGPaGaeyypa0Jae8hEaG3aaSbaaSqaaiaaic% daaeqaaOGaaiikaiabe67a4jaacYcacqaH3oaAcaGGPaGaey4kaSYa% aabmaeaacqaH1oqzdaahaaWcbeqaaiaad6gaaaaabaGaamOBaiabg2% da9iaaigdaaeaacaWGTbGaeyOeI0IaaGymaaqdcqGHris5aOGae8hE% aG3aaSbaaSqaaiab-5gaUbqabaGccaGGOaGaeqOVdGNaaiykaiabgU% caRiaad+eacaGGOaGaeqyTdu2aaWbaaSqabeaacaWGTbaaaOGaaiyk% aaaa!67B9!\[x(t,\varepsilon ) = x_0 (\xi ,\eta ) + \sum\nolimits_{n = 1}^{m - 1} {\varepsilon ^n } x_n (\xi ) + O(\varepsilon ^m )\], where % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaabsgacqaH+oaEcaGGVaGaaeizaiaadshacqGH9aqpdaaeWaqa% aiabew7aLnaaCaaaleqabaGaamOBaaaaaeaacaWGUbGaeyypa0JaaG% ymaaqaaiaad2gaa0GaeyyeIuoakiaadkfadaWgaaWcbaGaamOBaaqa% baGccaGGOaGaeqOVdGNaaiykaaaa!4FFC!\[{\text{d}}\xi /{\text{d}}t = \sum\nolimits_{n = 1}^m {\varepsilon ^n } R_n (\xi )\], % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaabsgacqaH3oaAcaGGVaGaaeizaiaadshacqGH9aqpdaaeWaqa% aiabew7aLnaaCaaaleqabaGaamOBaaaaaeaacaWGUbGaeyypa0JaaG% imaaqaaiaad2gaa0GaeyyeIuoakiaadofadaWgaaWcbaGaamOBaaqa% baGccaGGOaGaeqOVdGNaaiilaiabeE7aOjaacMcaaaa!5241!\[{\text{d}}\eta /{\text{d}}t = \sum\nolimits_{n = 0}^m {\varepsilon ^n } S_n (\xi ,\eta )\], and R n,S nare to be determined in the course of the analysis. This method is suitable for the systems with even non-linearities as well as with odd non-linearities. It can be viewed as a generalization of the two-variable expansion procedure. Using the present method we obtained a modified Krylov-Bogoliubov method. Four numerical examples are presented which served to demonstrate the effectiveness of the present method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 4123-4155 
    ISSN: 0029-5981
    Keywords: Petrov-Galerkin methods ; weighting parameters ; optimization ; spectral averaged phase errors ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A Fourier analysis of the linear and quadratic N + 1 and N + 2 Petrov-Galerkin finite element methods applied to the one-dimensional transient convective-diffusion equation is performed. The results show that a priori optimization of the N + 1 method is not possible because dissipative errors are introduced as dispersive errors are reduced (any optimization is subjective). However, a priori optimization of the N + 2 Petrov-Galerkin method is possible because the reduction of dispersion errors can be accomplished without the addition of artificial dissipation.The Spectrally Weighted Average Phase Error Method (SWAPEM) for the optimization of the N + 2 Petrov-Galerkin method is introduced, in which the N + 2 weighting parameter is chosen at each time step to minimize the integral over wave number of the phase error of Fourier modes, weighted by the frequency content of the global solution at the previous time step (obtained via FFT). The method is dynamic, and general in that the dependence of the weighting parameter on the solution waveform is accounted for. Optimal values predicted by the method are in excellent agreement with those suggested by the numerical experimentation of others. Simulations of the pure convective transport of a Gaussian plume and a triangle wave are discussed to illustrate the effectiveness of the method.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 13 (1997), S. 977-986 
    ISSN: 1069-8299
    Keywords: sequential function approximation ; interpolation functions ; optimization ; parallel direct search ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A computational method for the solution of differential equations is proposed. With this method an accurate approximation is built by incremental additions of optimal local basis functions. The parallel direct search software package (PDS), that supports parallel objective function evaluations, is used to solve the associated optimization problem efficiently. The advantage of the method is that, although it resembles adaptive methods in computational mechanics, an a priori grid is not necessary. Moreover, the traditional matrix construction and evaluations are avoided. Computational cost is reduced while efficiency is enhanced by the low-dimensional parallel-executed optimization and parallel function evaluations. In addition, the method should be applicable to a broad class of interpolation functions. Results and global convergence rates obtained for one- and two-dimensional boundary value problems are satisfactorily compared to those obtained by the conventional Galerkin finite element method. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Chichester : Wiley-Blackwell
    Communications in Numerical Methods in Engineering 13 (1997), S. 999-1008 
    ISSN: 1069-8299
    Keywords: optimization ; sensitivity analysis ; constraint approximation ; non-linear analysis ; finite element method ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: For the finite element non-linear analysis of engineering problems combined with an optimization method, two techniques - a semi-analytical sensitivity method and bi-point constraint approximation - have been proposed. To validate the proposed methods, a raft foundation on a soil medium has been analysed and the results have been compared. From the numerical results, it has been found that, for non-linear analysis, the semi-analytical sensitivity method is more efficient than the finite difference method and the bi-point approximation gives results which compare favourably with the finite element results. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 777-796 
    ISSN: 0029-5981
    Keywords: finite element method ; force method ; reanalysis ; eigenvalue ; structural variation ; optimization ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents a force-based finite element method that involves eigen-space transformation of element stiffness matrices in the first analysis. In each subsequent analysis (‘reanalysis’) associated with structural variations, the solution obtained previously is modified making use of intrinsic properties of eigen solutions and avoiding the time-consuming task of solving a large system of equations. The structural variations may involve changes in material properties, birth or death of elements, or change in boundary conditions. Numerical examples are presented to compare the accuracy and computational efficiency of the proposed method with the displacement-based finite element method. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 655-687 
    ISSN: 0029-5981
    Keywords: crashworthiness ; multibody dynamics ; flexible structures ; simulation ; design ; optimization ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Different formulations based on multibody dynamics are shown to be suitable for the development of a methodology for the impact simulation and crashworthiness design of railway vehicles. The proposed design methodology comprises different computer-aided tools of increasing complexity and accuracy which can be used with greater advantage and efficiency in the different design stages of railway stock. In general, the crashworthiness design methods and associated multibody dynamic tools which are presented in this paper require information to be obtained from numerical or experimental crush tests of specific structural components, subassemblies and critical energy absorption devices normally located in car extremities. This hybrid feature lends to the present design process various efficiency gains as a result of a better understanding of the crash and different collapse mechanisms and ease of use. To access the merits of the present methodologies some new designs are discussed and the application of the proposed numerical tools is illustrated for different structural configurations of car extremities. A formulation for the sensitivity analysis and optimization of planar constrained mechanical systems is also presented. An example of crashworthiness design of an end underframe model of a railway car is solved to demonstrate the use of the methodology. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 26 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 433-450 
    ISSN: 0029-5981
    Keywords: mesh partitioning ; finite elements ; parallel computing ; optimization ; heuristics ; frontal method ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: We address the problem of automatic partitioning of unstructured finite element meshes in the context of parallel numerical algorithms based on domain decomposition. A two-step approach is proposed, which combines a direct partitioning scheme with a non-deterministic procedure of combinatorial optimization. In contrast with previously published experiments with non-deterministic heuristics, the optimization step is shown to produce high-quality decompositions at a reasonable compute cost. We also show that the optimization approach can accommodate complex topological constraints and minimization objectives. This is illustrated by considering the particular case of topologically one-dimensional partitions, as well as load balancing of frontal subdomain solvers. Finally, the optimization procedure produces, in most cases, decompositions endowed with geometrically smooth interfaces. This contrasts with available partitioning schemes, and is crucial to some modern numerical techniques based on domain decomposition and a Lagrange multiplier treatment of the interface conditions.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 1021-1030 
    ISSN: 0029-5981
    Keywords: optimization ; finite element ; magnetostatic ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In this paper, we present an improvement of the optimization technique of the moving asymptotes applied to a class of magnetostatic design problem. Our approach includes, among other aspects, an active set strategy which turns possible to find feasible points during the iterative process. We present some numerical results obtained on real-life case studies where the functions are computed by a complex finite-element routine.
    Additional Material: 4 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 1721-1738 
    ISSN: 0029-5981
    Keywords: probabilistic analysis ; optimization ; safety index ; structural reliability ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The objective of this paper is to conduct reliability-based structural optimization in a multidisciplinary environment. An efficient reliability analysis is developed by expanding the limit functions in terms of intermediate design variables. The design constraints are approximated using multivariate splines in searching for the optimum. The reduction in computational cost realized in safety index calculation and optimization are demonstrated through several structural problems. This paper presents safety index computation, analytical sensitivity analysis of reliability constraints and optimization using truss, frame and plate examples.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 2265-2281 
    ISSN: 0029-5981
    Keywords: explicit and implicit time integration ; stability ; trapezoidal rule ; structural dynamics ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: A simple explicit solution technique for problems in structural dynamics, based on a Modified Trapezoidal rule Method (MTM) approximation of the governing ordinary differential equations, is developed. The resulting conditionally stable explicit method (MTM) can be easily implemented and is extremely simple to use. Particular attention is focused herein on the concept of numerical stability of the proposed method for a free-vibrational response of a linear undamped Single-Degree-Of-Freedom system (SDOF). To examine the effectiveness, strengths, and limitations of MTM, error analyses for the natural period, the displacement, the velocity and the associated phase angle for a free undamped simple mass-spring system are derived and compared with Modified Euler Method (MEM) and the well-known Newmark Beta Method (NBM). Numerical examples for a SDOF system and a Multi-Degree-Of-Freedom (MDOF) system are presented to illustrate the strengths and the limitations of the proposed method.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 1951-1965 
    ISSN: 0029-5981
    Keywords: optimization ; thermoelasticity ; topology ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: This paper presents the development of a computational model for the topology optimization problem, using a material distribution approach, of a 2-D linear-elastic solid subjected to thermal loads, with a compliance objective function and an isoperimetric constraint on volume. Defining formally the augmented Lagrangian associated with the optimization problem, the optimality conditions are derived analytically. The results of analysis are implemented in a computer code to produce numerical solutions for the optimal topology, considering the temperature distribution independent of design. The design optimization problem is solved via a sequence of linearized subproblems. The computational model developed is tested in example problems. The influence of both the temperature and the finite element model on the optimal solution obtained is analysed.
    Additional Material: 9 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 399-419 
    ISSN: 0029-5981
    Keywords: flaw identification ; boundary element method ; inverse analysis ; crack problems ; optimization ; sensitivity analysis ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In this paper a new boundary element formulation is presented for the identification of the location and size of internal flaws in two-dimensional structures. An introduction to inverse analysis is given, with special reference to methods of flaw identification, along with a brief review of the optimization methods employed. Both the standard boundary element and the dual boundary element method are presented, with the dual boundary element method proposed as the basis for the new formulation. The flaw identification method is presented, along with the computation of the boundary displacement and traction derivatives and the specialized analytical integration used for cracked boundaries. Examples are given to demonstrate the accuracy of the sensitivity values and the performance of flaw location.
    Additional Material: 14 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 1213-1230 
    ISSN: 0029-5981
    Keywords: metal forming ; preform design ; forging ; sensitivity analysis ; optimization ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: An optimization algorithm for preform die shape design in metal-forming processes is developed in this paper. The preform die shapes are represented by cubic B-spline curves. The control points of the B-spline are used as the design variables. The optimization objective is to reduce the difference between the realized and desired final forging shapes. The sensitivities of the objective function with respect to the design variables are developed in detail. The numerical examples show that the optimization method and the sensitivity analysis developed in this paper are very useful and the design results are satisfactory. Importantly, the preform die shapes designed by this method are easily manufacturable and can be implemented in practical metal-forming operations. This optimization method and the sensitivity analysis can also be applied in the preform design of complex industrial metal-forming problems. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 11 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 1505-1524 
    ISSN: 0029-5981
    Keywords: linkages ; synthesis ; position problems ; optimization ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The present paper describes a procedure for the optimal dimensional synthesis of mechanisms which is based on the solution of non-linear position problems. Planar mechanisms are modelled very easily by means of finite elements of bi-hinged rod type. The judicious choice of constraint conditions makes possible the solution of classical position problems: initial, finite-displacement, deformed and static-equilibrium problems, as well as the main types of dimensional synthesis: path generation, functions, rigid body guidance, mixed, and multiple. A single synthesis error function applies to all these types, and moreover is general since it is valid for mechanisms of any configuration. This function is based on the idea that the best mechanism for the given synthesis conditions is the one that least needs to be deformed when it is obliged to satisfy them exactly, to which end the elastic deformation of the elements is permitted. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 6 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 165-188 
    ISSN: 0029-5981
    Keywords: engineering design ; optimization ; discrete variables ; numerical methods ; test problems ; evaluation of methods ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Continuous-discrete variable non-linear optimization problems are defined and categorized into six different types. These include a full range of problems from continuous to purely discrete and non-differentiable. Methods for solution of these problems are studied and their characteristics are catalogued. The branch and bound, simulated annealing and genetic algorithms are found to be the most general methods for solving discrete problems. After some enhancements, these and two other methods are implemented into a program for certain applications. Several example problems are solved to study performance of the methods. It is concluded that solution of the mixed variable non-linear optimization problems usually requires considerable more computational effort compared to the continuous variable optimization problems. In addition, there is no guarantee that the best solution has been obtained; however, good practical solutions are usually obtained. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 3 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 1525-1550 
    ISSN: 0029-5981
    Keywords: adjoint problem ; discrete curvature ; finite element method ; free surface flow ; optimization ; quasi-Newton method ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: Optimal shape design approach is applied to numerical computation of a model potential free boundary value problem. The problem is discretized using the finite element method. To test the approach the problem is formulated in both velocity potential and stream function formulation and four different finite element discretizations are used. Associated minimization problem is solved using the quasi-Newton method. Gradient of the cost function is computed by solving the algebraic adjoint equation. Gravity and surface tension forces are included in the model. Viability of the method is showed by solving problems with important effects of gravity and surface tension forces. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 8 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 2325-2341 
    ISSN: 0029-5981
    Keywords: SPH ; explicit time integration ; stability ; stress points ; staggered ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: In this work, the stress-point approach, which was developed to address tension instability and improve accuracy in Smoothed Particle Hydrodynamics (SPH) methods, is further extended and applied for one-dimensional (1-D) problems. Details of the implementation of the stress-point method are also given. A stability analysis reveals a reduction in the critical time step by a factor of 1/√2 when the stress points are located at the extremes of the SPH particle. An elementary damage law is also introduced into the 1-D formulation. Application to a 1-D impact problem indicates far less oscillation in the pressure at the interface for coarse meshes than with the standard SPH formulation. Damage predictions and backface velocity histories for a bar appear to be quite reasonable as well. In general, applications to elastic and inelastic 1-D problems are very encouraging. The stress-point approach produces stable and accurate results. © 1997 by John Wiley & Sons, Ltd.
    Additional Material: 12 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 40 (1997), S. 3767-3783 
    ISSN: 0029-5981
    Keywords: acoustic fluid ; boundary element ; fluid-structure ; retarded potential ; stability ; transient ; Engineering ; Numerical Methods and Modeling
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The Retarded Potential (RP) method, which is a boundary element technique and non-local in both space and time, is employed to discretize the fluid domain for the analysis of transient fluid-structure interaction problems. The retarded potential analysis program RPFS is coupled to the ABAQUS non-linear finite element code to form ABAQUS/RPFS. The standard RP is inherently unstable for time steps below a critical time step that is equal to the maximum distance in the fluid divided by the wave speed. A technique referred to as the Figueiredo method is used to convert the standard RP differential-delay equations for the fluid to simply delay equations, which are more stable. The Figueiredo approach extends the stability range of the standard RP by a factor of approximately 10-20, but this time step is still not small enough to be useful for analysis. Digital signal processing methods are used to further stablize the response of the fluid by removing the oscillating high-frequency noise in the time histories of the solution without introducing phase shifting or any significant damping. Stability of the coupled system is achieved by not extrapolating the structural accelerations. ABAQUS/RPFS is applied to both a rigid and elastic sphere subjected to a plane wave, and the results using the full time histories required are completely stable and quite accurate. With this procedure, the retarded potential method may yet prove to be a valuable analysis tool for transient fluid-structure interaction problems. © 1997 John Wiley & Sons, Ltd.
    Additional Material: 15 Ill.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Chichester [u.a.] : Wiley-Blackwell
    International Journal for Numerical Methods in Engineering 38 (1995), S. 3087-3120 
    ISSN: 0029-5981
    Keywords: structures ; structural design ; optimization ; Lagrangian ; Engineering ; Engineering General
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics , Technology
    Notes: The merits and limitations of the Optimality Criteria (OC) method for the minimum weight design of structures subjected to multiple load conditions under stress, displacement and frequency constraints were investigated by examining several numerical examples. The examples were solved utilizing the OC design code that was developed for this purpose at the NASA Lewis Research Center. This OC code incorporates OC methods available in the literature with generalizations for stress constraints, fully utilized design concepts, and hybrid methods that combine both techniques. It includes multiple choices for Lagrange multiplier and design variable update methods, design strategies for several constraint types, variable linking, displacement and integrated force method analysers, and analytical and numerical sensitivities. On the basis of the examples solved, the optimality criteria for general application were found to be satisfactory for problems with few active constraints or with small numbers of design variables. However, the OC method without stress constraints converged to optimum even for large structural systems. For problems with large numbers of behaviour constraints and design variables, the method appears to follow a subset of active constraints that can result in a heavier design. The computational efficiency of OC methods appears to be similar to some mathematical programming techniques.
    Additional Material: 13 Ill.
    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...