Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Lanczos”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Phase diagram of the frustrated spin-1/2 Heisenberg antiferromagnet in two dimensions

A Lanczos technique is used to study the frustrated spin-1/2 Heisenberg model on square lattices of 16 and 20 sites. Frustration is introduced by an interaction along the diagonals of the plaquettes with coupling J2 greater than or equal to 0. For large J2, the ground state breaks (spontaneously) the lattice rotational symmetry. For intermediate values of J2, the squares of order parameters associated with spin-Peierls and 'twisted'states have a peak, while a similar quantity for a chiral state shows no interesting structure.

Dagotto, Elbio↗
NASA NTRS1990

QMR: A Quasi-Minimal Residual method for non-Hermitian linear systems

The biconjugate gradient (BCG) method is the natural generalization of the classical conjugate gradient algorithm for Hermitian positive definite matrices to general non-Hermitian linear systems. Unfortunately, the original BCG algorithm is susceptible to possible breakdowns and numerical instabilities. A novel BCG like approach is presented called the quasi-minimal residual (QMR) method, which overcomes the problems of BCG. An implementation of QMR based on a look-ahead version of the nonsymmetric Lanczos algorithm is proposed. It is shown how BCG iterates can be recovered stably from the QMR process. Some further properties of the QMR approach are given and an error bound is presented. Finally, numerical experiments are reported.

Freund, Roland W.↗
NASA NTRS1991

Comparison of advanced reduced-basis methods for transient structural analysis

Two advanced reduced-basis methods for linear, transient structural analysis, the force-derivative method and the Lanczos method, are compared to two widely-used modal methods, the mode-displacement method and the mode-acceleration method. Comparisons are made for two linear example problems: a proportionally-damped cantilevered beam subject to a discrete tip load which varies linearly with time, and a discretely-damped multispan beam subject to a uniformly distributed load which varies as a quintic function of time. Results from the methods are compared in terms of the number of basis vectors required to obtain a desired level of accuracy and the associated computational times. The results are problem dependent, and it is shown that for the cantilevered beam problem, the mode-acceleration and force-derivative methods are the most efficient in terms of the number of basis vectors and computational time. The force-derivative method is shown to be the most effective method for solving the multispan beam problem with closely-spaced frequencies. In general, the force-derivative method is shown to produce an accurate solution using very few basis vectors and to require less computational time as compared to the other methods studied.

Mcgowan, David M.↗
NASA NTRS1989

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

Freund, Roland↗
NASA NTRS1989

Projection methods for the numerical solution of Markov chain models

Projection methods for computing stationary probability distributions for Markov chain models are presented. A general projection method is a method which seeks an approximation from a subspace of small dimension to the original problem. Thus, the original matrix problem of size N is approximated by one of dimension m, typically much smaller than N. A particularly successful class of methods based on this principle is that of Krylov subspace methods which utilize subspaces of the form span(v,av,...,A(exp m-1)v). These methods are effective in solving linear systems and eigenvalue problems (Lanczos, Arnoldi,...) as well as nonlinear equations. They can be combined with more traditional iterative methods such as successive overrelaxation, symmetric successive overrelaxation, or with incomplete factorization methods to enhance convergence.

Saad, Youcef↗
NASA NTRS1992

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗
NASA NTRS1992

Modal Test/Analysis Correlation of Space Station Structures Using Nonlinear Sensitivity

The modal correlation problem is formulated as a constrained optimization problem for validation of finite element models (FEM's). For large-scale structural applications, a pragmatic procedure for substructuring, model verification, and system integration is described to achieve effective modal correlation. The space station substructure FEM's are reduced using Lanczos vectors and integrated into a system FEM using Craig-Bampton component modal synthesis. The optimization code is interfaced with MSC/NASTRAN to solve the problem of modal test/analysis correlation; that is, the problem of validating FEM's for launch and on-orbit coupled loads analysis against experimentally observed frequencies and mode shapes. An iterative perturbation algorithm is derived and implemented to update nonlinear sensitivity (derivatives of eigenvalues and eigenvectors) during optimizer iterations, which reduced the number of finite element analyses.

Gupta, Viney K.↗
NASA NTRS1992

Large-scale sparse singular value computations

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.

Berry, Michael W.↗
NASA NTRS1992

Modal test/analysis correlation of Space Station structures using nonlinear sensitivity

The modal correlation problem is formulated as a constrained optimization problem for validation of finite element models (FEM's). For large-scale structural applications, a pragmatic procedure for substructuring, model verification, and system integration is described to achieve effective modal correlations. The space station substructure FEM's are reduced using Lanczos vectors and integrated into a system FEM using Craig-Bampton component modal synthesis. The optimization code is interfaced with MSC/NASTRAN to solve the problem of modal test/analysis correlation; that is, the problem of validating FEM's for launch and on-orbit coupled loads analysis against experimentally observed frequencies and mode shapes. An iterative perturbation algorithm is derived and implemented to update nonlinear sensitivity (derivatives of eigenvalues and eigenvectors) during optimizer iterations, which reduced the number of finite element analyses.

Gupta, Viney K.↗
NASA NTRS1993

An efficient procedure for cascade aeroelastic stability determination using nonlinear, time-marching aerodynamic solvers

A numerical eigenvalue problem formulation and a practical calculation procedure for exact eigenvalues and corresponding eigenvectors are developed and applied to a nonlinear, two-dimensional, time-marching full potential solver for cascade aeroelastic stability analysis. This procedure is based on the Lanczos recursive method and it directly calculates stability information about a nonlinear steady state. It is compared to conventional approaches in the frequency and time domains developed earlier and is found to be 100-10.000 times more computationally efficient. Eigenvalue constellations and the flutter results for flow through a cascade SR5 propfan airfoil are presented.

Mahajan, Aparajit J.↗
NASA NTRS1993

Development and comparison of advanced reduced-basis methods for the transient structural analysis of unconstrained structures

The development of two advanced reduced-basis methods, the force derivative method and the Lanczos method, and two widely used modal methods, the mode displacement method and the mode acceleration method, for transient structural analysis of unconstrained structures is presented. Two example structural problems are studied: an undamped, unconstrained beam subject to a uniformly distributed load which varies as a sinusoidal function of time and an undamped high-speed civil transport aircraft subject to a normal wing tip load which varies as a sinusoidal function of time. These example problems are used to verify the methods and to compare the relative effectiveness of each of the four reduced-basis methods for performing transient structural analyses on unconstrained structures. The methods are verified with a solution obtained by integrating directly the full system of equations of motion, and they are compared using the number of basis vectors required to obtain a desired level of accuracy and the associated computational times as comparison criteria.

Mcgowan, David M.↗
NASA NTRS1993

Multidisciplinary aeroelastic analysis of a generic hypersonic vehicle

This paper presents details of a flutter and stability analysis of aerospace structures such as hypersonic vehicles. Both structural and aerodynamic domains are discretized by the common finite element technique. A vibration analysis is first performed by the STARS code employing a block Lanczos solution scheme. This is followed by the generation of a linear aerodynamic grid for subsequent linear flutter analysis within subsonic and supersonic regimes of the flight envelope; the doublet lattice and constant pressure techniques are employed to generate the unsteady aerodynamic forces. Flutter analysis is then performed for several representative flight points. The nonlinear flutter solution is effected by first implementing a CFD solution of the entire vehicle. Thus, a 3-D unstructured grid for the entire flow domain is generated by a moving front technique. A finite element Euler solution is then implemented employing a quasi-implicit as well as an explicit solution scheme. A novel multidisciplinary analysis is next effected that employs modal and aerodynamic data to yield aerodynamic damping characteristics. Such analyses are performed for a number of flight points to yield a large set of pertinent data that define flight flutter characteristics of the vehicle. This paper outlines the finite-element-based integrated analysis procedures in detail, which is followed by the results of numerical analyses of flight flutter simulation.

Gupta, K. K.↗
NASA NTRS1993

Computation of selected eigenvalues of generalized eigenvalue problems

The Arnoldi (1951) and Lanczos (1950) iterative algorithms are used to obtain a few selected eigenvalues of the generalized eigenvalue problem A(x) = lambdaB(x), where A and B are n x n nonsymmetric banded complex matrices. A shift-and-invert strategy is used to increase the rate of convergence toward the desired eigenvalues, and the two approaches are evaluated in view of their performance in a model problem concerning the linear stability of compressible boundary layers. A general scheme for computing the eigenvalues that lie within a 'box' in the complex plane is presented.

Nayar, Narinder↗
NASA NTRS1992

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗
NASA NTRS2000

Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems

The ability of computers to solve hitherto intractable problems and simulate complex processes using mathematical models makes them an indispensable part of modern science and engineering. Computer simulations of large-scale realistic applications usually require solving a set of non-linear partial differential equations (PDES) over a finite region. For example, one thrust area in the DOE Grand Challenge projects is to design future accelerators such as the SpaHation Neutron Source (SNS). Our colleagues at SLAC need to model complex RFQ cavities with large aspect ratios. Unstructured grids are currently used to resolve the small features in a large computational domain; dynamic mesh adaptation will be added in the future for additional efficiency. The PDEs for electromagnetics are discretized by the FEM method, which leads to a generalized eigenvalue problem Kx = AMx, where K and M are the stiffness and mass matrices, and are very sparse. In a typical cavity model, the number of degrees of freedom is about one million. For such large eigenproblems, direct solution techniques quickly reach the memory limits. Instead, the most widely-used methods are Krylov subspace methods, such as Lanczos or Jacobi-Davidson. In all the Krylov-based algorithms, sparse matrix-vector multiplication (SPMV) must be performed repeatedly. Therefore, the efficiency of SPMV usually determines the eigensolver speed. SPMV is also one of the most heavily used kernels in large-scale numerical simulations.

Oliker, Leonid↗
NASA NTRS2004

Vibration Characteristics Determined for Stainless Steel Sandwich Panels With a Metal Foam Core for Lightweight Fan Blade Design

The goal of this project at the NASA Glenn Research Center is to provide fan materials that are safer, weigh less, and cost less than the currently used titanium alloy or polymer matrix composite fans. The proposed material system is a sandwich fan construction made up of thin solid face sheets and a lightweight metal foam core. The stiffness of the sandwich structure is increased by separating the two face sheets by the foam layer. The resulting structure has a high stiffness and lighter weight in comparison to the solid facesheet material alone. The face sheets carry the applied in-plane and bending loads (ref. 1). The metal foam core must resist the transverse shear and transverse normal loads, as well as keep the facings supported and working as a single unit. Metal foams have ranges of mechanical properties, such as light weight, impact resistance, and vibration suppression (ref. 2), which makes them more suitable for use in lightweight fan structures. Metal foams have been available for decades (refs. 3 and 4), but the difficulties in the original processes and high costs have prevented their widespread use. However, advances in production techniques and cost reduction have created a new interest in this class of materials (ref. 5). The material chosen for the face sheet and the metal foam for this study was the aerospace-grade stainless steel 17-4PH. This steel was chosen because of its attractive mechanical properties and the ease with which it can be made through the powder metallurgy process (ref. 6). The advantages of a metal foam core, in comparison to a typical honeycomb core, are material isotropy and the ease of forming complex geometries, such as fan blades. A section of a 17-4PH sandwich structure is shown in the following photograph. Part of process of designing any blade is to determine the natural frequencies of the particular blade shape. A designer needs to predict the resonance frequencies of a new blade design to properly identify a useful operating range. Operating a blade at or near the resonance frequencies leads to high-cycle fatigue, which ultimately limits the blade's durability and life. So the aim of this study is to determine the variation of the resonance frequencies for an idealized sandwich blade as a function of its face-sheet thickness, core thickness, and foam density. The finite element method is used to determine the natural frequencies for an idealized rectangular sandwich blade. The proven Lanczos method (ref. 7) is used in the study to extract the natural frequency.

Ghosn, Louis J.↗
NASA NTRS2009

The GMAO ADVAR System: Preliminary Results

The Goddard Earth Observing System (GEOS-S) Data Assimilation System is now configurable to run strong constraint 4DVAR. The system combines the 4DVAR-capable Grid-point Statistical Interpolation analysis with the GEOS-S general circulation model and an early version of the tangent linear and adjoint models of the finite-volume hydrodynamics with simplified physics. The GMAO 4DVAR uses a Lanczos-based conjugate gradient algorithm in a nested resolution inner-loop setting. A range of tests and experiments will have been carried out by the time of the Symposium. Results on balance-related issues, resolution configuration, and choice of assimilation time window will be shown. A comparison with the Global Modeling and Assimilation Office (GMAO) 3DVAR and a discussion of future directions of development will also be presented.

Todling, Ricardo↗
NASA NTRS2004

Open-Source Software for Modeling of Nanoelectronic Devices

The Nanoelectronic Modeling 3-D (NEMO 3-D) computer program has been upgraded to open-source status through elimination of license-restricted components. The present version functions equivalently to the version reported in "Software for Numerical Modeling of Nanoelectronic Devices" (NPO-30520), NASA Tech Briefs, Vol. 27, No. 11 (November 2003), page 37. To recapitulate: NEMO 3-D performs numerical modeling of the electronic transport and structural properties of a semiconductor device that has overall dimensions of the order of tens of nanometers. The underlying mathematical model represents the quantum-mechanical behavior of the device resolved to the atomistic level of granularity. NEMO 3-D solves the applicable quantum matrix equation on a Beowulf-class cluster computer by use of a parallel-processing matrix vector multiplication algorithm coupled to a Lanczos and/or Rayleigh-Ritz algorithm that solves for eigenvalues. A prior upgrade of NEMO 3-D incorporated a capability for a strain treatment, parameterized for bulk material properties of GaAs and InAs, for two tight-binding submodels. NEMO 3-D has been demonstrated in atomistic analyses of effects of disorder in alloys and, in particular, in bulk In(x)Ga(1-x)As and in In(0.6)Ga(0.4)As quantum dots.

Oyafuso, Fabiano↗