Search NASA⌕ Search

SEARCH · Search NASA

Results for “Multilevel 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 19 records

Multilevel methods for elliptic problems on unstructured grids

Multilevel methods on unstructured grids for elliptic problems are reviewed. The advantages of these techniques are the flexible approximation of the boundaries of complicated physical domains and the ability to adapt the grid to the resolution of fine scaled structures. Multilevel methods, which include multigrid methods and domain decomposition methods, depend on the correct splitting of appropriate finite element spaces. The standard splittings used in the structured grid case cannot be directly extended to unstructured grids due to their requirement for a hierarchical grid structure. Issues related to the application of multilevel methods to unstructured grids are discussed, including how the coarse spaces and transfer operators are defined and how different types of boundary conditions are treated. An obvious way to generate a coarse mesh is to regrid the physical domain several times. Several alternatives are proposed and discussed: node nested coarse spaces, agglomerated coarse spaces and algebraically generated coarse spaces.

Chan, Tony F.↗

A multilevel method for structural synthesis

A multilevel method for structural synthesis based on finite element modeling at both the system and the substructure level is set forth. At the system level, the design is described using basis vectors generated via substructure design modification. Whenever possible, substructure constraints are satisfied via local material redistribution. At both the system level and the substructure level, design modification is carried out by solving a sequence of approximate problems. The method generates upper bound approximations for the optimum design and it has potential for substantial gains in computational efficiency, because the uncoupled substructure design modification problems can be processed in parallel.

Schmit, L. A.↗

Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty

The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.

Lai, Chen-Yao G.↗

Mimetic Finite Differences and Algebraic Multilevel Methods for Reservoir Performance Predictions: CRADA Final Report

The need to better predict and control reservoir performance is driving the development of increasingly sophisticated reservoir models that use unstructured general polyhedral grids to capture highly detailed stratigraphy. However, both discretization methods and scalable iterative solution algorithms for these situations are an active area of research. In this work we compared the performance of a new Mimetic Finite Difference (MFD) method with two new Mixed Finite Element methods, and LANL and the CRADA Participant investigated the performance of Los Alamos National Laboratory’s algebraic multigrid code on realistic flow problems. Furthermore, uncertainty quantification requires rapid evaluations of reservoir models. To do this, fine-scale reservoir models need to be coarsened and yet important fine-scale features and processes that have a significant impact on flows need to be preserved. To this end, we investigated the use of multi-resolution methods, such as the Multilevel Multiscale Mimetic (M3) method, to coarsen reservoir models.

97 MATHEMATICS AND COMPUTING↗

A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

Aftosmis, M. J.↗

Multilevel Method for Modeling Large-Scale Networks

Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from researchers. We propose to develop multilevel methods to model complex networks. The key point of the proposed strategy is that it will help to preserve part of the unknown structural attributes by guaranteeing the similar behavior of the real and artificial model on different scales.

99 GENERAL AND MISCELLANEOUS↗

A multilevel method for coupling the neutron kinetics and heat transfer equations

We present a computational method for adequate and efficient coupling the neutron transport equation with the precursor and heat transfer equations. It is based on the multilevel nonlinear quasidiffusion (QD) method for solving the multigroup transport equation. The system of equations includes the time-dependent high-order transport equation and time-dependent multigroup and effective one-group low-order QD equations. We also formulate a method applying the {alpha}-approximation for the time-dependent high-order transport equation. This approach enables one to avoid storing the angular flux from the previous time step. Numerical results for a model transient problem are presented. (authors)

97 MATHEMATICS AND COMPUTING↗

Multilevel Methods for Elliptic Problems with Highly Varying Coefficients on Nonaligned Coarse Grids

We generalize the analysis of classical multigrid and two-level overlapping Schwarz methods for 2nd order elliptic boundary value problems to problems with large discontinuities in the coefficients that are not resolved by the coarse grids or the subdomain partition. The theoretical results provide a recipe for designing hierarchies of standard piecewise linear coarse spaces such that the multigrid convergence rate and the condition number of the Schwarz preconditioned system do not depend on the coefficient variation or on any mesh parameters. One assumption we have to make is that the coarse grids are sufficiently fine in the vicinity of cross points or where regions with large diffusion coefficients are separated by a narrow region where the coefficient is small. We do not need to align them with possible discontinuities in the coefficients. The proofs make use of novel stable splittings based on weighted quasi-interpolants and weighted Poincaré-type inequalities. Finally, numerical experiments are included that illustrate the sharpness of the theoretical bounds and the necessity of the technical assumptions.

97 MATHEMATICS AND COMPUTING↗

Multilevel methods for transport equations in diffusive regimes

We consider the numerical solution of the single-group, steady state, isotropic transport equation. An analysis by means of the moment equations shows that a discrete ordinate S(sub N) discretization in direction (angle) with a least squares finite element discretization in space does not behave properly in the diffusion limit. A scaling of the S(sub N) equations is introduced so that the least squares discretization has the correct diffusion limit. For the resulting discrete system a full multigrid algorithm was developed.

Manteuffel, Thomas A.↗

Implementing abstract multigrid or multilevel methods

Multigrid methods can be formulated as an algorithm for an abstract problem that is independent of the partial differential equation, domain, and discretization method. In such an abstract setting, problems not arising from partial differential equations can be treated. A general theory exists for linear problems. The general theory was motivated by a series of abstract solvers (Madpack). The latest version was motivated by the theory. Madpack now allows for a wide variety of iterative and direct solvers, preconditioners, and interpolation and projection schemes, including user callback ones. It allows for sparse, dense, and stencil matrices. Mildly nonlinear problems can be handled. Also, there is a fast, multigrid Poisson solver (two and three dimensions). The type of solvers and design decisions (including language, data structures, external library support, and callbacks) are discussed. Based on the author's experiences with two versions of Madpack, a better approach is proposed. This is based on a mixed language formulation (C and FORTRAN + preprocessor). Reasons for not using FORTRAN, C, or C++ (individually) are given. Implementing the proposed strategy is not difficult.

Douglas, Craig C.↗

Multilevel metallization method for fabricating a metal oxide semiconductor device

An improved method is described of constructing a metal oxide semiconductor device having multiple layers of metal deposited by dc magnetron sputtering at low dc voltages and low substrate temperatures. The method provides multilevel interconnections and cross over between individual circuit elements in integrated circuits without significantly reducing the reliability or seriously affecting the yield.

Hollis, B. R., Jr.↗

Engineering applications of heuristic multilevel optimization methods

Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

Barthelemy, Jean-Francois M.↗

Engineering applications of heuristic multilevel optimization methods

Some engineering applications of heuristic multilevel optimization methods are presented and the discussion focuses on the dependency matrix that indicates the relationship between problem functions and variables. Coordination of the subproblem optimizations is shown to be typically achieved through the use of exact or approximate sensitivity analysis. Areas for further development are identified.

Barthelemy, Jean-Francois M.↗