Search NASA⌕ Search

SEARCH · Search NASA

Results for “algebraic methods”

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 181 records · Page 10

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. This technical memorandum describes the theory and method used in GRID2D/3D.

Shih, T. I.-P.↗

A Galerkin type finite element method for rotary-wing aeroelasticity in hover and forward flight

A Galerkin finite element method for the spatial discretization of the nonlinear, nonselfadjoint, partial differential equations governing rotary-wing aeroelasticity is presented. This method reduces algebraic manipulative labor significantly when compared to the global Galerkin method based on assumed modes. Furthermore, the Galerkin finite element method is ideally suited to treat rotor blades with discontinuous mass and stiffness distribution and structurally redundant configurations as they appear in bearingless rotors. Implementation of the method is illustrated for the coupled flap-lag aeroelastic problem of hingeless rotor blades in hover and forward flight. Numerical results for stability and response illustrate the numerical properties and convergence behavior of the method. It is concluded that the Galerkin finite element method is a practical tool for solving rotary-wing aeroelastic stability and response problems.

Straub, F. K.↗

Generalization of a stability domain estimation method for nonlinear discrete systems

In this paper, we present a generalization approach of an algebraic existing method to estimate stability regions for discrete nonlinear polynomial systems of degree 3. The existing method is based on the enlargement of a guaranteed stability region by applying various steps of a proposed algorithm. Its main limitation is that the initial result has only been subsequently developed in a particular case of a single iteration. The stability domain obtained is consequently not the widest one. Our main contribution in this paper is to develop generalized functions that allow the enlargement of the guaranteed stability region after k iterations, for any value of k. A required fundamental tool is developed and consists in a general formula allowing to give the result of the Kronecker power calculation of two matrices sum. The advantages of this generalization are to reach a larger region of asymptotic stability and to improve the existing methods results. Two application examples illustrate the proposed method.

97 MATHEMATICS AND COMPUTING↗

An adaptive scalable fully implicit algorithm based on stabilized finite element for reduced visco-resistive MHD

The magnetohydrodynamics (MHD) equations are continuum models used in the study of a wide range of plasma physics systems, including the evolution of complex plasma dynamics in tokamak disruptions. However, efficient numerical solution methods for MHD are extremely challenging due to disparate time and length scales, strong hyperbolic phenomena, and nonlinearity. Additionally, therefore the development of scalable, implicit MHD algorithms and high-resolution adaptive mesh refinement strategies is of considerable importance. In this work, we develop a high-order stabilized finite-element algorithm for the reduced visco-resistive MHD equations based on the MFEM finite element library (mfem.org). The scheme is fully implicit, solved with the Jacobian-free Newton-Krylov (JFNK) method with a physics-based preconditioning strategy. Our preconditioning strategy is a generalization of the physics-based preconditioning methods in Chacón et al. (2002) to adaptive, stabilized finite elements. Algebraic multigrid methods are used to invert sub-block operators to achieve scalability. A parallel adaptive mesh refinement scheme with dynamic load-balancing is implemented to efficiently resolve the multi-scale spatial features of the system. Our implementation uses the MFEM framework, which provides arbitrary-order polynomials and flexible adaptive conforming and non-conforming meshes capabilities. Results demonstrate the accuracy, efficiency, and scalability of the implicit scheme in the presence of large scale disparity. The potential of the AMR approach is demonstrated on an island coalescence problem in the high Lundquist-number regime (≥ 10 7 ) with the successful resolution of plasmoid instabilities and thin current sheets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Selected computations of transonic cavity flows

An efficient diagonal scheme implemented in an overset mesh framework has permitted the analysis of geometrically complex cavity flows via the Reynolds averaged Navier-Stokes equations. Use of rapid hyperbolic and algebraic grid methods has allowed simple specification of critical turbulent regions with an algebraic turbulence model. Comparisons between numerical and experimental results are made in two dimensions for the following problems: a backward-facing step; a resonating cavity; and two quieted cavity configurations. In three-dimensions the flow about three early concepts of the stratospheric Observatory For Infrared Astronomy (SOFIA) are compared to wind-tunnel data. Shedding frequencies of resolved shear layer structures are compared against experiment for the quieted cavities. The results demonstrate the progress of computational assessment of configuration safety and performance.

Atwood, Christopher A.↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 2: User's manual and program listing

An efficient computer program, called GRID2D/3D, was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. The theory and method used in GRID2D/3D is described.

Bailey, R. T.↗

Application of the Finite Element Method to Rotary Wing Aeroelasticity

A finite element method for the spatial discretization of the dynamic equations of equilibrium governing rotary-wing aeroelastic problems is presented. Formulation of the finite element equations is based on weighted Galerkin residuals. This Galerkin finite element method reduces algebraic manipulative labor significantly, when compared to the application of the global Galerkin method in similar problems. The coupled flap-lag aeroelastic stability boundaries of hingeless helicopter rotor blades in hover are calculated. The linearized dynamic equations are reduced to the standard eigenvalue problem from which the aeroelastic stability boundaries are obtained. The convergence properties of the Galerkin finite element method are studied numerically by refining the discretization process. Results indicate that four or five elements suffice to capture the dynamics of the blade with the same accuracy as the global Galerkin method.

Straub, F. K.↗

A matrix dependent/algebraic multigrid approach for extruded meshes with applications to ice sheet modeling

A multigrid method is proposed that combines ideas from matrix dependent multigrid for structured grids and algebraic multigrid for unstructured grids. It targets problems where a three-dimensional mesh can be viewed as an extrusion of a two-dimensional, unstructured mesh in a third dimension. Our motivation comes from the modeling of thin structures via finite elements and, more specifically, the modeling of ice sheets. Extruded meshes are relatively common for thin structures and often give rise to anisotropic problems when the thin direction mesh spacing is much smaller than the broad direction mesh spacing. Within our approach, the first few multigrid hierarchy levels are obtained by applying matrix dependent multigrid to semicoarsen in a structured thin direction fashion. After sufficient structured coarsening, the resulting mesh contains only a single layer corresponding to a two-dimensional, unstructured mesh. Algebraic multigrid can then be employed in a standard manner to create further coarse levels, as the anisotropic phenomena is no longer present in the single layer problem. The overall approach remains fully algebraic, with the minor exception that some additional information is needed to determine the extruded direction. Furthermore, this facilitates integration of the solver with a variety of different extruded mesh applications.

97 MATHEMATICS AND COMPUTING↗

Dynamics of local grid manipulations for internal flow problems

The control point method of algebraic grid generation is briefly reviewed. The review proceeds from the general statement of the method in 2-D unencumbered by detailed mathematical formulation. The method is supported by an introspective discussion which provides the basis for confidence in the approach. The more complex 3-D formulation is then presented as a natural generalization. Application of the method is carried out through 2-D examples which demonstrate the technique.

Eiseman, Peter R.↗

Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations

A method of increasing an efficiency at which a plurality of threshold gates arranged as neuromorphic hardware is able to perform a linear algebraic calculation having a dominant size of N. The computer-implemented method includes using the plurality of threshold gates to perform the linear algebraic calculation in a manner that is simultaneously efficient and at a near constant depth. “Efficient” is defined as a calculation algorithm that uses fewer of the plurality of threshold gates than a naïve algorithm. The naïve algorithm is a straightforward algorithm for solving the linear algebraic calculation. “Constant depth” is defined as an algorithm that has an execution time that is independent of a size of an input to the linear algebraic calculation. The near constant depth comprises a computing depth equal to or between O(log(log(N)) and the constant depth.

97 MATHEMATICS AND COMPUTING↗

An Easy Method To Accelerate An Iterative Algebraic Equation Solver

This article proposes to add a simple term to an iterative algebraic equation solver with an order n convergence rate, and to raise the order of convergence to (2n - 1). In particular, a simple algebraic equation solver with the 5th order convergence but uses only 4 function values in each iteration, is described in details. When this scheme is applied to a Newton-Raphson method of the quadratic convergence for a system of algebraic equations, a cubic convergence can be achieved with an low overhead cost of function evaluation that can be ignored as the size of the system increases.

97 MATHEMATICS AND COMPUTING↗

Numerical Solution of 3D Poisson-Nernst-Planck Equations Coupled with Classical Density Functional Theory for Modeling Ion and Electron Transport in a Confined Environment

We have developed efficient numerical algorithms for the solution of 3D steady-state Poisson-Nernst-Planck equations (PNP) with excess chemical potentials described by the classical density functional theory (cDFT). The coupled PNP equations are discretized by finite difference scheme and solved iteratively by Gummel method with relaxation. The Nernst-Planck equations are transformed into Laplace equations through the Slotboom transformation. Algebraic multigrid method is then applied to efficiently solve the Poisson equation and the transformed Nernst-Planck equations. A novel strategy for calculating excess chemical potentials through fast Fourier transforms is proposed which reduces computational complexity from O(N2) to O(NlogN) where N is the number of grid points. Integrals involving Dirac delta function are evaluated directly by coordinate transformation which yields more accurate result compared to applying numerical quadrature to an approximated delta function. Numerical results for ion and electron transport in solid electrolyte for Li ion batteries are shown to be in good agreement with the experimental data and the results from previous studies.

Meng, Da↗

An Easy Method to Accelerate an Iterative Algebraic Solver, part II

This study is a companion to [Yao, Journal of Computational Physics267(2014)]. We provide a compact alternative development of Yao’s method to accelerate to order 2n–1 a fixed-point iterative scheme with an original convergence-rate of ordern. Using this approach, we show how to further improve the order of convergence by increasings, the number of steps per iteration. This scheme extends to arbitrarily high order without extra derivative evaluations per iteration. We discuss the efficiency of the new methods, including s = 2 (Yao’s method), and compare to that of the original method as a function of n; and we consider the efficiency for systems of equations of system-size M. For n = 2 and large M, we find that the multi-step scheme peaks in efficiency at about s ln s ~ M function evaluations, where its computational speed is several times faster than Newton’s method.

97 MATHEMATICS AND COMPUTING↗

Scalable Implementation of Mean-Field and Correlation Methods Based on Lie-Algebraic Similarity Transformation of Spin Hamiltonians in the Jordan–Wigner Representation

Recent work has highlighted that the strong correlation inherent in spin Hamiltonians can be effectively reduced by mapping spins to Fermions via the Jordan−Wigner transformation (JW). The Hartree−Fock method is straightforward in the Fermionic domain and may provide a reasonable approximation to the ground state. Correlation with respect to the Fermionic mean field can be recovered based on Lie-algebraic similarity transformation (LAST) with two-body correlators. Specifically, a unitary LAST variant eliminates the dependence on site ordering, while a nonunitary LAST yields size-extensive correlation energies. Whereas the first recent demonstration of such methods was restricted to small spin systems, we present efficient implementations using analytical gradients for the optimization with respect to the mean-field reference and the LAST parameters, thereby enabling the treatment of larger clusters, including systems with local spins s > $\frac{1}{2}$.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HOMAR: A computer code for generating homotopic grids using algebraic relations: User's manual

A computer code for fast automatic generation of quasi-three-dimensional grid systems for aerospace configurations is described. The code employs a homotopic method to algebraically generate two-dimensional grids in cross-sectional planes, which are stacked to produce a three-dimensional grid system. Implementation of the algebraic equivalents of the homotopic relations for generating body geometries and grids are explained. Procedures for controlling grid orthogonality and distortion are described. Test cases with description and specification of inputs are presented in detail. The FORTRAN computer program and notes on implementation and use are included.

Moitra, Anutosh↗

Three-cluster description of properties of light neutron- and proton-rich nuclei in the framework of the algebraic version of the resonating group method

A three-cluster microscopic approach to description of the properties of light atomic nuclei (algebraic version of the resonating group method) is presented. The approach is based on the application of oscillator functions for determination of the wave functions of each cluster and expansion of the function of relative cluster motion. Those applications of the method that are related to the study of the properties of states of the discrete and continuous spectra of neutron- and proton-rich {sup 6}He, {sup 8}He, {sup 6}Be, {sup 5}H nuclei and fusion reactions {sup 3}H({sup 2}H, 2n){sup 4}He and {sup 3}He({sup 3}He, 2p){sup 4}He are mainly considered. Technical issues of calculations are discussed to the extent necessary for understanding the presented material. The main attention is concentrated on the presentation of physical results, their comparison with experimental data, and results obtained in other theoretical approaches. Problems associated with the role of the Pauli principle, convergence of numerical results, and approximations made in the course of calculations are also discussed in sufficient detail.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗