have invested in supercomputer systems, which have cost up to tens of millions of dollars each. Over the past year or so, however, the future of vecto
|
|
- Adele Bailey
- 5 years ago
- Views:
Transcription
1 MEETING THE NVH COMPUTATIONAL CHALLENGE: AUTOMATED MULTI-LEVEL SUBSTRUCTURING J. K. Bennighof, M. F. Kaplan, y M. B. Muller, y and M. Kim y Department of Aerospace Engineering & Engineering Mechanics The University of Texas at Austin Austin, Texas ABSTRACT Noise, Vibration and Harshness (NVH) analysis has presented a formidable computational challenge in the last several years. Accurate prediction of automobile frequency response at higher frequencies requires FE models which have millions of DOF. For obtaining frequency response over a broad frequency range, only the modal frequency response approach has been practical, and only vector supercomputers have been capable of solving for natural frequencies and modes in an acceptable amount of time. However, these machines are very expensive, and their future availability is uncertain. In the automated multi-level substructuring (AMLS) method, a large FE model is automatically divided into many substructures, and the model is transformed so that response is represented in terms of substructure eigenvectors. The numerical example demonstrates that the frequency response of a 2.9 million DOF FE car body model can be obtained more quickly using a single workstation processor with AMLS than it can be obtained using a supercomputer and the modal frequency response approach. NOMENCLATURE! : radian excitation frequency M; B; K;?: mass, viscous damping, stiness, structural damping matrices u; F : vectors of FE nodal displacements, forces : global structural damping parameter L; S : substructure \local," \shared" DOFs, partitions : matrix of substructure xed-interface eigenvectors : matrix of substructure \constraint modes" p : vector of substructure modal coordinates Associate Professor (bennighof@mail.utexas.edu). y Graduate Research Assistant. 1.INTRODUCTION An important objective of NVH (noise, vibration and harshness) frequency response FE analysis is prediction of noise levels as high as possible in the audible frequency range. This enables passenger comfort and perceived quality to be improved based on numerical simulation, rather than on costly and timeconsuming prototyping and testing. Until very recently, largescale NVH analysis has only been practical on vector supercomputers. The frequency range that could be addressed has been limited by the expense of processing on these machines, and by the amount of computer time required. In order to obtain acceptable accuracy at higher frequencies, FE models with over one million DOF are constructed. Because frequency response is desired at many frequencies, direct or iterative solutions in terms of all of the FE DOF are not feasible, so the modal frequency response approach is used instead. In the modal frequency response approach, a partial eigensolution is computed for the entire FE model, to obtain eigenpairs up to a cuto frequency based on the highest desired response frequency. Then the frequency response problem is projected onto the subspace of computed global eigenvectors. For the eigensolution, the block Lanczos eigensolver is used in conjunction with a sparse direct (out-of-core) solver. Unfortunately, attempts to parallelize the Lanczos algorithm for problems of this size have met with very limited success. Another obstacle is that for the Lanczos algorithm, the number of oating point operations per memory reference is relatively low. For this reason, a computer must have a high memory bandwidth to keep processors supplied with data. As a result, vector supercomputers have proven to be much faster for this algorithm than microprocessor-based systems. In the last several years, nearly all of the major automakers 1
2 have invested in supercomputer systems, which have cost up to tens of millions of dollars each. Over the past year or so, however, the future of vector supercomputers has become questionable as multiprocessor machines, with more favorable price/performance ratios on most applications, have become available, and commercial software has emerged which can effectively exploit capabilities of these machines. As the number of applications on which supercomputers oer a substantial performance advantage has decreased, the future economic viability of these machines has become less certain. In short, NVH analysis by conventional methods requires very expensive supercomputer hardware that may not be available for much longer. The size of FE models that can be handled and the frequency range that can be addressed are limited by the computational expense associated with frequency response analysis. Over the last few years, a new method known as automated multi-level substructuring (AMLS) has been developed for frequency response analysis of large FE models.[1,2] In AMLS, the FE model is automatically subdivided into thousands of substructures in a tree topology. Frequency response is represented in terms of substructure eigenvectors rather than global modes of vibration. Probably the greatest advantage of AMLS is that it enables frequency response analysis to be done on microprocessor-based systems, including workstations, rather than supercomputers. Because AMLS requires much less memory bandwidth and fewer oating point operations than the conventional modal frequency response approach, large jobs require less time on a single workstation processor using AMLS than they require on a supercomputer using NASTRAN software, as is demonstrated in the numerical example for this paper. AMLS has much lower disk space requirements than the modal frequency response approach, because in the conventional approach, thousands of eigenvectors and iteration vectors, expressed in all of the FE DOF, must be written to disk. In contrast, in AMLS it is not necessary to produce eigenvectors in all FE DOF. As a result, large jobs can be processed with tens of gigabytes of workstation disk space, rather than the much larger amounts typical on supercomputers. AMLS is also inherently more parallelizable than the Lanczos algorithm. Dierent substructures can be processed simultaneously and independently. Also, as transformation of the FE model to the substructure eigenvector representation progresses toward the root of the substructure tree, there is more opportunity for parallelizing the computation associated with each individual substructure. Evidently, with the capabilities that AMLS brings, there is potential for transforming the NVH enterprise from its present state, in which FE models are limited in size to about 2 million DOF and must be processed in batch on supercomputer systems. Jobs require so much CPU time and disk space that only a relatively small number of analyses can be performed to assess and improve NVH performance. The limitation on model size can be increased dramatically, improving accuracy and frequency range that can be addressed using models created with a high level of automation. The use of inexpensive microprocessor-based systems with multiple processors will enable rapid job turnaround and much more opportunity to optimize NVH performance. In the next section, the procedure for transforming FE models to the substructure mode representation is described. The following section gives an overview of procedures for approximating a structure's frequency response and global eigensolution after its model has been transformed. For a numerical example, AMLS is used to solve for the frequency response of a model having nearly 3 million DOF, and the results are compared with those obtained using commercial NASTRAN software on a supercomputer. Conclusions are summarized in the nal section. 2. MULTI-LEVEL SUBSTRUCTURING Frequency response of a FE model of a structure is typically governed by a system of equations of the form??! 2 M + i!b + (1 + i)k + i? u = F : (1) Here, damping is modeled using several possible approaches, including viscous damping (matrix B), structural damping that is globally uniform (scalar ), or structural damping which deviates locally from the global structural damping level (matrix?), typically for elements whose material properties dier from those of the predominant structural material. Damping can also be modeled using constant or frequency-dependent modal damping factors in modal frequency response computation. The FE model is transformed so that response is represented in terms of substructure modes. The rst step is to partition the model automatically into substructures on a number of levels, based on the sparsity structure of the system matrices. Substructures on the lowest level consist of a small number of nite elements. These \child" substructures are assembled together to form \parents," which are assembled together to form \grandparents," and so on until the model of the complete structure has been assembled. This results in a \tree" topology for the substructures, whose highest levels are shown in Figure 1 for the case in which each substructure has two \children". For large FE models, substructures typically number at least in the thousands. Within a substructure on the lowest level, displacement degrees of freedom are partitioned into two sets. One set consists of both \interface" and \forced" degrees of freedom, i.e., those that are shared with adjacent substructures at interfaces, and those that correspond to nonzeros in the force vector. These are called \shared" degrees of freedom, since the substructure shares these directly with its environment, in a general sense. 2
3 where I represents an identity submatrix. Damping matrices B and/or? are transformed similarly. Figure 1. Substructure tree. The remaining degrees of freedom are called \local" degrees of freedom. They are not excited directly, but only through coupling with the \shared" degrees of freedom. The substructure displacement vector u is partitioned into u S and u L. In AMLS, local degrees of freedom are represented with a quasistatic dependence on shared degrees of freedom, with deviation from quasistatic dependence represented using substructure \xed interface mode" eigenvectors. This combination of quasistatic dependence and modal response was used by Hurty [3] in a form which explicitly preserved substructure rigid body modes. Craig and Bampton [4] observed that substructure rigid body modes do not need to be preserved explicitly, and this led to a more streamlined formulation. Substructure response is represented in Craig-Bampton form as u = u L L L p p = = [ ] u S 0 I u S u S ; (2) where L satises the algebraic eigenvalue problem K LL L = M LL L L. Here, substructure stiness and mass matrices K and M are partitioned as u is partitioned, and L is a diagonal matrix of eigenvalues. The submatrix L is given by L =?K?1 LL K LS, and p is a vector of substructure modal coordinates. As a result of this transformation from the substructure's FE model to the quasistatic/modal representation, the substructure stiness matrix becomes, assuming that eigenvectors are massnormalized, ~K = [ ] T K LL K LS K SL K SS [ ] = L 0 0 ~ K ; (3) where o-diagonal submatrices are null due to the denition of. The substructure mass matrix is transformed to ~M = [ ] T M LL M LS I M ~ [ ] = ; M SL M SS ~M ~M (4) Once lowest-level \child" substructures have been transformed, they are assembled together to form \parent" substructures on the next level. Since local child degrees of freedom are represented implicitly in terms of shared degrees of freedom by default, parent degrees of freedom are considered to consist only of child shared degrees of freedom. From these, local and shared degrees of freedom for parents are identied, and parent models are transformed as the child substructure models were. Parent \modes" are not intended to be accurate approximations of physical modes of vibration. Instead, they constitute an ecient reduced subspace with useful orthogonality properties. Assembly to form higher-level substructures, and transformation to the quasistatic/modal representation, continues until a model for the entire structure has been assembled. If all \forced" degrees of freedom are included as \shared" degrees of freedom at all levels, all degrees of freedom that have been \local" for lower-level substructures implicitly depend quasistatically on forced and other shared degrees of freedom in the last assembled model. As a result, static response of the structure is represented exactly without using any modes of lower-level substructures. Once a model for the entire structure has been assembled, its degrees of freedom that are not forced are treated in the same manner as local degrees of freedom for lower-level substructures, and forced degrees of freedom are treated as the only shared degrees of freedom. A partial eigensolution is found and the model is transformed as described above. After this transformation, the only remaining explicit degrees of freedom in the model are forced degrees of freedom. One last eigensolution is found, in which only the forced degrees of freedom appear. Response of the structure can then be expressed entirely in terms of modes of substructures on all levels. The cost of performing this transformation consists of the costs of obtaining the and matrices, and of transforming M, K, and possibly B and/or?. A comparison with the cost of sparse direct methods can be made easily because of the similarity between multi-level substructuring and the multifrontal sparse solution approach [5]. In the latter approach, as described in [6], degrees of freedom internal to individual elements are rst eliminated by static condensation. Then pairs of elements are assembled together and degrees of freedom that become internal to the pairs are similarly eliminated. Pairs of superelements are assembled together on higher and higher levels, with elimination of internal degrees of freedom at each level, until the entire structure FE model has been assembled. If substructures on multiple levels correspond to the superelements generated during the multifrontal solution process, generation of substructure matrices and transformation of K requires operations very similar to those required for sparse factorization of K. The main dierence is that, in AMLS, at every 3
4 elimination of degrees of freedom by static condensation, a partial eigensolution is obtained. The substructure modes that are computed can then be used to augment the sparse factorization so that it can be used to compute response at nonzero frequency. The partial eigensolutions are economical because substructure eigenvalue problems are very small, and their eigenvalues are typically well separated, resulting in rapid convergence. The fact that substructure stiness matrices have already been factored can be exploited. In implementation, a cuto frequency for substructure natural frequencies is selected based on the response problems of interest. Typically many substructures do not have any natural frequencies below the cuto frequency. The number of eigenvectors found determines the cost of obtaining ~ M submatrices. The transformation cost for ~ M is somewhat greater than for K ~ because of cancellation in the latter case that does not occur in the former. The cost of transforming damping matrices is comparable to that of transforming them for a global modal representation. Of course, when neither B nor? is used, or when damping is modeled using a linear combination of the mass and stiness matrices as a damping matrix, the cost of transforming the damping matrix is negligible. Overall, the cost of transforming the model can be expected to be several times the cost of a sparse factorization of the global stiness matrix. As a result of the transformation, the stiness matrix from the FE discretization is replaced with a much smaller diagonal matrix of substructure eigenvalues. The FE mass matrix is replaced with a much smaller matrix having ones on the diagonal. All other nonzeros can be conned to rectangular submatrices that represent coupling between substructures and their ancestors or descendants. Transformed damping matrices are similarly populated, except that the identity matrices on the diagonal are replaced with submatrices, which are diagonal in certain wellknown special cases. 3. OBTAINING SOLUTIONS Once the FE model has been transformed to the representation in terms of substructure eigenvectors, as described in the preceding section, it can be used to approximate either frequency response or the global eigensolution. The frequency response problem, after projection onto the substructure mode subspace, becomes 2?! M ~ + i! B ~ + (1 + i) K ~ + i? ~ p = ~ A(!)p = ~ F ; (5) where the dimensions of the matrices and the vector F ~ are reduced to the number of substructure modes computed. If many substructure modes have been computed, the matrix ~A(!) is very large, and it is sparse, but not diagonal. For this reason, solving the system of frequency response equations at every frequency is costly enough to motivate using a special frequency sweep algorithm.[2] In this algorithm, the frequency response is divided into two components. The rst component contains the response of approximate global modes whose natural frequencies lie in or very close to the frequency sweep interval, and this component accounts for resonant or nearly resonant behavior. The second component accounts for the remainder of the response and is represented in terms of the substructure modes. The portion of the response represented by the second component varies smoothly with frequency, so it can be approximated well by updating it only occasionally during the frequency sweep and extrapolating or interpolating for frequencies between updates. Whether for the rst component of the frequency response or for a global eigenanalysis, global eigenpairs can be approximated by solving the algebraic eigenvalue problem K ~ ~ = M ~ ~ ~ for ~ and. ~ Each column of ~ contains coecients of substructure eigenvectors for representing global eigenvectors, and ~ contains approximate global eigenvalues. In the transformation of the FE model to the substructure mode representation, substructure modes can be computed to very high cuto frequencies with only a nominal increase in computational cost. This increases the number of substructure modes and the accuracy of the frequency response analysis. However, since the dimension of the reduced eigenvalue problem increases, the cost of solving it increases signicantly. An approximate eigensolution can be obtained by including only rows and columns of K ~ and M ~ corresponding to substructure modes below a frequency higher than the highest frequency for which global modes are needed, but generally much lower than the substructure mode cuto frequency. This approximation can be improved considerably, and very economically, by means of iterations that access all of the computed substructure modes.[7] Once an eigensolution for the reduced problem has been obtained, the frequency sweep analysis begins at the lowest frequency of interest. The rst component of the response is computed, and an iterative scheme is used to obtain the second component. Typically, only one iteration, which mainly involves a matrix-vector multiply, is required to update the responses of the substructure modes for the second component of the frequency response. After computing the second component of the response for the rst frequency, it can typically be used for several frequencies before it needs to be updated again. The rst component of the frequency response is updated at each frequency, because it varies much less smoothly with frequency, and because it is inexpensive to compute since only a small number of global modes are involved. The second component of the frequency response is updated when the accuracy obtained by simply using what was computed for the rst response frequency is no longer acceptable. At this point, the old response becomes a starting vector for the iterative scheme. Once the update has been done, linear extrapolation can be used to represent the second component. When this 4
5 is no longer suciently accurate, another update is performed, which provides enough information for quadratic extrapolation. This pattern can be repeated throughout the frequency sweep analysis, enabling the use of a very large number of substructure modes without having to compute with them very often during the frequency sweep. If necessary, the results of a frequency sweep analysis or an eigenanalysis can be expanded from the substructure mode representation to all FE DOF. However, signicant savings in disk space and CPU time are possible if these results are only needed in selected DOF. One of the advantages of AMLS over the modal frequency response approach using the Lanczos eigensolver is that much less CPU time and disk space is committed to working with the full set of FE DOF. 4. NUMERICAL EXAMPLE For an example, AMLS is used to approximate the frequency response of a FE model of an automobile \body-in-white" (without doors, hood, trunk lid, or other \trim" items attached) which has about 2.9 million DOF. This model was created in industry for analysis using NASTRAN software. Frequency response results obtained using AMLS, on an IBM RS/6000 workstation, are compared to results obtained using modal frequency response, as well as direct frequency response, in MSC.NASTRAN on a Cray T90 vector supercomputer. A frequency sweep up to 400 Hz is performed, so global modes up to a cuto frequency of 600 Hz are calculated in MSC.NASTRAN, for modal frequency response using residual exibility. For AMLS, substructure eigenvectors with natural frequencies up to 4,000 Hz are computed and used to represent the structure. Global modes with natural frequencies up to 480 Hz are approximated in terms of these substructure eigenvectors for use in the rst component of the frequency response. In AMLS, because quasistatic dependence of eliminated DOF on forced DOF is represented throughout the model transformation process, the benet of residual exibility is obtained. In Phase 1 of the analysis process for using AMLS to nd frequency response, the stiness and mass matrices for the model are generated using NASTRAN and are written to les, along with data enabling AMLS software to refer to the user's grid point numbers, etc. In Phase 2, this FE model is automatically divided into 12,068 substructures on 24 levels based on the sparsity structure of the FE stiness and mass matrices. In Phase 3, for obtaining frequency response up to 400 Hz, a total of 40,336 substructure eigenpairs with natural frequencies up to 4,000 Hz are computed and the FE model is projected onto the substructure mode subspace. In Phase 4, an approximate eigensolution for the reduced model is obtained. The accuracy of the global eigenvalues found in this phase has a large impact on the accuracy of resonances in the frequency response. The rst exible mode natural fre- Table 1. Wallclock and CPU Times Wallclock Time AMLS on IBM Workstation CPU Time Phase 1 53:09 25:02 Phase 2 21:52 15:33 Phase 3 6:33:45 6:26:41 Phase 4 2:17:40 2:17:33 Phase 5 1:10:25 1:09:37 Total 11:16:51 10:34:26 Modal Frequency Response on Cray T90 Total 14:53:29 15:27:02 quency is only % higher than the value obtained by NAS- TRAN. Natural frequencies below 50 Hz are found with less than % error; below 100 Hz, with less than 0.015% error; below 200 Hz, with less than 0.048% error; below 300 Hz, with less than 0.16% error; and below 400 Hz, with less than 0.64% error. In Phase 5, the frequency sweep analysis is performed using the frequency sweep algorithm described in the preceding section. Wallclock and CPU times for the ve phases of the AMLS analysis are presented in Table 1, along with wallclock and CPU times for the modal frequency response analysis done in MSC.NASTRAN. The AMLS analysis was done on an IBM RS/ P Model 260 workstation which had two processors and only 1 gigabyte of RAM. However, only one processor was used for these results. The modal frequency response analysis was done on a Cray T90 supercomputer with 3 processors. All three processors were used at once at various times during the job, with the average number of processors in use concurrently, over the course of the job, equal to In the frequency response results from AMLS, responses at the drive point tend to be slightly more accurate than responses away from the drive point. Figure 2 shows a typical drive point inertance, with circles representing values computed using direct frequency response, a dashed line for modal frequency response computed using MSC.NASTRAN, and a solid line for frequency response computed using AMLS. The results are visually almost indistinguishable. Figure 3 shows a typical transfer inertance, again with circles, dashed line and solid line representing direct, MSC.NASTRAN modal, and AMLS frequency response respectively. In the transfer inertance, there is cancellation between responses of dierent global modes, so that the frequency response is about two orders of magnitude smaller than for the drive point inertance, and there are antiresonances which do not appear in the drive point case. 5
6 Inertance Frequency (Hz) Figure 2. Drive point inertance. (Circles: direct. Dashed: modal. Solid: AMLS.) Because of these antiresonances, the error in the AMLS approximations of natural frequencies is more apparent in transfer frequency response than in the smoother drive point response. The AMLS approximation of frequency response is shifted slightly to the right at high frequencies, and error in the shape of the frequency response curve in the antiresonances is noticeable. However, antiresonance behavior at high frequencies is seldom of engineering interest, and FE models are particularly unlikely to capture both natural frequencies and mode shapes accurately enough to represent antiresonances accurately. On this example, using AMLS on one workstation processor produces results of useful engineering accuracy in less elapsed time than was required for using modal frequency response with residual exibility on a Cray T90, even though multiple processors were used by the supercomputer. 5. CONCLUSIONS Until recently, frequency response analysis of automobile bodies has been very expensive, and limited in the range of frequencies that could be addressed. With the extremely large FE models needed for accuracy at higher frequencies, and the large number of response frequencies, the modal frequency response approach has been the only practical choice. However, the Lanczos eigensolution algorithm for computing natural frequencies and modes makes microprocessor-based computing platforms impractical because of their limited memory bandwidth. Vector supercomputers have become the standard computing platform, despite their high cost. The Automated Multi-Level Substructuring (AMLS) method is a new approach to large-scale frequency response analysis in which the FE model is automatically divided into thousands of substructures on many levels. Response is represented in terms of substructure eigenvectors rather than global modes of vibration. The numerical example in this paper demonstrates, on an automobile body model which has almost 3 million degrees of freedom, that it is faster to do frequency response analysis on a single workstation processor, using AMLS, than to use a multiprocessor Cray T90 supercomputer and the conventional modal frequency response approach. Despite the use of substructure eigenvectors rather than global eigenvectors, the accuracy obtained using AMLS is extremely good. In AMLS, improving accuracy by computing substructure eigenvectors to very high cuto frequencies is very inexpensive. The ability to use workstations for large-scale frequency response analysis, with the same job throughput that has been oered by supercomputers and very little reduction in accuracy, can be expected to have a dramatic impact on NVH computation in 6
7 10 1 Inertance Frequency (Hz) Figure 2. Transfer inertance. (Circles: direct. Dashed: modal. Solid: AMLS.) the automotive industry. In addition, because of the potential for parallelizing AMLS, the turnaround time for NVH analysis can be expected to decrease greatly in the near future. ACKNOWLEDGMENTS The modal frequency response analysis on the Cray T90 supercomputer was performed by Mr. Mladen K. Chargin. Supercomputer time was provided by SGI/Cray Research, Inc. The IBM RS/6000 workstation was provided by IBM Corporation under the Shared University Resource program. This research was funded by Ford Motor Company. REFERENCES 1. Bennighof, J. K. and Kaplan, M. F., \Frequency Window Implementation of Adaptive Multi-Level Substructuring," Journal of Vibration and Acoustics, Vol. 120, No. 2, pp , April Hurty, W. C., \Dynamic Analysis of Structural Systems Using Component Modes," AIAA Journal, Vol. 3, No. 4, pp , Craig, R. R., Jr. and Bampton, M. C. C., \Coupling of Substructures for Dynamic Analysis," AIAA Journal, Vol. 6, No. 7, pp , Du, I. S. and Reid, J. K., \The Multifrontal Solution of Indenite Sparse Symmetric Linear Systems," ACM Transactions on Mathematical Software, Vol. 9, pp , Du, I. S., Erisman, A. M. and Reid, J. K., Direct Methods for Sparse Matrices, Oxford University Press, New York, pp , Bennighof, J. K., Kaplan, M. F. and Muller, M. B., \Extending the Frequency Response Capabilities of Automated Multi-Level Substructuring," Proceedings of 41st AIAA/- ASME/ASCE/AHS Structures, Structural Dynamics and Materials Conference, Atlanta, April 2000 (in preparation). 2. Bennighof, J. K. and Kaplan, M. F., \Frequency Sweep Analysis using Multi-Level Substructuring, Global Modes and Iteration," Proceedings of 39th AIAA/ASME/ASCE/- AHS Structures, Structural Dynamics and Materials Conference, Long Beach, April
Automated Multi-Level Substructuring CHAPTER 4 : AMLS METHOD. Condensation. Exact condensation
Automated Multi-Level Substructuring CHAPTER 4 : AMLS METHOD Heinrich Voss voss@tu-harburg.de Hamburg University of Technology AMLS was introduced by Bennighof (1998) and was applied to huge problems of
More informationMultilevel Methods for Eigenspace Computations in Structural Dynamics
Multilevel Methods for Eigenspace Computations in Structural Dynamics Ulrich Hetmaniuk & Rich Lehoucq Sandia National Laboratories, Computational Math and Algorithms, Albuquerque, NM Joint work with Peter
More informationSolving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices
Solving an Elliptic PDE Eigenvalue Problem via Automated Multi-Level Substructuring and Hierarchical Matrices Peter Gerds and Lars Grasedyck Bericht Nr. 30 März 2014 Key words: automated multi-level substructuring,
More informationMechanical Vibrations Chapter 6 Solution Methods for the Eigenvalue Problem
Mechanical Vibrations Chapter 6 Solution Methods for the Eigenvalue Problem Introduction Equations of dynamic equilibrium eigenvalue problem K x = ω M x The eigensolutions of this problem are written in
More informationVibration Transmission in Complex Vehicle Structures
Vibration Transmission in Complex Vehicle Structures Christophe Pierre Professor Matthew P. Castanier Assistant Research Scientist Yung-Chang Tan Dongying Jiang Graduate Student Research Assistants Vibrations
More informationAPPROXIMATE DYNAMIC MODEL SENSITIVITY ANALYSIS FOR LARGE, COMPLEX SPACE STRUCTURES. Timothy S. West, Senior Engineer
APPROXIMATE DYNAMIC MODEL SENSITIVITY ANALYSIS FOR LARGE, COMPLEX SPACE STRUCTURES Timothy S. West, Senior Engineer McDonnell Douglas Aerospace Space Station Division, Houston, Texas ABSTRACT During the
More informationEfficient Reduced Order Modeling of Low- to Mid-Frequency Vibration and Power Flow in Complex Structures
Efficient Reduced Order Modeling of Low- to Mid-Frequency Vibration and Power Flow in Complex Structures Yung-Chang Tan Graduate Student Research Assistant Matthew P. Castanier Assistant Research Scientist
More informationMatrix Assembly in FEA
Matrix Assembly in FEA 1 In Chapter 2, we spoke about how the global matrix equations are assembled in the finite element method. We now want to revisit that discussion and add some details. For example,
More informationTechnical University Hamburg { Harburg, Section of Mathematics, to reduce the number of degrees of freedom to manageable size.
Interior and modal masters in condensation methods for eigenvalue problems Heinrich Voss Technical University Hamburg { Harburg, Section of Mathematics, D { 21071 Hamburg, Germany EMail: voss @ tu-harburg.d400.de
More informationBOUNDARY CONDITION IDENTIFICATION BY SOLVING CHARACTERISTIC EQUATIONS
Journal of Sound and
More informationMatrix Iteration. Giacomo Boffi.
http://intranet.dica.polimi.it/people/boffi-giacomo Dipartimento di Ingegneria Civile Ambientale e Territoriale Politecnico di Milano April 12, 2016 Outline Second -Ritz Method Dynamic analysis of MDOF
More informationImproved Mixed-Boundary Component-Mode Representation for Structural Dynamic Analysis - (Short Version of Briefing)
Improved Mixed-Boundary Component-Mode Representation for Structural Dynamic Analysis - (Short Version of Briefing) Arya Majed, Ph.D. Ed Henkel Applied Structural Dynamics, Inc. www.appliedstructuraldynamics.com
More informationCAEFEM v9.5 Information
CAEFEM v9.5 Information Concurrent Analysis Corporation, 50 Via Ricardo, Thousand Oaks, CA 91320 USA Tel. (805) 375 1060, Fax (805) 375 1061 email: info@caefem.com or support@caefem.com Web: http://www.caefem.com
More informationComputation of Smallest Eigenvalues using Spectral Schur Complements
Computation of Smallest Eigenvalues using Spectral Schur Complements Constantine Bekas Yousef Saad January 23, 2004 Abstract The Automated Multilevel Substructing method (AMLS ) was recently presented
More informationThe parallel computation of the smallest eigenpair of an. acoustic problem with damping. Martin B. van Gijzen and Femke A. Raeven.
The parallel computation of the smallest eigenpair of an acoustic problem with damping. Martin B. van Gijzen and Femke A. Raeven Abstract Acoustic problems with damping may give rise to large quadratic
More informationMultifrontal QR factorization in a multiprocessor. environment. Abstract
Multifrontal QR factorization in a multiprocessor environment P. Amestoy 1, I.S. Du and C. Puglisi Abstract We describe the design and implementation of a parallel QR decomposition algorithm for a large
More informationAn Efficient FETI Implementation on Distributed Shared Memory Machines with Independent Numbers of Subdomains and Processors
Contemporary Mathematics Volume 218, 1998 B 0-8218-0988-1-03024-7 An Efficient FETI Implementation on Distributed Shared Memory Machines with Independent Numbers of Subdomains and Processors Michel Lesoinne
More informationImprovements for Implicit Linear Equation Solvers
Improvements for Implicit Linear Equation Solvers Roger Grimes, Bob Lucas, Clement Weisbecker Livermore Software Technology Corporation Abstract Solving large sparse linear systems of equations is often
More informationDETC98/PTG-5788 VIBRO-ACOUSTIC STUDIES OF TRANSMISSION CASING STRUCTURES
Proceedings of DETC98: 1998 ASME Design Engineering Technical Conference September 13-16, 1998, Atlanta, GA DETC98/PTG-5788 VIBRO-ACOUSTIC STUDIES O TRANSMISSION CASING STRUCTURES D. Crimaldi Graduate
More information1 Overview. 2 Adapting to computing system evolution. 11 th European LS-DYNA Conference 2017, Salzburg, Austria
1 Overview Improving LSTC s Multifrontal Linear Solver Roger Grimes 3, Robert Lucas 3, Nick Meng 2, Francois-Henry Rouet 3, Clement Weisbecker 3, and Ting-Ting Zhu 1 1 Cray Incorporated 2 Intel Corporation
More informationStructural Dynamics A Graduate Course in Aerospace Engineering
Structural Dynamics A Graduate Course in Aerospace Engineering By: H. Ahmadian ahmadian@iust.ac.ir The Science and Art of Structural Dynamics What do all the followings have in common? > A sport-utility
More informationMODEL REDUCTION USING GUYAN, IRS, AND DYNAMIC METHODS
MODEL REDUCTION USING GUYAN, IRS, AND DYNAMIC METHODS Christopher C. Flanigan Manager, Advanced Test and Analysis SDRC Operations, Inc. 11995 El Camino Real, Suite 200 San Diego, California 92130 USA ABSTRACT
More informationLie Groups for 2D and 3D Transformations
Lie Groups for 2D and 3D Transformations Ethan Eade Updated May 20, 2017 * 1 Introduction This document derives useful formulae for working with the Lie groups that represent transformations in 2D and
More informationDISPENSA FEM in MSC. Nastran
DISPENSA FEM in MSC. Nastran preprocessing: mesh generation material definitions definition of loads and boundary conditions solving: solving the (linear) set of equations components postprocessing: visualisation
More information#SEU16. FEA in Solid Edge and FEMAP Mark Sherman
FEA in Solid Edge and FEMAP Mark Sherman Realize innovation. FEMAP Continuous development with the same core team! Since 1985 there have been more than 35 releases of FEMAP with only one major architecture
More informationLifecycle simulation in the automotive industry
Lifecycle simulation in the automotive industry White Paper Advances in dynamic response with NX Nastran Accelerated product development cycles are just one symptom of an extremely competitive automotive
More informationApplication of NASA General-Purpose Solver. NASA Langley Research Center, Hampton, VA 23681, USA. Abstract
Application of NASA General-Purpose Solver to Large-Scale Computations in Aeroacoustics Willie R. Watson and Olaf O. Storaasli y NASA Langley Research Center, Hampton, VA 23681, USA Abstract Of several
More informationA METHOD FOR PROFILING THE DISTRIBUTION OF EIGENVALUES USING THE AS METHOD. Kenta Senzaki, Hiroto Tadano, Tetsuya Sakurai and Zhaojun Bai
TAIWANESE JOURNAL OF MATHEMATICS Vol. 14, No. 3A, pp. 839-853, June 2010 This paper is available online at http://www.tjm.nsysu.edu.tw/ A METHOD FOR PROFILING THE DISTRIBUTION OF EIGENVALUES USING THE
More informationTHE STATIC SUBSTRUCTURE METHOD FOR DYNAMIC ANALYSIS OF STRUCTURES. Lou Menglin* SUMMARY
264 THE STATIC SUBSTRUCTURE METHOD FOR DYNAMIC ANALYSIS OF STRUCTURES Lou Mengl* SUMMARY In this paper, the static substructure method based on the Ritz vector direct superposition method is suggested
More informationA pragmatic approach to including complex natural modes of vibration in aeroelastic analysis
A pragmatic approach to including complex natural modes of vibration in aeroelastic analysis International Aerospace Symposium of South Africa 14 to 16 September, 215 Stellenbosch, South Africa Louw van
More informationSparse solver 64 bit and out-of-core addition
Sparse solver 64 bit and out-of-core addition Prepared By: Richard Link Brian Yuen Martec Limited 1888 Brunswick Street, Suite 400 Halifax, Nova Scotia B3J 3J8 PWGSC Contract Number: W7707-145679 Contract
More informationDELFT UNIVERSITY OF TECHNOLOGY
DELFT UNIVERSITY OF TECHNOLOGY REPORT -09 Computational and Sensitivity Aspects of Eigenvalue-Based Methods for the Large-Scale Trust-Region Subproblem Marielba Rojas, Bjørn H. Fotland, and Trond Steihaug
More informationIdentification of Damping Using Proper Orthogonal Decomposition
Identification of Damping Using Proper Orthogonal Decomposition M Khalil, S Adhikari and A Sarkar Department of Aerospace Engineering, University of Bristol, Bristol, U.K. Email: S.Adhikari@bristol.ac.uk
More informationIdentification of damage location using Operational Deflection Shape (ODS)
Identification of damage location using Operational Deflection Shape (ODS) D. Di Maio, C. Zang, D. J. Ewins Mr. Dario Di Maio, Mechanical Engineering Bldg. Imperial College London, South Kensington Campus.
More informationCOMPUTATIONAL ASSESSMENT OF REDUCTION METHODS IN FE-BASED FREQUENCY-RESPONSE ANALYSIS
11th World Congress on Computational Mechanics (WCCM XI) 5th European Conference on Computational Mechanics (ECCM V) 6th European Conference on Computational Fluid Dynamics (ECFD VI) E. Oñate, J. Oliver
More informationRotor-dynamics Analysis Process
2001-36 Rotor-dynamics Analysis Process Mohammad A. Heidari, Ph.D. David L. Carlson Ted Yantis Technical Fellow Principal Engineer Principal Engineer The Boeing Company The Boeing Company The Boeing Company
More informationproblem Au = u by constructing an orthonormal basis V k = [v 1 ; : : : ; v k ], at each k th iteration step, and then nding an approximation for the e
A Parallel Solver for Extreme Eigenpairs 1 Leonardo Borges and Suely Oliveira 2 Computer Science Department, Texas A&M University, College Station, TX 77843-3112, USA. Abstract. In this paper a parallel
More informationDynamic Stress Analysis of a Bus Systems
Dynamic Stress Analysis of a Bus Systems *H. S. Kim, # Y. S. Hwang, # H. S. Yoon Commercial Vehicle Engineering & Research Center Hyundai Motor Company 772-1, Changduk, Namyang, Whasung, Kyunggi-Do, Korea
More informationReduction in number of dofs
Reduction in number of dofs Reduction in the number of dof to represent a structure reduces the size of matrices and, hence, computational cost. Because a subset of the original dof represent the whole
More informationPERFORMANCE ENHANCEMENT OF PARALLEL MULTIFRONTAL SOLVER ON BLOCK LANCZOS METHOD 1. INTRODUCTION
J. KSIAM Vol., No., -0, 009 PERFORMANCE ENHANCEMENT OF PARALLEL MULTIFRONTAL SOLVER ON BLOCK LANCZOS METHOD Wanil BYUN AND Seung Jo KIM, SCHOOL OF MECHANICAL AND AEROSPACE ENG, SEOUL NATIONAL UNIV, SOUTH
More informationLimit Analysis with the. Department of Mathematics and Computer Science. Odense University. Campusvej 55, DK{5230 Odense M, Denmark.
Limit Analysis with the Dual Ane Scaling Algorithm Knud D. Andersen Edmund Christiansen Department of Mathematics and Computer Science Odense University Campusvej 55, DK{5230 Odense M, Denmark e-mail:
More information1. Introduction Let the least value of an objective function F (x), x2r n, be required, where F (x) can be calculated for any vector of variables x2r
DAMTP 2002/NA08 Least Frobenius norm updating of quadratic models that satisfy interpolation conditions 1 M.J.D. Powell Abstract: Quadratic models of objective functions are highly useful in many optimization
More informationSparse factorization using low rank submatrices. Cleve Ashcraft LSTC 2010 MUMPS User Group Meeting April 15-16, 2010 Toulouse, FRANCE
Sparse factorization using low rank submatrices Cleve Ashcraft LSTC cleve@lstc.com 21 MUMPS User Group Meeting April 15-16, 21 Toulouse, FRANCE ftp.lstc.com:outgoing/cleve/mumps1 Ashcraft.pdf 1 LSTC Livermore
More informationEstimation of Unsteady Loading for Sting Mounted Wind Tunnel Models
52nd AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference 19th 4-7 April 2011, Denver, Colorado AIAA 2011-1941 Estimation of Unsteady Loading for Sting Mounted Wind Tunnel
More informationAdjoint Sensitivity Analysis in MSC/NASTRAN
Adjoint Sensitivity Analysis in MSC/NASTRAN Erwin H. Johnson The MacNeal-Schwendler Corporation 815 Colorado Blvd. Los Angeles, California 90041 Abstract The Adjoint Method for sensitivity analysis can
More informationSuperelement representation of a model with frequency dependent properties.
Superelement representation of a model with frequency dependent properties. Etienne Balmès ONERA Direction des structures B.P. 72, 92322 Chatillon Cedex, FRANCE ABSTRACT The paper analyses problems linked
More informationResponse Spectrum Analysis Shock and Seismic. FEMAP & NX Nastran
Response Spectrum Analysis Shock and Seismic FEMAP & NX Nastran Table of Contents 1. INTRODUCTION... 3 2. THE ACCELEROGRAM... 4 3. CREATING A RESPONSE SPECTRUM... 5 4. NX NASTRAN METHOD... 8 5. RESPONSE
More informationmidas Civil Dynamic Analysis
Edgar De Los Santos Midas IT August 23 rd 2017 Contents: Introduction Eigen Value Analysis Response Spectrum Analysis Pushover Analysis Time History Analysis Seismic Analysis Seismic Analysis The seismic
More information1 Introduction Duality transformations have provided a useful tool for investigating many theories both in the continuum and on the lattice. The term
SWAT/102 U(1) Lattice Gauge theory and its Dual P. K. Coyle a, I. G. Halliday b and P. Suranyi c a Racah Institute of Physics, Hebrew University of Jerusalem, Jerusalem 91904, Israel. b Department ofphysics,
More informationImproving the Ability to Simulate Noise from Brake Squeal
SIMULATE MORE ACCURATELY Improving the Ability to Simulate Noise from Brake Squeal Multidiscipline Simulation playing a key role in reducing brake squeal noise and vibration Brake Squeal Analysis Background
More informationENERGY FLOW MODELS FROM FINITE ELEMENTS: AN APPLICATION TO THREE COUPLED PLATES
FIFTH INTERNATIONAL CONGRESS ON SOUND DECEMBER 15-18, 1997 ADELAIDE, SOUTH AUSTRALIA AND VIBRATION ENERGY FLOW MODELS FROM FINITE ELEMENTS: AN APPLICATION TO THREE COUPLED PLATES P.J. Shorter and B.R.
More informationNORTHERN ILLINOIS UNIVERSITY
ABSTRACT Name: Santosh Kumar Mohanty Department: Mathematical Sciences Title: Ecient Algorithms for Eigenspace Decompositions of Toeplitz Matrices Major: Mathematical Sciences Degree: Doctor of Philosophy
More informationBoundary Value Problems - Solving 3-D Finite-Difference problems Jacob White
Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about
More informationFinite Element Modules for Demonstrating Critical Concepts in Engineering Vibration Course
Finite Element Modules for Demonstrating Critical Concepts in Engineering Vibration Course Shengyong Zhang Assistant Professor of Mechanical Engineering College of Engineering and Technology Purdue University
More informationAn Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems
An Implementation and Evaluation of the AMLS Method for Sparse Eigenvalue Problems WEIGUO GAO Fudan University XIAOYE S. LI and CHAO YANG Lawrence Berkeley National Laboratory and ZHAOJUN BAI University
More informationSolving Large Nonlinear Sparse Systems
Solving Large Nonlinear Sparse Systems Fred W. Wubs and Jonas Thies Computational Mechanics & Numerical Mathematics University of Groningen, the Netherlands f.w.wubs@rug.nl Centre for Interdisciplinary
More informationTheory of Vibrations in Stewart Platforms
Theory of Vibrations in Stewart Platforms J.M. Selig and X. Ding School of Computing, Info. Sys. & Maths. South Bank University London SE1 0AA, U.K. (seligjm@sbu.ac.uk) Abstract This article develops a
More informationLatent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology
Latent Semantic Indexing (LSI) CE-324: Modern Information Retrieval Sharif University of Technology M. Soleymani Fall 2014 Most slides have been adapted from: Profs. Manning, Nayak & Raghavan (CS-276,
More informationDivide and conquer algorithms for large eigenvalue problems Yousef Saad Department of Computer Science and Engineering University of Minnesota
Divide and conquer algorithms for large eigenvalue problems Yousef Saad Department of Computer Science and Engineering University of Minnesota PMAA 14 Lugano, July 4, 2014 Collaborators: Joint work with:
More informationADDITIVE SCHWARZ FOR SCHUR COMPLEMENT 305 the parallel implementation of both preconditioners on distributed memory platforms, and compare their perfo
35 Additive Schwarz for the Schur Complement Method Luiz M. Carvalho and Luc Giraud 1 Introduction Domain decomposition methods for solving elliptic boundary problems have been receiving increasing attention
More informationAdvantages, Limitations and Error Estimation of Mixed Solid Axisymmetric Modeling
Advantages, Limitations and Error Estimation of Mixed Solid Axisymmetric Modeling Sudeep Bosu TATA Consultancy Services Baskaran Sundaram TATA Consultancy Services, 185 Lloyds Road,Chennai-600086,INDIA
More informationA JACOBI-DAVIDSON ITERATION METHOD FOR LINEAR EIGENVALUE PROBLEMS. GERARD L.G. SLEIJPEN y AND HENK A. VAN DER VORST y
A JACOBI-DAVIDSON ITERATION METHOD FOR LINEAR EIGENVALUE PROBLEMS GERARD L.G. SLEIJPEN y AND HENK A. VAN DER VORST y Abstract. In this paper we propose a new method for the iterative computation of a few
More informationCurve Fitting Analytical Mode Shapes to Experimental Data
Curve Fitting Analytical Mode Shapes to Experimental Data Brian Schwarz, Shawn Richardson, Mar Richardson Vibrant Technology, Inc. Scotts Valley, CA ABSTRACT In is paper, we employ e fact at all experimental
More informationPreconditioning Subspace Iteration for Large Eigenvalue Problems with Automated Multi-Level Sub-structuring
Preconditioning Subspace Iteration for Large Eigenvalue Problems with Automated Multi-Level Sub-structuring Heinrich Voss 1, and Jiacong Yin 2 and Pu Chen 2 1 Institute of Mathematics, Hamburg University
More informationSymmetric rank-2k update on GPUs and/or multi-cores
Symmetric rank-2k update on GPUs and/or multi-cores Assignment 2, 5DV050, Spring 2012 Due on May 4 (soft) or May 11 (hard) at 16.00 Version 1.0 1 Background and motivation Quoting from Beresford N. Parlett's
More informationMATH 220 FINAL EXAMINATION December 13, Name ID # Section #
MATH 22 FINAL EXAMINATION December 3, 2 Name ID # Section # There are??multiple choice questions. Each problem is worth 5 points. Four possible answers are given for each problem, only one of which is
More informationAPPARC PaA3a Deliverable. ESPRIT BRA III Contract # Reordering of Sparse Matrices for Parallel Processing. Achim Basermannn.
APPARC PaA3a Deliverable ESPRIT BRA III Contract # 6634 Reordering of Sparse Matrices for Parallel Processing Achim Basermannn Peter Weidner Zentralinstitut fur Angewandte Mathematik KFA Julich GmbH D-52425
More informationAPVC2009. Forced Vibration Analysis of the Flexible Spinning Disk-spindle System Represented by Asymmetric Finite Element Equations
Forced Vibration Analysis of the Flexible Spinning Disk-spindle System Represented by Asymmetric Finite Element Equations Kiyong Park, Gunhee Jang* and Chanhee Seo Department of Mechanical Engineering,
More informationEnhancing Scalability of Sparse Direct Methods
Journal of Physics: Conference Series 78 (007) 0 doi:0.088/7-6596/78//0 Enhancing Scalability of Sparse Direct Methods X.S. Li, J. Demmel, L. Grigori, M. Gu, J. Xia 5, S. Jardin 6, C. Sovinec 7, L.-Q.
More informationLinear Solvers. Andrew Hazel
Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction
More informationr, Aq Fluid eigenvector, eigenvalue matrix 11 Fluid modal coordinate
Incorporation of the Tire Air Cavity Resonance into the Modal Tire Model William B. Clayton* and Rodrigue Saint-Cyr** *Michelin Americas R&D Corporation 515 Michelin Road PO Box 1987 Greenville, SC 29602-1987
More informationLinear Feedback Control Using Quasi Velocities
Linear Feedback Control Using Quasi Velocities Andrew J Sinclair Auburn University, Auburn, Alabama 36849 John E Hurtado and John L Junkins Texas A&M University, College Station, Texas 77843 A novel approach
More informationUsing SDM to Train Neural Networks for Solving Modal Sensitivity Problems
Using SDM to Train Neural Networks for Solving Modal Sensitivity Problems Brian J. Schwarz, Patrick L. McHargue, & Mark H. Richardson Vibrant Technology, Inc. 18141 Main Street Jamestown, California 95327
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationReview of modal testing
Review of modal testing A. Sestieri Dipartimento di Meccanica e Aeronautica University La Sapienza, Rome Presentation layout - Modelling vibration problems - Aim of modal testing - Types of modal testing:
More informationThe model reduction algorithm proposed is based on an iterative two-step LMI scheme. The convergence of the algorithm is not analyzed but examples sho
Model Reduction from an H 1 /LMI perspective A. Helmersson Department of Electrical Engineering Linkoping University S-581 8 Linkoping, Sweden tel: +6 1 816 fax: +6 1 86 email: andersh@isy.liu.se September
More informationPractical Linear Algebra: A Geometry Toolbox
Practical Linear Algebra: A Geometry Toolbox Third edition Chapter 12: Gauss for Linear Systems Gerald Farin & Dianne Hansford CRC Press, Taylor & Francis Group, An A K Peters Book www.farinhansford.com/books/pla
More informationEigenvalue problems and optimization
Notes for 2016-04-27 Seeking structure For the past three weeks, we have discussed rather general-purpose optimization methods for nonlinear equation solving and optimization. In practice, of course, we
More informationEssentials of Intermediate Algebra
Essentials of Intermediate Algebra BY Tom K. Kim, Ph.D. Peninsula College, WA Randy Anderson, M.S. Peninsula College, WA 9/24/2012 Contents 1 Review 1 2 Rules of Exponents 2 2.1 Multiplying Two Exponentials
More informationCourse Notes: Week 1
Course Notes: Week 1 Math 270C: Applied Numerical Linear Algebra 1 Lecture 1: Introduction (3/28/11) We will focus on iterative methods for solving linear systems of equations (and some discussion of eigenvalues
More informationbelow, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing
Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationChapter 23: Principles of Passive Vibration Control: Design of absorber
Chapter 23: Principles of Passive Vibration Control: Design of absorber INTRODUCTION The term 'vibration absorber' is used for passive devices attached to the vibrating structure. Such devices are made
More informationFurther experiences with GMRESR
Further experiences with GMRESR Report 92-2 C. Vui Technische Universiteit Delft Delft University of Technology Faculteit der Technische Wisunde en Informatica Faculty of Technical Mathematics and Informatics
More informationGrandstand Terraces. Experimental and Computational Modal Analysis. John N Karadelis
Grandstand Terraces. Experimental and Computational Modal Analysis. John N Karadelis INTRODUCTION Structural vibrations caused by human activities are not known to be particularly damaging or catastrophic.
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More informationParallel Singular Value Decomposition. Jiaxing Tan
Parallel Singular Value Decomposition Jiaxing Tan Outline What is SVD? How to calculate SVD? How to parallelize SVD? Future Work What is SVD? Matrix Decomposition Eigen Decomposition A (non-zero) vector
More informationRecent developments for frequency domain analysis in LS-DYNA
Recent developments for frequency domain analysis in LS-DYNA Yun Huang, Zhe Cui Livermore Software Technology Corporation 1 Introduction Since ls971 R6 version, a series of frequency domain features have
More informationDESIGN OF A HIGH SPEED TRAIN USING A MULTIPHYSICAL APPROACH
DESIGN OF A HIGH SPEED TRAIN USING A MULTIPHYSICAL APPROACH Aitor Berasarte Technologies Management Area Technology Division CAF WHAT DO WE ANALYSE? AERODYNAMICS STRUCTURAL ANALYSIS DYNAMICS NOISE & VIBRATIONS
More informationModal calculation by classical dynamic understructuring
itre : Calcul modal par sous-structuration dynamique clas[...] Date : 27/02/205 Page : /55 Modal calculation by classical dynamic understructuring Summary: his report presents the theoretical bases of
More informationEffect of Mass Matrix Formulation Schemes on Dynamics of Structures
Effect of Mass Matrix Formulation Schemes on Dynamics of Structures Swapan Kumar Nandi Tata Consultancy Services GEDC, 185 LR, Chennai 600086, India Sudeep Bosu Tata Consultancy Services GEDC, 185 LR,
More informationSOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS. Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA
1 SOLVING SPARSE LINEAR SYSTEMS OF EQUATIONS Chao Yang Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA, USA 2 OUTLINE Sparse matrix storage format Basic factorization
More informationD && 9.0 DYNAMIC ANALYSIS
9.0 DYNAMIC ANALYSIS Introduction When a structure has a loading which varies with time, it is reasonable to assume its response will also vary with time. In such cases, a dynamic analysis may have to
More informationOn the Development of Implicit Solvers for Time-Dependent Systems
School o something FACULTY School OF OTHER o Computing On the Development o Implicit Solvers or Time-Dependent Systems Peter Jimack School o Computing, University o Leeds In collaboration with: P.H. Gaskell,
More informationAcoustics Analysis of Speaker ANSYS, Inc. November 28, 2014
Acoustics Analysis of Speaker 1 Introduction ANSYS 14.0 offers many enhancements in the area of acoustics. In this presentation, an example speaker analysis will be shown to highlight some of the acoustics
More information1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)
Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. jeremy@cs.stanford.edu October 11, 1993 to appear in the
More informationThe Karhunen-Loeve, Discrete Cosine, and Related Transforms Obtained via the Hadamard Transform
The Karhunen-Loeve, Discrete Cosine, and Related Transforms Obtained via the Hadamard Transform Item Type text; Proceedings Authors Jones, H. W.; Hein, D. N.; Knauer, S. C. Publisher International Foundation
More informationSolving PDEs with CUDA Jonathan Cohen
Solving PDEs with CUDA Jonathan Cohen jocohen@nvidia.com NVIDIA Research PDEs (Partial Differential Equations) Big topic Some common strategies Focus on one type of PDE in this talk Poisson Equation Linear
More informationInformation Sciences Institute 22 June 2012 Bob Lucas, Gene Wagenbreth, Dan Davis, Roger Grimes and
Accelerating the Multifrontal Method Information Sciences Institute 22 June 2012 Bob Lucas, Gene Wagenbreth, Dan Davis, Roger Grimes {rflucas,genew,ddavis}@isi.edu and grimes@lstc.com 3D Finite Element
More informationA graph theoretic approach to matrix inversion by partitioning
Numerische Mathematik 4, t 28-- t 35 (1962) A graph theoretic approach to matrix inversion by partitioning By FRANK HARARY Abstract Let M be a square matrix whose entries are in some field. Our object
More information