Search NASA⌕ Search

SEARCH · Search NASA

Results for “multilevel method”

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 163 records · Page 9

A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems

Summary Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the nature of the PDEs, boundary or jump conditions, or discretization methods. While implementations of preconditioned KSP methods are usually readily available, it is unclear to users which methods are the best for different classes of problems. In this work, we present a comparison of some KSP methods, including GMRES, TFQMR, BiCGSTAB, and QMRCGSTAB, coupled with three classes of preconditioners, namely, Gauss–Seidel, incomplete LU factorization (including ILUT, ILUTP, and multilevel ILU), and algebraic multigrid (including BoomerAMG and ML). Theoretically, we compare the mathematical formulations and operation counts of these methods. Empirically, we compare the convergence and serial performance for a range of benchmark problems from numerical PDEs in two and three dimensions with up to millions of unknowns and also assess the asymptotic complexity of the methods as the number of unknowns increases. Our results show that GMRES tends to deliver better performance when coupled with an effective multigrid preconditioner, but it is less competitive with an ineffective preconditioner due to restarts. BoomerAMG with a proper choice of coarsening and interpolation techniques typically converges faster than ML, but both may fail for ill‐conditioned or saddle‐point problems, whereas multilevel ILU tends to succeed. We also show that right preconditioning is more desirable. This study helps establish some practical guidelines for choosing preconditioned KSP methods and motivates the development of more effective preconditioners.

Ghai, Aditi↗

Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations

The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Subwavelength optical lattices induced by position-dependent dark states

A method for the generation of subwavelength optical lattices based on multilevel dark states is proposed. The dark state is formed by a suitable combination of standing wave light fields, leading to position-dependent populations of the ground states. An additional field coupling dispersively to one of the ground states translates this position dependence into a subwavelength optical potential. We provide two semiclassical approaches to understand the involved physics, and demonstrate that they lead to identical results in a certain meaningful limit. Then we apply a Monte Carlo simulation technique to study the full quantum dynamics of the subwavelength trapping. Finally, we discuss the relevant time scales for the trapping, optimum conditions, and possible implementations.

74 ATOMIC AND MOLECULAR PHYSICS↗

Multi-output multilevel best linear unbiased estimators via semidefinite programming

Multifidelity forward uncertainty quantification (UQ) problems often involve multiple quantities of interest and heterogeneous models (e.g., different grids, equations, dimensions, physics, surrogate and reduced-order models). While computational efficiency is key in this context, multi-output strategies in multilevel/multifidelity methods are either sub-optimal or non-existent. In this paper we extend multilevel best linear unbiased estimators (MLBLUE) to multi-output forward UQ problems and we present new semidefinite programming formulations for their optimal setup. Not only do these formulations yield the optimal number of samples required, but also the optimal selection of low-fidelity models to use. While existing MLBLUE approaches are single-output only and require a non-trivial nonlinear optimization procedure, the new multi-output formulations can be solved reliably and efficiently. Here, we demonstrate the efficacy of the new methods and formulations in practical UQ problems with model heterogeneity.

97 MATHEMATICS AND COMPUTING↗

Multilevel resistive information storage and retrieval

The present invention relates to resistive random-access memory (RRAM or ReRAM) systems, as well as methods of employing multiple state variables to form degenerate states in such memory systems. The methods herein allow for precise write and read steps to form multiple state variables, and these steps can be performed electrically. Such an approach allows for multilevel, high density memory systems with enhanced information storage capacity and simplified information retrieval.

42 ENGINEERING↗

Time evolution, Lamb shift, and emission spectra of spontaneous emission of two identical atoms

A unitary transformation method is used to investigate the dynamic evolution of two multilevel atoms, in the basis of symmetric and antisymmetric states, with one atom being initially prepared in the first excited state and the other in the ground state. The unitary transformation guarantees that our calculations are based on the ground state of the atom-field system and the self-energy is subtracted at the beginning. The total Lamb shifts of the symmetric and antisymmetric states are divided into transformed shift and dynamic shift. The transformed shift is due to emitting and reabsorbing of virtual photons, by a single atom (nondynamic single atomic shift) and between the two atoms (quasi-static shift). The dynamic shift is due to the emitting and reabsorbing of real photons, by a single atom (dynamic single atomic shift) and between the two atoms (dynamic interatomic shift). The emitting and reabsorbing of virtual and real photons between the two atoms result in the interatomic shift, which does not exist for the one-atom case. The spectra at the long-time limit are calculated. If the distance between the two atoms is shorter than or comparable to the wavelength, the strong coupling between the two atoms splits the spectrum into two peaks, one from the symmetric state and the other from the antisymmetric state. The origin of the red or blue shifts for the symmetric and antisymmetric states mainly lies in the negative or positive interaction energy between the two atoms. In the investigation of the short time evolution, we find the modification of the effective density of states by the interaction between two atoms can modulate the quantum Zeno and quantum anti-Zeno effects in the decays of the symmetric and antisymmetric states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Implicit Non-Equilibrium Radiation Diffusion

We describe methods for accurate and efficient long term time integra- tion of non-equilibrium radiation diffusion systems: implicit time integration for effi- cient long term time integration of stiff multiphysics systems, local control theory based step size control to minimize the required global number of time steps while control- ling accuracy, dynamic 3D adaptive mesh refinement (AMR) to minimize memory and computational costs, Jacobian Free Newton-Krylov methods on AMR grids for efficient nonlinear solution, and optimal multilevel preconditioner components that provide level independent solver convergence.

Philip, Bobby↗

An FEM-MLMC algorithm for a moving shutter diffraction in time stochastic model

We consider a moving shutter and non-deterministic generalization of the diffraction in time model introduced by Moshinsky several decades ago to study a class of quantum transients. We first develop a moving-mesh finite element method (FEM) to simulate the determisitic version of the model. We then apply the FEM and multilevel Monte Carlo (MLMC) algorithm to the stochastic moving-domain model for simulation of approximate statistical moments of the density profile of the stochastic transients.

97 MATHEMATICS AND COMPUTING↗

Direct power control of grid connected PV systems with three level NPC inverter

This paper presents the control of a three-level Neutral Point Clamped (NPC) voltage source inverter for grid connected photovoltaic (PV) systems. The control method used is the Extended Direct Power Control (EDPC), which is a generic approach for Direct Power Control (DPC) of multilevel inverters based on geometrical considerations. Maximum Power Point Tracking (MPPT) algorithms, that allow maximal power conversion into the grid, have been included. These methods are capable of extracting maximum power from each of the independent PV arrays connected to each DC link voltage level. The first one is a conventional MPPT which outputs DC link voltage references to EDPC. The second one is based on DPC concept. This new MPPT outputs power increment references to EDPC, thus avoiding the use of a DC link voltage regulator. The whole control system has been tested on a three-level NPC voltage source inverter connected to the grid and results confirm the validity of the method. (author)

14 SOLAR ENERGY↗

4D cone beam CT via spatiotemporal tensor framelet

Purpose: On-board 4D cone beam CT (4DCBCT) offers respiratory phase-resolved volumetric imaging, and improves the accuracy of target localization in image guided radiation therapy. However, the clinical utility of this technique has been greatly impeded by its degraded image quality, prolonged imaging time, and increased imaging dose. The purpose of this letter is to develop a novel iterative 4DCBCT reconstruction method for improved image quality, increased imaging speed, and reduced imaging dose. Methods: The essence of this work is to introduce the spatiotemporal tensor framelet (STF), a high-dimensional tensor generalization of the 1D framelet for 4DCBCT, to effectively take into account of highly correlated and redundant features of the patient anatomy during respiration, in a multilevel fashion with multibasis sparsifying transform. The STF-based algorithm is implemented on a GPU platform for improved computational efficiency. To evaluate the method, 4DCBCT full-fan scans were acquired within 30 s, with a gantry rotation of 200°; STF is also compared with a state-of-art reconstruction method via spatiotemporal total variation regularization. Results: Both the simulation and experimental results demonstrate that STF-based reconstruction achieved superior image quality. The reconstruction of 20 respiratory phases took less than 10 min on an NVIDIA Tesla C2070 GPU card. The STF codes are available at https://sites.google.com/site/spatiotemporaltensorframelet . Conclusions: By effectively utilizing the spatiotemporal coherence of the patient anatomy among different respiratory phases in a multilevel fashion with multibasis sparsifying transform, the proposed STF method potentially enables fast and low-dose 4DCBCT with improved image quality.

60 APPLIED LIFE SCIENCES↗

Nature and Consequences of Biological Reductionism for the Immunological Study of Infectious Diseases

Evolution has conserved “economic” systems that perform many functions, faster or better, with less. For example, three to five leukocyte types protect from thousands of pathogens. In order to achieve so much with so little, biological systems combine their limited elements, creating complex structures. Yet, the prevalent research paradigm is reductionist. Focusing on infectious diseases, reductionist and non-reductionist views are here described. Furthermore, the literature indicates that reductionism is associated with information loss and errors, while non-reductionist operations can extract more information from the same data. When designed to capture one-to-many/many-to-one interactions—including the use of arrows that connect pairs of consecutive observations—non-reductionist (spatial–temporal) constructs eliminate data variability from all dimensions, except along one line, while arrows describe the directionality of temporal changes that occur along the line. To validate the patterns detected by non-reductionist operations, reductionist procedures are needed. Integrated (non-reductionist and reductionist) methods can (i) distinguish data subsets that differ immunologically and statistically; (ii) differentiate false-negative from -positive errors; (iii) discriminate disease stages; (iv) capture in vivo, multilevel interactions that consider the patient, the microbe, and antibiotic-mediated responses; and (v) assess dynamics. Integrated methods provide repeatable and biologically interpretable information.

59 BASIC BIOLOGICAL SCIENCES↗

Modeling and Control of Cascaded Bridgeless Multilevel Rectifier Under Unbalanced Load Conditions

The goal of this project is to model and control a novel unidirectional cascaded multilevel bridgeless rectifier as an active front end in medium and high voltage applications. This topology has many advantages over a conventional cascaded H-bridge rectifier, such as lower implementation cost, higher reliability, and greater flexibility with similar power quality.The steady-state mathematical model is used to develop a method for the voltage balancing of dc cells. Power factor analysis is discussed to achieve unity power factor using fully controlled hbridge cells. Power loss, efficiency, and cost comparison studies between the traditional cascaded H-Bridge converter and the proposed bridgeless converter demonstrate the advantages. A novel control strategy is proposed to achieve dc voltage balancing, fast and robust grid synchronization and power factor correction under unbalanced load conditions. Simulation and experimental results validate the models and control method.

Cascaded Bridgeless Rectifier, Power factor analys↗

A Novel Discharging Control Strategy for Modular Multilevel Converter Submodules without Using External Circuit

A novel discharging control strategy is proposed and implemented for submodules in modular multilevel converters (MMCs). By sequentially controlling the arm currents of a MMC to the arm resistors, all submodule capacitors are discharged safely and rapidly without adding additional devices and circuits, resulting in improved performance and reduced cost. Both open- and closed-loop control methods are evaluated for effectiveness of the new control strategy. Simulation and experimental results are provided to validate the new control strategy.

Modular multilevel converter, discharging method, ↗

Toward an optimal online checkpoint solution under a two-level HPC checkpoint model

The traditional single-level checkpointing method suffers from significant overhead on large-scale platforms. Hence, multilevel checkpointing protocols have been studied extensively in recent years. The multilevel checkpoint approach allows different levels of checkpoints to be set (each with different checkpoint overheads and recovery abilities), in order to further improve the fault tolerance performance of extreme-scale HPC applications. How to optimize the checkpoint intervals for each level, however, is an extremely difficult problem. In this paper, we construct an easy-to-use two-level checkpoint model. Checkpoint level 1 deals with errors with low checkpoint/recovery overheads such as transient memory errors, while checkpoint level 2 deals with hardware crashes such as node failures. Compared with previous optimization work, our new optimal checkpoint solution offers two improvements: (1) it is an online solution without requiring knowledge of the job length in advance, and (2) it shows that periodic patterns are optimal and determines the best pattern. We evaluate the proposed solution and compare it with the most up-to-date related approaches on an extreme-scale simulation testbed constructed based on a real HPC application execution. Simulation results show that our proposed solution outperforms other optimized solutions and can improve the performance significantly in some cases. Specifically, with the new solution the wall-clock time can be reduced by up to 25.3% over that of other state-of-the-art approaches. Lastly, a brute-force comparison with all possible patterns shows that our solution is always within 1% of the best pattern in the experiments.

97 MATHEMATICS AND COMPUTING↗

Multilevel Graph Partitioning for Three-Dimensional Discrete Fracture Network Flow Simulations

We present a topology-based method for mesh-partitioning in three-dimensional discrete fracture network (DFN) simulations that takes advantage of the intrinsic multi-level nature of a DFN. DFN models are used to simulate flow and transport through low-permeability fractured media in the subsurface by explicitly representing fractures as discrete entities. The governing equations for flow and transport are numerically integrated on computational meshes generated on the interconnected fracture networks. Modern high-fidelity DFN simulations require high-performance computing on multiple processors where performance and scalability depends partially on obtaining a high-quality partition of the mesh to balance work-loads and minimize communication across all processors. The discrete structure of a DFN naturally lends itself to various graph representations, which can be thought of as coarse-scale representations of the computational mesh. Using this concept, we develop two applications of the multilevel graph partitioning algorithm to partition the mesh of a DFN. In the first, we project a partition of the graph based on the DFN topology onto the mesh of the DFN and in the second, this DFN-based projection is used as the initial condition for further partitioning refinement of the mesh. We compare the performance of these methods with standard multi-level graph partitioning using graph-based metrics (cut, imbalance, partitioning time), computational-based metrics (FLOPS, iterations, solver time), and total run time. The DFN-based and the mesh-based partitioning methods are comparable in terms of the graph-based metrics, but the time required to obtain the partition is several orders of magnitude faster using the DFN-based partitions. The computation-based metrics show comparable performance between both methods so, in combination, the DFN-based partitions are several orders of magnitude faster than the mesh-based partition. Furthermore, the method which uses the DFN-partition solution as the initial condition of the mesh partition provided cut and imbalance values that were close to the mesh-based partition but in a fraction of the time. In turn, this hybrid method outperformed both of the other methods in terms of the total run time.

58 GEOSCIENCES↗

Multilevel Combinatorial Optimization across Quantum Architectures

Emerging quantum processors provide an opportunity to explore new approaches for solving traditional problems in the post Moore’s law supercomputing era. However, the limited number of qubits makes it infeasible to tackle massive real-world datasets directly in the near future, leading to new challenges in utilizing these quantum processors for practical purposes. Furthermore, hybrid quantum-classical algorithms that leverage both quantum and classical types of devices are considered as one of the main strategies to apply quantum computing to large-scale problems. In this article, we advocate the use of multilevel frameworks for combinatorial optimization as a promising general paradigm for designing hybrid quantum-classical algorithms. To demonstrate this approach, we apply this method to two well-known combinatorial optimization problems, namely, the Graph Partitioning Problem, and the Community Detection Problem. We develop hybrid multilevel solvers with quantum local search on D-Wave’s quantum annealer and IBM’s gate-model based quantum processor. We carry out experiments on graphs that are orders of magnitude larger than the current quantum hardware size, and we observe results comparable to state-of-the-art solvers in terms of quality of the solution.

97 MATHEMATICS AND COMPUTING↗

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

Mechanically Robust, Ultraelastic Hierarchical Foam with Tunable Properties via 3D Printing

We present a mechanically robust, ultraelastic foam with controlled multiscale architectures and tunable mechanical/conductive performance is fabricated via 3D printing. Hierarchical porosity, including both macro- and microscaled pores, are produced by the combination of direct ink writing (DIW), acid etching, and phase inversion. The thixotropic inks in DIW are formulated by a simple one-pot process to disperse duo nanoparticles (nanoclay and silica nanoparticles) in a polyurethane suspension. The resulting lightweight foam exhibits tailorable mechanical strength, unprecedented elasticity (standing over 1000 compression cycles), and remarkable robustness (rapidly and fully recover after a load more than 20 000 times of its own weight). Surface coating of carbon nanotubes yields a conductive elastic foam that can be used as piezoresistivity sensor with high sensitivity. For the first time, this strategy achieves 3D printing of elastic foam with controlled multilevel 3D structures and mechanical/conductive properties. In conclusion, the facile ink preparation method can be utilized to fabricate foams of various materials with desirable performance via 3D printing.

36 MATERIALS SCIENCE↗