ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Pure adaptive search in global optimization (1992)
    Springer
    Mathematical programming 53 (1992), S. 323-338 
    Details
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; global optimization ; complexity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. That is, at any iteration, the next point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. The complexity of this algorithm is measured by the expected number of iterations required to achieve a given accuracy of solution. We show that for global mathematical programs satisfying the Lipschitz condition, its complexity increases at mostlinearly in the dimension of the problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585710
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Pure adaptive search in monte carlo optimization (1989)
    Springer
    Mathematical programming 43 (1989), S. 317-328 
    Details
    ISSN: 1436-4646
    Keywords: Random search ; Monte Carlo optimization ; convex programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Pure adaptive search constructs a sequence of points uniformly distributed within a corresponding sequence of nested regions of the feasible space. At any stage, the next point in the sequence is chosen uniformly distributed over the region of feasible space containing all points that are equal or superior in value to the previous points in the sequence. We show that for convex programs the number of iterations required to achieve a given accuracy of solution increases at most linearly in the dimension of the problem. This compares to exponential growth in iterations required for pure random search.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01582296
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Improving Hit-and-Run for global optimization (1993)
    Springer
    Journal of global optimization 3 (1993), S. 171-192 
    Details
    ISSN: 1573-2916
    Keywords: Random search ; Monte Carlo optimization ; algorithm complexity ; global optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Improving Hit-and-Run is a random search algorithm for global optimization that at each iteration generates a candidate point for improvement that is uniformly distributed along a randomly chosen direction within the feasible region. The candidate point is accepted as the next iterate if it offers an improvement over the current iterate. We show that for positive definite quadratic programs, the expected number of function evaluations needed to arbitrarily well approximate the optimal solution is at most O(n5/2) wheren is the dimension of the problem. Improving Hit-and-Run when applied to global optimization problems can therefore be expected to converge polynomially fast as it approaches the global optimum.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01096737
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    Algebraic grid generation with control points (1992)
    In:  Other Sources
    Details
    Publication Date: 2011-08-24
    Description: The control-point form (CPF) formulation is an algebraically defined class of coordinate transformations by means of which the interior form of the coordinates can be manipulated in the local fashion, and any boundary can be either specified or manipulated in a similar manner. Currently, the most intense activity involving CPF is with such graphic interactive codes as TurboI and TurboT, for which detailed illustrative examples are given; these have furnished experience on whose basis future interactive strategies can be developed.
    Keywords: NUMERICAL ANALYSIS
    Type: In: Finite elements in fluids. Vol. 8 (A93-45962 19-34); p. 97-116.
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 5
    facet.materialart.
    Unknown
    Algebraic grid generation (1987)
    In:  Other Sources
    Details
    Publication Date: 2011-08-19
    Description: Algebraic grid generation is the direct expression of a physical coordinate system as a function of a uniform grid in a rectangular computational coordinate system. Algebraic grid generation is based on mathematical interpolation and is presented in general terms of multivariate transfinite interpolation. The multisurface method and the two-boundary technique are described as univariate procedures that can be applied within the context of transfinite interpolation. A technique for grid clustering is described. Problems that are commonly encountered in three-dimensional grid generation are discussed and approaches for dealing with complex physical domains using multiple computational grid blocks are presented.
    Keywords: NUMERICAL ANALYSIS
    Type: Computer Methods in Applied Mechanics and Engineering (ISSN 0045-7825); 64; 285-300
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 6
    facet.materialart.
    Unknown
    An interactive grid generation technique for fighter aircraft geometries (1988)
    In:  Other Sources
    Details
    Publication Date: 2018-12-01
    Description: This paper describes an interactive procedure to construct grids about fighter aircraft using a state-of-the-art workstation. The aircraft are characterized by a fuselage with an integrated canopy over the cockpit, an engine inlet, an area ruled midsection, canards, and highly-swept cranked delta wings or strakes integrated into the wings and tail surfaces. The grid topology, configuration surface grid, exterior grid computation, and computational interactive process are addressed.
    Keywords: NUMERICAL ANALYSIS
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 7
    facet.materialart.
    Unknown
    Applications of Lagrangian blending functions for grid generation around airplane geometries (1990)
    In:  Other Sources
    Details
    Publication Date: 2019-06-28
    Description: A simple procedure has been developed and applied for the grid generation around an airplane geometry. This approach is based on a transfinite interpolation with Lagrangian interpolation for the blending functions. A monotonic rational quadratic spline interpolation has been employed for the grid distributions.
    Keywords: NUMERICAL ANALYSIS
    Type: AIAA PAPER 90-0009
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
  • 8
    facet.materialart.
    Unknown
    Grid generation for computational CFD of full aerodynamic configurations (1990)
    In:  Other Sources
    Details
    Publication Date: 2019-07-13
    Description: It is now possible to compute flow about very complex three-dimensional aerodynamic configurations. Grid generation is an essential part of such computations and a basic capability has been demonstrated. The present problems are: (1) choosing among the competing approaches (structured, unstructured or rectangular); (2) automating and packaging software for grid generation; (3) assessing and assuring grid quality; (4) solid boundary-surface representation and grid generation on solid boundaries; (5) automated domain decomposition (structured grids); (6) grid adaption during the flow solution process. This paper discusses some of the capabilities in the computation of complex three-dimensional grids and addresses some of he current challenges.
    Keywords: NUMERICAL ANALYSIS
    Type: International Congress of Fluid Mechanics; Jan 02, 1990 - Jan 04, 1990; Cairo; Egypt
    Format: text
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    NASA TECHNICAL REPORTS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...