Engineering topics

Salama, M.

Publications and source records attributed to Salama, M..

At least 37 records · Page 2

NASA NTRS1990

A homotopy approach for combined control-structure optimization - Constructive analysis and numerical examples

This paper outlines the development of methods for the combined control-structure optimization of physical systems encountered in the technology of large space structures. The objectives of the approach taken in this paper is not to produce the 'best' optimized design, but rather to efficiently produce a family of design options so as to assist in early trade studies, typically before hard design constraints are imposed. The philosophy is that these are candidate designs to be passed on for further considerations, and their function is more to guide the development of the system design rather than to represent the ultimate product. A homotopy approach involving multi-objective functions is developed for this purpose. Analytical and numerical examples are also presented.

Scheid, R. E.↗

NASA NTRS1990

Continuation methods in multiobjective optimization for combined structure control design

A homotopy approach involving multiobjective functions is developed to outline the methods that have evolved for the combined control-structure optimization of physical systems encountered in the technology of large space structures. A method to effect a timely consideration of the control performance prior to the finalization of the structural design involves integrating the control and structural design processes into a unified design methodology that combines the two optimization problems into a single formulation. This study uses the combined optimization problem as a family of weighted structural and control costs. Connections with vector optimizations are described; an analysis of the zero-set of required conditions is made, and a numerical example is given.

Milman, M.↗

NASA NTRS1989

Combined control-structure optimization

An approach for combined control-structure optimization keyed to enhancing early design trade-offs is outlined and illustrated by numerical examples. The approach employs a homotopic strategy and appears to be effective for generating families of designs that can be used in these early trade studies. Analytical results were obtained for classes of structure/control objectives with linear quadratic Gaussian (LQG) and linear quadratic regulator (LQR) costs. For these, researchers demonstrated that global optima can be computed for small values of the homotopy parameter. Conditions for local optima along the homotopy path were also given. Details of two numerical examples employing the LQR control cost were given showing variations of the optimal design variables along the homotopy path. The results of the second example suggest that introducing a second homotopy parameter relating the two parts of the control index in the LQG/LQR formulation might serve to enlarge the family of Pareto optima, but its effect on modifying the optimal structural shapes may be analogous to the original parameter lambda.

Salama, M.↗

NASA NTRS1989

Recent experience in simultaneous control-structure optimization

To show the feasibility of simultaneous optimization as design procedure, low order problems were used in conjunction with simple control formulations. The numerical results indicate that simultaneous optimization is not only feasible, but also advantageous. Such advantages come at the expense of introducing complexities beyond those encountered in structure optimization alone, or control optimization alone. Examples include: larger design parameter space, optimization may combine continuous and combinatoric variables, and the combined objective function may be nonconvex. Future extensions to include large order problems, more complex objective functions and constraints, and more sophisticated control formulations will require further research to ensure that the additional complexities do not outweigh the advantages of simultaneous optimization. Some areas requiring more efficient tools than currently available include: multiobjective criteria and nonconvex optimization. Efficient techniques to deal with optimization over combinatoric and continuous variables, and with truncation issues for structure and control parameters of both the model space as well as the design space need to be developed.

Salama, M.↗

NASA NTRS1989

Selection of active member locations in adaptive structures

The effective use of multiple passive and active members in adaptive structures necessitates that these members be optimally distributed throughout the structure. In truss structures, the problem falls into the class of combinatorial optimization for which the solution becomes exceedingly intractable as the problem size increases. This is overcome by using the simulated annealing algorithm to obtain near optimal locations for passive and/or active members. The maximization of the rate of energy dissipation over a finite time period as the measure of optimality is adopted. The selection of optimal locations for both passive and active members is consistently treated through the use of the energy dissipation rate criterion within the simulated annealing algorithm. Numerical examples are used to illustrate the effectiveness of the methodology for large truss structures.

Chen, G.-S.↗

NASA NTRS1989

Methods for combined control-structure optimization

This paper outlines the development of methods for the combined control-structure optimization of physical systems encountered in the technology of large space structures. The objective of the approach taken in this paper is not to produce the 'best' optimized design, but rather to efficiently produce a family of design options so as to asist in early trade studies, typically before hard design constraints are imposed. The philosophy is that these are candidate designs to be passed on for further consideration, and their function is more to guide the development of the system design rather than to represent the ultimate product. A homotopy approach involving multi-objective functions is developed for this purpose, and a numerical example is presented.

Milman, M.↗

NASA NTRS1988

A parallel householder tridiagonalization stratagem using scattered row decomposition

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term 'Scattered Row Decomposition'. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.

Chang, H. Y.↗

NASA NTRS1988

A parallel Householder tridiagonalization stratagem using scattered square decomposition

The parallel stratagem in this paper uses scattered square decomposition, introduced by Fox (1985), for its data assignment and then exploits parallelism in the solution steps of the sequential Householder tridiagonalization algorithm. One may condense a real symmetric full matrix A of order n into a tridiagonal form by the stratagem in concurrent machines where N(=D-squared) processors are used. Expressions for efficiency and speedup are given for the evaluation of the stratagem. An alternative stratagem which requires less data transmission but more computations is also discussed. The results shown that the Householder method of tridiagonalization may be implemented on a concurrent machine efficiently by scattered square decomposition provided that the number of matrix elements contained in each processor is much larger than the number of processors of the concurrent machine, and the ratio of the time to transmit one data item from one processor to any other processor to the time to perform a floating-point arithmetic operation is small enough.

Chang, H. Y.↗

NASA NTRS1988

Eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors

Symmetric tridiagonal eigenvalue problems may arise indirectly in structural dynamic analysis. An algorithm for eigenvalue computation of large symmetric tridiagonal matrices on concurrent processors to meet the challenge of the new emerging computer hardware technology is presented. A standard bisection method in conjunction with Sylvester's Theorem is chosen to be converted into a parallel N-section algorithm. This parallel algorithm takes advantage of the multi-processor environment by carrying out N (number of processors) triangular factorizations of chosen shifted matrices in all processors concurrently and by minimizing communication between processors. The algorithm is designed for local-memory concurrent processors, i.e. message passing type processors. The efficiency and speed-up are given in terms of problem and machine parameters. The algorithm is very efficient when both the number of processors and the number of eigenvalues to be extracted are much smaller than the order of the tridiagonal matrix.

Chang, H. Y.↗

NASA NTRS1987

Optimal placement of excitations and sensors for verification of large dynamical systems

The computationally difficult problem of the optimal placement of excitations and sensors to maximize the observed measurements is studied within the framework of combinatorial optimization, and is solved numerically using a variation of the simulated annealing heuristic algorithm. Results of numerical experiments including a square plate and a 960 degrees-of-freedom Control of Flexible Structure (COFS) truss structure, are presented. Though the algorithm produces suboptimal solutions, its generality and simplicity allow the treatment of complex dynamical systems which would otherwise be difficult to handle.

Salama, M.↗

NASA NTRS1987

Optimal mapping of irregular finite element domains to parallel processors

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Flower, J.↗

NASA NTRS1986

Parallel solution of closely coupled systems

The odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.

Utku, S.↗

NASA NTRS1986

Concurrent Cholesky factorization of positive definite banded Hermitian matrices

First, the Cholesky factorization is extended to cover uniformly partitioned banded positive definite matrices of rank n which may be real symmetric or Hermitian. Then, two stratagems are given for the use of the algorithm in concurrent machines where the number of processing elements is less than required to factor the matrix in as few serial steps as possible, and where uniformly high efficiency is expected from all processing elements. Expressions are given for the efficiency factor e appearing in the speed-up expression q = eN, and these are specialized for the N node hypercube machine as a function of partition size s, the number N of processing elements of the hypercube machine, and the cost mu of interelement transmission relative to computation. It is shown that the efficiency factor e is inversely proportional to mu/s, and that e is almost independent of N when N is large and mu/s = 0. The task is completed in n/s serial steps with no limit on n. The half bandwidth b of the matrix is 2 Ns.

Utku, S.↗

NASA NTRS1986

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗

NASA NTRS1985

Cost Considerations in Nonlinear Finite-Element Computing

Conference paper discusses computational requirements for finiteelement analysis using quasi-linear approach to nonlinear problems. Paper evaluates computational efficiency of different computer architecturtural types in terms of relative cost and computing time.

Utku, S.↗

NASA NTRS1985

Optimization of Controlled Structures

A formulation is presented for the coupled optimal design of a structural system and its control by defining a composite objective function as a linear combination of two components: a structural objective and a control objective. For the case when the structural objective is a function of the structural design variables only, and when the control objective is represented by the quadratic functional of the response and control energy, one can analytically express the optimal control in terms of any set of admissible structural design variables. The expression for the optimal control is used recursively in an iterative Newton-Raphson search scheme, the goal of which is to determine a corresponding optimal set of structural design variables that minimize the composite objective function. A numerical example is given to illustrate the computational procedure.

Salama, M.↗

NASA NTRS1985

Direct computation of optimal control of forced linear system

It is known that the optimal control of a forced linear system may be reduced to that of tracking the system without forces. The solution of the tracking problem is available via the costate variables method. This procedure is computationally expensive for large order systems. It requires solution of matrix Riccati equation and two final value problems. An alternate approach is outlined for the direct computation of the optimal control. Instead of Riccati equation, a matrix Volterra integral must be solved. For this purpose two computational schemes are described, and an illustrative example is given. The results compare favorably with the classical solution. This alternative approach may be especially useful for the control of large space structure where large order models are required.

Utku, S.↗

NASA NTRS1985

Parallel solution of closely coupled systems

An odd-even permutation and a nested dissection technique were used to circumvent the strong seriality of a system of closely coupled equations. The effect of transforming the n x n Hermitian definite positive matrix coefficient on the topology of Cholesky factors is discussed. A series of directed graphs is constructed in order to show the computational steps required for the odd-even permutation. Numerical expressions for the speed-up and efficiency of parallel N-processing techniques and sequential processing by a single computer are derived. Similar expressions are derived for the case of insufficient processing capacity. The application of the odd-even permutation to the ensemble class of computer architectures is demonstrated.

Utku, S.↗