|
SmartDO
SmartDO is a multidisciplinary design optimization software, based on the Direct Global Search technology developed and marketed by FEA-Opt Technology. SmartDO specialized in the CAE-Based optimization, such as CAE ( computer-aided engineering), FEA (finite element analysis), CAD (computer-aided design), CFD (Computational fluid dynamics) and automatic control, with application on various physics phenomena. It is both GUI and scripting driven, allowed to be integrated with almost any kind of CAD/CAE and in-house codes. SmartDO focuses on the direct global optimization solver, which does not need much parametric study and tweaking on the solver parameter. Because of this, SmartDO has been frequently customized as the push-button expert system. History SmartDO was originated in 1995 by its founder (Dr. Shen-Yeh Chen) during his Ph.D. study in Civil Engineering Department of Arizona State University. During 1998 to 2004, SmartDO was continuously developed and applied on aerospace ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Optimization Software
Given a transformation between input and output values, described by a mathematical function ''f'', optimization deals with generating and selecting a best solution from some set of available alternatives, by systematically choosing input values from within an allowed set, computing the output of the function, and recording the best output values found during the process. Many real-world problems can be modeled in this way. For example, the inputs can be design parameters of a motor, the output can be the power consumption, or the inputs can be business choices and the output can be the obtained profit. An optimization problem, in this case a minimization problem, can be represented in the following way :''Given:'' a function ''f'' : ''A'' \to R from some set ''A'' to the real numbers :''Search for:'' an element ''x''0 in ''A'' such that ''f''(''x''0) ≤ ''f''(''x'') for all ''x'' in ''A''. In continuous optimization, ''A'' is some subset of the Euclidean space R''n'', often spec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nonlinear Programming
In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear. Applicability A typical non-convex problem is that of optimizing transportation costs by selection from a set of transportation methods, one or more of which exhibit economies of scale, with various connectivities and capacity constraints. An example would be petroleum product transport given a selection or combination of pipeline, rail tanker, road tanker, river barge, or coastal tankship. Owing to economic batch size the cost functions may have discontin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer-aided Design Software
Computer-aided or computer-assisted is an adjectival phrase that hints of the use of a computer as an indispensable tool in a certain field, usually derived from more traditional fields of science and engineering. Instead of the phrase computer-aided or computer-assisted, in some cases the suffix management system is used. Engineering and production *Computer-aided design ** Computer-aided architectural design ** Computer-aided industrial design ** Electronic and electrical computer-aided design ** Computer-aided garden design *Computer-aided drafting *Computer-aided engineering ** Computer-aided production engineering *Computer-aided manufacturing *Computer-aided quality * Computer-aided maintenance Music and arts * Computer-aided algorithmic composition * Computer-assisted painting Human languages * Computer-aided translation Medicine * Computer-assisted detection * Computer-aided diagnosis * Computer-assisted orthopedic surgery * Computer-aided patient registration * Comput ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer-aided Engineering Software
Computer-aided or computer-assisted is an adjectival phrase that hints of the use of a computer as an indispensable tool in a certain field, usually derived from more traditional fields of science and engineering. Instead of the phrase computer-aided or computer-assisted, in some cases the suffix management system is used. Engineering and production *Computer-aided design ** Computer-aided architectural design ** Computer-aided industrial design ** Electronic and electrical computer-aided design ** Computer-aided garden design *Computer-aided drafting *Computer-aided engineering ** Computer-aided production engineering *Computer-aided manufacturing *Computer-aided quality * Computer-aided maintenance Music and arts * Computer-aided algorithmic composition * Computer-assisted painting Human languages * Computer-aided translation Medicine * Computer-assisted detection * Computer-aided diagnosis * Computer-assisted orthopedic surgery * Computer-aided patient registration * Compute ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer System Optimization Software
A computer is a machine that can be programmed to carry out sequences of arithmetic or logical operations ( computation) automatically. Modern digital electronic computers can perform generic sets of operations known as programs. These programs enable computers to perform a wide range of tasks. A computer system is a nominally complete computer that includes the hardware, operating system (main software), and peripheral equipment needed and used for full operation. This term may also refer to a group of computers that are linked and function together, such as a computer network or computer cluster. A broad range of industrial and consumer products use computers as control systems. Simple special-purpose devices like microwave ovens and remote controls are included, as are factory devices like industrial robots and computer-aided design, as well as general-purpose devices like personal computers and mobile devices like smartphones. Computers power the Internet, which l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Crashworthiness
Crashworthiness is the ability of a structure to protect its occupants during an impact. This is commonly tested when investigating the safety of aircraft and vehicles. Depending on the nature of the impact and the vehicle involved, different criteria are used to determine the crashworthiness of the structure. Crashworthiness may be assessed either prospectively, using computer models (e.g., LS-DYNA, PAM-CRASH, MSC Dytran, MADYMO) or experiments, or retrospectively by analyzing crash outcomes. Several criteria are used to assess crashworthiness prospectively, including the deformation patterns of the vehicle structure, the acceleration experienced by the vehicle during an impact, and the probability of injury predicted by human body models. Injury probability is defined using criteria, which are mechanical parameters (e.g., force, acceleration, or deformation) that correlate with injury risk. A common injury criterion is the head impact criterion (HIC). Crashworthiness is asse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hill Climbing
numerical analysis, hill climbing is a mathematical optimization technique which belongs to the family of local search. It is an iterative algorithm that starts with an arbitrary solution to a problem, then attempts to find a better solution by making an incremental change to the solution. If the change produces a better solution, another incremental change is made to the new solution, and so on until no further improvements can be found. For example, hill climbing can be applied to the travelling salesman problem. It is easy to find an initial solution that visits all the cities but will likely be very poor compared to the optimal solution. The algorithm starts with such a solution and makes small improvements to it, such as switching the order in which two cities are visited. Eventually, a much shorter route is likely to be obtained. Hill climbing finds optimal solutions for convex problems – for other problems it will find only local optima (solutions that cannot be imp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tunneling Protocol
In computer networks, a tunneling protocol is a communication protocol which allows for the movement of data from one network to another. It involves allowing private network communications to be sent across a public network (such as the Internet) through a process called encapsulation. Because tunneling involves repackaging the traffic data into a different form, perhaps with encryption as standard, it can hide the nature of the traffic that is run through a tunnel. The tunneling protocol works by using the data portion of a packet (the payload) to carry the packets that actually provide the service. Tunneling uses a layered protocol model such as those of the OSI or TCP/IP protocol suite, but usually violates the layering when using the payload to carry a service not normally provided by the network. Typically, the delivery protocol operates at an equal or higher level in the layered model than the payload protocol. Uses A tunneling protocol may, for example, allow a foreig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nonlinear Programming
In mathematics, nonlinear programming (NLP) is the process of solving an optimization problem where some of the constraints or the objective function are nonlinear. An optimization problem is one of calculation of the extrema (maxima, minima or stationary points) of an objective function over a set of unknown real variables and conditional to the satisfaction of a system of equalities and inequalities, collectively termed constraints. It is the sub-field of mathematical optimization that deals with problems that are not linear. Applicability A typical non-convex problem is that of optimizing transportation costs by selection from a set of transportation methods, one or more of which exhibit economies of scale, with various connectivities and capacity constraints. An example would be petroleum product transport given a selection or combination of pipeline, rail tanker, road tanker, river barge, or coastal tankship. Owing to economic batch size the cost functions may have discontin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stochastic Programming
In the field of mathematical optimization, stochastic programming is a framework for modeling optimization problems that involve uncertainty. A stochastic program is an optimization problem in which some or all problem parameters are uncertain, but follow known probability distributions. This framework contrasts with deterministic optimization, in which all problem parameters are assumed to be known exactly. The goal of stochastic programming is to find a decision which both optimizes some criteria chosen by the decision maker, and appropriately accounts for the uncertainty of the problem parameters. Because many real-world decisions involve uncertainty, stochastic programming has found applications in a broad range of areas ranging from finance to transportation to energy optimization. Two-stage problems The basic idea of two-stage stochastic programming is that (optimal) decisions should be based on data available at the time the decisions are made and cannot depend on futur ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Genetic Algorithm
In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, etc. Methodology Optimization problems In a genetic algorithm, a population of candidate solutions (called individuals, creatures, organisms, or phenotypes) to an optimization problem is evolved toward better solutions. Each candidate solution has a set of properties (its chromosomes or genotype) which can be mutated and altered; traditionally, solutions are represented in binary as strings of 0s and 1s, but other encodings are also possible. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
List Of Numerical Analysis Software
Listed here are notable end-user computer applications intended for use with numerical or data analysis: Numerical-software packages General-purpose computer algebra systems Interface-oriented Language-oriented Historically significant * Expensive Desk Calculator written for the TX-0 and PDP-1 The PDP-1 (''Programmed Data Processor-1'') is the first computer in Digital Equipment Corporation's PDP series and was first produced in 1959. It is famous for being the computer most important in the creation of hacker culture at Massachusetts ... in the late 1950s or early 1960s. * S is an (array-based) programming language with strong numerical support. R is an implementation of the S language. See also References {{DEFAULTSORT:Numerical Analysis Software Lists of software Mathematics-related lists *Software ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Crashworthiness")
