A Critical Study of Agglomerated Multigrid Methods for Diffusion
NASA Technical Reports Server (NTRS)
Nishikawa, Hiroaki; Diskin, Boris; Thomas, James L.
2011-01-01
Agglomerated multigrid techniques used in unstructured-grid methods are studied critically for a model problem representative of laminar diffusion in the incompressible limit. The studied target-grid discretizations and discretizations used on agglomerated grids are typical of current node-centered formulations. Agglomerated multigrid convergence rates are presented using a range of two- and three-dimensional randomly perturbed unstructured grids for simple geometries with isotropic and stretched grids. Two agglomeration techniques are used within an overall topology-preserving agglomeration framework. The results show that multigrid with an inconsistent coarse-grid scheme using only the edge terms (also referred to in the literature as a thin-layer formulation) provides considerable speedup over single-grid methods but its convergence deteriorates on finer grids. Multigrid with a Galerkin coarse-grid discretization using piecewise-constant prolongation and a heuristic correction factor is slower and also grid-dependent. In contrast, grid-independent convergence rates are demonstrated for multigrid with consistent coarse-grid discretizations. Convergence rates of multigrid cycles are verified with quantitative analysis methods in which parts of the two-grid cycle are replaced by their idealized counterparts.
A Critical Study of Agglomerated Multigrid Methods for Diffusion
NASA Technical Reports Server (NTRS)
Thomas, James L.; Nishikawa, Hiroaki; Diskin, Boris
2009-01-01
Agglomerated multigrid techniques used in unstructured-grid methods are studied critically for a model problem representative of laminar diffusion in the incompressible limit. The studied target-grid discretizations and discretizations used on agglomerated grids are typical of current node-centered formulations. Agglomerated multigrid convergence rates are presented using a range of two- and three-dimensional randomly perturbed unstructured grids for simple geometries with isotropic and highly stretched grids. Two agglomeration techniques are used within an overall topology-preserving agglomeration framework. The results show that multigrid with an inconsistent coarse-grid scheme using only the edge terms (also referred to in the literature as a thin-layer formulation) provides considerable speedup over single-grid methods but its convergence deteriorates on finer grids. Multigrid with a Galerkin coarse-grid discretization using piecewise-constant prolongation and a heuristic correction factor is slower and also grid-dependent. In contrast, grid-independent convergence rates are demonstrated for multigrid with consistent coarse-grid discretizations. Actual cycle results are verified using quantitative analysis methods in which parts of the cycle are replaced by their idealized counterparts.
Development and Application of Agglomerated Multigrid Methods for Complex Geometries
NASA Technical Reports Server (NTRS)
Nishikawa, Hiroaki; Diskin, Boris; Thomas, James L.
2010-01-01
We report progress in the development of agglomerated multigrid techniques for fully un- structured grids in three dimensions, building upon two previous studies focused on efficiently solving a model diffusion equation. We demonstrate a robust fully-coarsened agglomerated multigrid technique for 3D complex geometries, incorporating the following key developments: consistent and stable coarse-grid discretizations, a hierarchical agglomeration scheme, and line-agglomeration/relaxation using prismatic-cell discretizations in the highly-stretched grid regions. A signi cant speed-up in computer time is demonstrated for a model diffusion problem, the Euler equations, and the Reynolds-averaged Navier-Stokes equations for 3D realistic complex geometries.
Recent Advances in Agglomerated Multigrid
NASA Technical Reports Server (NTRS)
Nishikawa, Hiroaki; Diskin, Boris; Thomas, James L.; Hammond, Dana P.
2013-01-01
We report recent advancements of the agglomerated multigrid methodology for complex flow simulations on fully unstructured grids. An agglomerated multigrid solver is applied to a wide range of test problems from simple two-dimensional geometries to realistic three- dimensional configurations. The solver is evaluated against a single-grid solver and, in some cases, against a structured-grid multigrid solver. Grid and solver issues are identified and overcome, leading to significant improvements over single-grid solvers.
Directional Agglomeration Multigrid Techniques for High Reynolds Number Viscous Flow Solvers
NASA Technical Reports Server (NTRS)
1998-01-01
A preconditioned directional-implicit agglomeration algorithm is developed for solving two- and three-dimensional viscous flows on highly anisotropic unstructured meshes of mixed-element types. The multigrid smoother consists of a pre-conditioned point- or line-implicit solver which operates on lines constructed in the unstructured mesh using a weighted graph algorithm. Directional coarsening or agglomeration is achieved using a similar weighted graph algorithm. A tight coupling of the line construction and directional agglomeration algorithms enables the use of aggressive coarsening ratios in the multigrid algorithm, which in turn reduces the cost of a multigrid cycle. Convergence rates which are independent of the degree of grid stretching are demonstrated in both two and three dimensions. Further improvement of the three-dimensional convergence rates through a GMRES technique is also demonstrated.
Directional Agglomeration Multigrid Techniques for High-Reynolds Number Viscous Flows
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1998-01-01
A preconditioned directional-implicit agglomeration algorithm is developed for solving two- and three-dimensional viscous flows on highly anisotropic unstructured meshes of mixed-element types. The multigrid smoother consists of a pre-conditioned point- or line-implicit solver which operates on lines constructed in the unstructured mesh using a weighted graph algorithm. Directional coarsening or agglomeration is achieved using a similar weighted graph algorithm. A tight coupling of the line construction and directional agglomeration algorithms enables the use of aggressive coarsening ratios in the multigrid algorithm, which in turn reduces the cost of a multigrid cycle. Convergence rates which are independent of the degree of grid stretching are demonstrated in both two and three dimensions. Further improvement of the three-dimensional convergence rates through a GMRES technique is also demonstrated.
Agglomeration Multigrid for an Unstructured-Grid Flow Solver
NASA Technical Reports Server (NTRS)
Frink, Neal; Pandya, Mohagna J.
2004-01-01
An agglomeration multigrid scheme has been implemented into the sequential version of the NASA code USM3Dns, tetrahedral cell-centered finite volume Euler/Navier-Stokes flow solver. Efficiency and robustness of the multigrid-enhanced flow solver have been assessed for three configurations assuming an inviscid flow and one configuration assuming a viscous fully turbulent flow. The inviscid studies include a transonic flow over the ONERA M6 wing and a generic business jet with flow-through nacelles and a low subsonic flow over a high-lift trapezoidal wing. The viscous case includes a fully turbulent flow over the RAE 2822 rectangular wing. The multigrid solutions converged with 12%-33% of the Central Processing Unit (CPU) time required by the solutions obtained without multigrid. For all of the inviscid cases, multigrid in conjunction with an explicit time-stepping scheme performed the best with regard to the run time memory and CPU time requirements. However, for the viscous case multigrid had to be used with an implicit backward Euler time-stepping scheme that increased the run time memory requirement by 22% as compared to the run made without multigrid.
Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1999-01-01
The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.
Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library
DOE Office of Scientific and Technical Information (OSTI.GOV)
Barker, Andrew T.; Benson, Thomas R.; Lee, Chak Shing
ParELAG is a parallel C++ library for numerical upscaling of finite element discretizations and element-based algebraic multigrid solvers. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured meshes. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.
Unsteady Analysis of Separated Aerodynamic Flows Using an Unstructured Multigrid Algorithm
NASA Technical Reports Server (NTRS)
Pelaez, Juan; Mavriplis, Dimitri J.; Kandil, Osama
2001-01-01
An implicit method for the computation of unsteady flows on unstructured grids is presented. The resulting nonlinear system of equations is solved at each time step using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Validation of the code using a one-equation turbulence model is performed for the well-known case of flow over a cylinder. A Detached Eddy Simulation model is also implemented and its performance compared to the one equation Spalart-Allmaras Reynolds Averaged Navier-Stokes (RANS) turbulence model. Validation cases using DES and RANS include flow over a sphere and flow over a NACA 0012 wing including massive stall regimes. The project was driven by the ultimate goal of computing separated flows of aerodynamic interest, such as massive stall or flows over complex non-streamlined geometries.
Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1998-01-01
A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.
Parallel performance investigations of an unstructured mesh Navier-Stokes solver
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
2000-01-01
A Reynolds-averaged Navier-Stokes solver based on unstructured mesh techniques for analysis of high-lift configurations is described. The method makes use of an agglomeration multigrid solver for convergence acceleration. Implicit line-smoothing is employed to relieve the stiffness associated with highly stretched meshes. A GMRES technique is also implemented to speed convergence at the expense of additional memory usage. The solver is cache efficient and fully vectorizable, and is parallelized using a two-level hybrid MPI-OpenMP implementation suitable for shared and/or distributed memory architectures, as well as clusters of shared memory machines. Convergence and scalability results are illustrated for various high-lift cases.
The multigrid preconditioned conjugate gradient method
NASA Technical Reports Server (NTRS)
Tatebe, Osamu
1993-01-01
A multigrid preconditioned conjugate gradient method (MGCG method), which uses the multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wavelength components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an efficient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition of the multigrid preconditioner in order to satisfy requirements of a preconditioner of the PCG method. Next numerical experiments show a behavior of the MGCG method and that the MGCG method is superior to both the ICCG method and the multigrid method in point of fast convergence and high parallelism. This fast convergence is understood in terms of the eigenvalue analysis of the preconditioned matrix. From this observation of the multigrid preconditioner, it is realized that the MGCG method converges in very few iterations and the multigrid preconditioner is a desirable preconditioner of the conjugate gradient method.
Implicit method for the computation of unsteady flows on unstructured grids
NASA Technical Reports Server (NTRS)
Venkatakrishnan, V.; Mavriplis, D. J.
1995-01-01
An implicit method for the computation of unsteady flows on unstructured grids is presented. Following a finite difference approximation for the time derivative, the resulting nonlinear system of equations is solved at each time step by using an agglomeration multigrid procedure. The method allows for arbitrarily large time steps and is efficient in terms of computational effort and storage. Inviscid and viscous unsteady flows are computed to validate the procedure. The issue of the mass matrix which arises with vertex-centered finite volume schemes is addressed. The present formulation allows the mass matrix to be inverted indirectly. A mesh point movement and reconnection procedure is described that allows the grids to evolve with the motion of bodies. As an example of flow over bodies in relative motion, flow over a multi-element airfoil system undergoing deployment is computed.
Application of multi-grid methods for solving the Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Demuren, A. O.
1989-01-01
The application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems is discussed. The methods consist of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line-, or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to that of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.
Application of multi-grid methods for solving the Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Demuren, A. O.
1989-01-01
This paper presents the application of a class of multi-grid methods to the solution of the Navier-Stokes equations for two-dimensional laminar flow problems. The methods consists of combining the full approximation scheme-full multi-grid technique (FAS-FMG) with point-, line- or plane-relaxation routines for solving the Navier-Stokes equations in primitive variables. The performance of the multi-grid methods is compared to those of several single-grid methods. The results show that much faster convergence can be procured through the use of the multi-grid approach than through the various suggestions for improving single-grid methods. The importance of the choice of relaxation scheme for the multi-grid method is illustrated.
Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method
Kalchev, Delyan Z.; Lee, C. S.; Villa, U.; ...
2016-09-22
Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less
Upscaling of Mixed Finite Element Discretization Problems by the Spectral AMGe Method
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kalchev, Delyan Z.; Lee, C. S.; Villa, U.
Here, we propose two multilevel spectral techniques for constructing coarse discretization spaces for saddle-point problems corresponding to PDEs involving a divergence constraint, with a focus on mixed finite element discretizations of scalar self-adjoint second order elliptic equations on general unstructured grids. We use element agglomeration algebraic multigrid (AMGe), which employs coarse elements that can have nonstandard shape since they are agglomerates of fine-grid elements. The coarse basis associated with each agglomerated coarse element is constructed by solving local eigenvalue problems and local mixed finite element problems. This construction leads to stable upscaled coarse spaces and guarantees the inf-sup compatibility ofmore » the upscaled discretization. Also, the approximation properties of these upscaled spaces improve by adding more local eigenfunctions to the coarse spaces. The higher accuracy comes at the cost of additional computational effort, as the sparsity of the resulting upscaled coarse discretization (referred to as operator complexity) deteriorates when we introduce additional functions in the coarse space. We also provide an efficient solver for the coarse (upscaled) saddle-point system by employing hybridization, which leads to a symmetric positive definite (s.p.d.) reduced system for the Lagrange multipliers, and to solve the latter s.p.d. system, we use our previously developed spectral AMGe solver. Numerical experiments, in both two and three dimensions, are provided to illustrate the efficiency of the proposed upscaling technique.« less
NASA Technical Reports Server (NTRS)
Dendy, J. E., Jr.
1981-01-01
The black box multigrid (BOXMG) code, which only needs specification of the matrix problem for application in the multigrid method was investigated. It is contended that a major problem with the multigrid method is that each new grid configuration requires a major programming effort to develop a code that specifically handles that grid configuration. The SOR and ICCG methods only specify the matrix problem, no matter what the grid configuration. It is concluded that the BOXMG does everything else necessary to set up the auxiliary coarser problems to achieve a multigrid solution.
NASA Technical Reports Server (NTRS)
Jothiprasad, Giridhar; Mavriplis, Dimitri J.; Caughey, David A.; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
The efficiency gains obtained using higher-order implicit Runge-Kutta schemes as compared with the second-order accurate backward difference schemes for the unsteady Navier-Stokes equations are investigated. Three different algorithms for solving the nonlinear system of equations arising at each timestep are presented. The first algorithm (NMG) is a pseudo-time-stepping scheme which employs a non-linear full approximation storage (FAS) agglomeration multigrid method to accelerate convergence. The other two algorithms are based on Inexact Newton's methods. The linear system arising at each Newton step is solved using iterative/Krylov techniques and left preconditioning is used to accelerate convergence of the linear solvers. One of the methods (LMG) uses Richardson's iterative scheme for solving the linear system at each Newton step while the other (PGMRES) uses the Generalized Minimal Residual method. Results demonstrating the relative superiority of these Newton's methods based schemes are presented. Efficiency gains as high as 10 are obtained by combining the higher-order time integration schemes with the more efficient nonlinear solvers.
Multigrid calculation of three-dimensional turbomachinery flows
NASA Technical Reports Server (NTRS)
Caughey, David A.
1989-01-01
Research was performed in the general area of computational aerodynamics, with particular emphasis on the development of efficient techniques for the solution of the Euler and Navier-Stokes equations for transonic flows through the complex blade passages associated with turbomachines. In particular, multigrid methods were developed, using both explicit and implicit time-stepping schemes as smoothing algorithms. The specific accomplishments of the research have included: (1) the development of an explicit multigrid method to solve the Euler equations for three-dimensional turbomachinery flows based upon the multigrid implementation of Jameson's explicit Runge-Kutta scheme (Jameson 1983); (2) the development of an implicit multigrid scheme for the three-dimensional Euler equations based upon lower-upper factorization; (3) the development of a multigrid scheme using a diagonalized alternating direction implicit (ADI) algorithm; (4) the extension of the diagonalized ADI multigrid method to solve the Euler equations of inviscid flow for three-dimensional turbomachinery flows; and also (5) the extension of the diagonalized ADI multigrid scheme to solve the Reynolds-averaged Navier-Stokes equations for two-dimensional turbomachinery flows.
Introduction to multigrid methods
NASA Technical Reports Server (NTRS)
Wesseling, P.
1995-01-01
These notes were written for an introductory course on the application of multigrid methods to elliptic and hyperbolic partial differential equations for engineers, physicists and applied mathematicians. The use of more advanced mathematical tools, such as functional analysis, is avoided. The course is intended to be accessible to a wide audience of users of computational methods. We restrict ourselves to finite volume and finite difference discretization. The basic principles are given. Smoothing methods and Fourier smoothing analysis are reviewed. The fundamental multigrid algorithm is studied. The smoothing and coarse grid approximation properties are discussed. Multigrid schedules and structured programming of multigrid algorithms are treated. Robustness and efficiency are considered.
NASA Astrophysics Data System (ADS)
Debreu, Laurent; Neveu, Emilie; Simon, Ehouarn; Le Dimet, Francois Xavier; Vidard, Arthur
2014-05-01
In order to lower the computational cost of the variational data assimilation process, we investigate the use of multigrid methods to solve the associated optimal control system. On a linear advection equation, we study the impact of the regularization term on the optimal control and the impact of discretization errors on the efficiency of the coarse grid correction step. We show that even if the optimal control problem leads to the solution of an elliptic system, numerical errors introduced by the discretization can alter the success of the multigrid methods. The view of the multigrid iteration as a preconditioner for a Krylov optimization method leads to a more robust algorithm. A scale dependent weighting of the multigrid preconditioner and the usual background error covariance matrix based preconditioner is proposed and brings significant improvements. [1] Laurent Debreu, Emilie Neveu, Ehouarn Simon, François-Xavier Le Dimet and Arthur Vidard, 2014: Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems, submitted to QJRMS, http://hal.inria.fr/hal-00874643 [2] Emilie Neveu, Laurent Debreu and François-Xavier Le Dimet, 2011: Multigrid methods and data assimilation - Convergence study and first experiments on non-linear equations, ARIMA, 14, 63-80, http://intranet.inria.fr/international/arima/014/014005.html
NASA Technical Reports Server (NTRS)
Dinar, N.
1978-01-01
Several aspects of multigrid methods are briefly described. The main subjects include the development of very efficient multigrid algorithms for systems of elliptic equations (Cauchy-Riemann, Stokes, Navier-Stokes), as well as the development of control and prediction tools (based on local mode Fourier analysis), used to analyze, check and improve these algorithms. Preliminary research on multigrid algorithms for time dependent parabolic equations is also described. Improvements in existing multigrid processes and algorithms for elliptic equations were studied.
Multigrid approaches to non-linear diffusion problems on unstructured meshes
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.; Bushnell, Dennis M. (Technical Monitor)
2001-01-01
The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.
Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics
DOE Office of Scientific and Technical Information (OSTI.GOV)
Adams, Mark F.; Samtaney, Ravi, E-mail: samtaney@pppl.go; Brandt, Achi
2010-09-01
Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations - so-called 'textbook' multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field,more » which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.« less
Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics
DOE Office of Scientific and Technical Information (OSTI.GOV)
Adams, Mark F.; Samtaney, Ravi; Brandt, Achi
2010-09-01
Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations – so-called ‘‘textbook” multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss–Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field,more » which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.« less
Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics
DOE Office of Scientific and Technical Information (OSTI.GOV)
Adams, Mark F.; Samtaney, Ravi; Brandt, Achi
2013-12-14
Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations – so-called “textbook” multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field,more » which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.« less
The Mixed Finite Element Multigrid Method for Stokes Equations
Muzhinji, K.; Shateyi, S.; Motsa, S. S.
2015-01-01
The stable finite element discretization of the Stokes problem produces a symmetric indefinite system of linear algebraic equations. A variety of iterative solvers have been proposed for such systems in an attempt to construct efficient, fast, and robust solution techniques. This paper investigates one of such iterative solvers, the geometric multigrid solver, to find the approximate solution of the indefinite systems. The main ingredient of the multigrid method is the choice of an appropriate smoothing strategy. This study considers the application of different smoothers and compares their effects in the overall performance of the multigrid solver. We study the multigrid method with the following smoothers: distributed Gauss Seidel, inexact Uzawa, preconditioned MINRES, and Braess-Sarazin type smoothers. A comparative study of the smoothers shows that the Braess-Sarazin smoothers enhance good performance of the multigrid method. We study the problem in a two-dimensional domain using stable Hood-Taylor Q 2-Q 1 pair of finite rectangular elements. We also give the main theoretical convergence results. We present the numerical results to demonstrate the efficiency and robustness of the multigrid method and confirm the theoretical results. PMID:25945361
High order multi-grid methods to solve the Poisson equation
NASA Technical Reports Server (NTRS)
Schaffer, S.
1981-01-01
High order multigrid methods based on finite difference discretization of the model problem are examined. The following methods are described: (1) a fixed high order FMG-FAS multigrid algorithm; (2) the high order methods; and (3) results are presented on four problems using each method with the same underlying fixed FMG-FAS algorithm.
Annual Copper Mountain Conferences on Multigrid and Iterative Methods, Copper Mountain, Colorado
DOE Office of Scientific and Technical Information (OSTI.GOV)
McCormick, Stephen F.
This project supported the Copper Mountain Conference on Multigrid and Iterative Methods, held from 2007 to 2015, at Copper Mountain, Colorado. The subject of the Copper Mountain Conference Series alternated between Multigrid Methods in odd-numbered years and Iterative Methods in even-numbered years. Begun in 1983, the Series represents an important forum for the exchange of ideas in these two closely related fields. This report describes the Copper Mountain Conference on Multigrid and Iterative Methods, 2007-2015. Information on the conference series is available at http://grandmaster.colorado.edu/~copper/.
Convergence acceleration of the Proteus computer code with multigrid methods
NASA Technical Reports Server (NTRS)
Demuren, A. O.; Ibraheem, S. O.
1995-01-01
This report presents the results of a study to implement convergence acceleration techniques based on the multigrid concept in the two-dimensional and three-dimensional versions of the Proteus computer code. The first section presents a review of the relevant literature on the implementation of the multigrid methods in computer codes for compressible flow analysis. The next two sections present detailed stability analysis of numerical schemes for solving the Euler and Navier-Stokes equations, based on conventional von Neumann analysis and the bi-grid analysis, respectively. The next section presents details of the computational method used in the Proteus computer code. Finally, the multigrid implementation and applications to several two-dimensional and three-dimensional test problems are presented. The results of the present study show that the multigrid method always leads to a reduction in the number of iterations (or time steps) required for convergence. However, there is an overhead associated with the use of multigrid acceleration. The overhead is higher in 2-D problems than in 3-D problems, thus overall multigrid savings in CPU time are in general better in the latter. Savings of about 40-50 percent are typical in 3-D problems, but they are about 20-30 percent in large 2-D problems. The present multigrid method is applicable to steady-state problems and is therefore ineffective in problems with inherently unstable solutions.
Multigrid Methods for Fully Implicit Oil Reservoir Simulation
NASA Technical Reports Server (NTRS)
Molenaar, J.
1996-01-01
In this paper we consider the simultaneous flow of oil and water in reservoir rock. This displacement process is modeled by two basic equations: the material balance or continuity equations and the equation of motion (Darcy's law). For the numerical solution of this system of nonlinear partial differential equations there are two approaches: the fully implicit or simultaneous solution method and the sequential solution method. In the sequential solution method the system of partial differential equations is manipulated to give an elliptic pressure equation and a hyperbolic (or parabolic) saturation equation. In the IMPES approach the pressure equation is first solved, using values for the saturation from the previous time level. Next the saturations are updated by some explicit time stepping method; this implies that the method is only conditionally stable. For the numerical solution of the linear, elliptic pressure equation multigrid methods have become an accepted technique. On the other hand, the fully implicit method is unconditionally stable, but it has the disadvantage that in every time step a large system of nonlinear algebraic equations has to be solved. The most time-consuming part of any fully implicit reservoir simulator is the solution of this large system of equations. Usually this is done by Newton's method. The resulting systems of linear equations are then either solved by a direct method or by some conjugate gradient type method. In this paper we consider the possibility of applying multigrid methods for the iterative solution of the systems of nonlinear equations. There are two ways of using multigrid for this job: either we use a nonlinear multigrid method or we use a linear multigrid method to deal with the linear systems that arise in Newton's method. So far only a few authors have reported on the use of multigrid methods for fully implicit simulations. Two-level FAS algorithm is presented for the black-oil equations, and linear multigrid for two-phase flow problems with strong heterogeneities and anisotropies is studied. Here we consider both possibilities. Moreover we present a novel way for constructing the coarse grid correction operator in linear multigrid algorithms. This approach has the advantage in that it preserves the sparsity pattern of the fine grid matrix and it can be extended to systems of equations in a straightforward manner. We compare the linear and nonlinear multigrid algorithms by means of a numerical experiment.
Multigrid method for the equilibrium equations of elasticity using a compact scheme
NASA Technical Reports Server (NTRS)
Taasan, S.
1986-01-01
A compact difference scheme is derived for treating the equilibrium equations of elasticity. The scheme is inconsistent and unstable. A multigrid method which takes into account these properties is described. The solution of the discrete equations, up to the level of discretization errors, is obtained by this method in just two multigrid cycles.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hu, Jonathan Joseph; Wiesner, Tobias A.; Prokopenko, Andrey
2014-10-01
The MueLu tutorial is written as a hands-on tutorial for MueLu, the next generation multigrid framework in Trilinos. It covers the whole spectrum from absolute beginners’ topics to expert level. Since the focus of this tutorial is on practical and technical aspects of multigrid methods in general and MueLu in particular, the reader is expected to have a basic understanding of multigrid methods and its general underlying concepts. Please refer to multigrid textbooks (e.g. [1]) for the theoretical background.
NASA Astrophysics Data System (ADS)
Hano, Mitsuo; Hotta, Masashi
A new multigrid method based on high-order vector finite elements is proposed in this paper. Low level discretizations in this method are obtained by using low-order vector finite elements for the same mesh. Gauss-Seidel method is used as a smoother, and a linear equation of lowest level is solved by ICCG method. But it is often found that multigrid solutions do not converge into ICCG solutions. An elimination algolithm of constant term using a null space of the coefficient matrix is also described. In three dimensional magnetostatic field analysis, convergence time and number of iteration of this multigrid method are discussed with the convectional ICCG method.
Multigrid techniques for unstructured meshes
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1995-01-01
An overview of current multigrid techniques for unstructured meshes is given. The basic principles of the multigrid approach are first outlined. Application of these principles to unstructured mesh problems is then described, illustrating various different approaches, and giving examples of practical applications. Advanced multigrid topics, such as the use of algebraic multigrid methods, and the combination of multigrid techniques with adaptive meshing strategies are dealt with in subsequent sections. These represent current areas of research, and the unresolved issues are discussed. The presentation is organized in an educational manner, for readers familiar with computational fluid dynamics, wishing to learn more about current unstructured mesh techniques.
Convergence acceleration of the Proteus computer code with multigrid methods
NASA Technical Reports Server (NTRS)
Demuren, A. O.; Ibraheem, S. O.
1992-01-01
Presented here is the first part of a study to implement convergence acceleration techniques based on the multigrid concept in the Proteus computer code. A review is given of previous studies on the implementation of multigrid methods in computer codes for compressible flow analysis. Also presented is a detailed stability analysis of upwind and central-difference based numerical schemes for solving the Euler and Navier-Stokes equations. Results are given of a convergence study of the Proteus code on computational grids of different sizes. The results presented here form the foundation for the implementation of multigrid methods in the Proteus code.
Evaluation of a Multigrid Scheme for the Incompressible Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Swanson, R. C.
2004-01-01
A fast multigrid solver for the steady, incompressible Navier-Stokes equations is presented. The multigrid solver is based upon a factorizable discrete scheme for the velocity-pressure form of the Navier-Stokes equations. This scheme correctly distinguishes between the advection-diffusion and elliptic parts of the operator, allowing efficient smoothers to be constructed. To evaluate the multigrid algorithm, solutions are computed for flow over a flat plate, parabola, and a Karman-Trefftz airfoil. Both nonlifting and lifting airfoil flows are considered, with a Reynolds number range of 200 to 800. Convergence and accuracy of the algorithm are discussed. Using Gauss-Seidel line relaxation in alternating directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of Runge-Kutta and implicit upwind based multigrid methods.
Vectorized multigrid Poisson solver for the CDC CYBER 205
NASA Technical Reports Server (NTRS)
Barkai, D.; Brandt, M. A.
1984-01-01
The full multigrid (FMG) method is applied to the two dimensional Poisson equation with Dirichlet boundary conditions. This has been chosen as a relatively simple test case for examining the efficiency of fully vectorizing of the multigrid method. Data structure and programming considerations and techniques are discussed, accompanied by performance details.
On the connection between multigrid and cyclic reduction
NASA Technical Reports Server (NTRS)
Merriam, M. L.
1984-01-01
A technique is shown whereby it is possible to relate a particular multigrid process to cyclic reduction using purely mathematical arguments. This technique suggest methods for solving Poisson's equation in 1-, 2-, or 3-dimensions with Dirichlet or Neumann boundary conditions. In one dimension the method is exact and, in fact, reduces to cyclic reduction. This provides a valuable reference point for understanding multigrid techniques. The particular multigrid process analyzed is referred to here as Approximate Cyclic Reduction (ACR) and is one of a class known as Multigrid Reduction methods in the literature. It involves one approximation with a known error term. It is possible to relate the error term in this approximation with certain eigenvector components of the error. These are sharply reduced in amplitude by classical relaxation techniques. The approximation can thus be made a very good one.
3D Parallel Multigrid Methods for Real-Time Fluid Simulation
NASA Astrophysics Data System (ADS)
Wan, Feifei; Yin, Yong; Zhang, Suiyu
2018-03-01
The multigrid method is widely used in fluid simulation because of its strong convergence. In addition to operating accuracy, operational efficiency is also an important factor to consider in order to enable real-time fluid simulation in computer graphics. For this problem, we compared the performance of the Algebraic Multigrid and the Geometric Multigrid in the V-Cycle and Full-Cycle schemes respectively, and analyze the convergence and speed of different methods. All the calculations are done on the parallel computing of GPU in this paper. Finally, we experiment with the 3D-grid for each scale, and give the exact experimental results.
A Conforming Multigrid Method for the Pure Traction Problem of Linear Elasticity: Mixed Formulation
NASA Technical Reports Server (NTRS)
Lee, Chang-Ock
1996-01-01
A multigrid method using conforming P-1 finite element is developed for the two-dimensional pure traction boundary value problem of linear elasticity. The convergence is uniform even as the material becomes nearly incompressible. A heuristic argument for acceleration of the multigrid method is discussed as well. Numerical results with and without this acceleration as well as performance estimates on a parallel computer are included.
NASA Technical Reports Server (NTRS)
Chen, Zhangxin; Ewing, Richard E.
1996-01-01
Multigrid algorithms for nonconforming and mixed finite element methods for second order elliptic problems on triangular and rectangular finite elements are considered. The construction of several coarse-to-fine intergrid transfer operators for nonconforming multigrid algorithms is discussed. The equivalence between the nonconforming and mixed finite element methods with and without projection of the coefficient of the differential problems into finite element spaces is described.
Multigrid methods for bifurcation problems: The self adjoint case
NASA Technical Reports Server (NTRS)
Taasan, Shlomo
1987-01-01
This paper deals with multigrid methods for computational problems that arise in the theory of bifurcation and is restricted to the self adjoint case. The basic problem is to solve for arcs of solutions, a task that is done successfully with an arc length continuation method. Other important issues are, for example, detecting and locating singular points as part of the continuation process, switching branches at bifurcation points, etc. Multigrid methods have been applied to continuation problems. These methods work well at regular points and at limit points, while they may encounter difficulties in the vicinity of bifurcation points. A new continuation method that is very efficient also near bifurcation points is presented here. The other issues mentioned above are also treated very efficiently with appropriate multigrid algorithms. For example, it is shown that limit points and bifurcation points can be solved for directly by a multigrid algorithm. Moreover, the algorithms presented here solve the corresponding problems in just a few work units (about 10 or less), where a work unit is the work involved in one local relaxation on the finest grid.
NASA Technical Reports Server (NTRS)
Atkins, H. L.; Helenbrook, B. T.
2005-01-01
This paper describes numerical experiments with P-multigrid to corroborate analysis, validate the present implementation, and to examine issues that arise in the implementations of the various combinations of relaxation schemes, discretizations and P-multigrid methods. The two approaches to implement P-multigrid presented here are equivalent for most high-order discretization methods such as spectral element, SUPG, and discontinuous Galerkin applied to advection; however it is discovered that the approach that mimics the common geometric multigrid implementation is less robust, and frequently unstable when applied to discontinuous Galerkin discretizations of di usion. Gauss-Seidel relaxation converges 40% faster than block Jacobi, as predicted by analysis; however, the implementation of Gauss-Seidel is considerably more expensive that one would expect because gradients in most neighboring elements must be updated. A compromise quasi Gauss-Seidel relaxation method that evaluates the gradient in each element twice per iteration converges at rates similar to those predicted for true Gauss-Seidel.
A multigrid nonoscillatory method for computing high speed flows
NASA Technical Reports Server (NTRS)
Li, C. P.; Shieh, T. H.
1993-01-01
A multigrid method using different smoothers has been developed to solve the Euler equations discretized by a nonoscillatory scheme up to fourth order accuracy. The best smoothing property is provided by a five-stage Runge-Kutta technique with optimized coefficients, yet the most efficient smoother is a backward Euler technique in factored and diagonalized form. The singlegrid solution for a hypersonic, viscous conic flow is in excellent agreement with the solution obtained by the third order MUSCL and Roe's method. Mach 8 inviscid flow computations for a complete entry probe have shown that the accuracy is at least as good as the symmetric TVD scheme of Yee and Harten. The implicit multigrid method is four times more efficient than the explicit multigrid technique and 3.5 times faster than the single-grid implicit technique. For a Mach 8.7 inviscid flow over a blunt delta wing at 30 deg incidence, the CPU reduction factor from the three-level multigrid computation is 2.2 on a grid of 37 x 41 x 73 nodes.
New Nonlinear Multigrid Analysis
NASA Technical Reports Server (NTRS)
Xie, Dexuan
1996-01-01
The nonlinear multigrid is an efficient algorithm for solving the system of nonlinear equations arising from the numerical discretization of nonlinear elliptic boundary problems. In this paper, we present a new nonlinear multigrid analysis as an extension of the linear multigrid theory presented by Bramble. In particular, we prove the convergence of the nonlinear V-cycle method for a class of mildly nonlinear second order elliptic boundary value problems which do not have full elliptic regularity.
Numerical Methods for Forward and Inverse Problems in Discontinuous Media
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chartier, Timothy P.
The research emphasis under this grant's funding is in the area of algebraic multigrid methods. The research has two main branches: 1) exploring interdisciplinary applications in which algebraic multigrid can make an impact and 2) extending the scope of algebraic multigrid methods with algorithmic improvements that are based in strong analysis.The work in interdisciplinary applications falls primarily in the field of biomedical imaging. Work under this grant demonstrated the effectiveness and robustness of multigrid for solving linear systems that result from highly heterogeneous finite element method models of the human head. The results in this work also give promise tomore » medical advances possible with software that may be developed. Research to extend the scope of algebraic multigrid has been focused in several areas. In collaboration with researchers at the University of Colorado, Lawrence Livermore National Laboratory, and Los Alamos National Laboratory, the PI developed an adaptive multigrid with subcycling via complementary grids. This method has very cheap computing costs per iterate and is showing promise as a preconditioner for conjugate gradient. Recent work with Los Alamos National Laboratory concentrates on developing algorithms that take advantage of the recent advances in adaptive multigrid research. The results of the various efforts in this research could ultimately have direct use and impact to researchers for a wide variety of applications, including, astrophysics, neuroscience, contaminant transport in porous media, bi-domain heart modeling, modeling of tumor growth, and flow in heterogeneous porous media. This work has already led to basic advances in computational mathematics and numerical linear algebra and will continue to do so into the future.« less
Geometric multigrid for an implicit-time immersed boundary method
DOE Office of Scientific and Technical Information (OSTI.GOV)
Guy, Robert D.; Philip, Bobby; Griffith, Boyce E.
2014-10-12
The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methodsmore » require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.« less
Multigrid accelerated simulations for Twisted Mass fermions
NASA Astrophysics Data System (ADS)
Bacchio, Simone; Alexandrou, Constantia; Finkerath, Jacob
2018-03-01
Simulations at physical quark masses are affected by the critical slowing down of the solvers. Multigrid preconditioning has proved to deal effectively with this problem. Multigrid accelerated simulations at the physical value of the pion mass are being performed to generate Nf = 2 and Nf = 2 + 1 + 1 gauge ensembles using twisted mass fermions. The adaptive aggregation-based domain decomposition multigrid solver, referred to as DD-αAMG method, is employed for these simulations. Our simulation strategy consists of an hybrid approach of different solvers, involving the Conjugate Gradient (CG), multi-mass-shift CG and DD-αAMG solvers. We present an analysis of the multigrid performance during the simulations discussing the stability of the method. This significant speeds up the Hybrid Monte Carlo simulation by more than a factor 4 at physical pion mass compared to the usage of the CG solver.
Multigrid Methods for Aerodynamic Problems in Complex Geometries
NASA Technical Reports Server (NTRS)
Caughey, David A.
1995-01-01
Work has been directed at the development of efficient multigrid methods for the solution of aerodynamic problems involving complex geometries, including the development of computational methods for the solution of both inviscid and viscous transonic flow problems. The emphasis is on problems of complex, three-dimensional geometry. The methods developed are based upon finite-volume approximations to both the Euler and the Reynolds-Averaged Navier-Stokes equations. The methods are developed for use on multi-block grids using diagonalized implicit multigrid methods to achieve computational efficiency. The work is focused upon aerodynamic problems involving complex geometries, including advanced engine inlets.
An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE
NASA Technical Reports Server (NTRS)
Baysal, Oktay; Lessard, Victor R.
1990-01-01
The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.
NASA Technical Reports Server (NTRS)
Jentink, Thomas Neil; Usab, William J., Jr.
1990-01-01
An explicit, Multigrid algorithm was written to solve the Euler and Navier-Stokes equations with special consideration given to the coarse mesh boundary conditions. These are formulated in a manner consistent with the interior solution, utilizing forcing terms to prevent coarse-mesh truncation error from affecting the fine-mesh solution. A 4-Stage Hybrid Runge-Kutta Scheme is used to advance the solution in time, and Multigrid convergence is further enhanced by using local time-stepping and implicit residual smoothing. Details of the algorithm are presented along with a description of Jameson's standard Multigrid method and a new approach to formulating the Multigrid equations.
NASA Technical Reports Server (NTRS)
Fay, John F.
1990-01-01
A calculation is made of the stability of various relaxation schemes for the numerical solution of partial differential equations. A multigrid acceleration method is introduced, and its effects on stability are explored. A detailed stability analysis of a simple case is carried out and verified by numerical experiment. It is shown that the use of multigrids can speed convergence by several orders of magnitude without adversely affecting stability.
Monolithic multigrid methods for two-dimensional resistive magnetohydrodynamics
Adler, James H.; Benson, Thomas R.; Cyr, Eric C.; ...
2016-01-06
Magnetohydrodynamic (MHD) representations are used to model a wide range of plasma physics applications and are characterized by a nonlinear system of partial differential equations that strongly couples a charged fluid with the evolution of electromagnetic fields. The resulting linear systems that arise from discretization and linearization of the nonlinear problem are generally difficult to solve. In this paper, we investigate multigrid preconditioners for this system. We consider two well-known multigrid relaxation methods for incompressible fluid dynamics: Braess--Sarazin relaxation and Vanka relaxation. We first extend these to the context of steady-state one-fluid viscoresistive MHD. Then we compare the two relaxationmore » procedures within a multigrid-preconditioned GMRES method employed within Newton's method. To isolate the effects of the different relaxation methods, we use structured grids, inf-sup stable finite elements, and geometric interpolation. Furthermore, we present convergence and timing results for a two-dimensional, steady-state test problem.« less
Uniform convergence of multigrid V-cycle iterations for indefinite and nonsymmetric problems
NASA Technical Reports Server (NTRS)
Bramble, James H.; Kwak, Do Y.; Pasciak, Joseph E.
1993-01-01
In this paper, we present an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems. In this multigrid method various types of smoothers may be used. One type of smoother which we consider is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. We also study smoothers based entirely on the original operator. One is based on the normal form, that is, the product of the operator and its transpose. Other smoothers studied include point and line, Jacobi, and Gauss-Seidel. We show that the uniform estimates for symmetric positive definite problems carry over to these algorithms. More precisely, the multigrid iteration for the nonsymmetric and/or indefinite problem is shown to converge at a uniform rate provided that the coarsest grid in the multilevel iteration is sufficiently fine (but not depending on the number of multigrid levels).
A positivity-preserving, implicit defect-correction multigrid method for turbulent combustion
NASA Astrophysics Data System (ADS)
Wasserman, M.; Mor-Yossef, Y.; Greenberg, J. B.
2016-07-01
A novel, robust multigrid method for the simulation of turbulent and chemically reacting flows is developed. A survey of previous attempts at implementing multigrid for the problems at hand indicated extensive use of artificial stabilization to overcome numerical instability arising from non-linearity of turbulence and chemistry model source-terms, small-scale physics of combustion, and loss of positivity. These issues are addressed in the current work. The highly stiff Reynolds-averaged Navier-Stokes (RANS) equations, coupled with turbulence and finite-rate chemical kinetics models, are integrated in time using the unconditionally positive-convergent (UPC) implicit method. The scheme is successfully extended in this work for use with chemical kinetics models, in a fully-coupled multigrid (FC-MG) framework. To tackle the degraded performance of multigrid methods for chemically reacting flows, two major modifications are introduced with respect to the basic, Full Approximation Storage (FAS) approach. First, a novel prolongation operator that is based on logarithmic variables is proposed to prevent loss of positivity due to coarse-grid corrections. Together with the extended UPC implicit scheme, the positivity-preserving prolongation operator guarantees unconditional positivity of turbulence quantities and species mass fractions throughout the multigrid cycle. Second, to improve the coarse-grid-correction obtained in localized regions of high chemical activity, a modified defect correction procedure is devised, and successfully applied for the first time to simulate turbulent, combusting flows. The proposed modifications to the standard multigrid algorithm create a well-rounded and robust numerical method that provides accelerated convergence, while unconditionally preserving the positivity of model equation variables. Numerical simulations of various flows involving premixed combustion demonstrate that the proposed MG method increases the efficiency by a factor of up to eight times with respect to an equivalent single-grid method, and by two times with respect to an artificially-stabilized MG method.
A highly parallel multigrid-like method for the solution of the Euler equations
NASA Technical Reports Server (NTRS)
Tuminaro, Ray S.
1989-01-01
We consider a highly parallel multigrid-like method for the solution of the two dimensional steady Euler equations. The new method, introduced as filtering multigrid, is similar to a standard multigrid scheme in that convergence on the finest grid is accelerated by iterations on coarser grids. In the filtering method, however, additional fine grid subproblems are processed concurrently with coarse grid computations to further accelerate convergence. These additional problems are obtained by splitting the residual into a smooth and an oscillatory component. The smooth component is then used to form a coarse grid problem (similar to standard multigrid) while the oscillatory component is used for a fine grid subproblem. The primary advantage in the filtering approach is that fewer iterations are required and that most of the additional work per iteration can be performed in parallel with the standard coarse grid computations. We generalize the filtering algorithm to a version suitable for nonlinear problems. We emphasize that this generalization is conceptually straight-forward and relatively easy to implement. In particular, no explicit linearization (e.g., formation of Jacobians) needs to be performed (similar to the FAS multigrid approach). We illustrate the nonlinear version by applying it to the Euler equations, and presenting numerical results. Finally, a performance evaluation is made based on execution time models and convergence information obtained from numerical experiments.
1988-08-01
Time Series 53. J. Barros-Neto and R. A. Artino, Hypoelliptic Boundary-Value Problems 54. R. L. Sternberg, A. J. Kalinowski, and J. S. Papadakis... Systems 95. C E. AuL Rings of Continuous Functions 96. R. Chuaqui, Analysis , Geometry, and Probability 97. L. Fuchs and L. Sace, Modules Over...Local Refinements for a Class of Nonshared Memory Systems 449 Hermann Mierendorif Analysis of a Multigrid Method for the Euler Equations of Gas Dynamics
Multigrid schemes for viscous hypersonic flows
NASA Technical Reports Server (NTRS)
Swanson, R. C.; Radespiel, R.
1993-01-01
Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm employs upwind spatial discretization with explicit multistage time stepping. Two-level versions of the various multigrid algorithms are applied to the two-dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving two different hypersonic flow problems. Some new multigrid schemes, based on semicoarsening strategies, are shown to be quite effective in relieving the stiffness caused by the high-aspect-ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6).
Multigrid methods for isogeometric discretization
Gahalaut, K.P.S.; Kraus, J.K.; Tomar, S.K.
2013-01-01
We present (geometric) multigrid methods for isogeometric discretization of scalar second order elliptic problems. The smoothing property of the relaxation method, and the approximation property of the intergrid transfer operators are analyzed. These properties, when used in the framework of classical multigrid theory, imply uniform convergence of two-grid and multigrid methods. Supporting numerical results are provided for the smoothing property, the approximation property, convergence factor and iterations count for V-, W- and F-cycles, and the linear dependence of V-cycle convergence on the smoothing steps. For two dimensions, numerical results include the problems with variable coefficients, simple multi-patch geometry, a quarter annulus, and the dependence of convergence behavior on refinement levels ℓ, whereas for three dimensions, only the constant coefficient problem in a unit cube is considered. The numerical results are complete up to polynomial order p=4, and for C0 and Cp-1 smoothness. PMID:24511168
Multigrid Acceleration of Time-Accurate DNS of Compressible Turbulent Flow
NASA Technical Reports Server (NTRS)
Broeze, Jan; Geurts, Bernard; Kuerten, Hans; Streng, Martin
1996-01-01
An efficient scheme for the direct numerical simulation of 3D transitional and developed turbulent flow is presented. Explicit and implicit time integration schemes for the compressible Navier-Stokes equations are compared. The nonlinear system resulting from the implicit time discretization is solved with an iterative method and accelerated by the application of a multigrid technique. Since we use central spatial discretizations and no artificial dissipation is added to the equations, the smoothing method is less effective than in the more traditional use of multigrid in steady-state calculations. Therefore, a special prolongation method is needed in order to obtain an effective multigrid method. This simulation scheme was studied in detail for compressible flow over a flat plate. In the laminar regime and in the first stages of turbulent flow the implicit method provides a speed-up of a factor 2 relative to the explicit method on a relatively coarse grid. At increased resolution this speed-up is enhanced correspondingly.
Multidimensional radiative transfer with multilevel atoms. II. The non-linear multigrid method.
NASA Astrophysics Data System (ADS)
Fabiani Bendicho, P.; Trujillo Bueno, J.; Auer, L.
1997-08-01
A new iterative method for solving non-LTE multilevel radiative transfer (RT) problems in 1D, 2D or 3D geometries is presented. The scheme obtains the self-consistent solution of the kinetic and RT equations at the cost of only a few (<10) formal solutions of the RT equation. It combines, for the first time, non-linear multigrid iteration (Brandt, 1977, Math. Comp. 31, 333; Hackbush, 1985, Multi-Grid Methods and Applications, springer-Verlag, Berlin), an efficient multilevel RT scheme based on Gauss-Seidel iterations (cf. Trujillo Bueno & Fabiani Bendicho, 1995ApJ...455..646T), and accurate short-characteristics formal solution techniques. By combining a valid stopping criterion with a nested-grid strategy a converged solution with the desired true error is automatically guaranteed. Contrary to the current operator splitting methods the very high convergence speed of the new RT method does not deteriorate when the grid spatial resolution is increased. With this non-linear multigrid method non-LTE problems discretized on N grid points are solved in O(N) operations. The nested multigrid RT method presented here is, thus, particularly attractive in complicated multilevel transfer problems where small grid-sizes are required. The properties of the method are analyzed both analytically and with illustrative multilevel calculations for Ca II in 1D and 2D schematic model atmospheres.
Eigensystem analysis of classical relaxation techniques with applications to multigrid analysis
NASA Technical Reports Server (NTRS)
Lomax, Harvard; Maksymiuk, Catherine
1987-01-01
Classical relaxation techniques are related to numerical methods for solution of ordinary differential equations. Eigensystems for Point-Jacobi, Gauss-Seidel, and SOR methods are presented. Solution techniques such as eigenvector annihilation, eigensystem mixing, and multigrid methods are examined with regard to the eigenstructure.
New multigrid approach for three-dimensional unstructured, adaptive grids
NASA Technical Reports Server (NTRS)
Parthasarathy, Vijayan; Kallinderis, Y.
1994-01-01
A new multigrid method with adaptive unstructured grids is presented. The three-dimensional Euler equations are solved on tetrahedral grids that are adaptively refined or coarsened locally. The multigrid method is employed to propagate the fine grid corrections more rapidly by redistributing the changes-in-time of the solution from the fine grid to the coarser grids to accelerate convergence. A new approach is employed that uses the parent cells of the fine grid cells in an adapted mesh to generate successively coaser levels of multigrid. This obviates the need for the generation of a sequence of independent, nonoverlapping grids as well as the relatively complicated operations that need to be performed to interpolate the solution and the residuals between the independent grids. The solver is an explicit, vertex-based, finite volume scheme that employs edge-based data structures and operations. Spatial discretization is of central-differencing type combined with a special upwind-like smoothing operators. Application cases include adaptive solutions obtained with multigrid acceleration for supersonic and subsonic flow over a bump in a channel, as well as transonic flow around the ONERA M6 wing. Two levels of multigrid resulted in reduction in the number of iterations by a factor of 5.
NASA Astrophysics Data System (ADS)
Caughey, David A.; Jameson, Antony
2003-10-01
New versions of implicit algorithms are developed for the efficient solution of the Euler and Navier-Stokes equations of compressible flow. The methods are based on a preconditioned, lower-upper (LU) implementation of a non-linear, symmetric Gauss-Seidel (SGS) algorithm for use as a smoothing algorithm in a multigrid method. Previously, this method had been implemented for flows in quasi-one-dimensional ducts and for two-dimensional flows past airfoils on boundary-conforming O-type grids for a variety of symmetric limited positive (SLIP) spatial approximations, including the scalar dissipation and convective upwind split pressure (CUSP) schemes. Here results are presented for both inviscid and viscous (laminar) flows past airfoils on boundary-conforming C-type grids. The method is significantly faster than earlier explicit or implicit methods for inviscid problems, allowing solution of these problems to the level of truncation error in three to five multigrid cycles. Viscous solutions still require as many as twenty multigrid cycles.
The block adaptive multigrid method applied to the solution of the Euler equations
NASA Technical Reports Server (NTRS)
Pantelelis, Nikos
1993-01-01
In the present study, a scheme capable of solving very fast and robust complex nonlinear systems of equations is presented. The Block Adaptive Multigrid (BAM) solution method offers multigrid acceleration and adaptive grid refinement based on the prediction of the solution error. The proposed solution method was used with an implicit upwind Euler solver for the solution of complex transonic flows around airfoils. Very fast results were obtained (18-fold acceleration of the solution) using one fourth of the volumes of a global grid with the same solution accuracy for two test cases.
Progress with multigrid schemes for hypersonic flow problems
NASA Technical Reports Server (NTRS)
Radespiel, R.; Swanson, R. C.
1991-01-01
Several multigrid schemes are considered for the numerical computation of viscous hypersonic flows. For each scheme, the basic solution algorithm uses upwind spatial discretization with explicit multistage time stepping. Two level versions of the various multigrid algorithms are applied to the two dimensional advection equation, and Fourier analysis is used to determine their damping properties. The capabilities of the multigrid methods are assessed by solving three different hypersonic flow problems. Some new multigrid schemes based on semicoarsening strategies are shown to be quite effective in relieving the stiffness caused by the high aspect ratio cells required to resolve high Reynolds number flows. These schemes exhibit good convergence rates for Reynolds numbers up to 200 x 10(exp 6) and Mach numbers up to 25.
ML 3.0 smoothed aggregation user's guide.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sala, Marzio; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen
2004-05-01
ML is a multigrid preconditioning package intended to solve linear systems of equations Az = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. ML should be used on large sparse linear systems arising from partial differential equation (PDE) discretizations. While technically any linear system can be considered, ML should be used on linear systems that correspond to things that work well with multigrid methods (e.g. elliptic PDEs). ML can be used as a stand-alone package ormore » to generate preconditioners for a traditional iterative solver package (e.g. Krylov methods). We have supplied support for working with the AZTEC 2.1 and AZTECOO iterative package [15]. However, other solvers can be used by supplying a few functions. This document describes one specific algebraic multigrid approach: smoothed aggregation. This approach is used within several specialized multigrid methods: one for the eddy current formulation for Maxwell's equations, and a multilevel and domain decomposition method for symmetric and non-symmetric systems of equations (like elliptic equations, or compressible and incompressible fluid dynamics problems). Other methods exist within ML but are not described in this document. Examples are given illustrating the problem definition and exercising multigrid options.« less
ML 3.1 smoothed aggregation user's guide.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Sala, Marzio; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen
2004-10-01
ML is a multigrid preconditioning package intended to solve linear systems of equations Ax = b where A is a user supplied n x n sparse matrix, b is a user supplied vector of length n and x is a vector of length n to be computed. ML should be used on large sparse linear systems arising from partial differential equation (PDE) discretizations. While technically any linear system can be considered, ML should be used on linear systems that correspond to things that work well with multigrid methods (e.g. elliptic PDEs). ML can be used as a stand-alone package ormore » to generate preconditioners for a traditional iterative solver package (e.g. Krylov methods). We have supplied support for working with the Aztec 2.1 and AztecOO iterative package [16]. However, other solvers can be used by supplying a few functions. This document describes one specific algebraic multigrid approach: smoothed aggregation. This approach is used within several specialized multigrid methods: one for the eddy current formulation for Maxwell's equations, and a multilevel and domain decomposition method for symmetric and nonsymmetric systems of equations (like elliptic equations, or compressible and incompressible fluid dynamics problems). Other methods exist within ML but are not described in this document. Examples are given illustrating the problem definition and exercising multigrid options.« less
Robust Multigrid Smoothers for Three Dimensional Elliptic Equations with Strong Anisotropies
NASA Technical Reports Server (NTRS)
Llorente, Ignacio M.; Melson, N. Duane
1998-01-01
We discuss the behavior of several plane relaxation methods as multigrid smoothers for the solution of a discrete anisotropic elliptic model problem on cell-centered grids. The methods compared are plane Jacobi with damping, plane Jacobi with partial damping, plane Gauss-Seidel, plane zebra Gauss-Seidel, and line Gauss-Seidel. Based on numerical experiments and local mode analysis, we compare the smoothing factor of the different methods in the presence of strong anisotropies. A four-color Gauss-Seidel method is found to have the best numerical and architectural properties of the methods considered in the present work. Although alternating direction plane relaxation schemes are simpler and more robust than other approaches, they are not currently used in industrial and production codes because they require the solution of a two-dimensional problem for each plane in each direction. We verify the theoretical predictions of Thole and Trottenberg that an exact solution of each plane is not necessary and that a single two-dimensional multigrid cycle gives the same result as an exact solution, in much less execution time. Parallelization of the two-dimensional multigrid cycles, the kernel of the three-dimensional implicit solver, is also discussed. Alternating-plane smoothers are found to be highly efficient multigrid smoothers for anisotropic elliptic problems.
A multigrid method for steady Euler equations on unstructured adaptive grids
NASA Technical Reports Server (NTRS)
Riemslagh, Kris; Dick, Erik
1993-01-01
A flux-difference splitting type algorithm is formulated for the steady Euler equations on unstructured grids. The polynomial flux-difference splitting technique is used. A vertex-centered finite volume method is employed on a triangular mesh. The multigrid method is in defect-correction form. A relaxation procedure with a first order accurate inner iteration and a second-order correction performed only on the finest grid, is used. A multi-stage Jacobi relaxation method is employed as a smoother. Since the grid is unstructured a Jacobi type is chosen. The multi-staging is necessary to provide sufficient smoothing properties. The domain is discretized using a Delaunay triangular mesh generator. Three grids with more or less uniform distribution of nodes but with different resolution are generated by successive refinement of the coarsest grid. Nodes of coarser grids appear in the finer grids. The multigrid method is started on these grids. As soon as the residual drops below a threshold value, an adaptive refinement is started. The solution on the adaptively refined grid is accelerated by a multigrid procedure. The coarser multigrid grids are generated by successive coarsening through point removement. The adaption cycle is repeated a few times. Results are given for the transonic flow over a NACA-0012 airfoil.
An adaptive grid algorithm for one-dimensional nonlinear equations
NASA Technical Reports Server (NTRS)
Gutierrez, William E.; Hills, Richard G.
1990-01-01
Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.
Multigrid Methods for the Computation of Propagators in Gauge Fields
NASA Astrophysics Data System (ADS)
Kalkreuter, Thomas
Multigrid methods were invented for the solution of discretized partial differential equations in order to overcome the slowness of traditional algorithms by updates on various length scales. In the present work generalizations of multigrid methods for propagators in gauge fields are investigated. Gauge fields are incorporated in algorithms in a covariant way. The kernel C of the restriction operator which averages from one grid to the next coarser grid is defined by projection on the ground-state of a local Hamiltonian. The idea behind this definition is that the appropriate notion of smoothness depends on the dynamics. The ground-state projection choice of C can be used in arbitrary dimension and for arbitrary gauge group. We discuss proper averaging operations for bosons and for staggered fermions. The kernels C can also be used in multigrid Monte Carlo simulations, and for the definition of block spins and blocked gauge fields in Monte Carlo renormalization group studies. Actual numerical computations are performed in four-dimensional SU(2) gauge fields. We prove that our proposals for block spins are “good”, using renormalization group arguments. A central result is that the multigrid method works in arbitrarily disordered gauge fields, in principle. It is proved that computations of propagators in gauge fields without critical slowing down are possible when one uses an ideal interpolation kernel. Unfortunately, the idealized algorithm is not practical, but it was important to answer questions of principle. Practical methods are able to outperform the conjugate gradient algorithm in case of bosons. The case of staggered fermions is harder. Multigrid methods give considerable speed-ups compared to conventional relaxation algorithms, but on lattices up to 184 conjugate gradient is superior.
Applications of multigrid software in the atmospheric sciences
NASA Technical Reports Server (NTRS)
Adams, J.; Garcia, R.; Gross, B.; Hack, J.; Haidvogel, D.; Pizzo, V.
1992-01-01
Elliptic partial differential equations from different areas in the atmospheric sciences are efficiently and easily solved utilizing the multigrid software package named MUDPACK. It is demonstrated that the multigrid method is more efficient than other commonly employed techniques, such as Gaussian elimination and fixed-grid relaxation. The efficiency relative to other techniques, both in terms of storage requirement and computational time, increases quickly with grid size.
Multigrid and Krylov Subspace Methods for the Discrete Stokes Equations
NASA Technical Reports Server (NTRS)
Elman, Howard C.
1996-01-01
Discretization of the Stokes equations produces a symmetric indefinite system of linear equations. For stable discretizations, a variety of numerical methods have been proposed that have rates of convergence independent of the mesh size used in the discretization. In this paper, we compare the performance of four such methods: variants of the Uzawa, preconditioned conjugate gradient, preconditioned conjugate residual, and multigrid methods, for solving several two-dimensional model problems. The results indicate that where it is applicable, multigrid with smoothing based on incomplete factorization is more efficient than the other methods, but typically by no more than a factor of two. The conjugate residual method has the advantage of being both independent of iteration parameters and widely applicable.
A multigrid solver for the semiconductor equations
NASA Technical Reports Server (NTRS)
Bachmann, Bernhard
1993-01-01
We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.
Multigrid methods in structural mechanics
NASA Technical Reports Server (NTRS)
Raju, I. S.; Bigelow, C. A.; Taasan, S.; Hussaini, M. Y.
1986-01-01
Although the application of multigrid methods to the equations of elasticity has been suggested, few such applications have been reported in the literature. In the present work, multigrid techniques are applied to the finite element analysis of a simply supported Bernoulli-Euler beam, and various aspects of the multigrid algorithm are studied and explained in detail. In this study, six grid levels were used to model half the beam. With linear prolongation and sequential ordering, the multigrid algorithm yielded results which were of machine accuracy with work equivalent to 200 standard Gauss-Seidel iterations on the fine grid. Also with linear prolongation and sequential ordering, the V(1,n) cycle with n greater than 2 yielded better convergence rates than the V(n,1) cycle. The restriction and prolongation operators were derived based on energy principles. Conserving energy during the inter-grid transfers required that the prolongation operator be the transpose of the restriction operator, and led to improved convergence rates. With energy-conserving prolongation and sequential ordering, the multigrid algorithm yielded results of machine accuracy with a work equivalent to 45 Gauss-Seidel iterations on the fine grid. The red-black ordering of relaxations yielded solutions of machine accuracy in a single V(1,1) cycle, which required work equivalent to about 4 iterations on the finest grid level.
NASA Astrophysics Data System (ADS)
Ge, Yongbin; Cao, Fujun
2011-05-01
In this paper, a multigrid method based on the high order compact (HOC) difference scheme on nonuniform grids, which has been proposed by Kalita et al. [J.C. Kalita, A.K. Dass, D.C. Dalal, A transformation-free HOC scheme for steady convection-diffusion on non-uniform grids, Int. J. Numer. Methods Fluids 44 (2004) 33-53], is proposed to solve the two-dimensional (2D) convection diffusion equation. The HOC scheme is not involved in any grid transformation to map the nonuniform grids to uniform grids, consequently, the multigrid method is brand-new for solving the discrete system arising from the difference equation on nonuniform grids. The corresponding multigrid projection and interpolation operators are constructed by the area ratio. Some boundary layer and local singularity problems are used to demonstrate the superiority of the present method. Numerical results show that the multigrid method with the HOC scheme on nonuniform grids almost gets as equally efficient convergence rate as on uniform grids and the computed solution on nonuniform grids retains fourth order accuracy while on uniform grids just gets very poor solution for very steep boundary layer or high local singularity problems. The present method is also applied to solve the 2D incompressible Navier-Stokes equations using the stream function-vorticity formulation and the numerical solutions of the lid-driven cavity flow problem are obtained and compared with solutions available in the literature.
Updated users' guide for TAWFIVE with multigrid
NASA Technical Reports Server (NTRS)
Melson, N. Duane; Streett, Craig L.
1989-01-01
A program for the Transonic Analysis of a Wing and Fuselage with Interacted Viscous Effects (TAWFIVE) was improved by the incorporation of multigrid and a method to specify lift coefficient rather than angle-of-attack. A finite volume full potential multigrid method is used to model the outer inviscid flow field. First order viscous effects are modeled by a 3-D integral boundary layer method. Both turbulent and laminar boundary layers are treated. Wake thickness effects are modeled using a 2-D strip method. A brief discussion of the engineering aspects of the program is given. The input, output, and use of the program are covered in detail. Sample results are given showing the effects of boundary layer corrections and the capability of the lift specification method.
NASA Astrophysics Data System (ADS)
Tzanos, Constantine P.
1992-10-01
A higher-order differencing scheme (Tzanos, 1990) is used in conjunction with a multigrid approach to obtain accurate solutions of the Navier-Stokes convection-diffusion equations at high Re numbers. Flow in a square cavity with a moving lid is used as a test problem. a multigrid approach based on the additive correction method (Settari and Aziz) and an iterative incomplete lower and upper solver demonstrated good performance for the whole range of Re number under consideration (from 1000 to 10,000) and for both uniform and nonuniform grids. It is concluded that the combination of the higher-order differencing scheme with a multigrid approach proved to be an effective technique for giving accurate solutions of the Navier-Stokes equations at high Re numbers.
Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
NASA Astrophysics Data System (ADS)
Shen, Zhao-Li; Huang, Ting-Zhu; Carpentieri, Bruno; Wen, Chun; Gu, Xian-Ming
2018-06-01
Recently, the adaptive algebraic aggregation multigrid method has been proposed for computing stationary distributions of Markov chains. This method updates aggregates on every iterative cycle to keep high accuracies of coarse-level corrections. Accordingly, its fast convergence rate is well guaranteed, but often a large proportion of time is cost by aggregation processes. In this paper, we show that the aggregates on each level in this method can be utilized to transfer the probability equation of that level into a block linear system. Then we propose a Block-Jacobi relaxation that deals with the block system on each level to smooth error. Some theoretical analysis of this technique is presented, meanwhile it is also adapted to solve PageRank problems. The purpose of this technique is to accelerate the adaptive aggregation multigrid method and its variants for solving Markov chains and PageRank problems. It also attempts to shed some light on new solutions for making aggregation processes more cost-effective for aggregation multigrid methods. Numerical experiments are presented to illustrate the effectiveness of this technique.
NASA Technical Reports Server (NTRS)
Thomas, J. L.; Diskin, B.; Brandt, A.
1999-01-01
The distributed-relaxation multigrid and defect- correction methods are applied to the two- dimensional compressible Navier-Stokes equations. The formulation is intended for high Reynolds number applications and several applications are made at a laminar Reynolds number of 10,000. A staggered- grid arrangement of variables is used; the coupled pressure and internal energy equations are solved together with multigrid, requiring a block 2x2 matrix solution. Textbook multigrid efficiencies are attained for incompressible and slightly compressible simulations of the boundary layer on a flat plate. Textbook efficiencies are obtained for compressible simulations up to Mach numbers of 0.7 for a viscous wake simulation.
Spectral multigrid methods for elliptic equations 2
NASA Technical Reports Server (NTRS)
Zang, T. A.; Wong, Y. S.; Hussaini, M. Y.
1983-01-01
A detailed description of spectral multigrid methods is provided. This includes the interpolation and coarse-grid operators for both periodic and Dirichlet problems. The spectral methods for periodic problems use Fourier series and those for Dirichlet problems are based upon Chebyshev polynomials. An improved preconditioning for Dirichlet problems is given. Numerical examples and practical advice are included.
Multigrid Solution of the Navier-Stokes Equations at Low Speeds with Large Temperature Variations
NASA Technical Reports Server (NTRS)
Sockol, Peter M.
2002-01-01
Multigrid methods for the Navier-Stokes equations at low speeds and large temperature variations are investigated. The compressible equations with time-derivative preconditioning and preconditioned flux-difference splitting of the inviscid terms are used. Three implicit smoothers have been incorporated into a common multigrid procedure. Both full coarsening and semi-coarsening with directional fine-grid defect correction have been studied. The resulting methods have been tested on four 2D laminar problems over a range of Reynolds numbers on both uniform and highly stretched grids. Two of the three methods show efficient and robust performance over the entire range of conditions. In addition none of the methods have any difficulty with the large temperature variations.
Mapping implicit spectral methods to distributed memory architectures
NASA Technical Reports Server (NTRS)
Overman, Andrea L.; Vanrosendale, John
1991-01-01
Spectral methods were proven invaluable in numerical simulation of PDEs (Partial Differential Equations), but the frequent global communication required raises a fundamental barrier to their use on highly parallel architectures. To explore this issue, a 3-D implicit spectral method was implemented on an Intel hypercube. Utilization of about 50 percent was achieved on a 32 node iPSC/860 hypercube, for a 64 x 64 x 64 Fourier-spectral grid; finer grids yield higher utilizations. Chebyshev-spectral grids are more problematic, since plane-relaxation based multigrid is required. However, by using a semicoarsening multigrid algorithm, and by relaxing all multigrid levels concurrently, relatively high utilizations were also achieved in this harder case.
Multigrid Methods in Electronic Structure Calculations
NASA Astrophysics Data System (ADS)
Briggs, Emil
1996-03-01
Multigrid techniques have become the method of choice for a broad range of computational problems. Their use in electronic structure calculations introduces a new set of issues when compared to traditional plane wave approaches. We have developed a set of techniques that address these issues and permit multigrid algorithms to be applied to the electronic structure problem in an efficient manner. In our approach the Kohn-Sham equations are discretized on a real-space mesh using a compact representation of the Hamiltonian. The resulting equations are solved directly on the mesh using multigrid iterations. This produces rapid convergence rates even for ill-conditioned systems with large length and/or energy scales. The method has been applied to both periodic and non-periodic systems containing over 400 atoms and the results are in very good agreement with both theory and experiment. Example applications include a vacancy in diamond, an isolated C60 molecule, and a 64-atom cell of GaN with the Ga d-electrons in valence which required a 250 Ry cutoff. A particular strength of a real-space multigrid approach is its ready adaptability to massively parallel computer architectures. The compact representation of the Hamiltonian is especially well suited to such machines. Tests on the Cray-T3D have shown nearly linear scaling of the execution time up to the maximum number of processors (512). The MPP implementation has been used for studies of a large Amyloid Beta Peptide (C_146O_45N_42H_210) found in the brains of Alzheimers disease patients. Further applications of the multigrid method will also be described. (in collaboration D. J. Sullivan and J. Bernholc)
Parallel multigrid smoothing: polynomial versus Gauss-Seidel
NASA Astrophysics Data System (ADS)
Adams, Mark; Brezina, Marian; Hu, Jonathan; Tuminaro, Ray
2003-07-01
Gauss-Seidel is often the smoother of choice within multigrid applications. In the context of unstructured meshes, however, maintaining good parallel efficiency is difficult with multiplicative iterative methods such as Gauss-Seidel. This leads us to consider alternative smoothers. We discuss the computational advantages of polynomial smoothers within parallel multigrid algorithms for positive definite symmetric systems. Two particular polynomials are considered: Chebyshev and a multilevel specific polynomial. The advantages of polynomial smoothing over traditional smoothers such as Gauss-Seidel are illustrated on several applications: Poisson's equation, thin-body elasticity, and eddy current approximations to Maxwell's equations. While parallelizing the Gauss-Seidel method typically involves a compromise between a scalable convergence rate and maintaining high flop rates, polynomial smoothers achieve parallel scalable multigrid convergence rates without sacrificing flop rates. We show that, although parallel computers are the main motivation, polynomial smoothers are often surprisingly competitive with Gauss-Seidel smoothers on serial machines.
Unweighted least squares phase unwrapping by means of multigrid techniques
NASA Astrophysics Data System (ADS)
Pritt, Mark D.
1995-11-01
We present a multigrid algorithm for unweighted least squares phase unwrapping. This algorithm applies Gauss-Seidel relaxation schemes to solve the Poisson equation on smaller, coarser grids and transfers the intermediate results to the finer grids. This approach forms the basis of our multigrid algorithm for weighted least squares phase unwrapping, which is described in a separate paper. The key idea of our multigrid approach is to maintain the partial derivatives of the phase data in separate arrays and to correct these derivatives at the boundaries of the coarser grids. This maintains the boundary conditions necessary for rapid convergence to the correct solution. Although the multigrid algorithm is an iterative algorithm, we demonstrate that it is nearly as fast as the direct Fourier-based method. We also describe how to parallelize the algorithm for execution on a distributed-memory parallel processor computer or a network-cluster of workstations.
On a multigrid method for the coupled Stokes and porous media flow problem
NASA Astrophysics Data System (ADS)
Luo, P.; Rodrigo, C.; Gaspar, F. J.; Oosterlee, C. W.
2017-07-01
The multigrid solution of coupled porous media and Stokes flow problems is considered. The Darcy equation as the saturated porous medium model is coupled to the Stokes equations by means of appropriate interface conditions. We focus on an efficient multigrid solution technique for the coupled problem, which is discretized by finite volumes on staggered grids, giving rise to a saddle point linear system. Special treatment is required regarding the discretization at the interface. An Uzawa smoother is employed in multigrid, which is a decoupled procedure based on symmetric Gauss-Seidel smoothing for velocity components and a simple Richardson iteration for the pressure field. Since a relaxation parameter is part of a Richardson iteration, Local Fourier Analysis (LFA) is applied to determine the optimal parameters. Highly satisfactory multigrid convergence is reported, and, moreover, the algorithm performs well for small values of the hydraulic conductivity and fluid viscosity, that are relevant for applications.
NASA Astrophysics Data System (ADS)
Turcksin, Bruno; Ragusa, Jean C.; Morel, Jim E.
2012-01-01
It is well known that the diffusion synthetic acceleration (DSA) methods for the Sn equations become ineffective in the Fokker-Planck forward-peaked scattering limit. In response to this deficiency, Morel and Manteuffel (1991) developed an angular multigrid method for the 1-D Sn equations. This method is very effective, costing roughly twice as much as DSA per source iteration, and yielding a maximum spectral radius of approximately 0.6 in the Fokker-Planck limit. Pautz, Adams, and Morel (PAM) (1999) later generalized the angular multigrid to 2-D, but it was found that the method was unstable with sufficiently forward-peaked mappings between the angular grids. The method was stabilized via a filtering technique based on diffusion operators, but this filtering also degraded the effectiveness of the overall scheme. The spectral radius was not bounded away from unity in the Fokker-Planck limit, although the method remained more effective than DSA. The purpose of this article is to recast the multidimensional PAM angular multigrid method without the filtering as an Sn preconditioner and use it in conjunction with the Generalized Minimal RESidual (GMRES) Krylov method. The approach ensures stability and our computational results demonstrate that it is also significantly more efficient than an analogous DSA-preconditioned Krylov method.
A Pseudo-Temporal Multi-Grid Relaxation Scheme for Solving the Parabolized Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
White, J. A.; Morrison, J. H.
1999-01-01
A multi-grid, flux-difference-split, finite-volume code, VULCAN, is presented for solving the elliptic and parabolized form of the equations governing three-dimensional, turbulent, calorically perfect and non-equilibrium chemically reacting flows. The space marching algorithms developed to improve convergence rate and or reduce computational cost are emphasized. The algorithms presented are extensions to the class of implicit pseudo-time iterative, upwind space-marching schemes. A full approximate storage, full multi-grid scheme is also described which is used to accelerate the convergence of a Gauss-Seidel relaxation method. The multi-grid algorithm is shown to significantly improve convergence on high aspect ratio grids.
Multigrid solution of the Navier-Stokes equations on highly stretched grids with defect correction
NASA Technical Reports Server (NTRS)
Sockol, Peter M.
1993-01-01
Relaxation-based multigrid solvers for the steady incompressible Navier-Stokes equations are examined to determine their computational speed and robustness. Four relaxation methods with a common discretization have been used as smoothers in a single tailored multigrid procedure. The equations are discretized on a staggered grid with first order upwind used for convection in the relaxation process on all grids and defect correction to second order central on the fine grid introduced once per multigrid cycle. A fixed W(1,1) cycle with full weighting of residuals is used in the FAS multigrid process. The resulting solvers have been applied to three 2D flow problems, over a range of Reynolds numbers, on both uniform and highly stretched grids. In all cases the L(sub 2) norm of the velocity changes is reduced to 10(exp -6) in a few 10's of fine grid sweeps. The results from this study are used to draw conclusions on the strengths and weaknesses of the individual relaxation schemes as well as those of the overall multigrid procedure when used as a solver on highly stretched grids.
NASA Astrophysics Data System (ADS)
Lavery, N.; Taylor, C.
1999-07-01
Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time-independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi-Babuska condition. The k-l model is used to complete the turbulence closure problem. The non-symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a V-cycling schedule. These methods are all compared to the non-symmetric frontal solver. Copyright
High order spectral volume and spectral difference methods on unstructured grids
NASA Astrophysics Data System (ADS)
Kannan, Ravishekar
The spectral volume (SV) and the spectral difference (SD) methods were developed by Wang and Liu and their collaborators for conservation laws on unstructured grids. They were introduced to achieve high-order accuracy in an efficient manner. Recently, these methods were extended to three-dimensional systems and to the Navier Stokes equations. The simplicity and robustness of these methods have made them competitive against other higher order methods such as the discontinuous Galerkin and residual distribution methods. Although explicit TVD Runge-Kutta schemes for the temporal advancement are easy to implement, they suffer from small time step limited by the Courant-Friedrichs-Lewy (CFL) condition. When the polynomial order is high or when the grid is stretched due to complex geometries or boundary layers, the convergence rate of explicit schemes slows down rapidly. Solution strategies to remedy this problem include implicit methods and multigrid methods. A novel implicit lower-upper symmetric Gauss-Seidel (LU-SGS) relaxation method is employed as an iterative smoother. It is compared to the explicit TVD Runge-Kutta smoothers. For some p-multigrid calculations, combining implicit and explicit smoothers for different p-levels is also studied. The multigrid method considered is nonlinear and uses Full Approximation Scheme (FAS). An overall speed-up factor of up to 150 is obtained using a three-level p-multigrid LU-SGS approach in comparison with the single level explicit method for the Euler equations for the 3rd order SD method. A study of viscous flux formulations was carried out for the SV method. Three formulations were used to discretize the viscous fluxes: local discontinuous Galerkin (LDG), a penalty method and the 2nd method of Bassi and Rebay. Fourier analysis revealed some interesting advantages for the penalty method. These were implemented in the Navier Stokes solver. An implicit and p-multigrid method was also implemented for the above. An overall speed-up factor of up to 1500 is obtained using a three-level p-multigrid LU-SGS approach in comparison with the single level explicit method for the Navier-Stokes equations. The SV method was also extended to turbulent flows. The RANS based SA model was used to close the Reynolds stresses. The numerical results are very promising and indicate that the approaches have great potentials for 3D flow problems.
Seventh Copper Mountain Conference on Multigrid Methods. Part 2
NASA Technical Reports Server (NTRS)
Melson, N. Duane (Editor); Manteuffel, Tom A. (Editor); McCormick, Steve F. (Editor); Douglas, Craig C. (Editor)
1996-01-01
The Seventh Copper Mountain Conference on Multigrid Methods was held on April 2-7, 1995 at Copper Mountain, Colorado. This book is a collection of many of the papers presented at the conference and so represents the conference proceedings. NASA Langley graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The vibrancy and diversity in this field are amply expressed in these important papers, and the collection clearly shows the continuing rapid growth of the use of multigrid acceleration techniques.
Multigrid method for stability problems
NASA Technical Reports Server (NTRS)
Ta'asan, Shlomo
1988-01-01
The problem of calculating the stability of steady state solutions of differential equations is addressed. Leading eigenvalues of large matrices that arise from discretization are calculated, and an efficient multigrid method for solving these problems is presented. The resulting grid functions are used as initial approximations for appropriate eigenvalue problems. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a nonstandard way in which the right-hand side of the coarse grid equations involves unknown parameters to be solved on the coarse grid. This leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem are presented which demonstrate the effectiveness of the method.
Segmental Refinement: A Multigrid Technique for Data Locality
Adams, Mark F.; Brown, Jed; Knepley, Matt; ...
2016-08-04
In this paper, we investigate a domain decomposed multigrid technique, termed segmental refinement, for solving general nonlinear elliptic boundary value problems. We extend the method first proposed in 1994 by analytically and experimentally investigating its complexity. We confirm that communication of traditional parallel multigrid is eliminated on fine grids, with modest amounts of extra work and storage, while maintaining the asymptotic exactness of full multigrid. We observe an accuracy dependence on the segmental refinement subdomain size, which was not considered in the original analysis. Finally, we present a communication complexity analysis that quantifies the communication costs ameliorated by segmental refinementmore » and report performance results with up to 64K cores on a Cray XC30.« less
Textbook Multigrid Efficiency for the Steady Euler Equations
NASA Technical Reports Server (NTRS)
Roberts, Thomas W.; Sidilkover, David; Swanson, R. C.
2004-01-01
A fast multigrid solver for the steady incompressible Euler equations is presented. Unlike time-marching schemes, this approach uses relaxation of the steady equations. Application of this method results in a discretization that correctly distinguishes between the advection and elliptic parts of the operator, allowing efficient smoothers to be constructed. Solvers for both unstructured triangular grids and structured quadrilateral grids have been written. Computations for channel flow and flow over a nonlifting airfoil have computed. Using Gauss-Seidel relaxation ordered in the flow direction, textbook multigrid convergence rates of nearly one order-of-magnitude residual reduction per multigrid cycle are achieved, independent of the grid spacing. This approach also may be applied to the compressible Euler equations and the incompressible Navier-Stokes equations.
A multigrid LU-SSOR scheme for approximate Newton iteration applied to the Euler equations
NASA Technical Reports Server (NTRS)
Yoon, Seokkwan; Jameson, Antony
1986-01-01
A new efficient relaxation scheme in conjunction with a multigrid method is developed for the Euler equations. The LU SSOR scheme is based on a central difference scheme and does not need flux splitting for Newton iteration. Application to transonic flow shows that the new method surpasses the performance of the LU implicit scheme.
NASA Technical Reports Server (NTRS)
Nicolaides, R. A.
1979-01-01
A description and explanation of a simple multigrid algorithm for solving finite element systems is given. Numerical results for an implementation are reported for a number of elliptic equations, including cases with singular coefficients and indefinite equations. The method shows the high efficiency, essentially independent of the grid spacing, predicted by the theory.
Multigrid for hypersonic viscous two- and three-dimensional flows
NASA Technical Reports Server (NTRS)
Turkel, E.; Swanson, R. C.; Vatsa, V. N.; White, J. A.
1991-01-01
The use of a multigrid method with central differencing to solve the Navier-Stokes equations for hypersonic flows is considered. The time dependent form of the equations is integrated with an explicit Runge-Kutta scheme accelerated by local time stepping and implicit residual smoothing. Variable coefficients are developed for the implicit process that removes the diffusion limit on the time step, producing significant improvement in convergence. A numerical dissipation formulation that provides good shock capturing capability for hypersonic flows is presented. This formulation is shown to be a crucial aspect of the multigrid method. Solutions are given for two-dimensional viscous flow over a NACA 0012 airfoil and three-dimensional flow over a blunt biconic.
Seventh Copper Mountain Conference on Multigrid Methods. Part 1
NASA Technical Reports Server (NTRS)
Melson, N. Duane; Manteuffel, Tom A.; McCormick, Steve F.; Douglas, Craig C.
1996-01-01
The Seventh Copper Mountain Conference on Multigrid Methods was held on 2-7 Apr. 1995 at Copper Mountain, Colorado. This book is a collection of many of the papers presented at the conference and so represents the conference proceedings. NASA Langley graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection shows its rapid trend to further diversity and depth.
The Sixth Copper Mountain Conference on Multigrid Methods, part 2
NASA Technical Reports Server (NTRS)
Melson, N. Duane (Editor); Mccormick, Steve F. (Editor); Manteuffel, Thomas A. (Editor)
1993-01-01
The Sixth Copper Mountain Conference on Multigrid Methods was held on April 4-9, 1993, at Copper Mountain, Colorado. This book is a collection of many of the papers presented at the conference and so represents the conference proceedings. NASA Langley graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection clearly shows its rapid trend to further diversity and depth.
Multigrid techniques for the solution of the passive scalar advection-diffusion equation
NASA Technical Reports Server (NTRS)
Phillips, R. E.; Schmidt, F. W.
1985-01-01
The solution of elliptic passive scalar advection-diffusion equations is required in the analysis of many turbulent flow and convective heat transfer problems. The accuracy of the solution may be affected by the presence of regions containing large gradients of the dependent variables. The multigrid concept of local grid refinement is a method for improving the accuracy of the calculations in these problems. In combination with the multilevel acceleration techniques, an accurate and efficient computational procedure is developed. In addition, a robust implementation of the QUICK finite-difference scheme is described. Calculations of a test problem are presented to quantitatively demonstrate the advantages of the multilevel-multigrid method.
NASA Astrophysics Data System (ADS)
Guo, Hongbo; He, Xiaowei; Liu, Muhan; Zhang, Zeyu; Hu, Zhenhua; Tian, Jie
2017-03-01
Cerenkov luminescence tomography (CLT), as a promising optical molecular imaging modality, can be applied to cancer diagnostic and therapeutic. Most researches about CLT reconstruction are based on the finite element method (FEM) framework. However, the quality of FEM mesh grid is still a vital factor to restrict the accuracy of the CLT reconstruction result. In this paper, we proposed a multi-grid finite element method framework, which was able to improve the accuracy of reconstruction. Meanwhile, the multilevel scheme adaptive algebraic reconstruction technique (MLS-AART) based on a modified iterative algorithm was applied to improve the reconstruction accuracy. In numerical simulation experiments, the feasibility of our proposed method were evaluated. Results showed that the multi-grid strategy could obtain 3D spatial information of Cerenkov source more accurately compared with the traditional single-grid FEM.
NASA Astrophysics Data System (ADS)
Kifonidis, K.; Müller, E.
2012-08-01
Aims: We describe and study a family of new multigrid iterative solvers for the multidimensional, implicitly discretized equations of hydrodynamics. Schemes of this class are free of the Courant-Friedrichs-Lewy condition. They are intended for simulations in which widely differing wave propagation timescales are present. A preferred solver in this class is identified. Applications to some simple stiff test problems that are governed by the compressible Euler equations, are presented to evaluate the convergence behavior, and the stability properties of this solver. Algorithmic areas are determined where further work is required to make the method sufficiently efficient and robust for future application to difficult astrophysical flow problems. Methods: The basic equations are formulated and discretized on non-orthogonal, structured curvilinear meshes. Roe's approximate Riemann solver and a second-order accurate reconstruction scheme are used for spatial discretization. Implicit Runge-Kutta (ESDIRK) schemes are employed for temporal discretization. The resulting discrete equations are solved with a full-coarsening, non-linear multigrid method. Smoothing is performed with multistage-implicit smoothers. These are applied here to the time-dependent equations by means of dual time stepping. Results: For steady-state problems, our results show that the efficiency of the present approach is comparable to the best implicit solvers for conservative discretizations of the compressible Euler equations that can be found in the literature. The use of red-black as opposed to symmetric Gauss-Seidel iteration in the multistage-smoother is found to have only a minor impact on multigrid convergence. This should enable scalable parallelization without having to seriously compromise the method's algorithmic efficiency. For time-dependent test problems, our results reveal that the multigrid convergence rate degrades with increasing Courant numbers (i.e. time step sizes). Beyond a Courant number of nine thousand, even complete multigrid breakdown is observed. Local Fourier analysis indicates that the degradation of the convergence rate is associated with the coarse-grid correction algorithm. An implicit scheme for the Euler equations that makes use of the present method was, nevertheless, able to outperform a standard explicit scheme on a time-dependent problem with a Courant number of order 1000. Conclusions: For steady-state problems, the described approach enables the construction of parallelizable, efficient, and robust implicit hydrodynamics solvers. The applicability of the method to time-dependent problems is presently restricted to cases with moderately high Courant numbers. This is due to an insufficient coarse-grid correction of the employed multigrid algorithm for large time steps. Further research will be required to help us to understand and overcome the observed multigrid convergence difficulties for time-dependent problems.
Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*
Bank, R.; Falgout, R. D.; Jones, T.; ...
2015-10-29
In modern large-scale supercomputing applications, algebraic multigrid (AMG) is a leading choice for solving matrix equations. However, the high cost of communication relative to that of computation is a concern for the scalability of traditional implementations of AMG on emerging architectures. This paper introduces two new algebraic multilevel algorithms, algebraic multigrid domain decomposition (AMG-DD) and algebraic multigrid range decomposition (AMG-RD), that replace traditional AMG V-cycles with a fully overlapping domain decomposition approach. While the methods introduced here are similar in spirit to the geometric methods developed by Brandt and Diskin [Multigrid solvers on decomposed domains, in Domain Decomposition Methods inmore » Science and Engineering, Contemp. Math. 157, AMS, Providence, RI, 1994, pp. 135--155], Mitchell [Electron. Trans. Numer. Anal., 6 (1997), pp. 224--233], and Bank and Holst [SIAM J. Sci. Comput., 22 (2000), pp. 1411--1443], they differ primarily in that they are purely algebraic: AMG-RD and AMG-DD trade communication for computation by forming global composite “grids” based only on the matrix, not the geometry. (As is the usual AMG convention, “grids” here should be taken only in the algebraic sense, regardless of whether or not it corresponds to any geometry.) Another important distinguishing feature of AMG-RD and AMG-DD is their novel residual communication process that enables effective parallel computation on composite grids, avoiding the all-to-all communication costs of the geometric methods. The main purpose of this paper is to study the potential of these two algebraic methods as possible alternatives to existing AMG approaches for future parallel machines. As a result, this paper develops some theoretical properties of these methods and reports on serial numerical tests of their convergence properties over a spectrum of problem parameters.« less
Application of p-Multigrid to Discontinuous Galerkin Formulations of the Poisson Equation
NASA Technical Reports Server (NTRS)
Helenbrook, B. T.; Atkins, H. L.
2006-01-01
We investigate p-multigrid as a solution method for several different discontinuous Galerkin (DG) formulations of the Poisson equation. Different combinations of relaxation schemes and basis sets have been combined with the DG formulations to find the best performing combination. The damping factors of the schemes have been determined using Fourier analysis for both one and two-dimensional problems. One important finding is that when using DG formulations, the standard approach of forming the coarse p matrices separately for each level of multigrid is often unstable. To ensure stability the coarse p matrices must be constructed from the fine grid matrices using algebraic multigrid techniques. Of the relaxation schemes, we find that the combination of Jacobi relaxation with the spectral element basis is fairly effective. The results using this combination are p sensitive in both one and two dimensions, but reasonable convergence rates can still be achieved for moderate values of p and isotropic meshes. A competitive alternative is a block Gauss-Seidel relaxation. This actually out performs a more expensive line relaxation when the mesh is isotropic. When the mesh becomes highly anisotropic, the implicit line method and the Gauss-Seidel implicit line method are the only effective schemes. Adding the Gauss-Seidel terms to the implicit line method gives a significant improvement over the line relaxation method.
DOE Office of Scientific and Technical Information (OSTI.GOV)
D'Ambra, P.; Vassilevski, P. S.
2014-05-30
Adaptive Algebraic Multigrid (or Multilevel) Methods (αAMG) are introduced to improve robustness and efficiency of classical algebraic multigrid methods in dealing with problems where no a-priori knowledge or assumptions on the near-null kernel of the underlined matrix are available. Recently we proposed an adaptive (bootstrap) AMG method, αAMG, aimed to obtain a composite solver with a desired convergence rate. Each new multigrid component relies on a current (general) smooth vector and exploits pairwise aggregation based on weighted matching in a matrix graph to define a new automatic, general-purpose coarsening process, which we refer to as “the compatible weighted matching”. Inmore » this work, we present results that broaden the applicability of our method to different finite element discretizations of elliptic PDEs. In particular, we consider systems arising from displacement methods in linear elasticity problems and saddle-point systems that appear in the application of the mixed method to Darcy problems.« less
NASA Astrophysics Data System (ADS)
Lv, X.; Zhao, Y.; Huang, X. Y.; Xia, G. H.; Su, X. H.
2007-07-01
A new three-dimensional (3D) matrix-free implicit unstructured multigrid finite volume (FV) solver for structural dynamics is presented in this paper. The solver is first validated using classical 2D and 3D cantilever problems. It is shown that very accurate predictions of the fundamental natural frequencies of the problems can be obtained by the solver with fast convergence rates. This method has been integrated into our existing FV compressible solver [X. Lv, Y. Zhao, et al., An efficient parallel/unstructured-multigrid preconditioned implicit method for simulating 3d unsteady compressible flows with moving objects, Journal of Computational Physics 215(2) (2006) 661-690] based on the immersed membrane method (IMM) [X. Lv, Y. Zhao, et al., as mentioned above]. Results for the interaction between the fluid and an immersed fixed-free cantilever are also presented to demonstrate the potential of this integrated fluid-structure interaction approach.
The Sixth Copper Mountain Conference on Multigrid Methods, part 1
NASA Technical Reports Server (NTRS)
Melson, N. Duane (Editor); Manteuffel, T. A. (Editor); Mccormick, S. F. (Editor)
1993-01-01
The Sixth Copper Mountain Conference on Multigrid Methods was held on 4-9 Apr. 1993, at Copper Mountain, CO. This book is a collection of many of the papers presented at the conference and as such represents the conference proceedings. NASA LaRC graciously provided printing of this document so that all of the papers could be presented in a single forum. Each paper was reviewed by a member of the conference organizing committee under the coordination of the editors. The multigrid discipline continues to expand and mature, as is evident from these proceedings. The vibrancy in this field is amply expressed in these important papers, and the collection clearly shows its rapid trend to further diversity and depth.
NASA Technical Reports Server (NTRS)
Atkins, Harold
1991-01-01
A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.
On Bi-Grid Local Mode Analysis of Solution Techniques for 3-D Euler and Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Ibraheem, S. O.; Demuren, A. O.
1994-01-01
A procedure is presented for utilizing a bi-grid stability analysis as a practical tool for predicting multigrid performance in a range of numerical methods for solving Euler and Navier-Stokes equations. Model problems based on the convection, diffusion and Burger's equation are used to illustrate the superiority of the bi-grid analysis as a predictive tool for multigrid performance in comparison to the smoothing factor derived from conventional von Neumann analysis. For the Euler equations, bi-grid analysis is presented for three upwind difference based factorizations, namely Spatial, Eigenvalue and Combination splits, and two central difference based factorizations, namely LU and ADI methods. In the former, both the Steger-Warming and van Leer flux-vector splitting methods are considered. For the Navier-Stokes equations, only the Beam-Warming (ADI) central difference scheme is considered. In each case, estimates of multigrid convergence rates from the bi-grid analysis are compared to smoothing factors obtained from single-grid stability analysis. Effects of grid aspect ratio and flow skewness are examined. Both predictions are compared with practical multigrid convergence rates for 2-D Euler and Navier-Stokes solutions based on the Beam-Warming central scheme.
Tuminaro, Raymond S.; Perego, Mauro; Tezaur, Irina Kalashnikova; ...
2016-10-06
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 multigridmore » 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.« less
Implementation and Optimization of miniGMG - a Compact Geometric Multigrid Benchmark
DOE Office of Scientific and Technical Information (OSTI.GOV)
Williams, Samuel; Kalamkar, Dhiraj; Singh, Amik
2012-12-01
Multigrid methods are widely used to accelerate the convergence of iterative solvers for linear systems used in a number of different application areas. In this report, we describe miniGMG, our compact geometric multigrid benchmark designed to proxy the multigrid solves found in AMR applications. We explore optimization techniques for geometric multigrid on existing and emerging multicore systems including the Opteron-based Cray XE6, Intel Sandy Bridge and Nehalem-based Infiniband clusters, as well as manycore-based architectures including NVIDIA's Fermi and Kepler GPUs and Intel's Knights Corner (KNC) co-processor. This report examines a variety of novel techniques including communication-aggregation, threaded wavefront-based DRAM communication-avoiding,more » dynamic threading decisions, SIMDization, and fusion of operators. We quantify performance through each phase of the V-cycle for both single-node and distributed-memory experiments and provide detailed analysis for each class of optimization. Results show our optimizations yield significant speedups across a variety of subdomain sizes while simultaneously demonstrating the potential of multi- and manycore processors to dramatically accelerate single-node performance. However, our analysis also indicates that improvements in networks and communication will be essential to reap the potential of manycore processors in large-scale multigrid calculations.« less
An automatic multigrid method for the solution of sparse linear systems
NASA Technical Reports Server (NTRS)
Shapira, Yair; Israeli, Moshe; Sidi, Avram
1993-01-01
An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.
A new extrapolation cascadic multigrid method for three dimensional elliptic boundary value problems
NASA Astrophysics Data System (ADS)
Pan, Kejia; He, Dongdong; Hu, Hongling; Ren, Zhengyong
2017-09-01
In this paper, we develop a new extrapolation cascadic multigrid method, which makes it possible to solve three dimensional elliptic boundary value problems with over 100 million unknowns on a desktop computer in half a minute. First, by combining Richardson extrapolation and quadratic finite element (FE) interpolation for the numerical solutions on two-level of grids (current and previous grids), we provide a quite good initial guess for the iterative solution on the next finer grid, which is a third-order approximation to the FE solution. And the resulting large linear system from the FE discretization is then solved by the Jacobi-preconditioned conjugate gradient (JCG) method with the obtained initial guess. Additionally, instead of performing a fixed number of iterations as used in existing cascadic multigrid methods, a relative residual tolerance is introduced in the JCG solver, which enables us to obtain conveniently the numerical solution with the desired accuracy. Moreover, a simple method based on the midpoint extrapolation formula is proposed to achieve higher-order accuracy on the finest grid cheaply and directly. Test results from four examples including two smooth problems with both constant and variable coefficients, an H3-regular problem as well as an anisotropic problem are reported to show that the proposed method has much better efficiency compared to the classical V-cycle and W-cycle multigrid methods. Finally, we present the reason why our method is highly efficient for solving these elliptic problems.
Conduct of the International Multigrid Conference
NASA Technical Reports Server (NTRS)
Mccormick, S.
1984-01-01
The 1983 International Multigrid Conference was held at Colorado's Copper Mountain Ski Resort, April 5-8. It was organized jointly by the Institute for Computational Studies at Colorado State University, U.S.A., and the Gasellschaft fur Mathematik und Datenverarbeitung Bonn, F.R. Germany, and was sponsored by the Air Force Office of Sponsored Research and National Aeronautics and Space Administration Headquarters. The conference was attended by 80 scientists, divided by institution almost equally into private industry, research laboratories, and academia. Fifteen attendees came from countries other than the U.S.A. In addition to the fruitful discussions, the most significant factor of the conference was of course the lectures. The lecturers include most of the leaders in the field of multigrid research. The program offered a nice integrated blend of theory, numerical studies, basic research, and applications. Some of the new areas of research that have surfaced since the Koln-Porz conference include: the algebraic multigrid approach; multigrid treatment of Euler equations for inviscid fluid flow problems; 3-D problems; and the application of MG methods on vector and parallel computers.
Spectral element multigrid. Part 2: Theoretical justification
NASA Technical Reports Server (NTRS)
Maday, Yvon; Munoz, Rafael
1988-01-01
A multigrid algorithm is analyzed which is used for solving iteratively the algebraic system resulting from tha approximation of a second order problem by spectral or spectral element methods. The analysis, performed here in the one dimensional case, justifies the good smoothing properties of the Jacobi preconditioner that was presented in Part 1 of this paper.
General relaxation schemes in multigrid algorithms for higher order singularity methods
NASA Technical Reports Server (NTRS)
Oskam, B.; Fray, J. M. J.
1981-01-01
Relaxation schemes based on approximate and incomplete factorization technique (AF) are described. The AF schemes allow construction of a fast multigrid method for solving integral equations of the second and first kind. The smoothing factors for integral equations of the first kind, and comparison with similar results from the second kind of equations are a novel item. Application of the MD algorithm shows convergence to the level of truncation error of a second order accurate panel method.
Numerical solution of a coupled pair of elliptic equations from solid state electronics
NASA Technical Reports Server (NTRS)
Phillips, T. N.
1983-01-01
Iterative methods are considered for the solution of a coupled pair of second order elliptic partial differential equations which arise in the field of solid state electronics. A finite difference scheme is used which retains the conservative form of the differential equations. Numerical solutions are obtained in two ways, by multigrid and dynamic alternating direction implicit methods. Numerical results are presented which show the multigrid method to be an efficient way of solving this problem.
Parameter estimation problems for distributed systems using a multigrid method
NASA Technical Reports Server (NTRS)
Ta'asan, Shlomo; Dutt, Pravir
1990-01-01
The problem of estimating spatially varying coefficients of partial differential equations is considered from observation of the solution and of the right hand side of the equation. It is assumed that the observations are distributed in the domain and that enough observations are given. A method of discretization and an efficient multigrid method for solving the resulting discrete systems are described. Numerical results are presented for estimation of coefficients in an elliptic and a parabolic partial differential equation.
A comparison of locally adaptive multigrid methods: LDC, FAC and FIC
NASA Technical Reports Server (NTRS)
Khadra, Khodor; Angot, Philippe; Caltagirone, Jean-Paul
1993-01-01
This study is devoted to a comparative analysis of three 'Adaptive ZOOM' (ZOom Overlapping Multi-level) methods based on similar concepts of hierarchical multigrid local refinement: LDC (Local Defect Correction), FAC (Fast Adaptive Composite), and FIC (Flux Interface Correction)--which we proposed recently. These methods are tested on two examples of a bidimensional elliptic problem. We compare, for V-cycle procedures, the asymptotic evolution of the global error evaluated by discrete norms, the corresponding local errors, and the convergence rates of these algorithms.
NASA Astrophysics Data System (ADS)
Moghaderi, Hamid; Dehghan, Mehdi; Donatelli, Marco; Mazza, Mariarosa
2017-12-01
Fractional diffusion equations (FDEs) are a mathematical tool used for describing some special diffusion phenomena arising in many different applications like porous media and computational finance. In this paper, we focus on a two-dimensional space-FDE problem discretized by means of a second order finite difference scheme obtained as combination of the Crank-Nicolson scheme and the so-called weighted and shifted Grünwald formula. By fully exploiting the Toeplitz-like structure of the resulting linear system, we provide a detailed spectral analysis of the coefficient matrix at each time step, both in the case of constant and variable diffusion coefficients. Such a spectral analysis has a very crucial role, since it can be used for designing fast and robust iterative solvers. In particular, we employ the obtained spectral information to define a Galerkin multigrid method based on the classical linear interpolation as grid transfer operator and damped-Jacobi as smoother, and to prove the linear convergence rate of the corresponding two-grid method. The theoretical analysis suggests that the proposed grid transfer operator is strong enough for working also with the V-cycle method and the geometric multigrid. On this basis, we introduce two computationally favourable variants of the proposed multigrid method and we use them as preconditioners for Krylov methods. Several numerical results confirm that the resulting preconditioning strategies still keep a linear convergence rate.
Application of multi-grid method on the simulation of incremental forging processes
NASA Astrophysics Data System (ADS)
Ramadan, Mohamad; Khaled, Mahmoud; Fourment, Lionel
2016-10-01
Numerical simulation becomes essential in manufacturing large part by incremental forging processes. It is a splendid tool allowing to show physical phenomena however behind the scenes, an expensive bill should be paid, that is the computational time. That is why many techniques are developed to decrease the computational time of numerical simulation. Multi-Grid method is a numerical procedure that permits to reduce computational time of numerical calculation by performing the resolution of the system of equations on several mesh of decreasing size which allows to smooth faster the low frequency of the solution as well as its high frequency. In this paper a Multi-Grid method is applied to cogging process in the software Forge 3. The study is carried out using increasing number of degrees of freedom. The results shows that calculation time is divide by two for a mesh of 39,000 nodes. The method is promising especially if coupled with Multi-Mesh method.
Time-marching multi-grid seismic tomography
NASA Astrophysics Data System (ADS)
Tong, P.; Yang, D.; Liu, Q.
2016-12-01
From the classic ray-based traveltime tomography to the state-of-the-art full waveform inversion, because of the nonlinearity of seismic inverse problems, a good starting model is essential for preventing the convergence of the objective function toward local minima. With a focus on building high-accuracy starting models, we propose the so-called time-marching multi-grid seismic tomography method in this study. The new seismic tomography scheme consists of a temporal time-marching approach and a spatial multi-grid strategy. We first divide the recording period of seismic data into a series of time windows. Sequentially, the subsurface properties in each time window are iteratively updated starting from the final model of the previous time window. There are at least two advantages of the time-marching approach: (1) the information included in the seismic data of previous time windows has been explored to build the starting models of later time windows; (2) seismic data of later time windows could provide extra information to refine the subsurface images. Within each time window, we use a multi-grid method to decompose the scale of the inverse problem. Specifically, the unknowns of the inverse problem are sampled on a coarse mesh to capture the macro-scale structure of the subsurface at the beginning. Because of the low dimensionality, it is much easier to reach the global minimum on a coarse mesh. After that, finer meshes are introduced to recover the micro-scale properties. That is to say, the subsurface model is iteratively updated on multi-grid in every time window. We expect that high-accuracy starting models should be generated for the second and later time windows. We will test this time-marching multi-grid method by using our newly developed eikonal-based traveltime tomography software package tomoQuake. Real application results in the 2016 Kumamoto earthquake (Mw 7.0) region in Japan will be demonstrated.
On Efficient Multigrid Methods for Materials Processing Flows with Small Particles
NASA Technical Reports Server (NTRS)
Thomas, James (Technical Monitor); Diskin, Boris; Harik, VasylMichael
2004-01-01
Multiscale modeling of materials requires simulations of multiple levels of structural hierarchy. The computational efficiency of numerical methods becomes a critical factor for simulating large physical systems with highly desperate length scales. Multigrid methods are known for their superior efficiency in representing/resolving different levels of physical details. The efficiency is achieved by employing interactively different discretizations on different scales (grids). To assist optimization of manufacturing conditions for materials processing with numerous particles (e.g., dispersion of particles, controlling flow viscosity and clusters), a new multigrid algorithm has been developed for a case of multiscale modeling of flows with small particles that have various length scales. The optimal efficiency of the algorithm is crucial for accurate predictions of the effect of processing conditions (e.g., pressure and velocity gradients) on the local flow fields that control the formation of various microstructures or clusters.
Multigrid methods for numerical simulation of laminar diffusion flames
NASA Technical Reports Server (NTRS)
Liu, C.; Liu, Z.; Mccormick, S.
1993-01-01
This paper documents the result of a computational study of multigrid methods for numerical simulation of 2D diffusion flames. The focus is on a simplified combustion model, which is assumed to be a single step, infinitely fast and irreversible chemical reaction with five species (C3H8, O2, N2, CO2 and H2O). A fully-implicit second-order hybrid scheme is developed on a staggered grid, which is stretched in the streamwise coordinate direction. A full approximation multigrid scheme (FAS) based on line distributive relaxation is developed as a fast solver for the algebraic equations arising at each time step. Convergence of the process for the simplified model problem is more than two-orders of magnitude faster than other iterative methods, and the computational results show good grid convergence, with second-order accuracy, as well as qualitatively agreement with the results of other researchers.
Reducing Communication in Algebraic Multigrid Using Additive Variants
DOE Office of Scientific and Technical Information (OSTI.GOV)
Vassilevski, Panayot S.; Yang, Ulrike Meier
Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less
Reducing Communication in Algebraic Multigrid Using Additive Variants
Vassilevski, Panayot S.; Yang, Ulrike Meier
2014-02-12
Algebraic multigrid (AMG) has proven to be an effective scalable solver on many high performance computers. However, its increasing communication complexity on coarser levels has shown to seriously impact its performance on computers with high communication cost. Moreover, additive AMG variants provide not only increased parallelism as well as decreased numbers of messages per cycle but also generally exhibit slower convergence. Here we present various new additive variants with convergence rates that are significantly improved compared to the classical additive algebraic multigrid method and investigate their potential for decreased communication, and improved communication-computation overlap, features that are essential for goodmore » performance on future exascale architectures.« less
Multigrid for Staggered Lattice Fermions
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brower, Richard C.; Clark, M. A.; Strelchenko, Alexei
Critical slowing down in Krylov methods for the Dirac operator presents a major obstacle to further advances in lattice field theory as it approaches the continuum solution. Here we formulate a multi-grid algorithm for the Kogut-Susskind (or staggered) fermion discretization which has proven difficult relative to Wilson multigrid due to its first-order anti-Hermitian structure. The solution is to introduce a novel spectral transformation by the K\\"ahler-Dirac spin structure prior to the Galerkin projection. We present numerical results for the two-dimensional, two-flavor Schwinger model, however, the general formalism is agnostic to dimension and is directly applicable to four-dimensional lattice QCD.
Multigrid Techniques for Highly Indefinite Equations
NASA Technical Reports Server (NTRS)
Shapira, Yair
1996-01-01
A multigrid method for the solution of finite difference approximations of elliptic PDE's is introduced. A parallelizable version of it, suitable for two and multi level analysis, is also defined, and serves as a theoretical tool for deriving a suitable implementation for the main version. For indefinite Helmholtz equations, this analysis provides a suitable mesh size for the coarsest grid used. Numerical experiments show that the method is applicable to diffusion equations with discontinuous coefficients and highly indefinite Helmholtz equations.
Large-scale Parallel Unstructured Mesh Computations for 3D High-lift Analysis
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.; Pirzadeh, S.
1999-01-01
A complete "geometry to drag-polar" analysis capability for the three-dimensional high-lift configurations is described. The approach is based on the use of unstructured meshes in order to enable rapid turnaround for complicated geometries that arise in high-lift configurations. Special attention is devoted to creating a capability for enabling analyses on highly resolved grids. Unstructured meshes of several million vertices are initially generated on a work-station, and subsequently refined on a supercomputer. The flow is solved on these refined meshes on large parallel computers using an unstructured agglomeration multigrid algorithm. Good prediction of lift and drag throughout the range of incidences is demonstrated on a transport take-off configuration using up to 24.7 million grid points. The feasibility of using this approach in a production environment on existing parallel machines is demonstrated, as well as the scalability of the solver on machines using up to 1450 processors.
On the solution of evolution equations based on multigrid and explicit iterative methods
NASA Astrophysics Data System (ADS)
Zhukov, V. T.; Novikova, N. D.; Feodoritova, O. B.
2015-08-01
Two schemes for solving initial-boundary value problems for three-dimensional parabolic equations are studied. One is implicit and is solved using the multigrid method, while the other is explicit iterative and is based on optimal properties of the Chebyshev polynomials. In the explicit iterative scheme, the number of iteration steps and the iteration parameters are chosen as based on the approximation and stability conditions, rather than on the optimization of iteration convergence to the solution of the implicit scheme. The features of the multigrid scheme include the implementation of the intergrid transfer operators for the case of discontinuous coefficients in the equation and the adaptation of the smoothing procedure to the spectrum of the difference operators. The results produced by these schemes as applied to model problems with anisotropic discontinuous coefficients are compared.
A Multigrid NLS-4DVar Data Assimilation Scheme with Advanced Research WRF (ARW)
NASA Astrophysics Data System (ADS)
Zhang, H.; Tian, X.
2017-12-01
The motions of the atmosphere have multiscale properties in space and/or time, and the background error covariance matrix (Β) should thus contain error information at different correlation scales. To obtain an optimal analysis, the multigrid three-dimensional variational data assimilation scheme is used widely when sequentially correcting errors from large to small scales. However, introduction of the multigrid technique into four-dimensional variational data assimilation is not easy, due to its strong dependence on the adjoint model, which has extremely high computational costs in data coding, maintenance, and updating. In this study, the multigrid technique was introduced into the nonlinear least-squares four-dimensional variational assimilation (NLS-4DVar) method, which is an advanced four-dimensional ensemble-variational method that can be applied without invoking the adjoint models. The multigrid NLS-4DVar (MG-NLS-4DVar) scheme uses the number of grid points to control the scale, with doubling of this number when moving from a coarse to a finer grid. Furthermore, the MG-NLS-4DVar scheme not only retains the advantages of NLS-4DVar, but also sufficiently corrects multiscale errors to achieve a highly accurate analysis. The effectiveness and efficiency of the proposed MG-NLS-4DVar scheme were evaluated by several groups of observing system simulation experiments using the Advanced Research Weather Research and Forecasting Model. MG-NLS-4DVar outperformed NLS-4DVar, with a lower computational cost.
NASA Astrophysics Data System (ADS)
Chen, Hui; Deng, Ju-Zhi; Yin, Min; Yin, Chang-Chun; Tang, Wen-Wu
2017-03-01
To speed up three-dimensional (3D) DC resistivity modeling, we present a new multigrid method, the aggregation-based algebraic multigrid method (AGMG). We first discretize the differential equation of the secondary potential field with mixed boundary conditions by using a seven-point finite-difference method to obtain a large sparse system of linear equations. Then, we introduce the theory behind the pairwise aggregation algorithms for AGMG and use the conjugate-gradient method with the V-cycle AGMG preconditioner (AGMG-CG) to solve the linear equations. We use typical geoelectrical models to test the proposed AGMG-CG method and compare the results with analytical solutions and the 3DDCXH algorithm for 3D DC modeling (3DDCXH). In addition, we apply the AGMG-CG method to different grid sizes and geoelectrical models and compare it to different iterative methods, such as ILU-BICGSTAB, ILU-GCR, and SSOR-CG. The AGMG-CG method yields nearly linearly decreasing errors, whereas the number of iterations increases slowly with increasing grid size. The AGMG-CG method is precise and converges fast, and thus can improve the computational efficiency in forward modeling of three-dimensional DC resistivity.
Reliability enhancement of Navier-Stokes codes through convergence enhancement
NASA Technical Reports Server (NTRS)
Choi, K.-Y.; Dulikravich, G. S.
1993-01-01
Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.
Reliability enhancement of Navier-Stokes codes through convergence enhancement
NASA Astrophysics Data System (ADS)
Choi, K.-Y.; Dulikravich, G. S.
1993-11-01
Reduction of total computing time required by an iterative algorithm for solving Navier-Stokes equations is an important aspect of making the existing and future analysis codes more cost effective. Several attempts have been made to accelerate the convergence of an explicit Runge-Kutta time-stepping algorithm. These acceleration methods are based on local time stepping, implicit residual smoothing, enthalpy damping, and multigrid techniques. Also, an extrapolation procedure based on the power method and the Minimal Residual Method (MRM) were applied to the Jameson's multigrid algorithm. The MRM uses same values of optimal weights for the corrections to every equation in a system and has not been shown to accelerate the scheme without multigriding. Our Distributed Minimal Residual (DMR) method based on our General Nonlinear Minimal Residual (GNLMR) method allows each component of the solution vector in a system of equations to have its own convergence speed. The DMR method was found capable of reducing the computation time by 10-75 percent depending on the test case and grid used. Recently, we have developed and tested a new method termed Sensitivity Based DMR or SBMR method that is easier to implement in different codes and is even more robust and computationally efficient than our DMR method.
A new multigrid formulation for high order finite difference methods on summation-by-parts form
NASA Astrophysics Data System (ADS)
Ruggiu, Andrea A.; Weinerfelt, Per; Nordström, Jan
2018-04-01
Multigrid schemes for high order finite difference methods on summation-by-parts form are studied by comparing the effect of different interpolation operators. By using the standard linear prolongation and restriction operators, the Galerkin condition leads to inaccurate coarse grid discretizations. In this paper, an alternative class of interpolation operators that bypass this issue and preserve the summation-by-parts property on each grid level is considered. Clear improvements of the convergence rate for relevant model problems are achieved.
NASA Astrophysics Data System (ADS)
Cools, S.; Vanroose, W.
2016-03-01
This paper improves the convergence and robustness of a multigrid-based solver for the cross sections of the driven Schrödinger equation. Adding a Coupled Channel Correction Step (CCCS) after each multigrid (MG) V-cycle efficiently removes the errors that remain after the V-cycle sweep. The combined iterative solution scheme (MG-CCCS) is shown to feature significantly improved convergence rates over the classical MG method at energies where bound states dominate the solution, resulting in a fast and scalable solution method for the complex-valued Schrödinger break-up problem for any energy regime. The proposed solver displays optimal scaling; a solution is found in a time that is linear in the number of unknowns. The method is validated on a 2D Temkin-Poet model problem, and convergence results both as a solver and preconditioner are provided to support the O (N) scalability of the method. This paper extends the applicability of the complex contour approach for far field map computation (Cools et al. (2014) [10]).
Multigrid methods with space–time concurrency
Falgout, R. D.; Friedhoff, S.; Kolev, Tz. V.; ...
2017-10-06
Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporalmore » dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.« less
Multigrid methods with space–time concurrency
DOE Office of Scientific and Technical Information (OSTI.GOV)
Falgout, R. D.; Friedhoff, S.; Kolev, Tz. V.
Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporalmore » dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.« less
NASA Technical Reports Server (NTRS)
Taylor, C. (Editor); Chin, J. H. (Editor); Homsy, G. M. (Editor)
1991-01-01
Consideration is given to the impulse response of a laminar boundary layer and receptivity; numerical transition to turbulence in plane Poiseuille flow; large eddy simulation of turbulent wake flow; a viscous model and loss calculation of a multisplitter cascade; vortex initiation during dynamic stall of an airfoil; a numerical analysis of isothermal flow in a combustion chamber; and compressible flow calculations with a two-equation turbulence model and unstructured grids. Attention is also given to a 2D calculation of a buoyant flow around a burning sphere, a fast multigrid method for 3D turbulent incompressible flows, a streaming flow induced by an oscillating cascade of circular cylinders, an algebraic multigrid scheme for solving the Navier-Stokes equations on unstructured meshes; and nonlinear coupled multigrid solutions to thermal problems employing different nodal grid arrangements and convective transport approximations.
Efficient relaxed-Jacobi smoothers for multigrid on parallel computers
NASA Astrophysics Data System (ADS)
Yang, Xiang; Mittal, Rajat
2017-03-01
In this Technical Note, we present a family of Jacobi-based multigrid smoothers suitable for the solution of discretized elliptic equations. These smoothers are based on the idea of scheduled-relaxation Jacobi proposed recently by Yang & Mittal (2014) [18] and employ two or three successive relaxed Jacobi iterations with relaxation factors derived so as to maximize the smoothing property of these iterations. The performance of these new smoothers measured in terms of convergence acceleration and computational workload, is assessed for multi-domain implementations typical of parallelized solvers, and compared to the lexicographic point Gauss-Seidel smoother. The tests include the geometric multigrid method on structured grids as well as the algebraic grid method on unstructured grids. The tests demonstrate that unlike Gauss-Seidel, the convergence of these Jacobi-based smoothers is unaffected by domain decomposition, and furthermore, they outperform the lexicographic Gauss-Seidel by factors that increase with domain partition count.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel
Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switchingmore » technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.« less
Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel
2018-02-06
Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switchingmore » technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. In conclusion, we also show that the strategy is efficient and scales optimally with problem size.« less
NASA Technical Reports Server (NTRS)
Zeng, S.; Wesseling, P.
1993-01-01
The performance of a linear multigrid method using four smoothing methods, called SCGS (Symmetrical Coupled GauBeta-Seidel), CLGS (Collective Line GauBeta-Seidel), SILU (Scalar ILU), and CILU (Collective ILU), is investigated for the incompressible Navier-Stokes equations in general coordinates, in association with Galerkin coarse grid approximation. Robustness and efficiency are measured and compared by application to test problems. The numerical results show that CILU is the most robust, SILU the least, with CLGS and SCGS in between. CLGS is the best in efficiency, SCGS and CILU follow, and SILU is the worst.
Multigrid contact detection method
NASA Astrophysics Data System (ADS)
He, Kejing; Dong, Shoubin; Zhou, Zhaoyao
2007-03-01
Contact detection is a general problem of many physical simulations. This work presents a O(N) multigrid method for general contact detection problems (MGCD). The multigrid idea is integrated with contact detection problems. Both the time complexity and memory consumption of the MGCD are O(N) . Unlike other methods, whose efficiencies are influenced strongly by the object size distribution, the performance of MGCD is insensitive to the object size distribution. We compare the MGCD with the no binary search (NBS) method and the multilevel boxing method in three dimensions for both time complexity and memory consumption. For objects with similar size, the MGCD is as good as the NBS method, both of which outperform the multilevel boxing method regarding memory consumption. For objects with diverse size, the MGCD outperform both the NBS method and the multilevel boxing method. We use the MGCD to solve the contact detection problem for a granular simulation system based on the discrete element method. From this granular simulation, we get the density property of monosize packing and binary packing with size ratio equal to 10. The packing density for monosize particles is 0.636. For binary packing with size ratio equal to 10, when the number of small particles is 300 times as the number of big particles, the maximal packing density 0.824 is achieved.
A NetCDF version of the two-dimensional energy balance model based on the full multigrid algorithm
NASA Astrophysics Data System (ADS)
Zhuang, Kelin; North, Gerald R.; Stevens, Mark J.
A NetCDF version of the two-dimensional energy balance model based on the full multigrid method in Fortran is introduced for both pedagogical and research purposes. Based on the land-sea-ice distribution, orbital elements, greenhouse gases concentration, and albedo, the code calculates the global seasonal surface temperature. A step-by-step guide with examples is provided for practice.
Monolithic multigrid method for the coupled Stokes flow and deformable porous medium system
NASA Astrophysics Data System (ADS)
Luo, P.; Rodrigo, C.; Gaspar, F. J.; Oosterlee, C. W.
2018-01-01
The interaction between fluid flow and a deformable porous medium is a complicated multi-physics problem, which can be described by a coupled model based on the Stokes and poroelastic equations. A monolithic multigrid method together with either a coupled Vanka smoother or a decoupled Uzawa smoother is employed as an efficient numerical technique for the linear discrete system obtained by finite volumes on staggered grids. A specialty in our modeling approach is that at the interface of the fluid and poroelastic medium, two unknowns from the different subsystems are defined at the same grid point. We propose a special discretization at and near the points on the interface, which combines the approximation of the governing equations and the considered interface conditions. In the decoupled Uzawa smoother, Local Fourier Analysis (LFA) helps us to select optimal values of the relaxation parameter appearing. To implement the monolithic multigrid method, grid partitioning is used to deal with the interface updates when communication is required between two subdomains. Numerical experiments show that the proposed numerical method has an excellent convergence rate. The efficiency and robustness of the method are confirmed in numerical experiments with typically small realistic values of the physical coefficients.
An upwind multigrid method for solving viscous flows on unstructured triangular meshes. M.S. Thesis
NASA Technical Reports Server (NTRS)
Bonhaus, Daryl Lawrence
1993-01-01
A multigrid algorithm is combined with an upwind scheme for solving the two dimensional Reynolds averaged Navier-Stokes equations on triangular meshes resulting in an efficient, accurate code for solving complex flows around multiple bodies. The relaxation scheme uses a backward-Euler time difference and relaxes the resulting linear system using a red-black procedure. Roe's flux-splitting scheme is used to discretize convective and pressure terms, while a central difference is used for the diffusive terms. The multigrid scheme is demonstrated for several flows around single and multi-element airfoils, including inviscid, laminar, and turbulent flows. The results show an appreciable speed up of the scheme for inviscid and laminar flows, and dramatic increases in efficiency for turbulent cases, especially those on increasingly refined grids.
On multigrid methods for the Navier-Stokes Computer
NASA Technical Reports Server (NTRS)
Nosenchuck, D. M.; Krist, S. E.; Zang, T. A.
1988-01-01
The overall architecture of the multipurpose parallel-processing Navier-Stokes Computer (NSC) being developed by Princeton and NASA Langley (Nosenchuck et al., 1986) is described and illustrated with extensive diagrams, and the NSC implementation of an elementary multigrid algorithm for simulating isotropic turbulence (based on solution of the incompressible time-dependent Navier-Stokes equations with constant viscosity) is characterized in detail. The present NSC design concept calls for 64 nodes, each with the performance of a class VI supercomputer, linked together by a fiber-optic hypercube network and joined to a front-end computer by a global bus. In this configuration, the NSC would have a storage capacity of over 32 Gword and a peak speed of over 40 Gflops. The multigrid Navier-Stokes code discussed would give sustained operation rates of about 25 Gflops.
Multigrid methods for flow transition in three-dimensional boundary layers with surface roughness
NASA Technical Reports Server (NTRS)
Liu, Chaoqun; Liu, Zhining; Mccormick, Steve
1993-01-01
The efficient multilevel adaptive method has been successfully applied to perform direct numerical simulations (DNS) of flow transition in 3-D channels and 3-D boundary layers with 2-D and 3-D isolated and distributed roughness in a curvilinear coordinate system. A fourth-order finite difference technique on stretched and staggered grids, a fully-implicit time marching scheme, a semi-coarsening multigrid method associated with line distributive relaxation scheme, and an improved outflow boundary-condition treatment, which needs only a very short buffer domain to damp all order-one wave reflections, are developed. These approaches make the multigrid DNS code very accurate and efficient. This allows us not only to be able to do spatial DNS for the 3-D channel and flat plate at low computational costs, but also to do spatial DNS for transition in the 3-D boundary layer with 3-D single and multiple roughness elements, which would have extremely high computational costs with conventional methods. Numerical results show good agreement with the linear stability theory, the secondary instability theory, and a number of laboratory experiments. The contribution of isolated and distributed roughness to transition is analyzed.
Conjugate gradient coupled with multigrid for an indefinite problem
NASA Technical Reports Server (NTRS)
Gozani, J.; Nachshon, A.; Turkel, E.
1984-01-01
An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.
Multigrid preconditioned conjugate-gradient method for large-scale wave-front reconstruction.
Gilles, Luc; Vogel, Curtis R; Ellerbroek, Brent L
2002-09-01
We introduce a multigrid preconditioned conjugate-gradient (MGCG) iterative scheme for computing open-loop wave-front reconstructors for extreme adaptive optics systems. We present numerical simulations for a 17-m class telescope with n = 48756 sensor measurement grid points within the aperture, which indicate that our MGCG method has a rapid convergence rate for a wide range of subaperture average slope measurement signal-to-noise ratios. The total computational cost is of order n log n. Hence our scheme provides for fast wave-front simulation and control in large-scale adaptive optics systems.
Algebraic multigrid methods applied to problems in computational structural mechanics
NASA Technical Reports Server (NTRS)
Mccormick, Steve; Ruge, John
1989-01-01
The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.
NASA Technical Reports Server (NTRS)
1982-01-01
Papers presented in this volume provide an overview of recent work on numerical boundary condition procedures and multigrid methods. The topics discussed include implicit boundary conditions for the solution of the parabolized Navier-Stokes equations for supersonic flows; far field boundary conditions for compressible flows; and influence of boundary approximations and conditions on finite-difference solutions. Papers are also presented on fully implicit shock tracking and on the stability of two-dimensional hyperbolic initial boundary value problems for explicit and implicit schemes.
NASA Technical Reports Server (NTRS)
Elmiligui, Alaa; Cannizzaro, Frank; Melson, N. D.
1991-01-01
A general multiblock method for the solution of the three-dimensional, unsteady, compressible, thin-layer Navier-Stokes equations has been developed. The convective and pressure terms are spatially discretized using Roe's flux differencing technique while the viscous terms are centrally differenced. An explicit Runge-Kutta method is used to advance the solution in time. Local time stepping, adaptive implicit residual smoothing, and the Full Approximation Storage (FAS) multigrid scheme are added to the explicit time stepping scheme to accelerate convergence to steady state. Results for three-dimensional test cases are presented and discussed.
Method for providing improved solid fuels from agglomerated subbituminous coal
Janiak, Jerzy S.; Turak, Ali A.; Pawlak, Wanda; Ignasiak, Boleslaw L.
1989-01-01
A method is provided for separating agglomerated subbituminous coal and the heavy bridging liquid used to form the agglomerates. The separation is performed by contacting the agglomerates with inert gas or steam at a temperature in the range of 250.degree. to 350.degree. C. at substantially atmospheric pressure.
Analysis Tools for CFD Multigrid Solvers
NASA Technical Reports Server (NTRS)
Mineck, Raymond E.; Thomas, James L.; Diskin, Boris
2004-01-01
Analysis tools are needed to guide the development and evaluate the performance of multigrid solvers for the fluid flow equations. Classical analysis tools, such as local mode analysis, often fail to accurately predict performance. Two-grid analysis tools, herein referred to as Idealized Coarse Grid and Idealized Relaxation iterations, have been developed and evaluated within a pilot multigrid solver. These new tools are applicable to general systems of equations and/or discretizations and point to problem areas within an existing multigrid solver. Idealized Relaxation and Idealized Coarse Grid are applied in developing textbook-efficient multigrid solvers for incompressible stagnation flow problems.
Three-dimensional multigrid algorithms for the flux-split Euler equations
NASA Technical Reports Server (NTRS)
Anderson, W. Kyle; Thomas, James L.; Whitfield, David L.
1988-01-01
The Full Approximation Scheme (FAS) multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each of the splitting algorithms uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computation required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. The stability and smoothing rate of each of the schemes are examined using a Fourier analysis of the complete system of equations. Results are presented for three-dimensional subsonic, transonic, and supersonic flows which demonstrate substantially improved convergence rates with the multigrid algorithm. The influence of using both a V-cycle and a W-cycle on the convergence is examined.
Spectral multigrid methods for the solution of homogeneous turbulence problems
NASA Technical Reports Server (NTRS)
Erlebacher, G.; Zang, T. A.; Hussaini, M. Y.
1987-01-01
New three-dimensional spectral multigrid algorithms are analyzed and implemented to solve the variable coefficient Helmholtz equation. Periodicity is assumed in all three directions which leads to a Fourier collocation representation. Convergence rates are theoretically predicted and confirmed through numerical tests. Residual averaging results in a spectral radius of 0.2 for the variable coefficient Poisson equation. In general, non-stationary Richardson must be used for the Helmholtz equation. The algorithms developed are applied to the large-eddy simulation of incompressible isotropic turbulence.
Multigrid solution strategies for adaptive meshing problems
NASA Technical Reports Server (NTRS)
Mavriplis, Dimitri J.
1995-01-01
This paper discusses the issues which arise when combining multigrid strategies with adaptive meshing techniques for solving steady-state problems on unstructured meshes. A basic strategy is described, and demonstrated by solving several inviscid and viscous flow cases. Potential inefficiencies in this basic strategy are exposed, and various alternate approaches are discussed, some of which are demonstrated with an example. Although each particular approach exhibits certain advantages, all methods have particular drawbacks, and the formulation of a completely optimal strategy is considered to be an open problem.
The Multigrid-Mask Numerical Method for Solution of Incompressible Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Ku, Hwar-Ching; Popel, Aleksander S.
1996-01-01
A multigrid-mask method for solution of incompressible Navier-Stokes equations in primitive variable form has been developed. The main objective is to apply this method in conjunction with the pseudospectral element method solving flow past multiple objects. There are two key steps involved in calculating flow past multiple objects. The first step utilizes only Cartesian grid points. This homogeneous or mask method step permits flow into the interior rectangular elements contained in objects, but with the restriction that the velocity for those Cartesian elements within and on the surface of an object should be small or zero. This step easily produces an approximate flow field on Cartesian grid points covering the entire flow field. The second or heterogeneous step corrects the approximate flow field to account for the actual shape of the objects by solving the flow field based on the local coordinates surrounding each object and adapted to it. The noise occurring in data communication between the global (low frequency) coordinates and the local (high frequency) coordinates is eliminated by the multigrid method when the Schwarz Alternating Procedure (SAP) is implemented. Two dimensional flow past circular and elliptic cylinders will be presented to demonstrate the versatility of the proposed method. An interesting phenomenon is found that when the second elliptic cylinder is placed in the wake of the first elliptic cylinder a traction force results in a negative drag coefficient.
Morphological characterization of diesel soot agglomerates based on the Beer-Lambert law
NASA Astrophysics Data System (ADS)
Lapuerta, Magín; Martos, Francisco J.; José Expósito, Juan
2013-03-01
A new method is proposed for the determination of the number of primary particles composing soot agglomerates emitted from diesel engines as well as their individual fractal dimension. The method is based on the Beer-Lambert law and it is applied to micro-photographs taken in high resolution transmission electron microscopy. Differences in the grey levels of the images lead to a more accurate estimation of the geometry of the agglomerate (in this case radius of gyration) than other methods based exclusively on the planar projections of the agglomerates. The method was validated by applying it to different images of the same agglomerate observed from different angles of incidence, and proving that the effect of the angle of incidence is minor, contrary to other methods. Finally, the comparisons with other methods showed that the size, number of primary particles and fractal dimension (the latter depending on the particle size) are usually underestimated when only planar projections of the agglomerates are considered.
Multigrid methods for a semilinear PDE in the theory of pseudoplastic fluids
NASA Technical Reports Server (NTRS)
Henson, Van Emden; Shaker, A. W.
1993-01-01
We show that by certain transformations the boundary layer equations for the class of non-Newtonian fluids named pseudoplastic can be generalized in the form the vector differential operator(u) + p(x)u(exp -lambda) = 0, where x is a member of the set Omega and Omega is a subset of R(exp n), n is greater than or equal to 1 under the classical conditions for steady flow over a semi-infinite flat plate. We provide a survey of the existence, uniqueness, and analyticity of the solutions for this problem. We also establish numerical solutions in one- and two-dimensional regions using multigrid methods.
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
DOE Office of Scientific and Technical Information (OSTI.GOV)
Christensen, Max La Cour; Villa, Umberto E.; Engsig-Karup, Allan P.
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, ourmore » FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.« less
Algebraic multigrid preconditioners for two-phase flow in porous media with phase transitions
NASA Astrophysics Data System (ADS)
Bui, Quan M.; Wang, Lu; Osei-Kuffuor, Daniel
2018-04-01
Multiphase flow is a critical process in a wide range of applications, including oil and gas recovery, carbon sequestration, and contaminant remediation. Numerical simulation of multiphase flow requires solving of a large, sparse linear system resulting from the discretization of the partial differential equations modeling the flow. In the case of multiphase multicomponent flow with miscible effect, this is a very challenging task. The problem becomes even more difficult if phase transitions are taken into account. A new approach to handle phase transitions is to formulate the system as a nonlinear complementarity problem (NCP). Unlike in the primary variable switching technique, the set of primary variables in this approach is fixed even when there is phase transition. Not only does this improve the robustness of the nonlinear solver, it opens up the possibility to use multigrid methods to solve the resulting linear system. The disadvantage of the complementarity approach, however, is that when a phase disappears, the linear system has the structure of a saddle point problem and becomes indefinite, and current algebraic multigrid (AMG) algorithms cannot be applied directly. In this study, we explore the effectiveness of a new multilevel strategy, based on the multigrid reduction technique, to deal with problems of this type. We demonstrate the effectiveness of the method through numerical results for the case of two-phase, two-component flow with phase appearance/disappearance. We also show that the strategy is efficient and scales optimally with problem size.
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Berger, M. J.; Adomavicius, G.
2000-01-01
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.
Weighted least squares phase unwrapping based on the wavelet transform
NASA Astrophysics Data System (ADS)
Chen, Jiafeng; Chen, Haiqin; Yang, Zhengang; Ren, Haixia
2007-01-01
The weighted least squares phase unwrapping algorithm is a robust and accurate method to solve phase unwrapping problem. This method usually leads to a large sparse linear equation system. Gauss-Seidel relaxation iterative method is usually used to solve this large linear equation. However, this method is not practical due to its extremely slow convergence. The multigrid method is an efficient algorithm to improve convergence rate. However, this method needs an additional weight restriction operator which is very complicated. For this reason, the multiresolution analysis method based on the wavelet transform is proposed. By applying the wavelet transform, the original system is decomposed into its coarse and fine resolution levels and an equivalent equation system with better convergence condition can be obtained. Fast convergence in separate coarse resolution levels speeds up the overall system convergence rate. The simulated experiment shows that the proposed method converges faster and provides better result than the multigrid method.
An Optimal Order Nonnested Mixed Multigrid Method for Generalized Stokes Problems
NASA Technical Reports Server (NTRS)
Deng, Qingping
1996-01-01
A multigrid algorithm is developed and analyzed for generalized Stokes problems discretized by various nonnested mixed finite elements within a unified framework. It is abstractly proved by an element-independent analysis that the multigrid algorithm converges with an optimal order if there exists a 'good' prolongation operator. A technique to construct a 'good' prolongation operator for nonnested multilevel finite element spaces is proposed. Its basic idea is to introduce a sequence of auxiliary nested multilevel finite element spaces and define a prolongation operator as a composite operator of two single grid level operators. This makes not only the construction of a prolongation operator much easier (the final explicit forms of such prolongation operators are fairly simple), but the verification of the approximate properties for prolongation operators is also simplified. Finally, as an application, the framework and technique is applied to seven typical nonnested mixed finite elements.
NASA Technical Reports Server (NTRS)
Cannizzaro, Frank E.; Ash, Robert L.
1992-01-01
A state-of-the-art computer code has been developed that incorporates a modified Runge-Kutta time integration scheme, upwind numerical techniques, multigrid acceleration, and multi-block capabilities (RUMM). A three-dimensional thin-layer formulation of the Navier-Stokes equations is employed. For turbulent flow cases, the Baldwin-Lomax algebraic turbulence model is used. Two different upwind techniques are available: van Leer's flux-vector splitting and Roe's flux-difference splitting. Full approximation multi-grid plus implicit residual and corrector smoothing were implemented to enhance the rate of convergence. Multi-block capabilities were developed to provide geometric flexibility. This feature allows the developed computer code to accommodate any grid topology or grid configuration with multiple topologies. The results shown in this dissertation were chosen to validate the computer code and display its geometric flexibility, which is provided by the multi-block structure.
Segmented Domain Decomposition Multigrid For 3-D Turbomachinery Flows
NASA Technical Reports Server (NTRS)
Celestina, M. L.; Adamczyk, J. J.; Rubin, S. G.
2001-01-01
A Segmented Domain Decomposition Multigrid (SDDMG) procedure was developed for three-dimensional viscous flow problems as they apply to turbomachinery flows. The procedure divides the computational domain into a coarse mesh comprised of uniformly spaced cells. To resolve smaller length scales such as the viscous layer near a surface, segments of the coarse mesh are subdivided into a finer mesh. This is repeated until adequate resolution of the smallest relevant length scale is obtained. Multigrid is used to communicate information between the different grid levels. To test the procedure, simulation results will be presented for a compressor and turbine cascade. These simulations are intended to show the ability of the present method to generate grid independent solutions. Comparisons with data will also be presented. These comparisons will further demonstrate the usefulness of the present work for they allow an estimate of the accuracy of the flow modeling equations independent of error attributed to numerical discretization.
Multigrid Method for Modeling Multi-Dimensional Combustion with Detailed Chemistry
NASA Technical Reports Server (NTRS)
Zheng, Xiaoqing; Liu, Chaoqun; Liao, Changming; Liu, Zhining; McCormick, Steve
1996-01-01
A highly accurate and efficient numerical method is developed for modeling 3-D reacting flows with detailed chemistry. A contravariant velocity-based governing system is developed for general curvilinear coordinates to maintain simplicity of the continuity equation and compactness of the discretization stencil. A fully-implicit backward Euler technique and a third-order monotone upwind-biased scheme on a staggered grid are used for the respective temporal and spatial terms. An efficient semi-coarsening multigrid method based on line-distributive relaxation is used as the flow solver. The species equations are solved in a fully coupled way and the chemical reaction source terms are treated implicitly. Example results are shown for a 3-D gas turbine combustor with strong swirling inflows.
Solving the Fluid Pressure Poisson Equation Using Multigrid-Evaluation and Improvements.
Dick, Christian; Rogowsky, Marcus; Westermann, Rudiger
2016-11-01
In many numerical simulations of fluids governed by the incompressible Navier-Stokes equations, the pressure Poisson equation needs to be solved to enforce mass conservation. Multigrid solvers show excellent convergence in simple scenarios, yet they can converge slowly in domains where physically separated regions are combined at coarser scales. Moreover, existing multigrid solvers are tailored to specific discretizations of the pressure Poisson equation, and they cannot easily be adapted to other discretizations. In this paper we analyze the convergence properties of existing multigrid solvers for the pressure Poisson equation in different simulation domains, and we show how to further improve the multigrid convergence rate by using a graph-based extension to determine the coarse grid hierarchy. The proposed multigrid solver is generic in that it can be applied to different kinds of discretizations of the pressure Poisson equation, by using solely the specification of the simulation domain and pre-assembled computational stencils. We analyze the proposed solver in combination with finite difference and finite volume discretizations of the pressure Poisson equation. Our evaluations show that, despite the common assumption, multigrid schemes can exploit their potential even in the most complicated simulation scenarios, yet this behavior is obtained at the price of higher memory consumption.
NASA Astrophysics Data System (ADS)
Cao, Jian; Chen, Jing-Bo; Dai, Meng-Xue
2018-01-01
An efficient finite-difference frequency-domain modeling of seismic wave propagation relies on the discrete schemes and appropriate solving methods. The average-derivative optimal scheme for the scalar wave modeling is advantageous in terms of the storage saving for the system of linear equations and the flexibility for arbitrary directional sampling intervals. However, using a LU-decomposition-based direct solver to solve its resulting system of linear equations is very costly for both memory and computational requirements. To address this issue, we consider establishing a multigrid-preconditioned BI-CGSTAB iterative solver fit for the average-derivative optimal scheme. The choice of preconditioning matrix and its corresponding multigrid components is made with the help of Fourier spectral analysis and local mode analysis, respectively, which is important for the convergence. Furthermore, we find that for the computation with unequal directional sampling interval, the anisotropic smoothing in the multigrid precondition may affect the convergence rate of this iterative solver. Successful numerical applications of this iterative solver for the homogenous and heterogeneous models in 2D and 3D are presented where the significant reduction of computer memory and the improvement of computational efficiency are demonstrated by comparison with the direct solver. In the numerical experiments, we also show that the unequal directional sampling interval will weaken the advantage of this multigrid-preconditioned iterative solver in the computing speed or, even worse, could reduce its accuracy in some cases, which implies the need for a reasonable control of directional sampling interval in the discretization.
Scalable smoothing strategies for a geometric multigrid method for the immersed boundary equations
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bhalla, Amneet Pal Singh; Knepley, Matthew G.; Adams, Mark F.
2016-12-20
The immersed boundary (IB) method is a widely used approach to simulating fluid-structure interaction (FSI). Although explicit versions of the IB method can suffer from severe time step size restrictions, these methods remain popular because of their simplicity and generality. In prior work (Guy et al., Adv Comput Math, 2015), some of us developed a geometric multigrid preconditioner for a stable semi-implicit IB method under Stokes flow conditions; however, this solver methodology used a Vanka-type smoother that presented limited opportunities for parallelization. This work extends this Stokes-IB solver methodology by developing smoothing techniques that are suitable for parallel implementation. Specifically,more » we demonstrate that an additive version of the Vanka smoother can yield an effective multigrid preconditioner for the Stokes-IB equations, and we introduce an efficient Schur complement-based smoother that is also shown to be effective for the Stokes-IB equations. We investigate the performance of these solvers for a broad range of material stiffnesses, both for Stokes flows and flows at nonzero Reynolds numbers, and for thick and thin structural models. We show here that linear solver performance degrades with increasing Reynolds number and material stiffness, especially for thin interface cases. Nonetheless, the proposed approaches promise to yield effective solution algorithms, especially at lower Reynolds numbers and at modest-to-high elastic stiffnesses.« less
Multigrid Computations of 3-D Incompressible Internal and External Viscous Rotating Flows
NASA Technical Reports Server (NTRS)
Sheng, Chunhua; Taylor, Lafayette K.; Chen, Jen-Ping; Jiang, Min-Yee; Whitfield, David L.
1996-01-01
This report presents multigrid methods for solving the 3-D incompressible viscous rotating flows in a NASA low-speed centrifugal compressor and a marine propeller 4119. Numerical formulations are given in both the rotating reference frame and the absolute frame. Comparisons are made for the accuracy, efficiency, and robustness between the steady-state scheme and the time-accurate scheme for simulating viscous rotating flows for complex internal and external flow applications. Prospects for further increase in efficiency and accuracy of unsteady time-accurate computations are discussed.
Variational optical flow computation in real time.
Bruhn, Andrés; Weickert, Joachim; Feddern, Christian; Kohlberger, Timo; Schnörr, Christoph
2005-05-01
This paper investigates the usefulness of bidirectional multigrid methods for variational optical flow computations. Although these numerical schemes are among the fastest methods for solving equation systems, they are rarely applied in the field of computer vision. We demonstrate how to employ those numerical methods for the treatment of variational optical flow formulations and show that the efficiency of this approach even allows for real-time performance on standard PCs. As a representative for variational optic flow methods, we consider the recently introduced combined local-global method. It can be considered as a noise-robust generalization of the Horn and Schunck technique. We present a decoupled, as well as a coupled, version of the classical Gauss-Seidel solver, and we develop several multgrid implementations based on a discretization coarse grid approximation. In contrast, with standard bidirectional multigrid algorithms, we take advantage of intergrid transfer operators that allow for nondyadic grid hierarchies. As a consequence, no restrictions concerning the image size or the number of traversed levels have to be imposed. In the experimental section, we juxtapose the developed multigrid schemes and demonstrate their superior performance when compared to unidirectional multgrid methods and nonhierachical solvers. For the well-known 316 x 252 Yosemite sequence, we succeeded in computing the complete set of dense flow fields in three quarters of a second on a 3.06-GHz Pentium4 PC. This corresponds to a frame rate of 18 flow fields per second which outperforms the widely-used Gauss-Seidel method by almost three orders of magnitude.
A simplified analysis of the multigrid V-cycle as a fast elliptic solver
NASA Technical Reports Server (NTRS)
Decker, Naomi H.; Taasan, Shlomo
1988-01-01
For special model problems, Fourier analysis gives exact convergence rates for the two-grid multigrid cycle and, for more general problems, provides estimates of the two-grid convergence rates via local mode analysis. A method is presented for obtaining mutigrid convergence rate estimates for cycles involving more than two grids (using essentially the same analysis as for the two-grid cycle). For the simple cast of the V-cycle used as a fast Laplace solver on the unit square, the k-grid convergence rate bounds obtained by this method are sharper than the bounds predicted by the variational theory. Both theoretical justification and experimental evidence are presented.
Artificial dissipation and central difference schemes for the Euler and Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Swanson, R. C.; Turkel, Eli
1987-01-01
An artificial dissipation model, including boundary treatment, that is employed in many central difference schemes for solving the Euler and Navier-Stokes equations is discussed. Modifications of this model such as the eigenvalue scaling suggested by upwind differencing are examined. Multistage time stepping schemes with and without a multigrid method are used to investigate the effects of changes in the dissipation model on accuracy and convergence. Improved accuracy for inviscid and viscous airfoil flow is obtained with the modified eigenvalue scaling. Slower convergence rates are experienced with the multigrid method using such scaling. The rate of convergence is improved by applying a dissipation scaling function that depends on mesh cell aspect ratio.
Multigrid treatment of implicit continuum diffusion
NASA Astrophysics Data System (ADS)
Francisquez, Manaure; Zhu, Ben; Rogers, Barrett
2017-10-01
Implicit treatment of diffusive terms of various differential orders common in continuum mechanics modeling, such as computational fluid dynamics, is investigated with spectral and multigrid algorithms in non-periodic 2D domains. In doubly periodic time dependent problems these terms can be efficiently and implicitly handled by spectral methods, but in non-periodic systems solved with distributed memory parallel computing and 2D domain decomposition, this efficiency is lost for large numbers of processors. We built and present here a multigrid algorithm for these types of problems which outperforms a spectral solution that employs the highly optimized FFTW library. This multigrid algorithm is not only suitable for high performance computing but may also be able to efficiently treat implicit diffusion of arbitrary order by introducing auxiliary equations of lower order. We test these solvers for fourth and sixth order diffusion with idealized harmonic test functions as well as a turbulent 2D magnetohydrodynamic simulation. It is also shown that an anisotropic operator without cross-terms can improve model accuracy and speed, and we examine the impact that the various diffusion operators have on the energy, the enstrophy, and the qualitative aspect of a simulation. This work was supported by DOE-SC-0010508. This research used resources of the National Energy Research Scientific Computing Center (NERSC).
Method for recovering light hydrocarbons from coal agglomerates
Huettenhain, Horst; Benz, August D.; Getsoian, John
1991-01-01
A method and apparatus for removing light hydrocarbons, such as heptane, from coal agglomerates includes an enclosed chamber having a substantially horizontal perforate surface therein. The coal agglomerates are introduced into a water bath within the chamber. The agglomerates are advanced over the surface while steam is substantially continuously introduced through the surface into the water bath. Steam heats the water and causes volatilization of the light hydrocarbons, which may be collected from the overhead of the chamber. The resulting agglomerates may be collected at the opposite end from the surface and subjected to final draining processes prior to transportation or use.
FAS multigrid calculations of three dimensional flow using non-staggered grids
NASA Technical Reports Server (NTRS)
Matovic, D.; Pollard, A.; Becker, H. A.; Grandmaison, E. W.
1993-01-01
Grid staggering is a well known remedy for the problem of velocity/pressure coupling in incompressible flow calculations. Numerous inconveniences occur, however, when staggered grids are implemented, particularly when a general-purpose code, capable of handling irregular three-dimensional domains, is sought. In several non-staggered grid numerical procedures proposed in the literature, the velocity/pressure coupling is achieved by either pressure or velocity (momentum) averaging. This approach is not convenient for simultaneous (block) solvers that are preferred when using multigrid methods. A new method is introduced in this paper that is based upon non-staggered grid formulation with a set of virtual cell face velocities used for pressure/velocity coupling. Instead of pressure or velocity averaging, a momentum balance at the cell face is used as a link between the momentum and mass balance constraints. The numerical stencil is limited to 9 nodes (in 2D) or 27 nodes (in 3D), both during the smoothing and inter-grid transfer, which is a convenient feature when a block point solver is applied. The results for a lid-driven cavity and a cube in a lid-driven cavity are presented and compared to staggered grid calculations using the same multigrid algorithm. The method is shown to be stable and produce a smooth (wiggle-free) pressure field.
Multigrid method for stability problems
NASA Technical Reports Server (NTRS)
Taasan, Shlomo
1988-01-01
The problem of calculating the stability of steady state solutions of differential equations is treated. Leading eigenvalues (i.e., having maximal real part) of large matrices that arise from discretization are to be calculated. An efficient multigrid method for solving these problems is presented. The method begins by obtaining an initial approximation for the dominant subspace on a coarse level using a damped Jacobi relaxation. This proceeds until enough accuracy for the dominant subspace has been obtained. The resulting grid functions are then used as an initial approximation for appropriate eigenvalue problems. These problems are being solved first on coarse levels, followed by refinement until a desired accuracy for the eigenvalues has been achieved. The method employs local relaxation on all levels together with a global change on the coarsest level only, which is designed to separate the different eigenfunctions as well as to update their corresponding eigenvalues. Coarsening is done using the FAS formulation in a non-standard way in which the right hand side of the coarse grid equations involves unknown parameters to be solved for on the coarse grid. This in particular leads to a new multigrid method for calculating the eigenvalues of symmetric problems. Numerical experiments with a model problem demonstrate the effectiveness of the method proposed. Using an FMG algorithm a solution to the level of discretization errors is obtained in just a few work units (less than 10), where a work unit is the work involved in one Jacobi relization on the finest level.
The Effect of Multigrid Parameters in a 3D Heat Diffusion Equation
NASA Astrophysics Data System (ADS)
Oliveira, F. De; Franco, S. R.; Pinto, M. A. Villela
2018-02-01
The aim of this paper is to reduce the necessary CPU time to solve the three-dimensional heat diffusion equation using Dirichlet boundary conditions. The finite difference method (FDM) is used to discretize the differential equations with a second-order accuracy central difference scheme (CDS). The algebraic equations systems are solved using the lexicographical and red-black Gauss-Seidel methods, associated with the geometric multigrid method with a correction scheme (CS) and V-cycle. Comparisons are made between two types of restriction: injection and full weighting. The used prolongation process is the trilinear interpolation. This work is concerned with the study of the influence of the smoothing value (v), number of mesh levels (L) and number of unknowns (N) on the CPU time, as well as the analysis of algorithm complexity.
Fuel agglomerates and method of agglomeration
Wen, Wu-Wey
1986-01-01
Solid fuel agglomerates are prepared of particulate coal or other carbonaceous material with a binder having a high humic acid or humate salt content. The humic acid is extracted from oxidized carbonaceous material with a mild aqueous alkali solution of, for instance, ammonia. The particulate material is blended with the extract which serves as the binder for the agglomerates. The water-resistant agglomerates are formed such as by pelletizing, followed by drying to remove moisture and solidify the humic acid binder throughout the agglomerate.
Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Chima, Rodrick V.; Turkel, Eli; Schaffer, Steve
1987-01-01
Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.
Scalability and performance of data-parallel pressure-based multigrid methods for viscous flows
DOE Office of Scientific and Technical Information (OSTI.GOV)
Blosch, E.L.; Shyy, W.
1996-05-01
A full-approximation storage multigrid method for solving the steady-state 2-d incompressible Navier-Stokes equations on staggered grids has been implemented in Fortran on the CM-5, using the array aliasing feature in CM-Fortran to avoid declaring fine-grid-sized arrays on all levels while still allowing a variable number of grid levels. Thus, the storage cost scales with the number of unknowns, allowing us to consider significantly larger problems than would otherwise be possible. Timings over a range of problem sizes and numbers of processors, up to 4096 x 4096 on 512 nodes, show that the smoothing procedure, a pressure-correction technique, is scalable andmore » that the restriction and prolongation steps are nearly so. The performance obtained for the multigrid method is 333 Mflops out of the theoretical peak 4 Gflops on a 32-node CM-5. In comparison, a single-grid computation obtained 420 Mflops. The decrease is due to the inefficiency of the smoothing iterations on the coarse grid levels. W cycles cost much more and are much less efficient than V cycles, due to the increased contribution from the coarse grids. The convergence rate characteristics of the pressure-correction multigrid method are investigated in a Re = 5000 lid-driven cavity flow and a Re = 300 symmetric backward-facing step flow, using either a defect-correction scheme or a second-order upwind scheme. A heuristic technique relating the convergence tolerances for the course grids to the truncation error of the discretization has been found effective and robust. With second-order upwinding on all grid levels, a 5-level 320 x 80 step flow solution was obtained in 20 V cycles, which corresponds to a smoothing rate of 0.7, and required 25 s on a 32-node CM-5. Overall, the convergence rates obtained in the present work are comparable to the most competitive findings reported in the literature. 62 refs., 13 figs.« less
Scalability and Performance of Data-Parallel Pressure-Based Multigrid Methods for Viscous Flows
NASA Astrophysics Data System (ADS)
Blosch, Edwin L.; Shyy, Wei
1996-05-01
A full-approximation storage multigrid method for solving the steady-state 2-dincompressible Navier-Stokes equations on staggered grids has been implemented in Fortran on the CM-5,using the array aliasing feature in CM-Fortran to avoid declaring fine-grid-sized arrays on all levels while still allowing a variable number of grid levels. Thus, the storage cost scales with the number of unknowns,allowing us to consider significantly larger problems than would otherwise be possible. Timings over a range of problem sizes and numbers of processors, up to 4096 × 4096 on 512 nodes, show that the smoothing procedure, a pressure-correction technique, is scalable and that the restriction and prolongation steps are nearly so. The performance obtained for the multigrid method is 333 Mflops out of the theoretical peak 4 Gflops on a 32-node CM-5. In comparison, a single-grid computation obtained 420 Mflops. The decrease is due to the inefficiency of the smoothing iterations on the coarse grid levels. W cycles cost much more and are much less efficient than V cycles, due to the increased contribution from the coarse grids. The convergence rate characteristics of the pressure-correction multigrid method are investigated in a Re = 5000 lid-driven cavity flow and a Re = 300 symmetric backward-facing step flow, using either a defect-correction scheme or a second-order upwind scheme. A heuristic technique relating the convergence tolerances for the coarse grids to the truncation error of the discretization has been found effective and robust. With second-order upwinding on all grid levels, a 5-level 320× 80 step flow solution was obtained in 20 V cycles, which corresponds to a smoothing rate of 0.7, and required 25 s on a 32-node CM-5. Overall, the convergence rates obtained in the present work are comparable to the most competitive findings reported in the literature.
Iterative methods for elliptic finite element equations on general meshes
NASA Technical Reports Server (NTRS)
Nicolaides, R. A.; Choudhury, Shenaz
1986-01-01
Iterative methods for arbitrary mesh discretizations of elliptic partial differential equations are surveyed. The methods discussed are preconditioned conjugate gradients, algebraic multigrid, deflated conjugate gradients, an element-by-element techniques, and domain decomposition. Computational results are included.
A Cell-Centered Multigrid Algorithm for All Grid Sizes
NASA Technical Reports Server (NTRS)
Gjesdal, Thor
1996-01-01
Multigrid methods are optimal; that is, their rate of convergence is independent of the number of grid points, because they use a nested sequence of coarse grids to represent different scales of the solution. This nesting does, however, usually lead to certain restrictions of the permissible size of the discretised problem. In cases where the modeler is free to specify the whole problem, such constraints are of little importance because they can be taken into consideration from the outset. We consider the situation in which there are other competing constraints on the resolution. These restrictions may stem from the physical problem (e.g., if the discretised operator contains experimental data measured on a fixed grid) or from the need to avoid limitations set by the hardware. In this paper we discuss a modification to the cell-centered multigrid algorithm, so that it can be used br problems with any resolution. We discuss in particular a coarsening strategy and choice of intergrid transfer operators that can handle grids with both an even or odd number of cells. The method is described and applied to linear equations obtained by discretization of two- and three-dimensional second-order elliptic PDEs.
Mehle, Andraž; Kitak, Domen; Podrekar, Gregor; Likar, Boštjan; Tomaževič, Dejan
2018-05-09
Agglomeration of pellets in fluidized bed coating processes is an undesirable phenomenon that affects the yield and quality of the product. In scope of PAT guidance, we present a system that utilizes visual imaging for in-line monitoring of the agglomeration degree. Seven pilot-scale Wurster coating processes were executed under various process conditions, providing a wide spectrum of process outcomes. Images of pellets were acquired during the coating processes in a contactless manner through an observation window of the coating apparatus. Efficient image analysis methods were developed for automatic recognition of discrete pellets and agglomerates in the acquired images. In-line obtained agglomeration degree trends revealed the agglomeration dynamics in distinct phases of the coating processes. We compared the in-line estimated agglomeration degree in the end point of each process to the results obtained by the off-line sieve analysis reference method. A strong positive correlation was obtained (coefficient of determination R 2 =0.99), confirming the feasibility of the approach. The in-line estimated agglomeration degree enables early detection of agglomeration and provides means for timely interventions to retain it in an acceptable range. Copyright © 2018 Elsevier B.V. All rights reserved.
NASA Technical Reports Server (NTRS)
1981-01-01
Developments in numerical solution of certain types of partial differential equations by rapidly converging sequences of operations on supporting grids that range from very fine to very coarse are presented.
Fast multigrid-based computation of the induced electric field for transcranial magnetic stimulation
NASA Astrophysics Data System (ADS)
Laakso, Ilkka; Hirata, Akimasa
2012-12-01
In transcranial magnetic stimulation (TMS), the distribution of the induced electric field, and the affected brain areas, depends on the position of the stimulation coil and the individual geometry of the head and brain. The distribution of the induced electric field in realistic anatomies can be modelled using computational methods. However, existing computational methods for accurately determining the induced electric field in realistic anatomical models have suffered from long computation times, typically in the range of tens of minutes or longer. This paper presents a matrix-free implementation of the finite-element method with a geometric multigrid method that can potentially reduce the computation time to several seconds or less even when using an ordinary computer. The performance of the method is studied by computing the induced electric field in two anatomically realistic models. An idealized two-loop coil is used as the stimulating coil. Multiple computational grid resolutions ranging from 2 to 0.25 mm are used. The results show that, for macroscopic modelling of the electric field in an anatomically realistic model, computational grid resolutions of 1 mm or 2 mm appear to provide good numerical accuracy compared to higher resolutions. The multigrid iteration typically converges in less than ten iterations independent of the grid resolution. Even without parallelization, each iteration takes about 1.0 s or 0.1 s for the 1 and 2 mm resolutions, respectively. This suggests that calculating the electric field with sufficient accuracy in real time is feasible.
Is the Multigrid Method Fault Tolerant? The Two-Grid Case
DOE Office of Scientific and Technical Information (OSTI.GOV)
Ainsworth, Mark; Glusa, Christian
2016-06-30
The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault occurring, a decision has to be made as to what remedial action should be taken in order to resume the execution of the algorithm. The action that is chosen can have a dramatic effect on the performance and characteristics of the scheme. Ideally, the resulting algorithm should be subjected to the same kind of mathematical analysis that was applied to the original, deterministic variant.more » The purpose of this work is to provide an analysis of the behaviour of the multigrid algorithm in the presence of faults. Multigrid is arguably the method of choice for the solution of large-scale linear algebra problems arising from discretization of partial differential equations and it is of considerable importance to anticipate its behaviour on an exascale machine. The analysis of resilience of algorithms is in its infancy and the current work is perhaps the first to provide a mathematical model for faults and analyse the behaviour of a state-of-the-art algorithm under the model. It is shown that the Two Grid Method fails to be resilient to faults. Attention is then turned to identifying the minimal necessary remedial action required to restore the rate of convergence to that enjoyed by the ideal fault-free method.« less
Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Zheng, Bin; Chen, Luoping; Hu, Xiaozhe
2016-03-05
In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigatemore » the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.« less
NASA Technical Reports Server (NTRS)
Cain, Michael D.
1999-01-01
The goal of this thesis is to develop an efficient and robust locally preconditioned semi-coarsening multigrid algorithm for the two-dimensional Navier-Stokes equations. This thesis examines the performance of the multigrid algorithm with local preconditioning for an upwind-discretization of the Navier-Stokes equations. A block Jacobi iterative scheme is used because of its high frequency error mode damping ability. At low Mach numbers, the performance of a flux preconditioner is investigated. The flux preconditioner utilizes a new limiting technique based on local information that was developed by Siu. Full-coarsening and-semi-coarsening are examined as well as the multigrid V-cycle and full multigrid. The numerical tests were performed on a NACA 0012 airfoil at a range of Mach numbers. The tests show that semi-coarsening with flux preconditioning is the most efficient and robust combination of coarsening strategy, and iterative scheme - especially at low Mach numbers.
NASA Astrophysics Data System (ADS)
Rasthofer, U.; Wall, W. A.; Gravemeier, V.
2018-04-01
A novel and comprehensive computational method, referred to as the eXtended Algebraic Variational Multiscale-Multigrid-Multifractal Method (XAVM4), is proposed for large-eddy simulation of the particularly challenging problem of turbulent two-phase flow. The XAVM4 involves multifractal subgrid-scale modeling as well as a Nitsche-type extended finite element method as an approach for two-phase flow. The application of an advanced structural subgrid-scale modeling approach in conjunction with a sharp representation of the discontinuities at the interface between two bulk fluids promise high-fidelity large-eddy simulation of turbulent two-phase flow. The high potential of the XAVM4 is demonstrated for large-eddy simulation of turbulent two-phase bubbly channel flow, that is, turbulent channel flow carrying a single large bubble of the size of the channel half-width in this particular application.
Method for encapsulating hazardous wastes using a staged mold
Unger, Samuel L.; Telles, Rodney W.; Lubowitz, Hyman R.
1989-01-01
A staged mold and method for stabilizing hazardous wastes for final disposal by molding an agglomerate of the hazardous wastes and encapsulating the agglomerate. Three stages are employed in the process. In the first stage, a first mold body is positioned on a first mold base, a mixture of the hazardous wastes and a thermosetting plastic is loaded into the mold, the mixture is mechanically compressed, heat is applied to cure the mixture to form a rigid agglomerate, and the first mold body is removed leaving the agglomerate sitting on the first mold base. In the second stage, a clamshell second mold body is positioned around the agglomerate and the first mold base, a powdered thermoplastic resin is poured on top of the agglomerate and in the gap between the sides of the agglomerate and the second mold body, the thermoplastic is compressed, heat is applied to melt the thermoplastic, and the plastic is cooled jacketing the agglomerate on the top and sides. In the third stage, the mold with the jacketed agglomerate is inverted, the first mold base is removed exposing the former bottom of the agglomerate, powdered thermoplastic is poured over the former bottom, the first mold base is replaced to compress the thermoplastic, heat is applied to melt the new thermoplastic and the top part of the jacket on the sides, the plastic is cooled jacketing the bottom and fusing with the jacketing on the sides to complete the seamless encapsulation of the agglomerate.
NASA Technical Reports Server (NTRS)
Duncan, Comer; Jones, Jim
1993-01-01
A key ingredient in the simulation of self-gravitating astrophysical fluid dynamical systems is the gravitational potential and its gradient. This paper focuses on the development of a mixed method multigrid solver of the Poisson equation formulated so that both the potential and the Cartesian components of its gradient are self-consistently and accurately generated. The method achieves this goal by formulating the problem as a system of four equations for the gravitational potential and the three Cartesian components of the gradient and solves them using a distributed relaxation technique combined with conventional full multigrid V-cycles. The method is described, some tests are presented, and the accuracy of the method is assessed. We also describe how the method has been incorporated into our three-dimensional hydrodynamics code and give an example of an application to the collision of two stars. We end with some remarks about the future developments of the method and some of the applications in which it will be used in astrophysics.
Array-based Hierarchical Mesh Generation in Parallel
Ray, Navamita; Grindeanu, Iulian; Zhao, Xinglin; ...
2015-11-03
In this paper, we describe an array-based hierarchical mesh generation capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial mesh that can be used for a number of purposes such as multi-level methods to generating large meshes. The capability is developed under the parallel mesh framework “Mesh Oriented dAtaBase” a.k.a MOAB. We describe the underlying data structures and algorithms to generate such hierarchies and present numerical results for computational efficiency and mesh quality. Inmore » conclusion, we also present results to demonstrate the applicability of the developed capability to a multigrid finite-element solver.« less
Advantages of multigrid methods for certifying the accuracy of PDE modeling
NASA Technical Reports Server (NTRS)
Forester, C. K.
1981-01-01
Numerical techniques for assessing and certifying the accuracy of the modeling of partial differential equations (PDE) to the user's specifications are analyzed. Examples of the certification process with conventional techniques are summarized for the three dimensional steady state full potential and the two dimensional steady Navier-Stokes equations using fixed grid methods (FG). The advantages of the Full Approximation Storage (FAS) scheme of the multigrid technique of A. Brandt compared with the conventional certification process of modeling PDE are illustrated in one dimension with the transformed potential equation. Inferences are drawn for how MG will improve the certification process of the numerical modeling of two and three dimensional PDE systems. Elements of the error assessment process that are common to FG and MG are analyzed.
Layer-oriented multigrid wavefront reconstruction algorithms for multi-conjugate adaptive optics
NASA Astrophysics Data System (ADS)
Gilles, Luc; Ellerbroek, Brent L.; Vogel, Curtis R.
2003-02-01
Multi-conjugate adaptive optics (MCAO) systems with 104-105 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of AO degrees of freedom. In this paper, we develop an iterative sparse matrix implementation of minimum variance wavefront reconstruction for telescope diameters up to 32m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method, using a multigrid preconditioner incorporating a layer-oriented (block) symmetric Gauss-Seidel iterative smoothing operator. We present open-loop numerical simulation results to illustrate algorithm convergence.
Textbook Multigrid Efficiency for Leading Edge Stagnation
NASA Technical Reports Server (NTRS)
Diskin, Boris; Thomas, James L.; Mineck, Raymond E.
2004-01-01
A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading-edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (FAS) cycle per grid. Asymptotic convergence rates of the FAS cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.
Textbook Multigrid Efficiency for Leading Edge Stagnation
NASA Technical Reports Server (NTRS)
Diskin, Boris; Thomas, James L.; Mineck, Raymond E.
2004-01-01
A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading- edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (F.4S) cycle per grid. Asymptotic convergence rates of the F.4S cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.
Layout optimization with algebraic multigrid methods
NASA Technical Reports Server (NTRS)
Regler, Hans; Ruede, Ulrich
1993-01-01
Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.
One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control
NASA Technical Reports Server (NTRS)
Taasan, Shlomo
1991-01-01
The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.
Scalable Parallel Computation for Extended MHD Modeling of Fusion Plasmas
NASA Astrophysics Data System (ADS)
Glasser, Alan H.
2008-11-01
Parallel solution of a linear system is scalable if simultaneously doubling the number of dependent variables and the number of processors results in little or no increase in the computation time to solution. Two approaches have this property for parabolic systems: multigrid and domain decomposition. Since extended MHD is primarily a hyperbolic rather than a parabolic system, additional steps must be taken to parabolize the linear system to be solved by such a method. Such physics-based preconditioning (PBP) methods have been pioneered by Chac'on, using finite volumes for spatial discretization, multigrid for solution of the preconditioning equations, and matrix-free Newton-Krylov methods for the accurate solution of the full nonlinear preconditioned equations. The work described here is an extension of these methods using high-order spectral element methods and FETI-DP domain decomposition. Application of PBP to a flux-source representation of the physics equations is discussed. The resulting scalability will be demonstrated for simple wave and for ideal and Hall MHD waves.
NASA Astrophysics Data System (ADS)
Coco, Armando; Russo, Giovanni
2018-05-01
In this paper we propose a second-order accurate numerical method to solve elliptic problems with discontinuous coefficients (with general non-homogeneous jumps in the solution and its gradient) in 2D and 3D. The method consists of a finite-difference method on a Cartesian grid in which complex geometries (boundaries and interfaces) are embedded, and is second order accurate in the solution and the gradient itself. In order to avoid the drop in accuracy caused by the discontinuity of the coefficients across the interface, two numerical values are assigned on grid points that are close to the interface: a real value, that represents the numerical solution on that grid point, and a ghost value, that represents the numerical solution extrapolated from the other side of the interface, obtained by enforcing the assigned non-homogeneous jump conditions on the solution and its flux. The method is also extended to the case of matrix coefficient. The linear system arising from the discretization is solved by an efficient multigrid approach. Unlike the 1D case, grid points are not necessarily aligned with the normal derivative and therefore suitable stencils must be chosen to discretize interface conditions in order to achieve second order accuracy in the solution and its gradient. A proper treatment of the interface conditions will allow the multigrid to attain the optimal convergence factor, comparable with the one obtained by Local Fourier Analysis for rectangular domains. The method is robust enough to handle large jump in the coefficients: order of accuracy, monotonicity of the errors and good convergence factor are maintained by the scheme.
NASA Astrophysics Data System (ADS)
Jux, Maximilian; Finke, Benedikt; Mahrholz, Thorsten; Sinapius, Michael; Kwade, Arno; Schilde, Carsten
2017-04-01
Several epoxy Al(OH)O (boehmite) dispersions in an epoxy resin are produced in a kneader to study the mechanistic correlation between the nanoparticle size and mechanical properties of the prepared nanocomposites. The agglomerate size is set by a targeted variation in solid content and temperature during dispersion, resulting in a different level of stress intensity and thus a different final agglomerate size during the process. The suspension viscosity was used for the estimation of stress energy in laminar shear flow. Agglomerate size measurements are executed via dynamic light scattering to ensure the quality of the produced dispersions. Furthermore, various nanocomposite samples are prepared for three-point bending, tension, and fracture toughness tests. The screening of the size effect is executed with at least seven samples per agglomerate size and test method. The variation of solid content is found to be a reliable method to adjust the agglomerate size between 138-354 nm during dispersion. The size effect on the Young's modulus and the critical stress intensity is only marginal. Nevertheless, there is a statistically relevant trend showing a linear increase with a decrease in agglomerate size. In contrast, the size effect is more dominant to the sample's strain and stress at failure. Unlike microscaled agglomerates or particles, which lead to embrittlement of the composite material, nanoscaled agglomerates or particles cause the composite elongation to be nearly of the same level as the base material. The observed effect is valid for agglomerate sizes between 138-354 nm and a particle mass fraction of 10 wt%.
A cell-vertex multigrid method for the Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Radespiel, R.
1989-01-01
A cell-vertex scheme for the Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing, a multigrid method, and carefully controlled artificial dissipative terms, very good convergence rates are obtained for a wide range of two- and three-dimensional flows over airfoils and wings. The accuracy of the code is examined by grid refinement studies and comparison with experimental data. For an accurate prediction of turbulent flows with strong separations, a modified version of the nonequilibrium turbulence model of Johnson and King is introduced, which is well suited for an implementation into three-dimensional Navier-Stokes codes. It is shown that the solutions for three-dimensional flows with strong separations can be dramatically improved, when a nonequilibrium model of turbulence is used.
Multigrid one shot methods for optimal control problems: Infinite dimensional control
NASA Technical Reports Server (NTRS)
Arian, Eyal; Taasan, Shlomo
1994-01-01
The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.
An O(Nm(sup 2)) Plane Solver for the Compressible Navier-Stokes Equations
NASA Technical Reports Server (NTRS)
Thomas, J. L.; Bonhaus, D. L.; Anderson, W. K.; Rumsey, C. L.; Biedron, R. T.
1999-01-01
A hierarchical multigrid algorithm for efficient steady solutions to the two-dimensional compressible Navier-Stokes equations is developed and demonstrated. The algorithm applies multigrid in two ways: a Full Approximation Scheme (FAS) for a nonlinear residual equation and a Correction Scheme (CS) for a linearized defect correction implicit equation. Multigrid analyses which include the effect of boundary conditions in one direction are used to estimate the convergence rate of the algorithm for a model convection equation. Three alternating-line- implicit algorithms are compared in terms of efficiency. The analyses indicate that full multigrid efficiency is not attained in the general case; the number of cycles to attain convergence is dependent on the mesh density for high-frequency cross-stream variations. However, the dependence is reasonably small and fast convergence is eventually attained for any given frequency with either the FAS or the CS scheme alone. The paper summarizes numerical computations for which convergence has been attained to within truncation error in a few multigrid cycles for both inviscid and viscous ow simulations on highly stretched meshes.
Multigrid calculation of three-dimensional viscous cascade flows
NASA Technical Reports Server (NTRS)
Arnone, A.; Liou, M.-S.; Povinelli, L. A.
1991-01-01
A 3-D code for viscous cascade flow prediction was developed. The space discretization uses a cell-centered scheme with eigenvalue scaling to weigh the artificial dissipation terms. Computational efficiency of a four stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full multigrid method. The Baldwin-Lomax eddy viscosity model is used for turbulence closure. A zonal, nonperiodic grid is used to minimize mesh distortion in and downstream of the throat region. Applications are presented for an annular vane with and without end wall contouring, and for a large scale linear cascade. The calculation is validated by comparing with experiments and by studying grid dependency.
Multigrid calculation of three-dimensional viscous cascade flows
NASA Technical Reports Server (NTRS)
Arnone, A.; Liou, M.-S.; Povinelli, L. A.
1991-01-01
A three-dimensional code for viscous cascade flow prediction has been developed. The space discretization uses a cell-centered scheme with eigenvalue scaling to weigh the artificial dissipation terms. Computational efficiency of a four-stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full-multigrid method. The Baldwin-Lomax eddy-viscosity model is used for turbulence closure. A zonal, nonperiodic grid is used to minimize mesh distortion in and downstream of the throat region. Applications are presented for an annular vane with and without end wall contouring, and for a large-scale linear cascade. The calculation is validated by comparing with experiments and by studying grid dependency.
NASA Astrophysics Data System (ADS)
Al-Chalabi, Rifat M. Khalil
1997-09-01
Development of an improvement to the computational efficiency of the existing nested iterative solution strategy of the Nodal Exapansion Method (NEM) nodal based neutron diffusion code NESTLE is presented. The improvement in the solution strategy is the result of developing a multilevel acceleration scheme that does not suffer from the numerical stalling associated with a number of iterative solution methods. The acceleration scheme is based on the multigrid method, which is specifically adapted for incorporation into the NEM nonlinear iterative strategy. This scheme optimizes the computational interplay between the spatial discretization and the NEM nonlinear iterative solution process through the use of the multigrid method. The combination of the NEM nodal method, calculation of the homogenized, neutron nodal balance coefficients (i.e. restriction operator), efficient underlying smoothing algorithm (power method of NESTLE), and the finer mesh reconstruction algorithm (i.e. prolongation operator), all operating on a sequence of coarser spatial nodes, constitutes the multilevel acceleration scheme employed in this research. Two implementations of the multigrid method into the NESTLE code were examined; the Imbedded NEM Strategy and the Imbedded CMFD Strategy. The main difference in implementation between the two methods is that in the Imbedded NEM Strategy, the NEM solution is required at every MG level. Numerical tests have shown that the Imbedded NEM Strategy suffers from divergence at coarse- grid levels, hence all the results for the different benchmarks presented here were obtained using the Imbedded CMFD Strategy. The novelties in the developed MG method are as follows: the formulation of the restriction and prolongation operators, and the selection of the relaxation method. The restriction operator utilizes a variation of the reactor physics, consistent homogenization technique. The prolongation operator is based upon a variant of the pin power reconstruction methodology. The relaxation method, which is the power method, utilizes a constant coefficient matrix within the NEM non-linear iterative strategy. The choice of the MG nesting within the nested iterative strategy enables the incorporation of other non-linear effects with no additional coding effort. In addition, if an eigenvalue problem is being solved, it remains an eigenvalue problem at all grid levels, simplifying coding implementation. The merit of the developed MG method was tested by incorporating it into the NESTLE iterative solver, and employing it to solve four different benchmark problems. In addition to the base cases, three different sensitivity studies are performed, examining the effects of number of MG levels, homogenized coupling coefficients correction (i.e. restriction operator), and fine-mesh reconstruction algorithm (i.e. prolongation operator). The multilevel acceleration scheme developed in this research provides the foundation for developing adaptive multilevel acceleration methods for steady-state and transient NEM nodal neutron diffusion equations. (Abstract shortened by UMI.)
Multigrid-based reconstruction algorithm for quantitative photoacoustic tomography
Li, Shengfu; Montcel, Bruno; Yuan, Zhen; Liu, Wanyu; Vray, Didier
2015-01-01
This paper proposes a multigrid inversion framework for quantitative photoacoustic tomography reconstruction. The forward model of optical fluence distribution and the inverse problem are solved at multiple resolutions. A fixed-point iteration scheme is formulated for each resolution and used as a cost function. The simulated and experimental results for quantitative photoacoustic tomography reconstruction show that the proposed multigrid inversion can dramatically reduce the required number of iterations for the optimization process without loss of reliability in the results. PMID:26203371
Multigrid solution of internal flows using unstructured solution adaptive meshes
NASA Technical Reports Server (NTRS)
Smith, Wayne A.; Blake, Kenneth R.
1992-01-01
This is the final report of the NASA Lewis SBIR Phase 2 Contract Number NAS3-25785, Multigrid Solution of Internal Flows Using Unstructured Solution Adaptive Meshes. The objective of this project, as described in the Statement of Work, is to develop and deliver to NASA a general three-dimensional Navier-Stokes code using unstructured solution-adaptive meshes for accuracy and multigrid techniques for convergence acceleration. The code will primarily be applied, but not necessarily limited, to high speed internal flows in turbomachinery.
Fast solution of elliptic partial differential equations using linear combinations of plane waves.
Pérez-Jordá, José M
2016-02-01
Given an arbitrary elliptic partial differential equation (PDE), a procedure for obtaining its solution is proposed based on the method of Ritz: the solution is written as a linear combination of plane waves and the coefficients are obtained by variational minimization. The PDE to be solved is cast as a system of linear equations Ax=b, where the matrix A is not sparse, which prevents the straightforward application of standard iterative methods in order to solve it. This sparseness problem can be circumvented by means of a recursive bisection approach based on the fast Fourier transform, which makes it possible to implement fast versions of some stationary iterative methods (such as Gauss-Seidel) consuming O(NlogN) memory and executing an iteration in O(Nlog(2)N) time, N being the number of plane waves used. In a similar way, fast versions of Krylov subspace methods and multigrid methods can also be implemented. These procedures are tested on Poisson's equation expressed in adaptive coordinates. It is found that the best results are obtained with the GMRES method using a multigrid preconditioner with Gauss-Seidel relaxation steps.
Magnetic agglomeration method for size control in the synthesis of magnetic nanoparticles
Huber, Dale L [Albuquerque, NM
2011-07-05
A method for controlling the size of chemically synthesized magnetic nanoparticles that employs magnetic interaction between particles to control particle size and does not rely on conventional kinetic control of the reaction to control particle size. The particles are caused to reversibly agglomerate and precipitate from solution; the size at which this occurs can be well controlled to provide a very narrow particle size distribution. The size of particles is controllable by the size of the surfactant employed in the process; controlling the size of the surfactant allows magnetic control of the agglomeration and precipitation processes. Agglomeration is used to effectively stop particle growth to provide a very narrow range of particle sizes.
Unified gas-kinetic scheme with multigrid convergence for rarefied flow study
NASA Astrophysics Data System (ADS)
Zhu, Yajun; Zhong, Chengwen; Xu, Kun
2017-09-01
The unified gas kinetic scheme (UGKS) is based on direct modeling of gas dynamics on the mesh size and time step scales. With the modeling of particle transport and collision in a time-dependent flux function in a finite volume framework, the UGKS can connect the flow physics smoothly from the kinetic particle transport to the hydrodynamic wave propagation. In comparison with the direct simulation Monte Carlo (DSMC) method, the current equation-based UGKS can implement implicit techniques in the updates of macroscopic conservative variables and microscopic distribution functions. The implicit UGKS significantly increases the convergence speed for steady flow computations, especially in the highly rarefied and near continuum regimes. In order to further improve the computational efficiency, for the first time, a geometric multigrid technique is introduced into the implicit UGKS, where the prediction step for the equilibrium state and the evolution step for the distribution function are both treated with multigrid acceleration. More specifically, a full approximate nonlinear system is employed in the prediction step for fast evaluation of the equilibrium state, and a correction linear equation is solved in the evolution step for the update of the gas distribution function. As a result, convergent speed has been greatly improved in all flow regimes from rarefied to the continuum ones. The multigrid implicit UGKS (MIUGKS) is used in the non-equilibrium flow study, which includes microflow, such as lid-driven cavity flow and the flow passing through a finite-length flat plate, and high speed one, such as supersonic flow over a square cylinder. The MIUGKS shows 5-9 times efficiency increase over the previous implicit scheme. For the low speed microflow, the efficiency of MIUGKS is several orders of magnitude higher than the DSMC. Even for the hypersonic flow at Mach number 5 and Knudsen number 0.1, the MIUGKS is still more than 100 times faster than the DSMC method for obtaining a convergent steady state solution.
Efficient Implementation of Multigrid Solvers on Message-Passing Parrallel Systems
NASA Technical Reports Server (NTRS)
Lou, John
1994-01-01
We discuss our implementation strategies for finite difference multigrid partial differential equation (PDE) solvers on message-passing systems. Our target parallel architecture is Intel parallel computers: the Delta and Paragon system.
Multistage Schemes with Multigrid for Euler and Navier-Strokes Equations: Components and Analysis
NASA Technical Reports Server (NTRS)
Swanson, R. C.; Turkel, Eli
1997-01-01
A class of explicit multistage time-stepping schemes with centered spatial differencing and multigrids are considered for the compressible Euler and Navier-Stokes equations. These schemes are the basis for a family of computer programs (flow codes with multigrid (FLOMG) series) currently used to solve a wide range of fluid dynamics problems, including internal and external flows. In this paper, the components of these multistage time-stepping schemes are defined, discussed, and in many cases analyzed to provide additional insight into their behavior. Special emphasis is given to numerical dissipation, stability of Runge-Kutta schemes, and the convergence acceleration techniques of multigrid and implicit residual smoothing. Both the Baldwin and Lomax algebraic equilibrium model and the Johnson and King one-half equation nonequilibrium model are used to establish turbulence closure. Implementation of these models is described.
Communication — Modeling polymer-electrolyte fuel-cell agglomerates with double-trap kinetics
Pant, Lalit M.; Weber, Adam Z.
2017-04-14
A new semi-analytical agglomerate model is presented for polymer-electrolyte fuel-cell cathodes. The model uses double-trap kinetics for the oxygen-reduction reaction, which can capture the observed potential-dependent coverage and Tafel-slope changes. An iterative semi-analytical approach is used to obtain reaction rate constants from the double-trap kinetics, oxygen concentration at the agglomerate surface, and overall agglomerate reaction rate. The analytical method can predict reaction rates within 2% of the numerically simulated values for a wide range of oxygen concentrations, overpotentials, and agglomerate sizes, while saving simulation time compared to a fully numerical approach.
Novel Binders and Methods for Agglomeration of Ore
DOE Office of Scientific and Technical Information (OSTI.GOV)
S. K. Kawatra; T. C. Eisele; K. A. Lewandowski
2006-09-30
Heap leaching is one of the methods being used to recover metal from low grade ore deposits. The main problem faced during heap leaching is the migration of fine grained particles through the heap, forming impermeable beds which result in poor solution flow. The poor solution flow leads to less contact between the leach solution and the ore, resulting in low recovery rates. Agglomeration of ore into coarse, porous masses prevents fine particles from migrating and clogging the spaces and channels between the larger ore particles. Currently, there is one facility in the United States which uses agglomeration. This operationmore » agglomerates their ore using leach solution (raffinate), but is still experiencing undesirable metal recovery from the heaps due to agglomerate breakdown. The use of a binder, in addition to the leach solution, during agglomeration would help to produce stronger agglomerates that did not break down during processing. However, there are no known binders that will work satisfactorily in the acidic environment of a heap, at a reasonable cost. As a result, operators of many facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. Increasing copper recovery in heap leaching by the use of binders and agglomeration would result in a significant decrease in the amount of energy consumed. Assuming that 70% of all the leaching heaps would convert to using agglomeration technology, as much as 1.64*10{sup 12} BTU per year would be able to be saved if a 25% increase in copper recovery was experienced, which is equivalent to saving approximately 18% of the energy currently being used in leaching heaps. For every week a leach cycle was decreased, a savings of as much as 1.23*10{sup 11} BTU per week would result. This project has identified several acid-resistant binders and agglomeration procedures. These binders and experimental procedures will be able to be used for use in improving the energy efficiency of heap leaching.« less
Airfoil Design and Optimization by the One-Shot Method
NASA Technical Reports Server (NTRS)
Kuruvila, G.; Taasan, Shlomo; Salas, M. D.
1995-01-01
An efficient numerical approach for the design of optimal aerodynamic shapes is presented in this paper. The objective of any optimization problem is to find the optimum of a cost function subject to a certain state equation (governing equation of the flow field) and certain side constraints. As in classical optimal control methods, the present approach introduces a costate variable (Lagrange multiplier) to evaluate the gradient of the cost function. High efficiency in reaching the optimum solution is achieved by using a multigrid technique and updating the shape in a hierarchical manner such that smooth (low-frequency) changes are done separately from high-frequency changes. Thus, the design variables are changed on a grid where their changes produce nonsmooth (high-frequency) perturbations that can be damped efficiently by the multigrid. The cost of solving the optimization problem is approximately two to three times the cost of the equivalent analysis problem.
Airfoil optimization by the one-shot method
NASA Technical Reports Server (NTRS)
Kuruvila, G.; Taasan, Shlomo; Salas, M. D.
1994-01-01
An efficient numerical approach for the design of optimal aerodynamic shapes is presented in this paper. The objective of any optimization problem is to find the optimum of a cost function subject to a certain state equation (Governing equation of the flow field) and certain side constraints. As in classical optimal control methods, the present approach introduces a costate variable (Language multiplier) to evaluate the gradient of the cost function. High efficiency in reaching the optimum solution is achieved by using a multigrid technique and updating the shape in a hierarchical manner such that smooth (low-frequency) changes are done separately from high-frequency changes. Thus, the design variables are changed on a grid where their changes produce nonsmooth (high-frequency) perturbations that can be damped efficiently by the multigrid. The cost of solving the optimization problem is approximately two to three times the cost of the equivalent analysis problem.
Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes
NASA Technical Reports Server (NTRS)
Movriplis, Dimitri J.
1998-01-01
Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.
Phonon Calculations Using the Real-Space Multigrid Method (RMG)
NASA Astrophysics Data System (ADS)
Zhang, Jiayong; Lu, Wenchang; Briggs, Emil; Cheng, Yongqiang; Ramirez-Cuesta, A. J.; Bernholc, Jerry
RMG, a DFT-based open-source package using the real-space multigrid method, has proven to work effectively on large scale systems with thousands of atoms. Our recent work has shown its practicability for high accuracy phonon calculations employing the frozen phonon method. In this method, a primary unit cell with a small lattice constant is enlarged to a supercell that is sufficiently large to obtain the force constants matrix by finite displacements of atoms in the supercell. An open-source package PhonoPy is used to determine the necessary displacements by taking symmetry into account. A python script coupling RMG and PhonoPy enables us to perform high-throughput calculations of phonon properties. We have applied this method to many systems, such as silicon, silica glass, ZIF-8, etc. Results from RMG are compared to the experimental spectra measured using the VISION inelastic neutron scattering spectrometer at the Spallation Neutron Source at ORNL, as well as results from other DFT codes. The computing resources were made available through the VirtuES (Virtual Experiments in Spectroscopy) project, funded by Laboratory Directed Research and Development program (LDRD project No. 7739)
Kojima, A; Hanada, M; Tobari, H; Nishikiori, R; Hiratsuka, J; Kashiwagi, M; Umeda, N; Yoshida, M; Ichikawa, M; Watanabe, K; Yamano, Y; Grisham, L R
2016-02-01
Design techniques for the vacuum insulation have been developed in order to realize a reliable voltage holding capability of multi-aperture multi-grid (MAMuG) accelerators for fusion application. In this method, the nested multi-stage configuration of the MAMuG accelerator can be uniquely designed to satisfy the target voltage within given boundary conditions. The evaluation of the voltage holding capabilities of each acceleration stages was based on the previous experimental results about the area effect and the multi-aperture effect. Since the multi-grid effect was found to be the extension of the area effect by the total facing area this time, the total voltage holding capability of the multi-stage can be estimated from that per single stage by assuming the stage with the highest electric field, the total facing area, and the total apertures. By applying these consideration, the analysis on the 3-stage MAMuG accelerator for JT-60SA agreed well with the past gap-scan experiments with an accuracy of less than 10% variation, which demonstrated the high reliability to design MAMuG accelerators and also multi-stage high voltage bushings.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Kojima, A., E-mail: kojima.atsushi@jaea.go.jp; Hanada, M.; Tobari, H.
Design techniques for the vacuum insulation have been developed in order to realize a reliable voltage holding capability of multi-aperture multi-grid (MAMuG) accelerators for fusion application. In this method, the nested multi-stage configuration of the MAMuG accelerator can be uniquely designed to satisfy the target voltage within given boundary conditions. The evaluation of the voltage holding capabilities of each acceleration stages was based on the previous experimental results about the area effect and the multi-aperture effect. Since the multi-grid effect was found to be the extension of the area effect by the total facing area this time, the total voltagemore » holding capability of the multi-stage can be estimated from that per single stage by assuming the stage with the highest electric field, the total facing area, and the total apertures. By applying these consideration, the analysis on the 3-stage MAMuG accelerator for JT-60SA agreed well with the past gap-scan experiments with an accuracy of less than 10% variation, which demonstrated the high reliability to design MAMuG accelerators and also multi-stage high voltage bushings.« less
Operator induced multigrid algorithms using semirefinement
NASA Technical Reports Server (NTRS)
Decker, Naomi; Vanrosendale, John
1989-01-01
A variant of multigrid, based on zebra relaxation, and a new family of restriction/prolongation operators is described. Using zebra relaxation in combination with an operator-induced prolongation leads to fast convergence, since the coarse grid can correct all error components. The resulting algorithms are not only fast, but are also robust, in the sense that the convergence rate is insensitive to the mesh aspect ratio. This is true even though line relaxation is performed in only one direction. Multigrid becomes a direct method if an operator-induced prolongation is used, together with the induced coarse grid operators. Unfortunately, this approach leads to stencils which double in size on each coarser grid. The use of an implicit three point restriction can be used to factor these large stencils, in order to retain the usual five or nine point stencils, while still achieving fast convergence. This algorithm achieves a V-cycle convergence rate of 0.03 on Poisson's equation, using 1.5 zebra sweeps per level, while the convergence rate improves to 0.003 if optimal nine point stencils are used. Numerical results for two and three dimensional model problems are presented, together with a two level analysis explaining these results.
NASA Astrophysics Data System (ADS)
Furuichi, Mikito; Nishiura, Daisuke
2017-10-01
We developed dynamic load-balancing algorithms for Particle Simulation Methods (PSM) involving short-range interactions, such as Smoothed Particle Hydrodynamics (SPH), Moving Particle Semi-implicit method (MPS), and Discrete Element method (DEM). These are needed to handle billions of particles modeled in large distributed-memory computer systems. Our method utilizes flexible orthogonal domain decomposition, allowing the sub-domain boundaries in the column to be different for each row. The imbalances in the execution time between parallel logical processes are treated as a nonlinear residual. Load-balancing is achieved by minimizing the residual within the framework of an iterative nonlinear solver, combined with a multigrid technique in the local smoother. Our iterative method is suitable for adjusting the sub-domain frequently by monitoring the performance of each computational process because it is computationally cheaper in terms of communication and memory costs than non-iterative methods. Numerical tests demonstrated the ability of our approach to handle workload imbalances arising from a non-uniform particle distribution, differences in particle types, or heterogeneous computer architecture which was difficult with previously proposed methods. We analyzed the parallel efficiency and scalability of our method using Earth simulator and K-computer supercomputer systems.
Multigrid Approach to Incompressible Viscous Cavity Flows
NASA Technical Reports Server (NTRS)
Wood, William A.
1996-01-01
Two-dimensional incompressible viscous driven-cavity flows are computed for Reynolds numbers on the range 100-20,000 using a loosely coupled, implicit, second-order centrally-different scheme. Mesh sequencing and three-level V-cycle multigrid error smoothing are incorporated into the symmetric Gauss-Seidel time-integration algorithm. Parametrics on the numerical parameters are performed, achieving reductions in solution times by more than 60 percent with the full multigrid approach. Details of the circulation patterns are investigated in cavities of 2-to-1, 1-to-1, and 1-to-2 depth to width ratios.
An Upwind Multigrid Algorithm for Calculating Flows on Unstructured Grids
NASA Technical Reports Server (NTRS)
Bonhaus, Daryl L.
1993-01-01
An algorithm is described that calculates inviscid, laminar, and turbulent flows on triangular meshes with an upwind discretization. A brief description of the base solver and the multigrid implementation is given, followed by results that consist mainly of convergence rates for inviscid and viscous flows over a NACA four-digit airfoil section. The results show that multigrid does accelerate convergence when the same relaxation parameters that yield good single-grid performance are used; however, larger gains in performance can be realized by doing less work in the relaxation scheme.
A Note on Multigrid Theory for Non-nested Grids and/or Quadrature
NASA Technical Reports Server (NTRS)
Douglas, C. C.; Douglas, J., Jr.; Fyfe, D. E.
1996-01-01
We provide a unified theory for multilevel and multigrid methods when the usual assumptions are not present. For example, we do not assume that the solution spaces or the grids are nested. Further, we do not assume that there is an algebraic relationship between the linear algebra problems on different levels. What we provide is a computationally useful theory for adaptively changing levels. Theory is provided for multilevel correction schemes, nested iteration schemes, and one way (i.e., coarse to fine grid with no correction iterations) schemes. We include examples showing the applicability of this theory: finite element examples using quadrature in the matrix assembly and finite volume examples with non-nested grids. Our theory applies directly to other discretizations as well.
Multigrid methods for differential equations with highly oscillatory coefficients
NASA Technical Reports Server (NTRS)
Engquist, Bjorn; Luo, Erding
1993-01-01
New coarse grid multigrid operators for problems with highly oscillatory coefficients are developed. These types of operators are necessary when the characters of the differential equations on coarser grids or longer wavelengths are different from that on the fine grid. Elliptic problems for composite materials and different classes of hyperbolic problems are practical examples. The new coarse grid operators can be constructed directly based on the homogenized differential operators or hierarchically computed from the finest grid. Convergence analysis based on the homogenization theory is given for elliptic problems with periodic coefficients and some hyperbolic problems. These are classes of equations for which there exists a fairly complete theory for the interaction between shorter and longer wavelengths in the problems. Numerical examples are presented.
Method of separating and de-watering fine particles
Yoon, Roe-Hoan
2016-12-13
A process for cleaning and dewatering hydrophobic particulate materials is presented. The process is performed in two steps: 1) agglomeration of the hydrophobic particles in a first hydrophobic liquid/aqueous mixture; followed by 2) dispersion of the agglomerates in a second hydrophobic liquid to release the water trapped within the agglomerates along with the entrained hydrophilic particles.
NASA Astrophysics Data System (ADS)
Matveev, A. D.
2016-11-01
To calculate the three-dimensional elastic body of heterogeneous structure under static loading, a method of multigrid finite element is provided, when implemented on the basis of algorithms of finite element method (FEM), using homogeneous and composite threedimensional multigrid finite elements (MFE). Peculiarities and differences of MFE from the currently available finite elements (FE) are to develop composite MFE (without increasing their dimensions), arbitrarily small basic partition of composite solids consisting of single-grid homogeneous FE of the first order can be used, i.e. in fact, to use micro approach in finite element form. These small partitions allow one to take into account in MFE, i.e. in the basic discrete models of composite solids, complex heterogeneous and microscopically inhomogeneous structure, shape, the complex nature of the loading and fixation and describe arbitrarily closely the stress and stain state by the equations of three-dimensional elastic theory without any additional simplifying hypotheses. When building the m grid FE, m of nested grids is used. The fine grid is generated by a basic partition of MFE, the other m —1 large grids are applied to reduce MFE dimensionality, when m is increased, MFE dimensionality becomes smaller. The procedures of developing MFE of rectangular parallelepiped, irregular shape, plate and beam types are given. MFE generate the small dimensional discrete models and numerical solutions with a high accuracy. An example of calculating the laminated plate, using three-dimensional 3-grid FE and the reference discrete model is given, with that having 2.2 milliards of FEM nodal unknowns.
Hollaus, K; Weiss, B; Magele, Ch; Hutten, H
2004-02-01
The acceleration of the solution of the quasi-static electric field problem considering anisotropic complex conductivity simulated by tetrahedral finite elements of first order is investigated by geometric multigrid.
Multigrid optimal mass transport for image registration and morphing
NASA Astrophysics Data System (ADS)
Rehman, Tauseef ur; Tannenbaum, Allen
2007-02-01
In this paper we present a computationally efficient Optimal Mass Transport algorithm. This method is based on the Monge-Kantorovich theory and is used for computing elastic registration and warping maps in image registration and morphing applications. This is a parameter free method which utilizes all of the grayscale data in an image pair in a symmetric fashion. No landmarks need to be specified for correspondence. In our work, we demonstrate significant improvement in computation time when our algorithm is applied as compared to the originally proposed method by Haker et al [1]. The original algorithm was based on a gradient descent method for removing the curl from an initial mass preserving map regarded as 2D vector field. This involves inverting the Laplacian in each iteration which is now computed using full multigrid technique resulting in an improvement in computational time by a factor of two. Greater improvement is achieved by decimating the curl in a multi-resolutional framework. The algorithm was applied to 2D short axis cardiac MRI images and brain MRI images for testing and comparison.
Development of a pressure based multigrid solution method for complex fluid flows
NASA Technical Reports Server (NTRS)
Shyy, Wei
1991-01-01
In order to reduce the computational difficulty associated with a single grid (SG) solution procedure, the multigrid (MG) technique was identified as a useful means for improving the convergence rate of iterative methods. A full MG full approximation storage (FMG/FAS) algorithm is used to solve the incompressible recirculating flow problems in complex geometries. The algorithm is implemented in conjunction with a pressure correction staggered grid type of technique using the curvilinear coordinates. In order to show the performance of the method, two flow configurations, one a square cavity and the other a channel, are used as test problems. Comparisons are made between the iterations, equivalent work units, and CPU time. Besides showing that the MG method can yield substantial speed-up with wide variations in Reynolds number, grid distributions, and geometry, issues such as the convergence characteristics of different grid levels, the choice of convection schemes, and the effectiveness of the basic iteration smoothers are studied. An adaptive grid scheme is also combined with the MG procedure to explore the effects of grid resolution on the MG convergence rate as well as the numerical accuracy.
Finite volume multigrid method of the planar contraction flow of a viscoelastic fluid
NASA Astrophysics Data System (ADS)
Moatssime, H. Al; Esselaoui, D.; Hakim, A.; Raghay, S.
2001-08-01
This paper reports on a numerical algorithm for the steady flow of viscoelastic fluid. The conservative and constitutive equations are solved using the finite volume method (FVM) with a hybrid scheme for the velocities and first-order upwind approximation for the viscoelastic stress. A non-uniform staggered grid system is used. The iterative SIMPLE algorithm is employed to relax the coupled momentum and continuity equations. The non-linear algebraic equations over the flow domain are solved iteratively by the symmetrical coupled Gauss-Seidel (SCGS) method. In both, the full approximation storage (FAS) multigrid algorithm is used. An Oldroyd-B fluid model was selected for the calculation. Results are reported for planar 4:1 abrupt contraction at various Weissenberg numbers. The solutions are found to be stable and smooth. The solutions show that at high Weissenberg number the domain must be long enough. The convergence of the method has been verified with grid refinement. All the calculations have been performed on a PC equipped with a Pentium III processor at 550 MHz. Copyright
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Berger, M. J.; Murman, S. M.; Kwak, Dochan (Technical Monitor)
2002-01-01
The proposed paper will present recent extensions in the development of an efficient Euler solver for adaptively-refined Cartesian meshes with embedded boundaries. The paper will focus on extensions of the basic method to include solution adaptation, time-dependent flow simulation, and arbitrary rigid domain motion. The parallel multilevel method makes use of on-the-fly parallel domain decomposition to achieve extremely good scalability on large numbers of processors, and is coupled with an automatic coarse mesh generation algorithm for efficient processing by a multigrid smoother. Numerical results are presented demonstrating parallel speed-ups of up to 435 on 512 processors. Solution-based adaptation may be keyed off truncation error estimates using tau-extrapolation or a variety of feature detection based refinement parameters. The multigrid method is extended to for time-dependent flows through the use of a dual-time approach. The extension to rigid domain motion uses an Arbitrary Lagrangian-Eulerlarian (ALE) formulation, and results will be presented for a variety of two- and three-dimensional example problems with both simple and complex geometry.
MULTIGRID FOR THE MORTAR FINITE ELEMENT METHOD. (R825207)
The perspectives, information and conclusions conveyed in research project abstracts, progress reports, final reports, journal abstracts and journal publications convey the viewpoints of the principal investigator and may not represent the views and policies of ORD and EPA. Concl...
A model to estimate the size of nanoparticle agglomerates in gas-solid fluidized beds
NASA Astrophysics Data System (ADS)
de Martín, Lilian; van Ommen, J. Ruud
2013-11-01
The estimation of nanoparticle agglomerates' size in fluidized beds remains an open challenge, mainly due to the difficulty of characterizing the inter-agglomerate van der Waals force. The current approach is to describe micron-sized nanoparticle agglomerates as micron-sized particles with 0.1-0.2-μm asperities. This simplification does not capture the influence of the particle size on the van der Waals attraction between agglomerates. In this paper, we propose a new description where the agglomerates are micron-sized particles with nanoparticles on the surface, acting as asperities. As opposed to previous models, here the van der Waals force between agglomerates decreases with an increase in the particle size. We have also included an additional force due to the hydrogen bond formation between the surfaces of hydrophilic and dry nanoparticles. The average size of the fluidized agglomerates has been estimated equating the attractive force obtained from this method to the weight of the individual agglomerates. The results have been compared to 54 experimental values, most of them collected from the literature. Our model approximates without a systematic error the size of most of the nanopowders, both in conventional and centrifugal fluidized beds, outperforming current models. Although simple, the model is able to capture the influence of the nanoparticle size, particle density, and Hamaker coefficient on the inter-agglomerate forces.
Successfully use agglomeration for size enlargement
DOE Office of Scientific and Technical Information (OSTI.GOV)
Pietsch, W.
1996-04-01
The processing of fine and ultrafine particles by size enlargement finds an ever increasing application. At the same time, undesirable agglomeration such as buildup, caking, bridging, and uncontrolled aggregation of fine particles can occur during processing and handling of these particulate solids. This article will provide a survey of the phenomena of agglomeration and discuss the unit operation of size enlargement by agglomeration. This article is also an invitation, particularly to young engineers, to become interested in agglomeration. Considering that mechanical process technologies are requiring more energy every year than any other group of consumers and efficiencies are typically inmore » the single digits or teens at best, considerable rewards can be expected from the development of scientifically modified, more energy-efficient methods and equipment.« less
NASA Astrophysics Data System (ADS)
Ao, Wen; Liu, Xin; Rezaiguia, Hichem; Liu, Huan; Wang, Zhixin; Liu, Peijin
2017-07-01
The agglomeration of aluminum particles usually occurs on the burning surface of aluminized composite propellants. It leads to low propellant combustion efficiency and high two-phase flow losses. To reach a thorough understanding of aluminum agglomeration behaviors, agglomeration processes, and particles size distribution of Al/AP/RDX/GAP propellants were studied by using a cinephotomicrography experimental technique, under 5 MPa. Accumulation, aggregation, and agglomeration phenomena of aluminum particles have been inspected, as well as the flame asymmetry of burning agglomerates. Results reveals that the dependency of the mean and the maximum agglomeration diameter to the burning rate and the virgin aluminum size have the same trend. A second-time mergence of multiple agglomerates on the burning surface is unveiled. Two typical modes of second mergence are concluded, based upon vertical and level movement of agglomerates, respectively. The latter mode is found to be dominant and sometimes a combination of the two modes may occur. A new model of aluminum agglomeration on the burning surface of composite propellants is derived to predict the particulates size distribution with a low computational amount. The basic idea is inspired from the well-known pocket models. The pocket size of the region formed by adjacent AP particles is obtained through scanning electron microscopy of the propellant cross-section coupled to an image processing method. The second mergence mechanism, as well as the effect of the burning rate on the agglomeration processes, are included in the present model. The mergence of two agglomerates is prescribed to occur only if their separation distance is less than a critical value. The agglomerates size distribution resulting from this original model match reasonably with the experimental data. Moreover, the present model gives superior results for mean agglomeration diameter compared to common empirical and pocket models. The average prediction error is lower than 5% for the four propellants tested. Results of this study are expected to provide better insight and enrich in the theoretical frame of aluminum agglomeration.
NASA Technical Reports Server (NTRS)
Liu, Chao-Qun; Shan, H.; Jiang, L.
1999-01-01
Numerical investigation of flow separation over a NACA 0012 airfoil at large angles of attack has been carried out. The numerical calculation is performed by solving the full Navier-Stokes equations in generalized curvilinear coordinates. The second-order LU-SGS implicit scheme is applied for time integration. This scheme requires no tridiagonal inversion and is capable of being completely vectorized, provided the corresponding Jacobian matrices are properly selected. A fourth-order centered compact scheme is used for spatial derivatives. In order to reduce numerical oscillation, a sixth-order implicit filter is employed. Non-reflecting boundary conditions are imposed at the far-field and outlet boundaries to avoid possible non-physical wave reflection. Complex flow separation and vortex shedding phenomenon have been observed and discussed.
Electrostatic formation of liquid marbles and agglomerates
NASA Astrophysics Data System (ADS)
Liyanaarachchi, K. R.; Ireland, P. M.; Webber, G. B.; Galvin, K. P.
2013-07-01
We report observations of a sudden, explosive release of electrostatically charged 100 μm glass beads from a particle bed. These cross an air gap of several millimeters, are engulfed by an approaching pendant water drop, and form a metastable spherical agglomerate on the bed surface. The stability transition of the particle bed is explained by promotion of internal friction by in-plane electrostatic stresses. The novel agglomerates formed this way resemble the "liquid marbles" formed by coating a drop with hydrophobic particles. Complex multi-layered agglomerates may also be produced by this method, with potential industrial, pharmaceutical, environmental, and biological applications.
Advanced Multigrid Solvers for Fluid Dynamics
NASA Technical Reports Server (NTRS)
Brandt, Achi
1999-01-01
The main objective of this project has been to support the development of multigrid techniques in computational fluid dynamics that can achieve "textbook multigrid efficiency" (TME), which is several orders of magnitude faster than current industrial CFD solvers. Toward that goal we have assembled a detailed table which lists every foreseen kind of computational difficulty for achieving it, together with the possible ways for resolving the difficulty, their current state of development, and references. We have developed several codes to test and demonstrate, in the framework of simple model problems, several approaches for overcoming the most important of the listed difficulties that had not been resolved before. In particular, TME has been demonstrated for incompressible flows on one hand, and for near-sonic flows on the other hand. General approaches were advanced for the relaxation of stagnation points and boundary conditions under various situations. Also, new algebraic multigrid techniques were formed for treating unstructured grid formulations. More details on all these are given below.
Ku, Bon Ki; Evans, Douglas E
2012-04-01
For nanoparticles with nonspherical morphologies, e.g., open agglomerates or fibrous particles, it is expected that the actual density of agglomerates may be significantly different from the bulk material density. It is further expected that using the material density may upset the relationship between surface area and mass when a method for estimating aerosol surface area from number and mass concentrations (referred to as "Maynard's estimation method") is used. Therefore, it is necessary to quantitatively investigate how much the Maynard's estimation method depends on particle morphology and density. In this study, aerosol surface area estimated from number and mass concentration measurements was evaluated and compared with values from two reference methods: a method proposed by Lall and Friedlander for agglomerates and a mobility based method for compact nonspherical particles using well-defined polydisperse aerosols with known particle densities. Polydisperse silver aerosol particles were generated by an aerosol generation facility. Generated aerosols had a range of morphologies, count median diameters (CMD) between 25 and 50 nm, and geometric standard deviations (GSD) between 1.5 and 1.8. The surface area estimates from number and mass concentration measurements correlated well with the two reference values when gravimetric mass was used. The aerosol surface area estimates from the Maynard's estimation method were comparable to the reference method for all particle morphologies within the surface area ratios of 3.31 and 0.19 for assumed GSDs 1.5 and 1.8, respectively, when the bulk material density of silver was used. The difference between the Maynard's estimation method and surface area measured by the reference method for fractal-like agglomerates decreased from 79% to 23% when the measured effective particle density was used, while the difference for nearly spherical particles decreased from 30% to 24%. The results indicate that the use of particle density of agglomerates improves the accuracy of the Maynard's estimation method and that an effective density should be taken into account, when known, when estimating aerosol surface area of nonspherical aerosol such as open agglomerates and fibrous particles.
Solving Upwind-Biased Discretizations. 2; Multigrid Solver Using Semicoarsening
NASA Technical Reports Server (NTRS)
Diskin, Boris
1999-01-01
This paper studies a novel multigrid approach to the solution for a second order upwind biased discretization of the convection equation in two dimensions. This approach is based on semi-coarsening and well balanced explicit correction terms added to coarse-grid operators to maintain on coarse-grid the same cross-characteristic interaction as on the target (fine) grid. Colored relaxation schemes are used on all the levels allowing a very efficient parallel implementation. The results of the numerical tests can be summarized as follows: 1) The residual asymptotic convergence rate of the proposed V(0, 2) multigrid cycle is about 3 per cycle. This convergence rate far surpasses the theoretical limit (4/3) predicted for standard multigrid algorithms using full coarsening. The reported efficiency does not deteriorate with increasing the cycle, depth (number of levels) and/or refining the target-grid mesh spacing. 2) The full multi-grid algorithm (FMG) with two V(0, 2) cycles on the target grid and just one V(0, 2) cycle on all the coarse grids always provides an approximate solution with the algebraic error less than the discretization error. Estimates of the total work in the FMG algorithm are ranged between 18 and 30 minimal work units (depending on the target (discretizatioin). Thus, the overall efficiency of the FMG solver closely approaches (if does not achieve) the goal of the textbook multigrid efficiency. 3) A novel approach to deriving a discrete solution approximating the true continuous solution with a relative accuracy given in advance is developed. An adaptive multigrid algorithm (AMA) using comparison of the solutions on two successive target grids to estimate the accuracy of the current target-grid solution is defined. A desired relative accuracy is accepted as an input parameter. The final target grid on which this accuracy can be achieved is chosen automatically in the solution process. the actual relative accuracy of the discrete solution approximation obtained by AMA is always better than the required accuracy; the computational complexity of the AMA algorithm is (nearly) optimal (comparable with the complexity of the FMG algorithm applied to solve the problem on the optimally spaced target grid).
Acoustic agglomeration methods and apparatus
NASA Technical Reports Server (NTRS)
Barmatz, M. B. (Inventor)
1984-01-01
Methods are described for using acoustic energy to agglomerate fine particles on the order of one micron diameter that are suspended in gas, to provide agglomerates large enough for efficient removal by other techniques. The gas with suspended particles, is passed through the length of a chamber while acoustic energy at a resonant chamber mode is applied to set up one or more acoustic standing wave patterns that vibrate the suspended particles to bring them together so they agglomerate. Several widely different frequencies can be applied to efficiently vibrate particles of widely differing sizes. The standing wave pattern can be applied along directions transversed to the flow of the gas. The particles can be made to move in circles by applying acoustic energy in perpendicular directions with the energy in both directions being of the same wavelength but 90 deg out of phase.
pyro: Python-based tutorial for computational methods for hydrodynamics
NASA Astrophysics Data System (ADS)
Zingale, Michael
2015-07-01
pyro is a simple python-based tutorial on computational methods for hydrodynamics. It includes 2-d solvers for advection, compressible, incompressible, and low Mach number hydrodynamics, diffusion, and multigrid. It is written with ease of understanding in mind. An extensive set of notes that is part of the Open Astrophysics Bookshelf project provides details of the algorithms.
Continuous air agglomeration method for high carbon fly ash beneficiation
Gray, McMahon L.; Champagne, Kenneth J.; Finseth, Dennis H.
2000-01-01
The carbon and mineral components of fly ash are effectively separated by a continuous air agglomeration method, resulting in a substantially carboree mineral stream and a highly concentrated carbon product. The method involves mixing the fly ash comprised of carbon and inorganic mineral matter with a liquid hydrocarbon to form a slurry, contacting the slurry with an aqueous solution, dispersing the hydrocarbon slurry into small droplets within the aqueous solution by mechanical mixing and/or aeration, concentrating the inorganic mineral matter in the aqueous solution, agglomerating the carbon and hydrocarbon in the form of droplets, collecting the droplets, separating the hydrocarbon from the concentrated carbon product, and recycling the hydrocarbon.
NASA Technical Reports Server (NTRS)
Thompson, C. P.; Leaf, G. K.; Vanrosendale, J.
1991-01-01
An algorithm is described for the solution of the laminar, incompressible Navier-Stokes equations. The basic algorithm is a multigrid based on a robust, box-based smoothing step. Its most important feature is the incorporation of automatic, dynamic mesh refinement. This algorithm supports generalized simple domains. The program is based on a standard staggered-grid formulation of the Navier-Stokes equations for robustness and efficiency. Special grid transfer operators were introduced at grid interfaces in the multigrid algorithm to ensure discrete mass conservation. Results are presented for three models: the driven-cavity, a backward-facing step, and a sudden expansion/contraction.
Ku, Bon Ki; Evans, Douglas E.
2015-01-01
For nanoparticles with nonspherical morphologies, e.g., open agglomerates or fibrous particles, it is expected that the actual density of agglomerates may be significantly different from the bulk material density. It is further expected that using the material density may upset the relationship between surface area and mass when a method for estimating aerosol surface area from number and mass concentrations (referred to as “Maynard’s estimation method”) is used. Therefore, it is necessary to quantitatively investigate how much the Maynard’s estimation method depends on particle morphology and density. In this study, aerosol surface area estimated from number and mass concentration measurements was evaluated and compared with values from two reference methods: a method proposed by Lall and Friedlander for agglomerates and a mobility based method for compact nonspherical particles using well-defined polydisperse aerosols with known particle densities. Polydisperse silver aerosol particles were generated by an aerosol generation facility. Generated aerosols had a range of morphologies, count median diameters (CMD) between 25 and 50 nm, and geometric standard deviations (GSD) between 1.5 and 1.8. The surface area estimates from number and mass concentration measurements correlated well with the two reference values when gravimetric mass was used. The aerosol surface area estimates from the Maynard’s estimation method were comparable to the reference method for all particle morphologies within the surface area ratios of 3.31 and 0.19 for assumed GSDs 1.5 and 1.8, respectively, when the bulk material density of silver was used. The difference between the Maynard’s estimation method and surface area measured by the reference method for fractal-like agglomerates decreased from 79% to 23% when the measured effective particle density was used, while the difference for nearly spherical particles decreased from 30% to 24%. The results indicate that the use of particle density of agglomerates improves the accuracy of the Maynard’s estimation method and that an effective density should be taken into account, when known, when estimating aerosol surface area of nonspherical aerosol such as open agglomerates and fibrous particles. PMID:26526560
Mobility and settling rate of agglomerates of polydisperse nanoparticles.
Spyrogianni, Anastasia; Karadima, Katerina S; Goudeli, Eirini; Mavrantzas, Vlasis G; Pratsinis, Sotiris E
2018-02-14
Agglomerate settling impacts nanotoxicology and nanomedicine as well as the stability of engineered nanofluids. Here, the mobility of nanostructured fractal-like SiO 2 agglomerates in water is investigated and their settling rate in infinitely dilute suspensions is calculated by a Brownian dynamics algorithm tracking the agglomerate translational and rotational motion. The corresponding friction matrices are obtained using the HYDRO++ algorithm [J. G. de la Torre, G. del Rio Echenique, and A. Ortega, J. Phys. Chem. B 111, 955 (2007)] from the Kirkwood-Riseman theory accounting for hydrodynamic interactions of primary particles (PPs) through the Rotne-Prager-Yamakawa tensor, properly modified for polydisperse PPs. Agglomerates are generated by an event-driven method and have constant mass fractal dimension but varying PP size distribution, mass, and relative shape anisotropy. The calculated diffusion coefficient from HYDRO++ is used to obtain the agglomerate mobility diameter d m and is compared with that from scaling laws for fractal-like agglomerates. The ratio d m /d g of the mobility diameter to the gyration diameter of the agglomerate decreases with increasing relative shape anisotropy. For constant d m and mean d p , the agglomerate settling rate, u s , increases with increasing PP geometric standard deviation σ p,g (polydispersity). A linear relationship between u s and agglomerate mass to d m ratio, m/d m , is revealed and attributed to the fast Brownian rotation of such small and light nanoparticle agglomerates. An analytical expression for the u s of agglomerates consisting of polydisperse PPs is then derived, u s =1-ρ f ρ p g3πμmd m (ρ f is the density of the fluid, ρ p is the density of PPs, μ is the viscosity of the fluid, and g is the acceleration of gravity), valid for agglomerates for which the characteristic rotational time is considerably shorter than their settling time. Our calculations demonstrate that the commonly made assumption of monodisperse PPs underestimates u s by a fraction depending on σ p,g and agglomerate mass mobility exponent. Simulations are in excellent agreement with deposition rate measurements of fumed SiO 2 agglomerates in water.
Mobility and settling rate of agglomerates of polydisperse nanoparticles
NASA Astrophysics Data System (ADS)
Spyrogianni, Anastasia; Karadima, Katerina S.; Goudeli, Eirini; Mavrantzas, Vlasis G.; Pratsinis, Sotiris E.
2018-02-01
Agglomerate settling impacts nanotoxicology and nanomedicine as well as the stability of engineered nanofluids. Here, the mobility of nanostructured fractal-like SiO2 agglomerates in water is investigated and their settling rate in infinitely dilute suspensions is calculated by a Brownian dynamics algorithm tracking the agglomerate translational and rotational motion. The corresponding friction matrices are obtained using the HYDRO++ algorithm [J. G. de la Torre, G. del Rio Echenique, and A. Ortega, J. Phys. Chem. B 111, 955 (2007)] from the Kirkwood-Riseman theory accounting for hydrodynamic interactions of primary particles (PPs) through the Rotne-Prager-Yamakawa tensor, properly modified for polydisperse PPs. Agglomerates are generated by an event-driven method and have constant mass fractal dimension but varying PP size distribution, mass, and relative shape anisotropy. The calculated diffusion coefficient from HYDRO++ is used to obtain the agglomerate mobility diameter dm and is compared with that from scaling laws for fractal-like agglomerates. The ratio dm/dg of the mobility diameter to the gyration diameter of the agglomerate decreases with increasing relative shape anisotropy. For constant dm and mean dp, the agglomerate settling rate, us, increases with increasing PP geometric standard deviation σp,g (polydispersity). A linear relationship between us and agglomerate mass to dm ratio, m/dm, is revealed and attributed to the fast Brownian rotation of such small and light nanoparticle agglomerates. An analytical expression for the us of agglomerates consisting of polydisperse PPs is then derived, us=(1/-{ρf/ρp})g 3 π μ m/dm (ρf is the density of the fluid, ρp is the density of PPs, μ is the viscosity of the fluid, and g is the acceleration of gravity), valid for agglomerates for which the characteristic rotational time is considerably shorter than their settling time. Our calculations demonstrate that the commonly made assumption of monodisperse PPs underestimates us by a fraction depending on σp,g and agglomerate mass mobility exponent. Simulations are in excellent agreement with deposition rate measurements of fumed SiO2 agglomerates in water.
NASA Technical Reports Server (NTRS)
Woods, Claudia M.; Brewe, David E.
1988-01-01
A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.
NASA Technical Reports Server (NTRS)
Woods, C. M.; Brewe, D. E.
1989-01-01
A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed utilizing a multigrid iteration technique. The method is compared with a noniterative approach in terms of computational time and accuracy. The computational model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobsson-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via a smeared mass or striated flow extending to both surfaces in the film gap. The mixed nature of the equations (parabolic in the full film zone and hyperbolic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.
Adaptive grid embedding for the two-dimensional flux-split Euler equations. M.S. Thesis
NASA Technical Reports Server (NTRS)
Warren, Gary Patrick
1990-01-01
A numerical algorithm is presented for solving the 2-D flux-split Euler equations using a multigrid method with adaptive grid embedding. The method uses an unstructured data set along with a system of pointers for communication on the irregularly shaped grid topologies. An explicit two-stage time advancement scheme is implemented. A multigrid algorithm is used to provide grid level communication and to accelerate the convergence of the solution to steady state. Results are presented for a subcritical airfoil and a transonic airfoil with 3 levels of adaptation. Comparisons are made with a structured upwind Euler code which uses the same flux integration techniques of the present algorithm. Good agreement is obtained with converged surface pressure coefficients. The lift coefficients of the adaptive code are within 2 1/2 percent of the structured code for the sub-critical case and within 4 1/2 percent of the structured code for the transonic case using approximately one-third the number of grid points.
Urban Planning Problems of Agglomerations
NASA Astrophysics Data System (ADS)
Olenkov, V. D.; Tazeev, N. T.
2017-11-01
The article explores the state of the air basin of the Chelyabinsk agglomeration and gives the examples of solutions for the pollution problems from the point of view of city planning. The main features and structure of the modern urban agglomerations are considered, the methods for determining their boundaries are studied and the main problems are identified. The study of the boundaries and territorial structure of the Chelyabinsk urban agglomeration is conducted, and a general description of the territory is given. The data on the change in the volume of pollutant emissions into the atmosphere and the index of atmospheric pollution for the period 2003-2015 are given basing on the annual comprehensive reports regarding the state of the environment. The review of the world experience of city-planning actions on the decision of ecological problems is carried out. The most suitable ways for the ecological problems solving in the Chelyabinsk agglomeration are considered. The authors give recommendations for the ecological situation improving in the territory of the Chelyabinsk agglomeration.
Determining and representing width of soil boundaries using electrical conductivity and MultiGrid
NASA Astrophysics Data System (ADS)
Greve, Mogens Humlekrog; Greve, Mette Balslev
2004-07-01
In classical soil mapping, map unit boundaries are considered crisp even though all experienced survey personnel are aware of the fact, that soil boundaries really are transition zones of varying width. However, classification of transition zone width on site is difficult in a practical survey. The objective of this study is to present a method for determining soil boundary width and a way of representing continuous soil boundaries in GIS. A survey was performed using the non-contact conductivity meter EM38 from Geonics Inc., which measures the bulk Soil Electromagnetic Conductivity (SEC). The EM38 provides an opportunity to classify the width of transition zones in an unbiased manner. By calculating the spatial rate of change in the interpolated EM38 map across the crisp map unit delineations from a classical soil mapping, a measure of transition zone width can be extracted. The map unit delineations are represented as transition zones in a GIS through a concept of multiple grid layers, a MultiGrid. Each layer corresponds to a soil type and the values in a layer represent the percentage of that soil type in each cell. As a test, the subsoil texture was mapped at the Vindum field in Denmark using both the classical mapping method with crisp representation of the boundaries and the new map with MultiGrid and continuous boundaries. These maps were then compared to an independent reference map of subsoil texture. The improvement of the prediction of subsoil texture, using continuous boundaries instead of crisp, was in the case of the Vindum field, 15%.
Reasons and remedies for the agglomeration of multilayered graphene and carbon nanotubes in polymers
Atif, Rasheed
2016-01-01
Summary One of the main issues in the production of polymer nanocomposites is the dispersion state of filler as multilayered graphene (MLG) and carbon nanotubes (CNTs) tend to agglomerate due to van der Waals forces. The agglomeration can be avoided by using organic solvents, selecting suitable dispersion and production methods, and functionalizing the fillers. Another proposed method is the use of hybrid fillers as synergistic effects can cause an improvement in the dispersion state of the fillers. In this review article, various aspects of each process that can help avoid filler agglomeration and improve dispersion state are discussed in detail. This review article would be helpful for both current and prospective researchers in the field of MLG- and CNT-based polymer nanocomposites to achieve maximum enhancement in mechanical, thermal, and electrical properties of produced polymer nanocomposites. PMID:27826492
NASA Workshop on Computational Structural Mechanics 1987, part 3
NASA Technical Reports Server (NTRS)
Sykes, Nancy P. (Editor)
1989-01-01
Computational Structural Mechanics (CSM) topics are explored. Algorithms and software for nonlinear structural dynamics, concurrent algorithms for transient finite element analysis, computational methods and software systems for dynamics and control of large space structures, and the use of multi-grid for structural analysis are discussed.
DOE Office of Scientific and Technical Information (OSTI.GOV)
De Sterck, H
2011-10-18
The following work has been performed by PI Hans De Sterck and graduate student Manda Winlaw for the required tasks 1-5 (as listed in the Statement of Work). Graduate student Manda Winlaw has visited LLNL January 31-March 11, 2011 and May 23-August 19, 2010, working with Van Henson and Mike O'Hara on non-negative matrix factorizations (NMF). She has investigated the dense subgraph clustering algorithm from 'Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs' by Chen and Saad, testing this method on several term-document matrices and adapting it to cluster based on the rank of the subgraphs instead ofmore » the density. Manda Winlaw was awarded a first prize in the annual LLNL summer student poster competition for a poster on her NMF research. PI Hans De Sterck has developed a new adaptive algebraic multigrid algorithm for computing a few dominant or minimal singular triplets of sparse rectangular matrices. This work builds on adaptive algebraic multigrid methods that were further developed by the PI and collaborators (including Sanders and Henson) for Markov chains. The method also combines and extends existing multigrid algorithms for the symmetric eigenproblem. The PI has visited LLNL February 22-25, 2011, and has given a CASC seminar 'Algebraic Multigrid for the Singular Value Problem' on this work on February 23, 2011. During his visit, he has discussed this work and related topics with Van Henson, Geoffrey Sanders, Panayot Vassilevski, and others. He has tested the algorithm on PDE matrices and on a term-document matrix, with promising initial results. Manda Winlaw has also started to work, with O'Hara, on estimating probability distributions over undirected graph edges. The goal is to estimate probabilistic models from sets of undirected graph edges for the purpose of prediction, anomaly detection and support to supervised learning. Graduate student Manda Winlaw is writing a paper on the results obtained with O'Hara which will be submitted some time later in 2011 to a data mining conference. PI Hans De Sterck has developed a new optimization algorithm for canonical tensor approximation, formulating an extension of the nonlinear GMRES method to optimization problems. Numerical results for tensors with up to 8 modes show that this new method is efficient for sparse and dense tensors. He has written a paper on this which has been submitted to the SIAM Journal on Scientific Computing. PI Hans De Sterck has further developed his new optimization algorithm for canonical tensor approximation, formulating an extension in terms of steepest-descent preconditioning, which makes the approach generally applicable for nonlinear optimization. He has written a paper on this extension which has been submitted to Numerical Linear Algebra with Applications.« less
Methods for high volume production of nanostructured materials
Ripley, Edward B [Knoxville, TN; Morrell, Jonathan S [Knoxville, TN; Seals, Roland D [Oak Ridge, TN; Ludtka, Gerald M [Oak Ridge, TN
2011-03-22
A system and method for high volume production of nanoparticles, nanotubes, and items incorporating nanoparticles and nanotubes. Microwave, radio frequency, or infrared energy vaporizes a metal catalyst which, as it condenses, is contacted by carbon or other elements such as silicon, germanium, or boron to form agglomerates. The agglomerates may be annealed to accelerate the production of nanotubes. Magnetic or electric fields may be used to align the nanotubes during their production. The nanotubes may be separated from the production byproducts in aligned or non-aligned configurations. The agglomerates may be formed directly into tools, optionally in compositions that incorporate other materials such as abrasives, binders, carbon-carbon composites, and cermets.
GRUMFOIL: A computer code for the viscous transonic flow over airfoils
NASA Technical Reports Server (NTRS)
Mead, H. R.; Melnik, R. E.
1985-01-01
A user's manual which describes the operation of the computer program, GRUMFOIL is presented. The program computes the viscous transonic flow over two dimensional airfoils using a boundary layer type viscid-inviscid interaction approach. The inviscid solution is obtained by a multigrid method for the full potential equation. The boundary layer solution is based on integral entrainment methods.
Multigrid solutions to quasi-elliptic schemes
NASA Technical Reports Server (NTRS)
Brandt, A.; Taasan, S.
1985-01-01
Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate then corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.
Multigrid solutions to quasi-elliptic schemes
NASA Technical Reports Server (NTRS)
Brandt, A.; Taasan, S.
1985-01-01
Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate than corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.
NASA Astrophysics Data System (ADS)
Bolshakov, V. V.
2017-11-01
The article analyzes the research and design methods of urban agglomerations in the context of the Chelyabinsk agglomeration from the point of view of correctness, objectivity and consistency of the results obtained. The completed and approved project of the Chelyabinsk agglomeration is analysed to provide architectural and planning solutions for sustainable social and economic development according to the theories that have been formed to date. The possibility of effectuation and implementation of the approved project of the Chelyabinsk agglomeration taking in account existing specific natural, historical and socio-economic factors characteristic for the territory under consideration is examined. The authors draw the conclusions the project of the Chelyabinsk agglomeration has been developed in line with the town-planning solutions that do not reflect modern approaches based on the competitive advantages of territories and do not form a space providing transition to a modernized and innovative economy. Specific town-planning decisions have a weak justification and an undeveloped methodology for pre-project analysis and methodology for designing urban agglomerations because of absence of a full study of the phenomenon of urban agglomeration and processes occurring in it today. It is necessary to continue research in the field of development of the Chelyabinsk agglomeration with the use of a logical and objective methodology to analyze the territory and design which can lead to the formation of an urban-planning information model that reflects all the system processes and allows for predicting project solutions.
Aerodynamic Shape Optimization of Complex Aircraft Configurations via an Adjoint Formulation
NASA Technical Reports Server (NTRS)
Reuther, James; Jameson, Antony; Farmer, James; Martinelli, Luigi; Saunders, David
1996-01-01
This work describes the implementation of optimization techniques based on control theory for complex aircraft configurations. Here control theory is employed to derive the adjoint differential equations, the solution of which allows for a drastic reduction in computational costs over previous design methods (13, 12, 43, 38). In our earlier studies (19, 20, 22, 23, 39, 25, 40, 41, 42) it was shown that this method could be used to devise effective optimization procedures for airfoils, wings and wing-bodies subject to either analytic or arbitrary meshes. Design formulations for both potential flows and flows governed by the Euler equations have been demonstrated, showing that such methods can be devised for various governing equations (39, 25). In our most recent works (40, 42) the method was extended to treat wing-body configurations with a large number of mesh points, verifying that significant computational savings can be gained for practical design problems. In this paper the method is extended for the Euler equations to treat complete aircraft configurations via a new multiblock implementation. New elements include a multiblock-multigrid flow solver, a multiblock-multigrid adjoint solver, and a multiblock mesh perturbation scheme. Two design examples are presented in which the new method is used for the wing redesign of a transonic business jet.
NASA Technical Reports Server (NTRS)
Wang, P.; Li, P.
1998-01-01
A high-resolution numerical study on parallel systems is reported on three-dimensional, time-dependent, thermal convective flows. A parallel implentation on the finite volume method with a multigrid scheme is discussed, and a parallel visualization systemm is developed on distributed systems for visualizing the flow.
Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes
Ray, Navamita; Grindeanu, Iulian; Zhao, Xinglin; ...
2016-08-18
In this paper, we describe an array-based hierarchical mesh refinement capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used tomore » project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.« less
Higher-order ice-sheet modelling accelerated by multigrid on graphics cards
NASA Astrophysics Data System (ADS)
Brædstrup, Christian; Egholm, David
2013-04-01
Higher-order ice flow modelling is a very computer intensive process owing primarily to the nonlinear influence of the horizontal stress coupling. When applied for simulating long-term glacial landscape evolution, the ice-sheet models must consider very long time series, while both high temporal and spatial resolution is needed to resolve small effects. The use of higher-order and full stokes models have therefore seen very limited usage in this field. However, recent advances in graphics card (GPU) technology for high performance computing have proven extremely efficient in accelerating many large-scale scientific computations. The general purpose GPU (GPGPU) technology is cheap, has a low power consumption and fits into a normal desktop computer. It could therefore provide a powerful tool for many glaciologists working on ice flow models. Our current research focuses on utilising the GPU as a tool in ice-sheet and glacier modelling. To this extent we have implemented the Integrated Second-Order Shallow Ice Approximation (iSOSIA) equations on the device using the finite difference method. To accelerate the computations, the GPU solver uses a non-linear Red-Black Gauss-Seidel iterator coupled with a Full Approximation Scheme (FAS) multigrid setup to further aid convergence. The GPU finite difference implementation provides the inherent parallelization that scales from hundreds to several thousands of cores on newer cards. We demonstrate the efficiency of the GPU multigrid solver using benchmark experiments.
Agglomeration of Celecoxib by Quasi Emulsion Solvent Diffusion Method: Effect of Stabilizer.
Maghsoodi, Maryam; Nokhodchi, Ali
2016-12-01
Purpose: The quasi-emulsion solvent diffusion (QESD) has evolved into an effective technique to manufacture agglomerates of API crystals. Although, the proposed technique showed benefits, such as cost effectiveness, that is considerably sensitive to the choice of a stabilizer, which agonizes from a absence of systemic understanding in this field. In the present study, the combination of different solvents and stabilizers were compared to investigate any connections between the solvents and stabilizers. Methods: Agglomerates of celecoxib were prepared by QESD method using four different stabilizers (Tween 80, HPMC, PVP and SLS) and three different solvents (methyl acetate, ethyl acetate and isopropyl acetate). The solid state of obtained particles was investigated by differential scanning calorimetry (DSC) and Fourier transform infrared (FT-IR) spectroscopy. The agglomerated were also evaluated in term of production yield, distribution of particles and dissolution behavior. Results: The results showed that the effectiveness of stabilizer in terms of particle size and particle size distribution is specific to each solvent candidate. A stabilizer with a lower HLB value is preferred which actually increased its effectiveness with the solvent candidates with higher lipophilicity. HPMC appeared to be the most versatile stabilizer because it showed a better stabilizing effect compared to other stabilizers in all solvents used. Conclusion: This study demonstrated that the efficiency of stabilizers in forming the celecoxib agglomerates by QESD was influenced by the HLB of the stabilizer and lipophilicity of the solvents.
Novel Binders and Methods for Agglomeration of Ore
DOE Office of Scientific and Technical Information (OSTI.GOV)
S. K. Kawatra; T. C. Eisele; K. A. Lewandowski
2006-12-31
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not break down during processing. However, for many important metal extraction processes there are no binders known that willmore » work satisfactorily. Primary examples of this are copper heap leaching, where there are no binders that will work in the acidic environment encountered in this process, and advanced ironmaking processes, where binders must function satisfactorily over an extraordinarily large range of temperatures (from room temperature up to over 1200 C). As a result, operators of many facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of a broad range of mineral agglomeration applications, particularly heap leaching and advanced primary ironmaking. This project has identified several acid-resistant binders and agglomeration procedures that can be used for improving the energy efficiency of heap leaching, by preventing the ''ponding'' and ''channeling'' effects that currently cause reduced recovery and extended leaching cycle times. Methods have also been developed for iron ore processing which are intended to improve the performance of pellet binders, and have directly saved energy by increasing filtration rates of the pelletization feed by as much as 23%.« less
On dealing with multiple correlation peaks in PIV
NASA Astrophysics Data System (ADS)
Masullo, A.; Theunissen, R.
2018-05-01
A novel algorithm to analyse PIV images in the presence of strong in-plane displacement gradients and reduce sub-grid filtering is proposed in this paper. Interrogation windows subjected to strong in-plane displacement gradients often produce correlation maps presenting multiple peaks. Standard multi-grid procedures discard such ambiguous correlation windows using a signal to noise (SNR) filter. The proposed algorithm improves the standard multi-grid algorithm allowing the detection of splintered peaks in a correlation map through an automatic threshold, producing multiple displacement vectors for each correlation area. Vector locations are chosen by translating images according to the peak displacements and by selecting the areas with the strongest match. The method is assessed on synthetic images of a boundary layer of varying intensity and a sinusoidal displacement field of changing wavelength. An experimental case of a flow exhibiting strong velocity gradients is also provided to show the improvements brought by this technique.
Marching iterative methods for the parabolized and thin layer Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Israeli, M.
1985-01-01
Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.
NOVEL BINDERS AND METHODS FOR AGGLOMERATION OF ORE
DOE Office of Scientific and Technical Information (OSTI.GOV)
S.K. Kawatra; T.C. Eisele; J.A. Gurtler
2005-04-01
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not breakdown during processing. However, for many important metal extraction processes there are no binders known that will workmore » satisfactorily. Primary examples of this are copper heap leaching, where there are no binders that will work in the acidic environment encountered in this process. As a result, operators of many facilities see large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of a broad range of mineral agglomeration applications, particularly heap leaching.« less
Novel Binders and Methods for Agglomeration of Ore
DOE Office of Scientific and Technical Information (OSTI.GOV)
S. K. Kawatra; T. C. Eisele; J. A. Gurtler
2004-03-31
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not break down during processing. However, for many important metal extraction processes there are no binders known that willmore » work satisfactorily. A primary example of this is copper heap leaching, where there are no binders that will work in the acidic environment encountered in this process. As a result, operators of acidic heap-leach facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of other agglomeration applications, particularly advanced primary ironmaking.« less
NASA Astrophysics Data System (ADS)
Esmaily, M.; Jofre, L.; Mani, A.; Iaccarino, G.
2018-03-01
A geometric multigrid algorithm is introduced for solving nonsymmetric linear systems resulting from the discretization of the variable density Navier-Stokes equations on nonuniform structured rectilinear grids and high-Reynolds number flows. The restriction operation is defined such that the resulting system on the coarser grids is symmetric, thereby allowing for the use of efficient smoother algorithms. To achieve an optimal rate of convergence, the sequence of interpolation and restriction operations are determined through a dynamic procedure. A parallel partitioning strategy is introduced to minimize communication while maintaining the load balance between all processors. To test the proposed algorithm, we consider two cases: 1) homogeneous isotropic turbulence discretized on uniform grids and 2) turbulent duct flow discretized on stretched grids. Testing the algorithm on systems with up to a billion unknowns shows that the cost varies linearly with the number of unknowns. This O (N) behavior confirms the robustness of the proposed multigrid method regarding ill-conditioning of large systems characteristic of multiscale high-Reynolds number turbulent flows. The robustness of our method to density variations is established by considering cases where density varies sharply in space by a factor of up to 104, showing its applicability to two-phase flow problems. Strong and weak scalability studies are carried out, employing up to 30,000 processors, to examine the parallel performance of our implementation. Excellent scalability of our solver is shown for a granularity as low as 104 to 105 unknowns per processor. At its tested peak throughput, it solves approximately 4 billion unknowns per second employing over 16,000 processors with a parallel efficiency higher than 50%.
Detwiler, R.L.; Mehl, S.; Rajaram, H.; Cheung, W.W.
2002-01-01
Numerical solution of large-scale ground water flow and transport problems is often constrained by the convergence behavior of the iterative solvers used to solve the resulting systems of equations. We demonstrate the ability of an algebraic multigrid algorithm (AMG) to efficiently solve the large, sparse systems of equations that result from computational models of ground water flow and transport in large and complex domains. Unlike geometric multigrid methods, this algorithm is applicable to problems in complex flow geometries, such as those encountered in pore-scale modeling of two-phase flow and transport. We integrated AMG into MODFLOW 2000 to compare two- and three-dimensional flow simulations using AMG to simulations using PCG2, a preconditioned conjugate gradient solver that uses the modified incomplete Cholesky preconditioner and is included with MODFLOW 2000. CPU times required for convergence with AMG were up to 140 times faster than those for PCG2. The cost of this increased speed was up to a nine-fold increase in required random access memory (RAM) for the three-dimensional problems and up to a four-fold increase in required RAM for the two-dimensional problems. We also compared two-dimensional numerical simulations of steady-state transport using AMG and the generalized minimum residual method with an incomplete LU-decomposition preconditioner. For these transport simulations, AMG yielded increased speeds of up to 17 times with only a 20% increase in required RAM. The ability of AMG to solve flow and transport problems in large, complex flow systems and its ready availability make it an ideal solver for use in both field-scale and pore-scale modeling.
NASA Astrophysics Data System (ADS)
Zohdi, T. I.
2016-03-01
In industry, particle-laden fluids, such as particle-functionalized inks, are constructed by adding fine-scale particles to a liquid solution, in order to achieve desired overall properties in both liquid and (cured) solid states. However, oftentimes undesirable particulate agglomerations arise due to some form of mutual-attraction stemming from near-field forces, stray electrostatic charges, process ionization and mechanical adhesion. For proper operation of industrial processes involving particle-laden fluids, it is important to carefully breakup and disperse these agglomerations. One approach is to target high-frequency acoustical pressure-pulses to breakup such agglomerations. The objective of this paper is to develop a computational model and corresponding solution algorithm to enable rapid simulation of the effect of acoustical pulses on an agglomeration composed of a collection of discrete particles. Because of the complex agglomeration microstructure, containing gaps and interfaces, this type of system is extremely difficult to mesh and simulate using continuum-based methods, such as the finite difference time domain or the finite element method. Accordingly, a computationally-amenable discrete element/discrete ray model is developed which captures the primary physical events in this process, such as the reflection and absorption of acoustical energy, and the induced forces on the particulate microstructure. The approach utilizes a staggered, iterative solution scheme to calculate the power transfer from the acoustical pulse to the particles and the subsequent changes (breakup) of the pulse due to the particles. Three-dimensional examples are provided to illustrate the approach.
NASA Technical Reports Server (NTRS)
Yang, Cheng I.; Guo, Yan-Hu; Liu, C.- H.
1996-01-01
The analysis and design of a submarine propulsor requires the ability to predict the characteristics of both laminar and turbulent flows to a higher degree of accuracy. This report presents results of certain benchmark computations based on an upwind, high-resolution, finite-differencing Navier-Stokes solver. The purpose of the computations is to evaluate the ability, the accuracy and the performance of the solver in the simulation of detailed features of viscous flows. Features of interest include flow separation and reattachment, surface pressure and skin friction distributions. Those features are particularly relevant to the propulsor analysis. Test cases with a wide range of Reynolds numbers are selected; therefore, the effects of the convective and the diffusive terms of the solver can be evaluated separately. Test cases include flows over bluff bodies, such as circular cylinders and spheres, at various low Reynolds numbers, flows over a flat plate with and without turbulence effects, and turbulent flows over axisymmetric bodies with and without propulsor effects. Finally, to enhance the iterative solution procedure, a full approximation scheme V-cycle multigrid method is implemented. Preliminary results indicate that the method significantly reduces the computational effort.
Multilevel Iterative Methods in Nonlinear Computational Plasma Physics
NASA Astrophysics Data System (ADS)
Knoll, D. A.; Finn, J. M.
1997-11-01
Many applications in computational plasma physics involve the implicit numerical solution of coupled systems of nonlinear partial differential equations or integro-differential equations. Such problems arise in MHD, systems of Vlasov-Fokker-Planck equations, edge plasma fluid equations. We have been developing matrix-free Newton-Krylov algorithms for such problems and have applied these algorithms to the edge plasma fluid equations [1,2] and to the Vlasov-Fokker-Planck equation [3]. Recently we have found that with increasing grid refinement, the number of Krylov iterations required per Newton iteration has grown unmanageable [4]. This has led us to the study of multigrid methods as a means of preconditioning matrix-free Newton-Krylov methods. In this poster we will give details of the general multigrid preconditioned Newton-Krylov algorithm, as well as algorithm performance details on problems of interest in the areas of magnetohydrodynamics and edge plasma physics. Work supported by US DoE 1. Knoll and McHugh, J. Comput. Phys., 116, pg. 281 (1995) 2. Knoll and McHugh, Comput. Phys. Comm., 88, pg. 141 (1995) 3. Mousseau and Knoll, J. Comput. Phys. (1997) (to appear) 4. Knoll and McHugh, SIAM J. Sci. Comput. 19, (1998) (to appear)
Multi-Grid detector for neutron spectroscopy: results obtained on time-of-flight spectrometer CNCS
NASA Astrophysics Data System (ADS)
Anastasopoulos, M.; Bebb, R.; Berry, K.; Birch, J.; Bryś, T.; Buffet, J.-C.; Clergeau, J.-F.; Deen, P. P.; Ehlers, G.; van Esch, P.; Everett, S. M.; Guerard, B.; Hall-Wilton, R.; Herwig, K.; Hultman, L.; Höglund, C.; Iruretagoiena, I.; Issa, F.; Jensen, J.; Khaplanov, A.; Kirstein, O.; Lopez Higuera, I.; Piscitelli, F.; Robinson, L.; Schmidt, S.; Stefanescu, I.
2017-04-01
The Multi-Grid detector technology has evolved from the proof-of-principle and characterisation stages. Here we report on the performance of the Multi-Grid detector, the MG.CNCS prototype, which has been installed and tested at the Cold Neutron Chopper Spectrometer, CNCS at SNS. This has allowed a side-by-side comparison to the performance of 3He detectors on an operational instrument. The demonstrator has an active area of 0.2 m2. It is specifically tailored to the specifications of CNCS. The detector was installed in June 2016 and has operated since then, collecting neutron scattering data in parallel to the He-3 detectors of CNCS. In this paper, we present a comprehensive analysis of this data, in particular on instrument energy resolution, rate capability, background and relative efficiency. Stability, gamma-ray and fast neutron sensitivity have also been investigated. The effect of scattering in the detector components has been measured and provides input to comparison for Monte Carlo simulations. All data is presented in comparison to that measured by the 3He detectors simultaneously, showing that all features recorded by one detector are also recorded by the other. The energy resolution matches closely. We find that the Multi-Grid is able to match the data collected by 3He, and see an indication of a considerable advantage in the count rate capability. Based on these results, we are confident that the Multi-Grid detector will be capable of producing high quality scientific data on chopper spectrometers utilising the unprecedented neutron flux of the ESS.
A Study of Multigrid Preconditioners Using Eigensystem Analysis
NASA Technical Reports Server (NTRS)
Roberts, Thomas W.; Swanson, R. C.
2005-01-01
The convergence properties of numerical schemes for partial differential equations are studied by examining the eigensystem of the discrete operator. This method of analysis is very general, and allows the effects of boundary conditions and grid nonuniformities to be examined directly. Algorithms for the Laplace equation and a two equation model hyperbolic system are examined.
Plane Smoothers for Multiblock Grids: Computational Aspects
NASA Technical Reports Server (NTRS)
Llorente, Ignacio M.; Diskin, Boris; Melson, N. Duane
1999-01-01
Standard multigrid methods are not well suited for problems with anisotropic discrete operators, which can occur, for example, on grids that are stretched in order to resolve a boundary layer. One of the most efficient approaches to yield robust methods is the combination of standard coarsening with alternating-direction plane relaxation in the three dimensions. However, this approach may be difficult to implement in codes with multiblock structured grids because there may be no natural definition of global lines or planes. This inherent obstacle limits the range of an implicit smoother to only the portion of the computational domain in the current block. This report studies in detail, both numerically and analytically, the behavior of blockwise plane smoothers in order to provide guidance to engineers who use block-structured grids. The results obtained so far show alternating-direction plane smoothers to be very robust, even on multiblock grids. In common computational fluid dynamics multiblock simulations, where the number of subdomains crossed by the line of a strong anisotropy is low (up to four), textbook multigrid convergence rates can be obtained with a small overlap of cells between neighboring blocks.
Multilevel Methods for Elliptic Problems with Highly Varying Coefficients on Nonaligned Coarse Grids
DOE Office of Scientific and Technical Information (OSTI.GOV)
Scheichl, Robert; Vassilevski, Panayot S.; Zikatanov, Ludmil T.
2012-06-21
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 crossmore » 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.« less
Semiannual Report October 1, 1999 through March 31, 2000
2000-04-01
Mark Carpenter (NASA Langley). Textbook Multigrid Efficiency for the Navier-Stokes Equations Boris Diskin A typical modern Reynolds-Averaged...defined as textbook multigrid efficiency (TME), meaning the solutions to the governing system of equations are attained in a computational work...basic elements of the barriers to be overcome in extending textbook efficiencies to the compressible RANS equations, namely entering flows, far wake
Novel Binders and Methods for Agglomeration of Ore
DOE Office of Scientific and Technical Information (OSTI.GOV)
S. K. Kawatra; T. C. Eisele; K. A. Lewandowski
2006-03-31
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not break down during processing. However, for many important metal extraction processes there are no binders known that willmore » work satisfactorily at a reasonable cost. A primary example of this is copper heap leaching, where there are no binders currently encountered in this acidic environment process. As a result, operators of many facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of a broad range of mineral agglomeration applications, particularly heap leaching. The active involvement of our industrial partners will help to ensure rapid commercialization of any agglomeration technologies developed by this project.« less
Novel Binders and Methods for Agglomeration of Ore
DOE Office of Scientific and Technical Information (OSTI.GOV)
S. K. Kawatra; T. C. Eisele; J. A. Gurtler
2005-09-30
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not break down during processing. However, for many important metal extraction processes there are no binders known that willmore » work satisfactorily at a reasonable cost. A primary example of this is copper heap leaching, where there are no binders currently encountered in this acidic environment process. As a result, operators of many facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of a broad range of mineral agglomeration applications, particularly heap leaching. The active involvement of our industrial partners will help to ensure rapid commercialization of any agglomeration technologies developed by this project.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Choi, Young Joon, E-mail: yjchoi@uvic.ca; Djilali, Ned, E-mail: ndjilali@uvic.ca
2016-01-15
Colloidal agglomeration of nanoparticles in shear flow is investigated by solving the fluid-particle and particle-particle interactions in a 2D system. We use an extended finite element method in which the dynamics of the particles is solved in a fully coupled manner with the flow, allowing an accurate description of the fluid-particle interfaces without the need of boundary-fitted meshes or of empirical correlations to account for the hydrodynamic interactions between the particles. Adaptive local mesh refinement using a grid deformation method is incorporated with the fluid-structure interaction algorithm, and the particle-particle interaction at the microscopic level is modeled using the Lennard-Jonesmore » potential. Motivated by the process used in fabricating fuel cell catalysts from a colloidal ink, the model is applied to investigate agglomeration of colloidal particles under external shear flow in a sliding bi-periodic Lees-Edwards frame with varying shear rates and particle fraction ratios. Both external shear and particle fraction are found to have a crucial impact on the structure formation of colloidal particles in a suspension. Segregation intensity and graph theory are used to analyze the underlying agglomeration patterns and structures, and three agglomeration regimes are identified.« less
Chemical Characterization of Bed Material Coatingsby LA-ICP-MS and SEM-EDS
NASA Astrophysics Data System (ADS)
Piispanen, M. H.; Mustonen, A. J.; Tiainen, M. S.; Laitinen, R. S.
Bed material coatings and the consequent agglomeration of bed material are main ash-related problems in FB-boilers. The bed agglomeration is a particular problem when combusting biofuels and waste materials. Whereas SEM-EDS together with automated image processing has proven to be a convenient method to study compositional distribution in coating layers and agglomerates, it is a relatively expensive technique and is not necessarily widely available. In this contribution, we explore the suitability of LA-ICP-MS to provide analogous information of the bed.
Semi-automatic sparse preconditioners for high-order finite element methods on non-uniform meshes
NASA Astrophysics Data System (ADS)
Austin, Travis M.; Brezina, Marian; Jamroz, Ben; Jhurani, Chetan; Manteuffel, Thomas A.; Ruge, John
2012-05-01
High-order finite elements often have a higher accuracy per degree of freedom than the classical low-order finite elements. However, in the context of implicit time-stepping methods, high-order finite elements present challenges to the construction of efficient simulations due to the high cost of inverting the denser finite element matrix. There are many cases where simulations are limited by the memory required to store the matrix and/or the algorithmic components of the linear solver. We are particularly interested in preconditioned Krylov methods for linear systems generated by discretization of elliptic partial differential equations with high-order finite elements. Using a preconditioner like Algebraic Multigrid can be costly in terms of memory due to the need to store matrix information at the various levels. We present a novel method for defining a preconditioner for systems generated by high-order finite elements that is based on a much sparser system than the original high-order finite element system. We investigate the performance for non-uniform meshes on a cube and a cubed sphere mesh, showing that the sparser preconditioner is more efficient and uses significantly less memory. Finally, we explore new methods to construct the sparse preconditioner and examine their effectiveness for non-uniform meshes. We compare results to a direct use of Algebraic Multigrid as a preconditioner and to a two-level additive Schwarz method.
Summers, Stephen; Henry, Theodore; Gutierrez, Tony
2018-05-01
Microplastics (<5 mm) have often been studied under in-vitro conditions where plastics have been investigated in isolation. However, in the natural environment microplastics readily form agglomerates conferring the particles with properties different to their pristine counterparts. Here, we examined the interaction of exopolymers with polystyrene nanoplastics and microplastics. Formation of plastic agglomerates was examined using simulated sea surface conditions. Flow cytometry coupled with microscopy revealed that nano- and microplastic particle spheres form agglomerates in seawater with a mucilagenous material and an associated microbial community. To characterise this material, differential staining methods revealed it to be glycoprotein in composition. Exposing increasing concentrations of a marine bacterial glycoprotein EPS to nano- or microplastics revealed that these types of polymers contribute to the formation and abundance of plastic agglomerates. This work highlights the importance of EPS on the fate of plastic and future research should take this into account when evaluating the impact of plastics. Crown Copyright © 2018. Published by Elsevier Ltd. All rights reserved.
NASA Astrophysics Data System (ADS)
Yasar, Özüm; Uslu, Tuncay
2017-12-01
Among the fine coal cleaning methods, the oil agglomeration process has important advantages such as high process recovery, more clean product, simple dewatering stage. Several coal agglomeration studies have been undertaken recently and effects of different variables on the process performance have been investigated. However, unlike flotation studies, most of the previous agglomeration studies have not used dispersing agents to minimize slime coating effects of clays. In this study, agglomeration process was applied for recovery of fine coals from coal washery tailings containing remarkable amount of fine coal. Negative effect of fine clays during recovery was tried to be eliminated by using dispersing agent instead of de-sliming. Although ash reductions over 90 % were achieved, performance remained below expectations in terms of combustible matter recovery. However, this study is a preliminary one. It is considered that more satisfied results will be obtained in the next studies by changing the variables such as solid ratio, oil dosage, dispersant type and dosage.
NASA Astrophysics Data System (ADS)
Kellogg, Kevin; Liu, Peiyuan; Lamarche, Casey; Hrenya, Christine
2017-11-01
In flows of cohesive particles, agglomerates will readily form and break. These agglomerates are expected to complicate how particles interact with the surrounding fluid in multiphase flows, and consequently how the solids flow. In this work, a dilute flow of particles driven by gas against gravity is studied. A continuum framework, composed of a population balance to predict the formation of agglomerates, and kinetic-theory-based balances, is used to predict the flow of particles. The closures utilized for the birth and death rates due to aggregation and breakage in the population balance take into account how the impact velocity (the granular temperature) affects the outcome of a collision as aggregation, rebound, or breakage. The agglomerate size distribution and solids velocity predicted by the continuum framework are compared to discrete element method (DEM) simulations, as well to experimental results of particles being entrained from the riser of a fluidized bed. Dow Corning Corporation.
NASA Astrophysics Data System (ADS)
Wang, Lu; Zhang, Guo-Hua; Wang, Jing-Song; Chou, Kuo-Chih
2016-08-01
An agglomeration of the furnace charge always takes place during the oxidation roasting process of molybdenite concentrate (with the main component of MoS2) in multiple hearth furnaces, which greatly affects the production process and furnace service life. In the present work, a preliminary study about the influence of various components on the agglomeration phenomenon of pure MoS2 have been carried out. The results show that reaction temperature, impurity content, and air flow rate have significant effects on the agglomeration extent. Meanwhile, the impurity type added into the pure MoS2 plays a crucial role. It was found that CaO and MgO have a stronger sulfur-fixing effect and that the desulphurization of the roasted product was uncompleted. It was also concluded that the agglomeration is due to the formation of low-melting-point eutectics, including that between MoO3 and impurities and that between MoO3 and Mo4O11. It is suggested that decreasing the impurities contents, especially K, Cu, Pb, and Fe, is an effective method for reducing the extent of agglomeration.
Multigrid time-accurate integration of Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Arnone, Andrea; Liou, Meng-Sing; Povinelli, Louis A.
1993-01-01
Efficient acceleration techniques typical of explicit steady-state solvers are extended to time-accurate calculations. Stability restrictions are greatly reduced by means of a fully implicit time discretization. A four-stage Runge-Kutta scheme with local time stepping, residual smoothing, and multigridding is used instead of traditional time-expensive factorizations. Some applications to natural and forced unsteady viscous flows show the capability of the procedure.
Multigrid Methods for EHL Problems
NASA Technical Reports Server (NTRS)
Nurgat, Elyas; Berzins, Martin
1996-01-01
In many bearings and contacts, forces are transmitted through thin continuous fluid films which separate two contacting elements. Objects in contact are normally subjected to friction and wear which can be reduced effectively by using lubricants. If the lubricant film is sufficiently thin to prevent the opposing solids from coming into contact and carries the entire load, then we have hydrodynamic lubrication, where the lubricant film is determined by the motion and geometry of the solids. However, for loaded contacts of low geometrical conformity, such as gears, rolling contact bearings and cams, this is not the case due to high pressures and this is referred to as Elasto-Hydrodynamic Lubrication (EHL) In EHL, elastic deformation of the contacting elements and the increase in fluid viscosity with pressure are very significant and cannot be ignored. Since the deformation results in changing the geometry of the lubricating film, which in turn determines the pressure distribution, an EHL mathematical model must simultaneously satisfy the complex elasticity (integral) and the Reynolds lubrication (differential) equations. The nonlinear and coupled nature of the two equations makes numerical calculations computationally intensive. This is especially true for highly loaded problems found in practice. One novel feature of these problems is that the solution may exhibit sharp pressure spikes in the outlet region. To this date both finite element and finite difference methods have been used to solve EHL problems with perhaps greater emphasis on the use of the finite difference approach. In both cases, a major computational difficulty is ensuring convergence of the nonlinear equations solver to a steady state solution. Two successful methods for achieving this are direct iteration and multigrid methods. Direct iteration methods (e.g Gauss Seidel) have long been used in conjunction with finite difference discretizations on regular meshes. Perhaps one of the best examples of the application of such methods is the recent Effective Influence Method of Dowson and Wang. Multigrid methods have also been used with great success by Venner and Venner and Lubrecht with a good summary being given by Venner. As both these finite difference discretization based approaches appear to provide an efficient way of solving EHL problems, it is important to understand their relative merits. This paper is a first attempt at providing such an understanding in the context of EHL point contact problem, (contact of two spheres), in which the contact zone is a point and an ellipse or circle for unloaded and loaded dry contacts respectively. Since the film thickness and the contact width are generally small compared to the local radius of curvature of the two surfaces, the reduced geometry of the surfaces in the contact area can be accurately approximated to the contact between a paraboloid and a flat surface. The layout of the remainder of this paper is as follows. In section 2 we introduce the form of the equations to be solved. The Effective Influence Newton Method is described in Section 3 while Section 4 describes the Multigrid method to be used. Sections 5 and 6 describe the test problems to be used in the comparison between the two methods and compare the performance of the two methods. Section 7 concludes the paper with an argument of the two methods and suggests some future research directions.
NASA Astrophysics Data System (ADS)
Ao, Wen; Liu, Peijin; Yang, Wenjing
2016-12-01
In solid propellants, aluminum is widely used to improve the performance, however the condensed combustion products especially the large agglomerates generated from aluminum combustion significantly affect the combustion and internal flow inside the solid rocket motor. To clarify the properties of the condensed combustion products of aluminized propellants, a constant-pressure quench vessel was adopted to collect the combustion products. The morphology and chemical compositions of the collected products, were then studied by using scanning electron microscopy coupled with energy dispersive (SEM-EDS) method. Various structures have been observed in the condensed combustion products. Apart from the typical agglomerates or smoke oxide particles observed before, new structures including the smoke oxide clusters, irregular agglomerates and carbon-inclusions are discovered and investigated. Smoke oxide particles have the highest amount in the products. The highly dispersed oxide particle is spherical with very smooth surface and is on the order of 1-2 μm, but due to the high temperature and long residence time, these small particles will aggregate into smoke oxide clusters which are much larger than the initial particles. Three types of spherical agglomerates have been found. As the ambient gas temperature is much higher than the boiling point of Al2O3, the condensation layer inside which the aluminum drop is burning would evaporate quickly, which result in the fact that few "hollow agglomerates" has been found compared to "cap agglomerates" and "solid agglomerates". Irregular agglomerates usually larger than spherical agglomerates. The formation of irregular agglomerates likely happens by three stages: deformation of spherical aluminum drops; combination of particles with various shape; finally production of irregular agglomerates. EDS results show the ratio of O to Al on the surface of agglomerates is lower in comparison to smoke oxide particles. C and O account for most element compositions for all the carbon inclusions. The rough, spherical, strip shape and flake shape carbon-inclusions are believed to be derived from the degradation products of the binder or oxidizer, while the fiber silk is possibly the combustion product of fiber inside the heat insulation layer of the propellants. Images of products at different pressures reveal high pressure reduces the degree of agglomeration. The chemical compositions, size range and content of all the observed structures are given in this paper. Results of our study are expected to provide better insight in the working process of solid rocket motor.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Srinath Vadlamani; Scott Kruger; Travis Austin
Extended magnetohydrodynamic (MHD) codes are used to model the large, slow-growing instabilities that are projected to limit the performance of International Thermonuclear Experimental Reactor (ITER). The multiscale nature of the extended MHD equations requires an implicit approach. The current linear solvers needed for the implicit algorithm scale poorly because the resultant matrices are so ill-conditioned. A new solver is needed, especially one that scales to the petascale. The most successful scalable parallel processor solvers to date are multigrid solvers. Applying multigrid techniques to a set of equations whose fundamental modes are dispersive waves is a promising solution to CEMM problems.more » For the Phase 1, we implemented multigrid preconditioners from the HYPRE project of the Center for Applied Scientific Computing at LLNL via PETSc of the DOE SciDAC TOPS for the real matrix systems of the extended MHD code NIMROD which is a one of the primary modeling codes of the OFES-funded Center for Extended Magnetohydrodynamic Modeling (CEMM) SciDAC. We implemented the multigrid solvers on the fusion test problem that allows for real matrix systems with success, and in the process learned about the details of NIMROD data structures and the difficulties of inverting NIMROD operators. The further success of this project will allow for efficient usage of future petascale computers at the National Leadership Facilities: Oak Ridge National Laboratory, Argonne National Laboratory, and National Energy Research Scientific Computing Center. The project will be a collaborative effort between computational plasma physicists and applied mathematicians at Tech-X Corporation, applied mathematicians Front Range Scientific Computations, Inc. (who are collaborators on the HYPRE project), and other computational plasma physicists involved with the CEMM project.« less
Architecting the Finite Element Method Pipeline for the GPU.
Fu, Zhisong; Lewis, T James; Kirby, Robert M; Whitaker, Ross T
2014-02-01
The finite element method (FEM) is a widely employed numerical technique for approximating the solution of partial differential equations (PDEs) in various science and engineering applications. Many of these applications benefit from fast execution of the FEM pipeline. One way to accelerate the FEM pipeline is by exploiting advances in modern computational hardware, such as the many-core streaming processors like the graphical processing unit (GPU). In this paper, we present the algorithms and data-structures necessary to move the entire FEM pipeline to the GPU. First we propose an efficient GPU-based algorithm to generate local element information and to assemble the global linear system associated with the FEM discretization of an elliptic PDE. To solve the corresponding linear system efficiently on the GPU, we implement a conjugate gradient method preconditioned with a geometry-informed algebraic multi-grid (AMG) method preconditioner. We propose a new fine-grained parallelism strategy, a corresponding multigrid cycling stage and efficient data mapping to the many-core architecture of GPU. Comparison of our on-GPU assembly versus a traditional serial implementation on the CPU achieves up to an 87 × speedup. Focusing on the linear system solver alone, we achieve a speedup of up to 51 × versus use of a comparable state-of-the-art serial CPU linear system solver. Furthermore, the method compares favorably with other GPU-based, sparse, linear solvers.
NASA Astrophysics Data System (ADS)
Guan, Zhen; Pekurovsky, Dmitry; Luce, Jason; Thornton, Katsuyo; Lowengrub, John
The structural phase field crystal (XPFC) model can be used to model grain growth in polycrystalline materials at diffusive time-scales while maintaining atomic scale resolution. However, the governing equation of the XPFC model is an integral-partial-differential-equation (IPDE), which poses challenges in implementation onto high performance computing (HPC) platforms. In collaboration with the XSEDE Extended Collaborative Support Service, we developed a distributed memory HPC solver for the XPFC model, which combines parallel multigrid and P3DFFT. The performance benchmarking on the Stampede supercomputer indicates near linear strong and weak scaling for both multigrid and transfer time between multigrid and FFT modules up to 1024 cores. Scalability of the FFT module begins to decline at 128 cores, but it is sufficient for the type of problem we will be examining. We have demonstrated simulations using 1024 cores, and we expect to achieve 4096 cores and beyond. Ongoing work involves optimization of MPI/OpenMP-based codes for the Intel KNL Many-Core Architecture. This optimizes the code for coming pre-exascale systems, in particular many-core systems such as Stampede 2.0 and Cori 2 at NERSC, without sacrificing efficiency on other general HPC systems.
Oriented nanofibers embedded in a polymer matrix
NASA Technical Reports Server (NTRS)
Barrera, Enrique V. (Inventor); Lozano, Karen (Inventor); Rodriguez-Macias, Fernando J. (Inventor); Chibante, Luis Paulo Felipe (Inventor); Stewart, David Harris (Inventor)
2011-01-01
A method of forming a composite of embedded nanofibers in a polymer matrix is disclosed. The method includes incorporating nanofibers in a plastic matrix forming agglomerates, and uniformly distributing the nanofibers by exposing the agglomerates to hydrodynamic stresses. The hydrodynamic said stresses force the agglomerates to break apart. In combination or additionally elongational flow is used to achieve small diameters and alignment. A nanofiber reinforced polymer composite system is disclosed. The system includes a plurality of nanofibers that are embedded in polymer matrices in micron size fibers. A method for producing nanotube continuous fibers is disclosed. Nanofibers are fibrils with diameters of 100 nm, multiwall nanotubes, single wall nanotubes and their various functionalized and derivatized forms. The method includes mixing a nanofiber in a polymer; and inducing an orientation of the nanofibers that enables the nanofibers to be used to enhance mechanical, thermal and electrical properties. Orientation is induced by high shear mixing and elongational flow, singly or in combination. The polymer may be removed from said nanofibers, leaving micron size fibers of aligned nanofibers.
NASA Astrophysics Data System (ADS)
Oueslati, F.; Ben-Beya, B.
2018-01-01
Three-dimensional thermosolutal natural convection and entropy generation within an inclined enclosure is investigated in the current study. A numerical method based on the finite volume method and a full multigrid technique is implemented to solve the governing equations. Effects of various parameters, namely, the aspect ratio, buoyancy ratio, and tilt angle on the flow patterns and entropy generation are predicted and discussed.
Brandão, Pedro F; Ramos, Rui M; Valente, Inês M; Almeida, Paulo J; Carro, Antonia M; Lorenzo, Rosa A; Rodrigues, José A
2017-04-01
In this work, a simple methodology was developed for the extraction and determination of free formaldehyde content in cork agglomerate samples. For the first time, gas-diffusion microextraction was used for the extraction of volatile formaldehyde directly from samples, with simultaneous derivatization with acetylacetone (Hantzsch reaction). The absorbance of the coloured solution was read in a spectrophotometer at 412 nm. Different extraction parameters were studied and optimized (extraction temperature, sample mass, volume of acceptor solution, extraction time and concentration of derivatization reagent) by means of an asymmetric screening. The developed methodology proved to be a reliable tool for the determination of formaldehyde in cork agglomerates with the following suitable method features: low LOD (0.14 mg kg -1 ) and LOQ (0.47 mg kg -1 ), r 2 = 0.9994, and intraday and interday precision of 3.5 and 4.9%, respectively. The developed methodology was applied to the determination of formaldehyde in different cork agglomerate samples, and contents between 1.9 and 9.4 mg kg -1 were found. Furthermore, formaldehyde was also determined by the standard method EN 717-3 for comparison purposes; no significant differences between the results of both methods were observed. Graphical abstract Representation of the GDME system and its main components.
Applications of Space-Filling-Curves to Cartesian Methods for CFD
NASA Technical Reports Server (NTRS)
Aftosmis, Michael J.; Berger, Marsha J.; Murman, Scott M.
2003-01-01
The proposed paper presents a variety novel uses of Space-Filling-Curves (SFCs) for Cartesian mesh methods in 0. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, most are applicable on general body-fitted meshes -both structured and unstructured. We demonstrate the use of single O(N log N) SFC-based reordering to produce single-pass (O(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations. Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 512 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 10% of ideal even with only around 50,000 cells in each subdomain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with O(max(M,N)) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for finite-difference-based gradient design methods.
Colloidal stability of carbonate-coated silver nanoparticles in synthetic and natural freshwater.
Piccapietra, Flavio; Sigg, Laura; Behra, Renata
2012-01-17
To gain important information on fate, mobility, and bioavailability of silver nanoparticles (AgNP) in aquatic systems, the influence of pH, ionic strength, and humic substances on the stability of carbonate-coated AgNP (average diameter 29 nm) was systematically investigated in 10 mM carbonate and 10 mM MOPS buffer, and in filtered natural freshwater. Changes in the physicochemical properties of AgNP were measured using nanoparticle tracking analysis, dynamic light scattering, and ultraviolet-visible spectroscopy. According to the pH-dependent carbonate speciation, below pH 4 the negatively charged surface of AgNP became positive and increased agglomeration was observed. Electrolyte concentrations above 2 mM Ca(2+) and 100 mM Na(+) enhanced AgNP agglomeration in the synthetic media. In the considered concentration range of humic substances, no relevant changes in the AgNP agglomeration state were measured. Agglomeration of AgNP exposed in filtered natural freshwater was observed to be primarily controlled by the electrolyte type and concentration. Moreover, agglomerated AgNP were still detected after 7 days of exposure. Consequently, slow sedimentation and high mobility of agglomerated AgNP could be expected under the considered natural conditions. A critical evaluation of the different methods used is presented as well.
NOVEL BINDERS AND METHODS FOR AGGLOMERATION OF ORE
DOE Office of Scientific and Technical Information (OSTI.GOV)
S.K. Kawatra; T.C. Eisele; J.A. Gurtler
2004-04-01
Many metal extraction operations, such as leaching of copper, leaching of precious metals, and reduction of metal oxides to metal in high-temperature furnaces, require agglomeration of ore to ensure that reactive liquids or gases are evenly distributed throughout the ore being processed. Agglomeration of ore into coarse, porous masses achieves this even distribution of fluids by preventing fine particles from migrating and clogging the spaces and channels between the larger ore particles. Binders are critically necessary to produce agglomerates that will not break down during processing. However, for many important metal extraction processes there are no binders known that willmore » work satisfactorily. Primary examples of this are copper heap leaching, where there are no binders that will work in the acidic environment encountered in this process, and advanced ironmaking processes, where binders must function satisfactorily over an extraordinarily large range of temperatures (from room temperature up to over 1200 C). As a result, operators of many facilities see a large loss of process efficiency due to their inability to take advantage of agglomeration. The large quantities of ore that must be handled in metal extraction processes also means that the binder must be inexpensive and useful at low dosages to be economical. The acid-resistant binders and agglomeration procedures developed in this project will also be adapted for use in improving the energy efficiency and performance of a broad range of mineral agglomeration applications, particularly heap leaching and advanced primary ironmaking.« less
A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids
NASA Technical Reports Server (NTRS)
Prieto, Manuel; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)
2001-01-01
This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.
NASA Technical Reports Server (NTRS)
Woods, Claudia M.
1988-01-01
A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.
A fast multigrid-based electromagnetic eigensolver for curved metal boundaries on the Yee mesh
DOE Office of Scientific and Technical Information (OSTI.GOV)
Bauer, Carl A., E-mail: carl.bauer@colorado.edu; Werner, Gregory R.; Cary, John R.
For embedded boundary electromagnetics using the Dey–Mittra (Dey and Mittra, 1997) [1] algorithm, a special grad–div matrix constructed in this work allows use of multigrid methods for efficient inversion of Maxwell’s curl–curl matrix. Efficient curl–curl inversions are demonstrated within a shift-and-invert Krylov-subspace eigensolver (open-sourced at ([ofortt]https://github.com/bauerca/maxwell[cfortt])) on the spherical cavity and the 9-cell TESLA superconducting accelerator cavity. The accuracy of the Dey–Mittra algorithm is also examined: frequencies converge with second-order error, and surface fields are found to converge with nearly second-order error. In agreement with previous work (Nieter et al., 2009) [2], neglecting some boundary-cut cell faces (as is requiredmore » in the time domain for numerical stability) reduces frequency convergence to first-order and surface-field convergence to zeroth-order (i.e. surface fields do not converge). Additionally and importantly, neglecting faces can reduce accuracy by an order of magnitude at low resolutions.« less
RMG An Open Source Electronic Structure Code for Multi-Petaflops Calculations
NASA Astrophysics Data System (ADS)
Briggs, Emil; Lu, Wenchang; Hodak, Miroslav; Bernholc, Jerzy
RMG (Real-space Multigrid) is an open source, density functional theory code for quantum simulations of materials. It solves the Kohn-Sham equations on real-space grids, which allows for natural parallelization via domain decomposition. Either subspace or Davidson diagonalization, coupled with multigrid methods, are used to accelerate convergence. RMG is a cross platform open source package which has been used in the study of a wide range of systems, including semiconductors, biomolecules, and nanoscale electronic devices. It can optionally use GPU accelerators to improve performance on systems where they are available. The recently released versions (>2.0) support multiple GPU's per compute node, have improved performance and scalability, enhanced accuracy and support for additional hardware platforms. New versions of the code are regularly released at http://www.rmgdft.org. The releases include binaries for Linux, Windows and MacIntosh systems, automated builds for clusters using cmake, as well as versions adapted to the major supercomputing installations and platforms. Several recent, large-scale applications of RMG will be discussed.
NASA Technical Reports Server (NTRS)
Bates, J. R.; Semazzi, F. H. M.; Higgins, R. W.; Barros, Saulo R. M.
1990-01-01
A vector semi-Lagrangian semi-implicit two-time-level finite-difference integration scheme for the shallow water equations on the sphere is presented. A C-grid is used for the spatial differencing. The trajectory-centered discretization of the momentum equation in vector form eliminates pole problems and, at comparable cost, gives greater accuracy than a previous semi-Lagrangian finite-difference scheme which used a rotated spherical coordinate system. In terms of the insensitivity of the results to increasing timestep, the new scheme is as successful as recent spectral semi-Lagrangian schemes. In addition, the use of a multigrid method for solving the elliptic equation for the geopotential allows efficient integration with an operation count which, at high resolution, is of lower order than in the case of the spectral models. The properties of the new scheme should allow finite-difference models to compete with spectral models more effectively than has previously been possible.
A Comparison of Solver Performance for Complex Gastric Electrophysiology Models
Sathar, Shameer; Cheng, Leo K.; Trew, Mark L.
2016-01-01
Computational techniques for solving systems of equations arising in gastric electrophysiology have not been studied for efficient solution process. We present a computationally challenging problem of simulating gastric electrophysiology in anatomically realistic stomach geometries with multiple intracellular and extracellular domains. The multiscale nature of the problem and mesh resolution required to capture geometric and functional features necessitates efficient solution methods if the problem is to be tractable. In this study, we investigated and compared several parallel preconditioners for the linear systems arising from tetrahedral discretisation of electrically isotropic and anisotropic problems, with and without stimuli. The results showed that the isotropic problem was computationally less challenging than the anisotropic problem and that the application of extracellular stimuli increased workload considerably. Preconditioning based on block Jacobi and algebraic multigrid solvers were found to have the best overall solution times and least iteration counts, respectively. The algebraic multigrid preconditioner would be expected to perform better on large problems. PMID:26736543
A multiblock multigrid three-dimensional Euler equation solver
NASA Technical Reports Server (NTRS)
Cannizzaro, Frank E.; Elmiligui, Alaa; Melson, N. Duane; Vonlavante, E.
1990-01-01
Current aerodynamic designs are often quite complex (geometrically). Flexible computational tools are needed for the analysis of a wide range of configurations with both internal and external flows. In the past, geometrically dissimilar configurations required different analysis codes with different grid topologies in each. The duplicity of codes can be avoided with the use of a general multiblock formulation which can handle any grid topology. Rather than hard wiring the grid topology into the program, it is instead dictated by input to the program. In this work, the compressible Euler equations, written in a body-fitted finite-volume formulation, are solved using a pseudo-time-marching approach. Two upwind methods (van Leer's flux-vector-splitting and Roe's flux-differencing) were investigated. Two types of explicit solvers (a two-step predictor-corrector and a modified multistage Runge-Kutta) were used with multigrid acceleration to enhance convergence. A multiblock strategy is used to allow greater geometric flexibility. A report on simple explicit upwind schemes for solving compressible flows is included.
A preconditioned formulation of the Cauchy-Riemann equations
NASA Technical Reports Server (NTRS)
Phillips, T. N.
1983-01-01
A preconditioning of the Cauchy-Riemann equations which results in a second-order system is described. This system is shown to have a unique solution if the boundary conditions are chosen carefully. This choice of boundary condition enables the solution of the first-order system to be retrieved. A numerical solution of the preconditioned equations is obtained by the multigrid method.
Phillips, Edward Geoffrey; Shadid, John N.; Cyr, Eric C.
2018-05-01
Here, we report multiple physical time-scales can arise in electromagnetic simulations when dissipative effects are introduced through boundary conditions, when currents follow external time-scales, and when material parameters vary spatially. In such scenarios, the time-scales of interest may be much slower than the fastest time-scales supported by the Maxwell equations, therefore making implicit time integration an efficient approach. The use of implicit temporal discretizations results in linear systems in which fast time-scales, which severely constrain the stability of an explicit method, can manifest as so-called stiff modes. This study proposes a new block preconditioner for structure preserving (also termed physicsmore » compatible) discretizations of the Maxwell equations in first order form. The intent of the preconditioner is to enable the efficient solution of multiple-time-scale Maxwell type systems. An additional benefit of the developed preconditioner is that it requires only a traditional multigrid method for its subsolves and compares well against alternative approaches that rely on specialized edge-based multigrid routines that may not be readily available. Lastly, results demonstrate parallel scalability at large electromagnetic wave CFL numbers on a variety of test problems.« less
DOE Office of Scientific and Technical Information (OSTI.GOV)
Phillips, Edward Geoffrey; Shadid, John N.; Cyr, Eric C.
Here, we report multiple physical time-scales can arise in electromagnetic simulations when dissipative effects are introduced through boundary conditions, when currents follow external time-scales, and when material parameters vary spatially. In such scenarios, the time-scales of interest may be much slower than the fastest time-scales supported by the Maxwell equations, therefore making implicit time integration an efficient approach. The use of implicit temporal discretizations results in linear systems in which fast time-scales, which severely constrain the stability of an explicit method, can manifest as so-called stiff modes. This study proposes a new block preconditioner for structure preserving (also termed physicsmore » compatible) discretizations of the Maxwell equations in first order form. The intent of the preconditioner is to enable the efficient solution of multiple-time-scale Maxwell type systems. An additional benefit of the developed preconditioner is that it requires only a traditional multigrid method for its subsolves and compares well against alternative approaches that rely on specialized edge-based multigrid routines that may not be readily available. Lastly, results demonstrate parallel scalability at large electromagnetic wave CFL numbers on a variety of test problems.« less
Performance of fully-coupled algebraic multigrid preconditioners for large-scale VMS resistive MHD
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lin, P. T.; Shadid, J. N.; Hu, J. J.
Here, we explore the current performance and scaling of a fully-implicit stabilized unstructured finite element (FE) variational multiscale (VMS) capability for large-scale simulations of 3D incompressible resistive magnetohydrodynamics (MHD). The large-scale linear systems that are generated by a Newton nonlinear solver approach are iteratively solved by preconditioned Krylov subspace methods. The efficiency of this approach is critically dependent on the scalability and performance of the algebraic multigrid preconditioner. Our study considers the performance of the numerical methods as recently implemented in the second-generation Trilinos implementation that is 64-bit compliant and is not limited by the 32-bit global identifiers of themore » original Epetra-based Trilinos. The study presents representative results for a Poisson problem on 1.6 million cores of an IBM Blue Gene/Q platform to demonstrate very large-scale parallel execution. Additionally, results for a more challenging steady-state MHD generator and a transient solution of a benchmark MHD turbulence calculation for the full resistive MHD system are also presented. These results are obtained on up to 131,000 cores of a Cray XC40 and one million cores of a BG/Q system.« less
Performance of fully-coupled algebraic multigrid preconditioners for large-scale VMS resistive MHD
Lin, P. T.; Shadid, J. N.; Hu, J. J.; ...
2017-11-06
Here, we explore the current performance and scaling of a fully-implicit stabilized unstructured finite element (FE) variational multiscale (VMS) capability for large-scale simulations of 3D incompressible resistive magnetohydrodynamics (MHD). The large-scale linear systems that are generated by a Newton nonlinear solver approach are iteratively solved by preconditioned Krylov subspace methods. The efficiency of this approach is critically dependent on the scalability and performance of the algebraic multigrid preconditioner. Our study considers the performance of the numerical methods as recently implemented in the second-generation Trilinos implementation that is 64-bit compliant and is not limited by the 32-bit global identifiers of themore » original Epetra-based Trilinos. The study presents representative results for a Poisson problem on 1.6 million cores of an IBM Blue Gene/Q platform to demonstrate very large-scale parallel execution. Additionally, results for a more challenging steady-state MHD generator and a transient solution of a benchmark MHD turbulence calculation for the full resistive MHD system are also presented. These results are obtained on up to 131,000 cores of a Cray XC40 and one million cores of a BG/Q system.« less
High volume production of nanostructured materials
Ripley, Edward B [Knoxville, TN; Morrell, Jonathan S [Knoxville, TN; Seals, Roland D [Oak Ridge, TN; Ludtka, Gerard M [Oak Ridge, TN
2009-10-13
A system and method for high volume production of nanoparticles, nanotubes, and items incorporating nanoparticles and nanotubes. Microwave, radio frequency, or infrared energy vaporizes a metal catalyst which, as it condenses, is contacted by carbon or other elements such as silicon, germanium, or boron to form agglomerates. The agglomerates may be annealed to accelerate the production of nanotubes. Magnetic or electric fields may be used to align the nanotubes during their production. The nanotubes may be separated from the production byproducts in aligned or non-aligned configurations. The agglomerates may be formed directly into tools, optionally in compositions that incorporate other materials such as abrasives, binders, carbon-carbon composites, and cermets.
Convergence of Defect-Correction and Multigrid Iterations for Inviscid Flows
NASA Technical Reports Server (NTRS)
Diskin, Boris; Thomas, James L.
2011-01-01
Convergence of multigrid and defect-correction iterations is comprehensively studied within different incompressible and compressible inviscid regimes on high-density grids. Good smoothing properties of the defect-correction relaxation have been shown using both a modified Fourier analysis and a more general idealized-coarse-grid analysis. Single-grid defect correction alone has some slowly converging iterations on grids of medium density. The convergence is especially slow for near-sonic flows and for very low compressible Mach numbers. Additionally, the fast asymptotic convergence seen on medium density grids deteriorates on high-density grids. Certain downstream-boundary modes are very slowly damped on high-density grids. Multigrid scheme accelerates convergence of the slow defect-correction iterations to the extent determined by the coarse-grid correction. The two-level asymptotic convergence rates are stable and significantly below one in most of the regions but slow convergence is noted for near-sonic and very low-Mach compressible flows. Multigrid solver has been applied to the NACA 0012 airfoil and to different flow regimes, such as near-tangency and stagnation. Certain convergence difficulties have been encountered within stagnation regions. Nonetheless, for the airfoil flow, with a sharp trailing-edge, residuals were fast converging for a subcritical flow on a sequence of grids. For supercritical flow, residuals converged slower on some intermediate grids than on the finest grid or the two coarsest grids.
Hydrophobic agglomeration of apatite fines induced by sodium oleate in aqueous solutions
NASA Astrophysics Data System (ADS)
Yang, Bingqiao; Huang, Pengliang; Song, Shaoxian; Luo, Huihua; Zhang, Yi
2018-06-01
In this work, the hydrophobic agglomeration of apatite fines induced by sodium oleate in aqueous solutions has been investigated through the measurement of agglomeration degree and fractal dimension. The results showed that the agglomeration degree of apatite fines and agglomerates morphology was strongly depended on sodium oleate concentration, pH, stirring speed and time. Better agglomeration degree and more regular agglomerates were achieved at sodium oleate concentration of 5 × 10-5 mol/L under neutral condition. The critical stirring speed for agglomerates rupture was 1000 rev/min, above which, prolonged stirring time would cause breakage and restructure of the agglomerates after a certain stirring time, resulting in lower agglomeration degree and more regular agglomerates. The agglomeration degree of apatite fines could be greatly enhanced with the addition of emulsified kerosene, but only if the apatite surface was hydrophobic enough.
Belmeziti, Ali; Coutard, Olivier; de Gouvello, Bernard
2014-01-01
This paper is based on a prospective scenario of development of rainwater harvesting (RWH) on a given large urban area (such as metropolitan area or region). In such a perspective, a new method is proposed to quantify the related potential of potable water savings (PPWS) indicator on this type of area by adapting the reference model usually used on the building level. The method is based on four setting-up principles: gathering (definition of buildings-types and municipalities-types), progressing (use of an intermediate level), increasing (choice of an upper estimation) and prioritizing (ranking the stakes of RWH). Its application to the Paris agglomeration shows that is possible to save up to 11% of the total current potable water through the use of RWH. It also shows that the residential sector offers the most important part because it holds two-thirds of the agglomeration PPWS.
Method and system for producing metallic iron nuggets
Iwasaki, Iwao; Kiesel, Richard F.; Englund, David J; Hendrickson, Dave
2012-12-18
A method and system for producing metallic iron nuggets may include providing multiple layers of agglomerates, such as briquettes, balls and extrusions, of a reducible mixture of reducing material (such as carbonaceous material) and of a reducible iron bearing material (such as iron oxide) on a hearth material layer (such as carbonaceous material) and providing a coarse overlayer of carbonaceous material over at least some of the agglomerates. Heating the agglomerates of reducible mixture to 1425.degree. C. or 1400.degree. C. or 1375.degree. C. results in formation of an intermediate product of one or more metallic iron nuggets, which may have a sulfur content of less than 0.03%, and slag, which may have less than 5% mass MgO, which may have a ratio of percent by weight sulfur in the slag over percent by weight sulfur in the metallic nuggets of at least about 12 or at least about 15.
Dust recycling technology in Kimitsu Works
NASA Astrophysics Data System (ADS)
Oda, Hiroshi; Ibaraki, Tetsuharu
Dust recycling technology by the rotary hearth furnace has been applied at Nippon Steel‧s Kimitsu Works since 2000. The dust and sludge with iron oxide and carbon are agglomerated into shaped articles and the iron oxide is reduced in a high temperature atmosphere. Zinc and other impurities in the dust and sludge are expelled and exhausted into off gas. The DRI pellets made from the dust and sludge have 70% metallization and are strong enough for being recycled to the blast furnaces. No.1 plant, which was constructed in May 2000 and has an agglomeration method of pelletizing, recycles mainly dry dusts. No.2 plant, which was constructed in December 2002 and has an agglomeration method of extrusion, recycles mainly sludge. The combination of the two plants is a solution for recycling various kinds of dusts and sludge emitted in a large scale steel works as Kimitsu Works
Convergence speeding up in the calculation of the viscous flow about an airfoil
NASA Technical Reports Server (NTRS)
Radespiel, R.; Rossow, C.
1988-01-01
A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Grout, Ray W. S.
Convergence of spectral deferred correction (SDC), where low-order time integration methods are used to construct higher-order methods through iterative refinement, can be accelerated in terms of computational effort by using mixed-precision methods. Using ideas from multi-level SDC (in turn based on FAS multigrid ideas), some of the SDC correction sweeps can use function values computed in reduced precision without adversely impacting the accuracy of the final solution. This is particularly beneficial for the performance of combustion solvers such as S3D [6] which require double precision accuracy but are performance limited by the cost of data motion.
Preparation and Characterization of Ato Nanoparticles by Coprecipitation with Modified Drying Method
NASA Astrophysics Data System (ADS)
Liu, Shimin; Liang, Dongdong; Liu, Jindong; Jiang, Weiwei; Liu, Chaoqian; Ding, Wanyu; Wang, Hualin; Wang, Nan
Antimony-doped tin oxide (ATO) nanoparticles were prepared by coprecipitation by packing drying and traditional direct drying (for comparison) methods. The as-prepared ATO nanoparticles were characterized by TG, XRD, EDS, TEM, HRTEM, BET, bulk density and electrical resistivity measurements. Results indicated that the ATO nanoparticles obtained by coprecipitation with direct drying method featured hard-agglomerated morphology, high bulk density, low surface area and low electrical resistivity, probably due to the direct liquid evaporation during drying, the fast shrinkage of the precipitate, the poor removal efficiency of liquid molecules and the hard agglomerate formation after calcination. Very differently, the ATO product obtained by the packing and drying method featured free-agglomerated morphology, low bulk density, high surface area and high electrical resistivity ascribed probably to the formed vapor cyclone environment and liquid evaporation-resistance, avoiding fast liquid removal and improving the removal efficiency of liquid molecules. The intrinsic formation mechanism of ATO nanoparticles from different drying methods was illustrated based on the dehydration process of ATO precipitates. Additionally, the packing and drying time played key roles in determining the bulk density, morphology and electrical conductivity of ATO nanoparticles.
Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale
Chan, Cy P.; Bachan, John D.; Kenny, Joseph P.; ...
2017-01-26
Here, we introduce a topology-aware performance optimization and modeling workflow for AMR simulation that includes two new modeling tools, ProgrAMR and Mota Mapper, which interface with the BoxLib AMR framework and the SSTmacro network simulator. ProgrAMR allows us to generate and model the execution of task dependency graphs from high-level specifications of AMR-based applications, which we demonstrate by analyzing two example AMR-based multigrid solvers with varying degrees of asynchrony. Mota Mapper generates multiobjective, network topology-aware box mappings, which we apply to optimize the data layout for the example multigrid solvers. While the sensitivity of these solvers to layout and executionmore » strategy appears to be modest for balanced scenarios, the impact of better mapping algorithms can be significant when performance is highly constrained by network hop latency. Furthermore, we show that network latency in the multigrid bottom solve is the main contributing factor preventing good scaling on exascale-class machines.« less
Topology-Aware Performance Optimization and Modeling of Adaptive Mesh Refinement Codes for Exascale
DOE Office of Scientific and Technical Information (OSTI.GOV)
Chan, Cy P.; Bachan, John D.; Kenny, Joseph P.
Here, we introduce a topology-aware performance optimization and modeling workflow for AMR simulation that includes two new modeling tools, ProgrAMR and Mota Mapper, which interface with the BoxLib AMR framework and the SSTmacro network simulator. ProgrAMR allows us to generate and model the execution of task dependency graphs from high-level specifications of AMR-based applications, which we demonstrate by analyzing two example AMR-based multigrid solvers with varying degrees of asynchrony. Mota Mapper generates multiobjective, network topology-aware box mappings, which we apply to optimize the data layout for the example multigrid solvers. While the sensitivity of these solvers to layout and executionmore » strategy appears to be modest for balanced scenarios, the impact of better mapping algorithms can be significant when performance is highly constrained by network hop latency. Furthermore, we show that network latency in the multigrid bottom solve is the main contributing factor preventing good scaling on exascale-class machines.« less
Three dimensional unstructured multigrid for the Euler equations
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1991-01-01
The three dimensional Euler equations are solved on unstructured tetrahedral meshes using a multigrid strategy. The driving algorithm consists of an explicit vertex-based finite element scheme, which employs an edge-based data structure to assemble the residuals. The multigrid approach employs a sequence of independently generated coarse and fine meshes to accelerate the convergence to steady-state of the fine grid solution. Variables, residuals and corrections are passed back and forth between the various grids of the sequence using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using linear interpolation. The addresses and weights for interpolation are determined in a preprocessing stage using an efficient graph traversal algorithm. The preprocessing operation is shown to require a negligible fraction of the CPU time required by the overall solution procedure, while gains in overall solution efficiencies greater than an order of magnitude are demonstrated on meshes containing up to 350,000 vertices. Solutions using globally regenerated fine meshes as well as adaptively refined meshes are given.
Multigrid calculation of internal flows in complex geometries
NASA Technical Reports Server (NTRS)
Smith, K. M.; Vanka, S. P.
1992-01-01
The development, validation, and application of a general purpose multigrid solution algorithm and computer program for the computation of elliptic flows in complex geometries is presented. This computer program combines several desirable features including a curvilinear coordinate system, collocated arrangement of the variables, and Full Multi-Grid/Full Approximation Scheme (FMG/FAS). Provisions are made for the inclusion of embedded obstacles and baffles inside the flow domain. The momentum and continuity equations are solved in a decoupled manner and a pressure corrective equation is used to update the pressures such that the fluxes at the cell faces satisfy local mass continuity. Despite the computational overhead required in the restriction and prolongation phases of the multigrid cycling, the superior convergence results in reduced overall CPU time. The numerical scheme and selected results of several validation flows are presented. Finally, the procedure is applied to study the flowfield in a side-inlet dump combustor and twin jet impingement from a simulated aircraft fuselage.
Final Report: Subcontract B623868 Algebraic Multigrid solvers for coupled PDE systems
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brannick, J.
The Pennsylvania State University (“Subcontractor”) continued to work on the design of algebraic multigrid solvers for coupled systems of partial differential equations (PDEs) arising in numerical modeling of various applications, with a main focus on solving the Dirac equation arising in Quantum Chromodynamics (QCD). The goal of the proposed work was to develop combined geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers for these QCD systems. The research in these areas built on previous works, focusing on the following three topics: (1) the development of parallel full-multigrid (PFMG) andmore » non-Galerkin coarsening techniques in this frame work for solving the Wilson Dirac system; (2) the use of these same Wilson MG solvers for preconditioning the Overlap and Domain Wall formulations of the Dirac equation; and (3) the design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity.« less
Applications of Space-Filling-Curves to Cartesian Methods for CFD
NASA Technical Reports Server (NTRS)
Aftosmis, M. J.; Murman, S. M.; Berger, M. J.
2003-01-01
This paper presents a variety of novel uses of space-filling-curves (SFCs) for Cartesian mesh methods in CFD. While these techniques will be demonstrated using non-body-fitted Cartesian meshes, many are applicable on general body-fitted meshes-both structured and unstructured. We demonstrate the use of single theta(N log N) SFC-based reordering to produce single-pass (theta(N)) algorithms for mesh partitioning, multigrid coarsening, and inter-mesh interpolation. The intermesh interpolation operator has many practical applications including warm starts on modified geometry, or as an inter-grid transfer operator on remeshed regions in moving-body simulations Exploiting the compact construction of these operators, we further show that these algorithms are highly amenable to parallelization. Examples using the SFC-based mesh partitioner show nearly linear speedup to 640 CPUs even when using multigrid as a smoother. Partition statistics are presented showing that the SFC partitions are, on-average, within 15% of ideal even with only around 50,000 cells in each sub-domain. The inter-mesh interpolation operator also has linear asymptotic complexity and can be used to map a solution with N unknowns to another mesh with M unknowns with theta(M + N) operations. This capability is demonstrated both on moving-body simulations and in mapping solutions to perturbed meshes for control surface deflection or finite-difference-based gradient design methods.
Progress Towards a Cartesian Cut-Cell Method for Viscous Compressible Flow
NASA Technical Reports Server (NTRS)
Berger, Marsha; Aftosmis, Michael J.
2012-01-01
We present preliminary development of an approach for simulating high Reynolds number steady compressible flow in two space dimensions using a Cartesian cut-cell finite volume method. We consider both laminar and turbulent flow with both low and high cell Reynolds numbers near the wall. The approach solves the full Navier-Stokes equations in all cells, and uses a wall model to address the resolution requirements near boundaries and to mitigate mesh irregularities in cut cells. We present a quadratic wall model for low cell Reynolds numbers. At high cell Reynolds numbers, the quadratic is replaced with a newly developed analytic wall model stemming from solution of a limiting form of the Spalart-Allmaras turbulence model which features a forward evaluation for flow velocity and exactly matches characteristics of the SA turbulence model in the field. We develop multigrid operators which attain convergence rates similar to inviscid multigrid. Investigations focus on preliminary verification and validation of the method. Flows over flat plates and compressible airfoils show good agreement with both theoretical results and experimental data. Mesh convergence studies on sub- and transonic airfoil flows show convergence of surface pressures with wall spacings as large as approx.0.1% chord. With the current analytic wall model, one or two additional refinements near the wall are required to obtain mesh converged values of skin friction.
NASA Astrophysics Data System (ADS)
Webb, Anthony J.
Phase Change Materials (PCMs), like paraffin wax, can be used for passive thermal management of portable electronics if their overall bulk thermal conductivity is increased through the addition of highly conducting nanoparticles. Finite Element Analysis (FEA) is used to investigate the influence of nanoparticle agglomeration on the overall conductive thermal transport in a nanoenhanced composite by dictating the thermal conductivity of individual elements according to their local inclusion volume fraction and characteristics inside a low conducting PCM matrix. The inclusion density distribution is dictated by an agglomeration factor, and the effective thermal conductivity of each element is calculated from the nanoparticle volume fraction using a method similar to the Representative Volume Element (RVE) methodology. FEA studies are performed for 2-D and 3-D models. In the 2-D model, the grain boundary is fixed at x = 0 for simplicity. For the 3-D model, the grain boundary geometry is randomly varied. A negligible 2-D effect on thermal transport in the 2-D model is seen, so a 1-D thermal resistance network is created for comparison, and the results agree within 4%.The influence of the agglomeration factor and contact Biot number on the overall bulk thermal conductivity is determined by applying Fourier's Law on the entire simulated composite. For the 2-D and 3-D models with a contact Biot number above 1, the overall bulk thermal conductivity decreases prior to the percolation threshold being met and then increases with increasing agglomeration. Finally, a MatlabRTM based image processing tool is created to estimate the agglomeration factor based on an experimental image of a nanoparticle distribution, with a calculated approximate agglomeration value of Beta*L = 5 which results in a bulk thermal conductivity of 0.278 W/(m-K).
Shen, Yonglin
2017-01-01
This paper adopts the PM2.5 concentration data obtained from 1497 station-based monitoring sites, population and gross domestic product (GDP) census data, revealing population exposure and economic effects of PM2.5 in four typical urban agglomerations of China, i.e., Beijing-Tianjin-Hebei (BTH), the Yangtze River delta (YRD), the Pearl River delta (PRD), and Chengdu-Chongqing (CC). The Cokriging interpolation method was used to estimate the PM2.5 concentration from station-level to grid-level. Next, an evaluation was conducted mainly at the grid-level with a cell size of 1 × 1 km, assisted by the urban agglomeration scale. Criteria including the population-weighted mean, the cumulative percent distribution and the correlation coefficient were applied in our evaluation. The results showed that the spatial pattern of population exposure in BTH was consistent with that of PM2.5 concentration, as well as changes in elevation. The topography was also an important factor in the accumulation of PM2.5 in CC. Moreover, the most polluted urban agglomeration based on the population-weighted mean was BTH, while the least was PRD. In terms of the cumulative percent distribution, only 0.51% of the population who lived in the four urban agglomerations, and 2.33% of the GDP that was produced in the four urban agglomerations, were associated with an annual PM2.5 concentration smaller than the Chinese National Ambient Air Quality Standard of 35 µg/m3. This indicates that the majority of people live in the high air polluted areas, and economic development contributes to air pollution. Our results are supported by the high correlation between population exposure and the corresponding GDP in each urban agglomeration. PMID:28671643
Method of preparing thin porous sheets of ceramic material
Swarr, Thomas E.; Nickols, Richard C.; Krasij, Myron
1987-03-24
A method of forming thin porous sheets of ceramic material for use as electrodes or other components in a molten carbonate fuel cell is disclosed. The method involves spray drying a slurry of fine ceramic particles in liquid carrier to produce generally spherical agglomerates of high porosity and a rough surface texture. The ceramic particles may include the electrode catalyst and the agglomerates can be calcined to improve mechanical strength. After slurrying with suitable volatile material and binder tape casting is used to form sheets that are sufficiently strong for further processing and handling in the assembly of a high temperature fuel cell.
Method of preparing thin porous sheets of ceramic material
Swarr, T.E.; Nickols, R.C.; Krasij, M.
1984-05-23
A method of forming thin porous sheets of ceramic material for use as electrodes or other components in a molten carbonate fuel cell is disclosed. The method involves spray drying a slurry of fine ceramic particles in liquid carrier to produce generally spherical agglomerates of high porosity and a rough surface texture. The ceramic particles may include the electrode catalyst and the agglomerates can be calcined to improve mechanical strength. After slurrying with suitable volatile material and binder tape casting is used to form sheets that are sufficiently strong for further processing and handling in the assembly of a high temperature fuel cell.
Advanced Multi-phase Flow CFD Model Development for Solid Rocket Motor Flowfield Analysis
NASA Technical Reports Server (NTRS)
Liaw, Paul; Chen, Yen-Sen
1995-01-01
A Navier-Stokes code, finite difference Navier-Stokes (FDNS), is used to analyze the complicated internal flowfield of the SRM (solid rocket motor) to explore the impacts due to the effects of chemical reaction, particle dynamics, and slag accumulation on the solid rocket motor (SRM). The particulate multi-phase flowfield with chemical reaction, particle evaporation, combustion, breakup, and agglomeration models are included in present study to obtain a better understanding of the SRM design. Finite rate chemistry model is applied to simulate the chemical reaction effects. Hermsen correlation model is used for the combustion simulation. The evaporation model introduced by Spalding is utilized to include the heat transfer from the particulate phase to the gase phase due to the evaporation of the particles. A correlation of the minimum particle size for breakup expressed in terms of the Al/Al2O3 surface tension and shear force was employed to simulate the breakup of particles. It is assumed that the breakup occurs when the Weber number exceeds 6. A simple L agglomeration model is used to investigate the particle agglomeration. However, due to the large computer memory requirements for the agglomeration model, only 2D cases are tested with the agglomeration model. The VOF (Volume of Fluid) method is employed to simulate the slag buildup in the aft-end cavity of the redesigned solid rocket motor (RSRM). Monte Carlo method is employed to calculate the turbulent dispersion effect of the particles. The flowfield analysis obtained using the FDNS code in the present research with finite rate chemical reaction, particle evaporation, combustion, breakup, agglomeration, and VOG models will provide a design guide for the potential improvement of the SRM including the use of materials and the shape of nozzle geometry such that a better performance of the SRM can be achieved. The simulation of the slag buildup in the aft-end cavity can assist the designer to improve the design of the RSRM geometry.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Druinsky, Alex; Ghysels, Pieter; Li, Xiaoye S.
In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism andmore » made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.« less
NASA Astrophysics Data System (ADS)
Ivankovic, A.; Muzaferija, S.; Demirdzic, I.
1997-07-01
Rapid Crack Propagation (RCP) along pressurised plastic pipes is by far the most dangerous pipe failure mode. Despite the economic benefits offered by increasing pipe size and operating pressure, both strategies increase the risk and the potential consequences of RCP. It is therefore extremely important to account for RCP in establishing the safe operational conditions. Combined experimental-numerical study is the only reliable approach of addressing the problem, and extensive research is undertaken by various fracture groups (e.g. Southwest Research Institute - USA, Imperial College - UK). This paper presents numerical results from finite volume modelling of full-scale test on medium density polyethylene gas pressurised pipes. The crack speed and pressure profile are prescribed in the analysis. Both steady-state and transient RCPs are considered, and the comparison between the two shown. The steady-state results are efficiently achieved employing a full multigrid acceleration technique, where sets of progressively finer grids are used in V-cycles. Also, the effect of inelastic behaviour of polyethylene on RCP results is demonstrated.
NASA Technical Reports Server (NTRS)
Agrawal, Gagan; Sussman, Alan; Saltz, Joel
1993-01-01
Scientific and engineering applications often involve structured meshes. These meshes may be nested (for multigrid codes) and/or irregularly coupled (called multiblock or irregularly coupled regular mesh problems). A combined runtime and compile-time approach for parallelizing these applications on distributed memory parallel machines in an efficient and machine-independent fashion was described. A runtime library which can be used to port these applications on distributed memory machines was designed and implemented. The library is currently implemented on several different systems. To further ease the task of application programmers, methods were developed for integrating this runtime library with compilers for HPK-like parallel programming languages. How this runtime library was integrated with the Fortran 90D compiler being developed at Syracuse University is discussed. Experimental results to demonstrate the efficacy of our approach are presented. A multiblock Navier-Stokes solver template and a multigrid code were experimented with. Our experimental results show that our primitives have low runtime communication overheads. Further, the compiler parallelized codes perform within 20 percent of the code parallelized by manually inserting calls to the runtime library.
Development of an explicit multiblock/multigrid flow solver for viscous flows in complex geometries
NASA Technical Reports Server (NTRS)
Steinthorsson, E.; Liou, M. S.; Povinelli, L. A.
1993-01-01
A new computer program is being developed for doing accurate simulations of compressible viscous flows in complex geometries. The code employs the full compressible Navier-Stokes equations. The eddy viscosity model of Baldwin and Lomax is used to model the effects of turbulence on the flow. A cell centered finite volume discretization is used for all terms in the governing equations. The Advection Upwind Splitting Method (AUSM) is used to compute the inviscid fluxes, while central differencing is used for the diffusive fluxes. A four-stage Runge-Kutta time integration scheme is used to march solutions to steady state, while convergence is enhanced by a multigrid scheme, local time-stepping, and implicit residual smoothing. To enable simulations of flows in complex geometries, the code uses composite structured grid systems where all grid lines are continuous at block boundaries (multiblock grids). Example results shown are a flow in a linear cascade, a flow around a circular pin extending between the main walls in a high aspect-ratio channel, and a flow of air in a radial turbine coolant passage.
Development of an explicit multiblock/multigrid flow solver for viscous flows in complex geometries
NASA Technical Reports Server (NTRS)
Steinthorsson, E.; Liou, M.-S.; Povinelli, L. A.
1993-01-01
A new computer program is being developed for doing accurate simulations of compressible viscous flows in complex geometries. The code employs the full compressible Navier-Stokes equations. The eddy viscosity model of Baldwin and Lomax is used to model the effects of turbulence on the flow. A cell centered finite volume discretization is used for all terms in the governing equations. The Advection Upwind Splitting Method (AUSM) is used to compute the inviscid fluxes, while central differencing is used for the diffusive fluxes. A four-stage Runge-Kutta time integration scheme is used to march solutions to steady state, while convergence is enhanced by a multigrid scheme, local time-stepping and implicit residual smoothing. To enable simulations of flows in complex geometries, the code uses composite structured grid systems where all grid lines are continuous at block boundaries (multiblock grids). Example results are shown a flow in a linear cascade, a flow around a circular pin extending between the main walls in a high aspect-ratio channel, and a flow of air in a radial turbine coolant passage.
Distributed Relaxation for Conservative Discretizations
NASA Technical Reports Server (NTRS)
Diskin, Boris; Thomas, James L.
2001-01-01
A multigrid method is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work that is a small (less than 10) multiple of the operation count in one target-grid residual evaluation. The way to achieve this efficiency is the distributed relaxation approach. TME solvers employing distributed relaxation have already been demonstrated for nonconservative formulations of high-Reynolds-number viscous incompressible and subsonic compressible flow regimes. The purpose of this paper is to provide foundations for applications of distributed relaxation to conservative discretizations. A direct correspondence between the primitive variable interpolations for calculating fluxes in conservative finite-volume discretizations and stencils of the discretized derivatives in the nonconservative formulation has been established. Based on this correspondence, one can arrive at a conservative discretization which is very efficiently solved with a nonconservative relaxation scheme and this is demonstrated for conservative discretization of the quasi one-dimensional Euler equations. Formulations for both staggered and collocated grid arrangements are considered and extensions of the general procedure to multiple dimensions are discussed.
Optimization of refractive liquid crystal lenses using an efficient multigrid simulation.
Milton, Harry; Brimicombe, Paul; Morgan, Philip; Gleeson, Helen; Clamp, John
2012-05-07
A multigrid computational model has been developed to assess the performance of refractive liquid crystal lenses, which is up to 40 times faster than previous techniques. Using this model, the optimum geometries producing an ideal parabolic voltage distribution were deduced for refractive liquid crystal lenses with diameters from 1 to 9 mm. The ratio of insulation thickness to lens diameter was determined to be 1:2 for small diameter lenses, tending to 1:3 for larger lenses. The model is used to propose a new method of lens operation with lower operating voltages needed to induce specific optical powers. The operating voltages are calculated for the induction of optical powers between + 1.00 D and + 3.00 D in a 3 mm diameter lens, with the speed of the simulation facilitating the optimization of the refractive index profile. We demonstrate that the relationship between additional applied voltage and optical power is approximately linear for optical powers under + 3.00 D. The versatility of the computational simulation has also been demonstrated by modeling of in-plane electrode liquid crystal devices.
1980-10-01
faster than previous algorithms. Indeed, with only minor modifications, the standard multigrid programs solve the LCP with essentially the same efficiency... Lemna 2.2. Let Uk be the solution of the LCP (2.3), and let uk > 0 be an approximate solu- tion obtained after one or more Gk projected sweeps. Let...in Figure 3.2, Ivu IIG decreased from .293 10 to .110 10 with the expenditure of (99.039-94.400) = 4.639 work units. While minor variations do arise, a
Porru, Marcella; Özkan, Leyla
2017-05-24
This paper develops a new simulation model for crystal size distribution dynamics in industrial batch crystallization. The work is motivated by the necessity of accurate prediction models for online monitoring purposes. The proposed numerical scheme is able to handle growth, nucleation, and agglomeration kinetics by means of the population balance equation and the method of characteristics. The former offers a detailed description of the solid phase evolution, while the latter provides an accurate and efficient numerical solution. In particular, the accuracy of the prediction of the agglomeration kinetics, which cannot be ignored in industrial crystallization, has been assessed by comparing it with solutions in the literature. The efficiency of the solution has been tested on a simulation of a seeded flash cooling batch process. Since the proposed numerical scheme can accurately simulate the system behavior more than hundred times faster than the batch duration, it is suitable for online applications such as process monitoring tools based on state estimators.
2017-01-01
This paper develops a new simulation model for crystal size distribution dynamics in industrial batch crystallization. The work is motivated by the necessity of accurate prediction models for online monitoring purposes. The proposed numerical scheme is able to handle growth, nucleation, and agglomeration kinetics by means of the population balance equation and the method of characteristics. The former offers a detailed description of the solid phase evolution, while the latter provides an accurate and efficient numerical solution. In particular, the accuracy of the prediction of the agglomeration kinetics, which cannot be ignored in industrial crystallization, has been assessed by comparing it with solutions in the literature. The efficiency of the solution has been tested on a simulation of a seeded flash cooling batch process. Since the proposed numerical scheme can accurately simulate the system behavior more than hundred times faster than the batch duration, it is suitable for online applications such as process monitoring tools based on state estimators. PMID:28603342
A fast direct solver for a class of two-dimensional separable elliptic equations on the sphere
NASA Technical Reports Server (NTRS)
Moorthi, Shrinivas; Higgins, R. Wayne
1992-01-01
An efficient, direct, second-order solver for the discrete solution of two-dimensional separable elliptic equations on the sphere is presented. The method involves a Fourier transformation in longitude and a direct solution of the resulting coupled second-order finite difference equations in latitude. The solver is made efficient by vectorizing over longitudinal wavenumber and by using a vectorized fast Fourier transform routine. It is evaluated using a prescribed solution method and compared with a multigrid solver and the standard direct solver from FISHPAK.
A comparison of two central difference schemes for solving the Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Maksymiuk, C. M.; Swanson, R. C.; Pulliam, T. H.
1990-01-01
Five viscous transonic airfoil cases were computed by two significantly different computational fluid dynamics codes: An explicit finite-volume algorithm with multigrid, and an implicit finite-difference approximate-factorization method with Eigenvector diagonalization. Both methods are described in detail, and their performance on the test cases is compared. The codes utilized the same grids, turbulence model, and computer to provide the truest test of the algorithms. The two approaches produce very similar results, which, for attached flows, also agree well with experimental results; however, the explicit code is considerably faster.
The Effects of Dissipation and Coarse Grid Resolution for Multigrid in Flow Problems
NASA Technical Reports Server (NTRS)
Eliasson, Peter; Engquist, Bjoern
1996-01-01
The objective of this paper is to investigate the effects of the numerical dissipation and the resolution of the solution on coarser grids for multigrid with the Euler equation approximations. The convergence is accomplished by multi-stage explicit time-stepping to steady state accelerated by FAS multigrid. A theoretical investigation is carried out for linear hyperbolic equations in one and two dimensions. The spectra reveals that for stability and hence robustness of spatial discretizations with a small amount of numerical dissipation the grid transfer operators have to be accurate enough and the smoother of low temporal accuracy. Numerical results give grid independent convergence in one dimension. For two-dimensional problems with a small amount of numerical dissipation, however, only a few grid levels contribute to an increased speed of convergence. This is explained by the small numerical dissipation leading to dispersion. Increasing the mesh density and hence making the problem over resolved increases the number of mesh levels contributing to an increased speed of convergence. If the steady state equations are elliptic, all grid levels contribute to the convergence regardless of the mesh density.
Multilevel filtering elliptic preconditioners
NASA Technical Reports Server (NTRS)
Kuo, C. C. Jay; Chan, Tony F.; Tong, Charles
1989-01-01
A class of preconditioners is presented for elliptic problems built on ideas borrowed from the digital filtering theory and implemented on a multilevel grid structure. They are designed to be both rapidly convergent and highly parallelizable. The digital filtering viewpoint allows the use of filter design techniques for constructing elliptic preconditioners and also provides an alternative framework for understanding several other recently proposed multilevel preconditioners. Numerical results are presented to assess the convergence behavior of the new methods and to compare them with other preconditioners of multilevel type, including the usual multigrid method as preconditioner, the hierarchical basis method and a recent method proposed by Bramble-Pasciak-Xu.
Efficient solution of the simplified P N equations
Hamilton, Steven P.; Evans, Thomas M.
2014-12-23
We show new solver strategies for the multigroup SPN equations for nuclear reactor analysis. By forming the complete matrix over space, moments, and energy a robust set of solution strategies may be applied. Moreover, power iteration, shifted power iteration, Rayleigh quotient iteration, Arnoldi's method, and a generalized Davidson method, each using algebraic and physics-based multigrid preconditioners, have been compared on C5G7 MOX test problem as well as an operational PWR model. These results show that the most ecient approach is the generalized Davidson method, that is 30-40 times faster than traditional power iteration and 6-10 times faster than Arnoldi's method.
Allahham, Ayman; Stewart, Peter J; Das, Shyamal C
2013-11-30
Influence of ternary, poorly water-soluble components on the agglomerate strength of cohesive indomethacin mixtures during dissolution was studied to explore the relationship between agglomerate strength and extent of de-agglomeration and dissolution of indomethacin (Ind). Dissolution profiles of Ind from 20% Ind-lactose binary mixtures, and ternary mixtures containing additional dibasic calcium phosphate (1% or 10%; DCP), calcium sulphate (10%) and talc (10%) were determined. Agglomerate strength distributions were estimated by Monte Carlo simulation of particle size, work of cohesion and packing fraction distributions. The agglomerate strength of Ind decreased from 1.19 MPa for the binary Ind mixture to 0.84 MPa for 1DCP:20Ind mixture and to 0.42 MPa for 1DCP:2Ind mixture. Both extent of de-agglomeration, demonstrated by the concentration of the dispersed indomethacin distribution, and extent of dispersion, demonstrated by the particle size of the dispersed indomethacin, were in descending order of 1DCP:2Ind>1DCP:20Ind>binary Ind. The addition of calcium sulphate dihydrate and talc also reduced the agglomerate strength and improved de-agglomeration and dispersion of indomethacin. While not definitively causal, the improved de-agglomeration and dispersion of a poorly water soluble drug by poorly water soluble components was related to the agglomerate strength of the cohesive matrix during dissolution. Copyright © 2013 Elsevier B.V. All rights reserved.
In vitro dosimetry of agglomerates
NASA Astrophysics Data System (ADS)
Hirsch, V.; Kinnear, C.; Rodriguez-Lorenzo, L.; Monnier, C. A.; Rothen-Rutishauser, B.; Balog, S.; Petri-Fink, A.
2014-06-01
Agglomeration of nanoparticles in biological fluids is a pervasive phenomenon that leads to difficulty in the interpretation of results from in vitro exposure, primarily due to differing particokinetics of agglomerates to nanoparticles. Therefore, well-defined small agglomerates were designed that possessed different particokinetic profiles, and their cellular uptake was compared to a computational model of dosimetry. The approach used here paves the way for a better understanding of the impact of agglomeration on the nanoparticle-cell interaction.Agglomeration of nanoparticles in biological fluids is a pervasive phenomenon that leads to difficulty in the interpretation of results from in vitro exposure, primarily due to differing particokinetics of agglomerates to nanoparticles. Therefore, well-defined small agglomerates were designed that possessed different particokinetic profiles, and their cellular uptake was compared to a computational model of dosimetry. The approach used here paves the way for a better understanding of the impact of agglomeration on the nanoparticle-cell interaction. Electronic supplementary information (ESI) available: ITC data for tiopronin/Au-NP interactions, agglomeration kinetics at different pHs for tiopronin-coated Au-NPs, UV-Vis spectra in water, PBS and DMEM and temporal correlation functions for single Au-NPs and corresponding agglomerates, calculation of diffusion and sedimentation parameters, modelling of relative cell uptake based on the ISDD model and cytotoxicity of single Au-NPs and their agglomerates, and synthesis and cell uptake of large spherical Au-NPs. See DOI: 10.1039/c4nr00460d
Transport and Deposition of Welding Fume Agglomerates in a Realistic Human Nasal Airway.
Tian, Lin; Inthavong, Kiao; Lidén, Göran; Shang, Yidan; Tu, Jiyuan
2016-07-01
Welding fume is a complex mixture containing ultra-fine particles in the nanometer range. Rather than being in the form of a singular sphere, due to the high particle concentration, welding fume particles agglomerate into long straight chains, branches, or other forms of compact shapes. Understanding the transport and deposition of these nano-agglomerates in human respiratory systems is of great interest as welding fumes are a known health hazard. The neurotoxin manganese (Mn) is a common element in welding fumes. Particulate Mn, either as soluble salts or oxides, that has deposited on the olfactory mucosa in human nasal airway is transported along the olfactory nerve to the olfactory bulb within the brain. If this Mn is further transported to the basal ganglia of the brain, it could accumulate at the part of the brain that is the focal point of its neurotoxicity. Accounting for various dynamic shape factors due to particle agglomeration, the current computational study is focused on the exposure route, the deposition pattern, and the deposition efficiency of the inhaled welding fume particles in a realistic human nasal cavity. Particular attention is given to the deposition pattern and deposition efficiency of inhaled welding fume agglomerates in the nasal olfactory region. For particles in the nanoscale, molecular diffusion is the dominant transport mechanism. Therefore, Brownian diffusion, hydrodynamic drag, Saffman lift force, and gravitational force are included in the model study. The deposition efficiencies for single spherical particles, two kinds of agglomerates of primary particles, two-dimensional planar and straight chains, are investigated for a range of primary particle sizes and a range of number of primary particles per agglomerate. A small fraction of the inhaled welding fume agglomerates is deposited on the olfactory mucosa, approximately in the range 0.1-1%, and depends on particle size and morphology. The strong size dependence of the deposition in olfactory mucosa on particle size implies that the occupation deposition of welding fume manganese can be expected to vary with welding method. © The Author 2016. Published by Oxford University Press on behalf of the British Occupational Hygiene Society.
Two-Level Hierarchical FEM Method for Modeling Passive Microwave Devices
NASA Astrophysics Data System (ADS)
Polstyanko, Sergey V.; Lee, Jin-Fa
1998-03-01
In recent years multigrid methods have been proven to be very efficient for solving large systems of linear equations resulting from the discretization of positive definite differential equations by either the finite difference method or theh-version of the finite element method. In this paper an iterative method of the multiple level type is proposed for solving systems of algebraic equations which arise from thep-version of the finite element analysis applied to indefinite problems. A two-levelV-cycle algorithm has been implemented and studied with a Gauss-Seidel iterative scheme used as a smoother. The convergence of the method has been investigated, and numerical results for a number of numerical examples are presented.
Transport characteristics of nanoparticle-based ferrofluids in a gel model of the brain
Basak, Soubir; Brogan, David; Dietrich, Hans; Ritter, Rogers; Dacey, Ralph G; Biswas, Pratim
2009-01-01
A current advance in nanotechnology is the selective targeting of therapeutics by external magnetic field-guided delivery. This is an important area of research in medicine. The use of magnetic forces results in the formation of agglomerated structures in the field region. The transport characteristics of these agglomerated structures are explored. A nonintrusive method based on in situ light-scattering techniques is used to characterize the velocity of such particles in a magnetic field gradient. A transport model for the chain-like agglomerates is developed based on these experimental observations. The transport characteristics of magnetic nanoparticle drug carriers are then explored in gel-based simulated models of the brain. Results of such measurements demonstrate decreased diffusion of magnetic nanoparticles when placed in a high magnetic field gradient. PMID:19421367
Hou, Kang; Zhou, Jieting; Li, Xuxiang; Ge, Shengbin
2016-01-01
Analysis of human living environmental quality of Shenyang-Dalian urban agglomerations has important theoretical and practical significance in rapid development region. A lot of investigations have been carried for Shenyang-Dalian urban agglomerations, including 38 counties. Based on the carrying capacity of resources, natural and socioeconomic environmental factors and regional changes of human living environmental evaluation are analyzed with the application of geographic information systems (GIS) software. By using principal component analysis (PCA) model and natural breaks classification (NBC) method, the evaluation results are divided into five categories. The results show that the human living environmental evaluation (HLEE) indexes of Dalian, Shenyang, and Liaoyang are higher than other counties. Among these counties, the human living environmental evaluation (HLEE) indexes of coastal counties are significantly higher than inland counties. The range of the human living environmental evaluation index in most of the study area is at III, IV, and V levels, accounting for 80.01%. Based on these results, it could illustrate the human living environment is in relatively suitable condition in Shenyang-Dalian urban agglomeration. PMID:27200212
Rapidly converging multigrid reconstruction of cone-beam tomographic data
NASA Astrophysics Data System (ADS)
Myers, Glenn R.; Kingston, Andrew M.; Latham, Shane J.; Recur, Benoit; Li, Thomas; Turner, Michael L.; Beeching, Levi; Sheppard, Adrian P.
2016-10-01
In the context of large-angle cone-beam tomography (CBCT), we present a practical iterative reconstruction (IR) scheme designed for rapid convergence as required for large datasets. The robustness of the reconstruction is provided by the "space-filling" source trajectory along which the experimental data is collected. The speed of convergence is achieved by leveraging the highly isotropic nature of this trajectory to design an approximate deconvolution filter that serves as a pre-conditioner in a multi-grid scheme. We demonstrate this IR scheme for CBCT and compare convergence to that of more traditional techniques.
Generalization of mixed multiscale finite element methods with applications
DOE Office of Scientific and Technical Information (OSTI.GOV)
Lee, C S
Many science and engineering problems exhibit scale disparity and high contrast. The small scale features cannot be omitted in the physical models because they can affect the macroscopic behavior of the problems. However, resolving all the scales in these problems can be prohibitively expensive. As a consequence, some types of model reduction techniques are required to design efficient solution algorithms. For practical purpose, we are interested in mixed finite element problems as they produce solutions with certain conservative properties. Existing multiscale methods for such problems include the mixed multiscale finite element methods. We show that for complicated problems, the mixedmore » multiscale finite element methods may not be able to produce reliable approximations. This motivates the need of enrichment for coarse spaces. Two enrichment approaches are proposed, one is based on generalized multiscale finte element metthods (GMsFEM), while the other is based on spectral element-based algebraic multigrid (rAMGe). The former one, which is called mixed GMsFEM, is developed for both Darcy’s flow and linear elasticity. Application of the algorithm in two-phase flow simulations are demonstrated. For linear elasticity, the algorithm is subtly modified due to the symmetry requirement of the stress tensor. The latter enrichment approach is based on rAMGe. The algorithm differs from GMsFEM in that both of the velocity and pressure spaces are coarsened. Due the multigrid nature of the algorithm, recursive application is available, which results in an efficient multilevel construction of the coarse spaces. Stability, convergence analysis, and exhaustive numerical experiments are carried out to validate the proposed enrichment approaches. iii« less
Prediction of Agglomeration, Fouling, and Corrosion Tendency of Fuels in CFB Co-Combustion
NASA Astrophysics Data System (ADS)
Barišć, Vesna; Zabetta, Edgardo Coda; Sarkki, Juha
Prediction of agglomeration, fouling, and corrosion tendency of fuels is essential to the design of any CFB boiler. During the years, tools have been successfully developed at Foster Wheeler to help with such predictions for the most commercial fuels. However, changes in fuel market and the ever-growing demand for co-combustion capabilities pose a continuous need for development. This paper presents results from recently upgraded models used at Foster Wheeler to predict agglomeration, fouling, and corrosion tendency of a variety of fuels and mixtures. The models, subject of this paper, are semi-empirical computer tools that combine the theoretical basics of agglomeration/fouling/corrosion phenomena with empirical correlations. Correlations are derived from Foster Wheeler's experience in fluidized beds, including nearly 10,000 fuel samples and over 1,000 tests in about 150 CFB units. In these models, fuels are evaluated based on their classification, their chemical and physical properties by standard analyses (proximate, ultimate, fuel ash composition, etc.;.) alongside with Foster Wheeler own characterization methods. Mixtures are then evaluated taking into account the component fuels. This paper presents the predictive capabilities of the agglomeration/fouling/corrosion probability models for selected fuels and mixtures fired in full-scale. The selected fuels include coals and different types of biomass. The models are capable to predict the behavior of most fuels and mixtures, but also offer possibilities for further improvements.
Gyulai, Orsolya; Kovács, Anita; Sovány, Tamás; Csóka, Ildikó; Aigner, Zoltán
2018-04-20
This research work presents the use of the Quality by Design (QbD) concept for optimization of the spherical agglomeration crystallization method in the case of the active agent, ambroxol hydrochloride (AMB HCl). AMB HCl spherical crystals were formulated by the spherical agglomeration method, which was applied as an antisolvent technique. Spherical crystals have good flowing properties, which makes the direct compression tableting method applicable. This means that the amount of additives used can be reduced and smaller tablets can be formed. For the risk assessment, LeanQbD Software was used. According to its results, four independent variables (mixing type and time, dT (temperature difference between solvent and antisolvent), and composition (solvent/antisolvent volume ratio)) and three dependent variables (mean particle size, aspect ratio, and roundness) were selected. Based on these, a 2⁻3 mixed-level factorial design was constructed, crystallization was accomplished, and the results were evaluated using Statistica for Windows 13 program. Product assay was performed and it was revealed that improvements in the mean particle size (from ~13 to ~200 µm), roundness (from ~2.4 to ~1.5), aspect ratio (from ~1.7 to ~1.4), and flow properties were observed while polymorphic transitions were avoided.
Simple numerical method for predicting steady compressible flows
NASA Technical Reports Server (NTRS)
Vonlavante, Ernst; Nelson, N. Duane
1986-01-01
A numerical method for solving the isenthalpic form of the governing equations for compressible viscous and inviscid flows was developed. The method was based on the concept of flux vector splitting in its implicit form. The method was tested on several demanding inviscid and viscous configurations. Two different forms of the implicit operator were investigated. The time marching to steady state was accelerated by the implementation of the multigrid procedure. Its various forms very effectively increased the rate of convergence of the present scheme. High quality steady state results were obtained in most of the test cases; these required only short computational times due to the relative efficiency of the basic method.
Agglomerating combustor-gasifier method and apparatus for coal gasification
Chen, Joseph L. P.; Archer, David H.
1976-09-21
A method and apparatus for gasifying coal wherein the gasification takes place in a spout fluid bed at a pressure of about 10 to 30 atmospheres and a temperature of about 1800.degree. to 2200.degree.F and wherein the configuration of the apparatus and the manner of introduction of gases for combustion and fluidization is such that agglomerated ash can be withdrawn from the bottom of the apparatus and gas containing very low dust loading is produced. The gasification reaction is self-sustaining through the burning of a stoichiometric amount of coal with air in the lower part of the apparatus to form the spout within the fluid bed. The method and apparatus are particularly suitable for gasifying coarse coal particles.
Good, Robert J.; Badgujar, Mohan
1992-01-01
A method for the beneficiation of coal by selective agglomeration and the beneficiated coal product thereof is disclosed wherein coal, comprising impurities, is comminuted to a particle size sufficient to allow impurities contained therein to disperse in water, an aqueous slurry is formed with the comminuted coal particles, treated with a compound, such as a polysaccharide and/or disaccharide, to increase the relative hydrophilicity of hydrophilic components, and thereafter the slurry is treated with sufficient liquid agglomerant to form a coagulum comprising reduced impurity coal.
Fully anisotropic 3-D EM modelling on a Lebedev grid with a multigrid pre-conditioner
NASA Astrophysics Data System (ADS)
Jaysaval, Piyoosh; Shantsev, Daniil V.; de la Kethulle de Ryhove, Sébastien; Bratteland, Tarjei
2016-12-01
We present a numerical algorithm for 3-D electromagnetic (EM) simulations in conducting media with general electric anisotropy. The algorithm is based on the finite-difference discretization of frequency-domain Maxwell's equations on a Lebedev grid, in which all components of the electric field are collocated but half a spatial step staggered with respect to the magnetic field components, which also are collocated. This leads to a system of linear equations that is solved using a stabilized biconjugate gradient method with a multigrid preconditioner. We validate the accuracy of the numerical results for layered and 3-D tilted transverse isotropic (TTI) earth models representing typical scenarios used in the marine controlled-source EM method. It is then demonstrated that not taking into account the full anisotropy of the conductivity tensor can lead to misleading inversion results. For synthetic data corresponding to a 3-D model with a TTI anticlinal structure, a standard vertical transverse isotropic (VTI) inversion is not able to image a resistor, while for a 3-D model with a TTI synclinal structure it produces a false resistive anomaly. However, if the VTI forward solver used in the inversion is replaced by the proposed TTI solver with perfect knowledge of the strike and dip of the dipping structures, the resulting resistivity images become consistent with the true models.
P1 Nonconforming Finite Element Method for the Solution of Radiation Transport Problems
NASA Technical Reports Server (NTRS)
Kang, Kab S.
2002-01-01
The simulation of radiation transport in the optically thick flux-limited diffusion regime has been identified as one of the most time-consuming tasks within large simulation codes. Due to multimaterial complex geometry, the radiation transport system must often be solved on unstructured grids. In this paper, we investigate the behavior and the benefits of the unstructured P(sub 1) nonconforming finite element method, which has proven to be flexible and effective on related transport problems, in solving unsteady implicit nonlinear radiation diffusion problems using Newton and Picard linearization methods. Key words. nonconforrning finite elements, radiation transport, inexact Newton linearization, multigrid preconditioning
A multi-level solution algorithm for steady-state Markov chains
NASA Technical Reports Server (NTRS)
Horton, Graham; Leutenegger, Scott T.
1993-01-01
A new iterative algorithm, the multi-level algorithm, for the numerical solution of steady state Markov chains is presented. The method utilizes a set of recursively coarsened representations of the original system to achieve accelerated convergence. It is motivated by multigrid methods, which are widely used for fast solution of partial differential equations. Initial results of numerical experiments are reported, showing significant reductions in computation time, often an order of magnitude or more, relative to the Gauss-Seidel and optimal SOR algorithms for a variety of test problems. The multi-level method is compared and contrasted with the iterative aggregation-disaggregation algorithm of Takahashi.
Physicochemical cleaning and recovery of coal
NASA Astrophysics Data System (ADS)
Wheelock, T. D.
1982-03-01
The development and demonstration of a method of depressing iron pyrites which is applicable to both the froth flotation and oil agglomeration methods of cleaning and recoverying fine-size coal are described.
On some variational acceleration techniques and related methods for local refinement
NASA Astrophysics Data System (ADS)
Teigland, Rune
1998-10-01
This paper shows that the well-known variational acceleration method described by Wachspress (E. Wachspress, Iterative Solution of Elliptic Systems and Applications to the Neutron Diffusion Equations of Reactor Physics, Prentice-Hall, Englewood Cliffs, NJ, 1966) and later generalized to multilevels (known as the additive correction multigrid method (B.R Huthchinson and G.D. Raithby, Numer. Heat Transf., 9, 511-537 (1986))) is similar to the FAC method of McCormick and Thomas (S.F McCormick and J.W. Thomas, Math. Comput., 46, 439-456 (1986)) and related multilevel methods. The performance of the method is demonstrated for some simple model problems using local refinement and suggestions for improving the performance of the method are given.
An efficient flexible-order model for 3D nonlinear water waves
NASA Astrophysics Data System (ADS)
Engsig-Karup, A. P.; Bingham, H. B.; Lindberg, O.
2009-04-01
The flexible-order, finite difference based fully nonlinear potential flow model described in [H.B. Bingham, H. Zhang, On the accuracy of finite difference solutions for nonlinear water waves, J. Eng. Math. 58 (2007) 211-228] is extended to three dimensions (3D). In order to obtain an optimal scaling of the solution effort multigrid is employed to precondition a GMRES iterative solution of the discretized Laplace problem. A robust multigrid method based on Gauss-Seidel smoothing is found to require special treatment of the boundary conditions along solid boundaries, and in particular on the sea bottom. A new discretization scheme using one layer of grid points outside the fluid domain is presented and shown to provide convergent solutions over the full physical and discrete parameter space of interest. Linear analysis of the fundamental properties of the scheme with respect to accuracy, robustness and energy conservation are presented together with demonstrations of grid independent iteration count and optimal scaling of the solution effort. Calculations are made for 3D nonlinear wave problems for steep nonlinear waves and a shoaling problem which show good agreement with experimental measurements and other calculations from the literature.
Method for producing ceramic particles and agglomerates
Phillips, Jonathan; Gleiman, Seth S.; Chen, Chun-Ku
2001-01-01
A method for generating spherical and irregularly shaped dense particles of ceramic oxides having a controlled particle size and particle size distribution. An aerosol containing precursor particles of oxide ceramics is directed into a plasma. As the particles flow through the hot zone of the plasma, they melt, collide, and join to form larger particles. If these larger particles remain in the hot zone, they continue melting and acquire a spherical shape that is retained after they exit the hot zone, cool down, and solidify. If they exit the hot zone before melting completely, their irregular shape persists and agglomerates are produced. The size and size distribution of the dense product particles can be controlled by adjusting several parameters, the most important in the case of powder precursors appears to be the density of powder in the aerosol stream that enters the plasma hot zone. This suggests that particle collision rate is responsible for determining ultimate size of the resulting sphere or agglomerate. Other parameters, particularly the gas flow rates and the microwave power, are also adjusted to control the particle size distribution.
A mixed solvent system for preparation of spherically agglomerated crystals of ascorbic acid.
Ren, Fuzheng; Zhou, Yaru; Liu, Yan; Fu, Jinping; Jing, Qiufang; Ren, Guobin
2017-09-01
The objective of this research was to develop a novel solvent system to prepare spherically agglomerated crystals (SAC) of ascorbic acid with improved flowability for direct compression. A spherical agglomeration method was developed by selecting the mixed solvents (n-butyl and ethyl acetate) as a poor solvent and the process was further optimized by using triangular phase diagram and particle vision measurement. Physiochemical properties of SAC were characterized and compared with original drug crystals. It showed that amount of poor solvent, ratio of solvent mixture, and drug concentration are critical for preparation of SAC with desirable properties. The solid state of SAC was same as original crystals according to DSC, XRD, and FT-IR results. There was no significant difference in solubility and dissolution rate of drug between SAC and original crystals. The flowability and packability of SAC as well as the tensile strength and elastic recovery of tablets made from SAC were all significantly improved when compared with original crystals and tablets from crystals. It is concluded that the present method was suitable to prepare SAC of ascorbic acid for direct compression.
Kinetic energy density and agglomerate abrasion rate during blending of agglomerates into powders.
Willemsz, Tofan A; Hooijmaijers, Ricardo; Rubingh, Carina M; Tran, Thanh N; Frijlink, Henderik W; Vromans, Herman; van der Voort Maarschalk, Kees
2012-01-23
Problems related to the blending of a cohesive powder with a free flowing bulk powder are frequently encountered in the pharmaceutical industry. The cohesive powder often forms lumps or agglomerates which are not dispersed during the mixing process and are therefore detrimental to blend uniformity. Achieving sufficient blend uniformity requires that the blending conditions are able to break up agglomerates, which is often an abrasion process. This study was based on the assumption that the abrasion rate of agglomerates determines the required blending time. It is shown that the kinetic energy density of the moving powder bed is a relevant parameter which correlates with the abrasion rate of agglomerates. However, aspects related to the strength of agglomerates should also be considered. For this reason the Stokes abrasion number (St(Abr)) has been defined. This parameter describes the ratio between the kinetic energy density of the moving powder bed and the work of fracture of the agglomerate. The St(Abr) number is shown to predict the abrasion potential of agglomerates in the dry-mixing process. It appeared possible to include effects of filler particle size and impeller rotational rate into this concept. A clear relationship between abrasion rate of agglomerates and the value of St(Abr) was demonstrated. Copyright © 2011 Elsevier B.V. All rights reserved.
Staged mold for encapsulating hazardous wastes
Unger, Samuel L.; Telles, Rodney W.; Lubowitz, Hyman R.
1990-01-01
A staged mold for stabilizing hazardous wastes for final disposal by molding an agglomerate of the hazardous wastes and encapsulating the agglomerate. Three stages are employed in the process. In the first stage, a first mold body is positioned on a first mold base, a mixture of the hazardous wastes and a thermosetting plastic is loaded into the mold, the mixture is mechanically compressed, heat is applied to cure the mixture to form a rigid agglomerate, and the first mold body is removed leaving the agglomerate sitting on the first mold base. In the second stage, a clamshell second mold body is positioned around the agglomerate and the first mold base, a powdered thermoplastic resin is poured on top of the agglomerate and in the gap between the sides of the agglomerate and the second mold body, the thermoplastic is compressed, heat is applied to melt the thermoplastic, and the plastic is cooled jacketing the agglomerate on the top and sides. In the third stage, the mold with the jacketed agglomerate is inverted, the first mold base is removed exposing the former bottom of the agglomerate, powdered thermoplastic is poured over the former bottom, the first mold base is replaced to compress the thermoplastic, heat is applied to melt the new thermoplastic and the top part of the jacket on the sides, the plastic is cooled jacketing the bottom and fusing with the jacketing on the sides to complete the seamless encapsulation of the agglomerate.
Staged mold for encapsulating hazardous wastes
Unger, Samuel L.; Telles, Rodney W.; Lubowitz, Hyman R.
1988-01-01
A staged mold for stabilizing hazardous wastes for final disposal by molding an agglomerate of the hazardous wastes and encapsulating the agglomerate. Three stages are employed in the process. In the first stage, a first mold body is positioned on a first mold base, a mixture of the hazardous wastes and a thermosetting plastic is loaded into the mold, the mixture is mechanically compressed, heat is applied to cure the mixture to form a rigid agglomerate, and the first mold body is removed leaving the agglomerate sitting on the first mold base. In the second stage, a clamshell second mold body is positioned around the agglomerate and the first mold base, a powdered thermoplastic resin is poured on top of the agglomerate and in the gap between the sides of the agglomerate and the second mold body, the thermoplastic is compressed, heat is applied to melt the thermoplastic, and the plastic is cooled jacketing the agglomerate on the top and sides. In the third stage, the mold with the jacketed agglomerate is inverted, the first mold base is removed exposing the former bottom of the agglomerate, powdered thermoplastic is poured over the former bottom, the first mold base is replaced to compress the thermoplastic, heat is applied to melt the new thermoplastic and the top part of the jacket on the sides, the plastic is cooled jacketing the bottom and fusing with the jacketing on the sides to complete the seamless encapsulation of the agglomerate.
On the Multilevel Solution Algorithm for Markov Chains
NASA Technical Reports Server (NTRS)
Horton, Graham
1997-01-01
We discuss the recently introduced multilevel algorithm for the steady-state solution of Markov chains. The method is based on an aggregation principle which is well established in the literature and features a multiplicative coarse-level correction. Recursive application of the aggregation principle, which uses an operator-dependent coarsening, yields a multi-level method which has been shown experimentally to give results significantly faster than the typical methods currently in use. When cast as a multigrid-like method, the algorithm is seen to be a Galerkin-Full Approximation Scheme with a solution-dependent prolongation operator. Special properties of this prolongation lead to the cancellation of the computationally intensive terms of the coarse-level equations.
On the Performance of an Algebraic MultigridSolver on Multicore Clusters
DOE Office of Scientific and Technical Information (OSTI.GOV)
Baker, A H; Schulz, M; Yang, U M
2010-04-29
Algebraic multigrid (AMG) solvers have proven to be extremely efficient on distributed-memory architectures. However, when executed on modern multicore cluster architectures, we face new challenges that can significantly harm AMG's performance. We discuss our experiences on such an architecture and present a set of techniques that help users to overcome the associated problems, including thread and process pinning and correct memory associations. We have implemented most of the techniques in a MultiCore SUPport library (MCSup), which helps to map OpenMP applications to multicore machines. We present results using both an MPI-only and a hybrid MPI/OpenMP model.
NASA Technical Reports Server (NTRS)
Roberts, Thomas W.; Sidilkover, David; Thomas, J. L.
2000-01-01
The second-order factorizable discretization of the compressible Euler equations developed by Sidilkover is extended to conservation form on general curvilinear body-fitted grids. The discrete equations are solved by symmetric collective Gauss-Seidel relaxation and FAS multigrid. Solutions for flow in a channel with Mach numbers ranging from 0.0001 to a supercritical Mach number are shown, demonstrating uniform convergence rates and no loss of accuracy in the incompressible limit. A solution for the flow around the leading edge of a semi-infinite parabolic body demonstrates that the scheme maintains rapid convergence for a flow containing a stagnation point.
Using domain decomposition in the multigrid NAS parallel benchmark on the Fujitsu VPP500
DOE Office of Scientific and Technical Information (OSTI.GOV)
Wang, J.C.H.; Lung, H.; Katsumata, Y.
1995-12-01
In this paper, we demonstrate how domain decomposition can be applied to the multigrid algorithm to convert the code for MPP architectures. We also discuss the performance and scalability of this implementation on the new product line of Fujitsu`s vector parallel computer, VPP500. This computer has Fujitsu`s well-known vector processor as the PE each rated at 1.6 C FLOPS. The high speed crossbar network rated at 800 MB/s provides the inter-PE communication. The results show that the physical domain decomposition is the best way to solve MG problems on VPP500.
Chatterjee, Arindam; Gupta, Madan Mohan; Srivastava, Birendra
2017-01-01
Tablets have been choice of manufacturers over the years due to their comparatively low cost of manufacturing, packaging, shipping, and ease of administration; also have better stability and can be considered virtually tamper proof. A major challenge in formulation development of the tablets extends from lower solubility of the active agent to the elaborated manufacturing procedures for obtaining a compressible granular material. Moreover, the validation and documentation increases, as the numbers of steps increases for an industrially acceptable granulation process. Spherical crystallization (SC) is a promising technique, which encompass the crystallization, agglomeration, and spheronization phenomenon in a single step. Initially, two methods, spherical agglomeration, and emulsion solvent diffusion, were suggested to get a desired result. Later on, the introduction of modified methods such as crystallo-co-agglomeration, ammonia diffusion system, and neutralization techniques overcame the limitations of the older techniques. Under controlled conditions such as solvent composition, mixing rate and temperature, spherical dense agglomerates cluster from particles. Application of the SC technique includes production of compacted spherical particles of drug having improved uniformity in shape and size of particles, good bulk density, better flow properties as well as better solubility so SC when used on commercial scale will bring down the production costs of pharmaceutical tablet and will increase revenue for the pharmaceutical industries in the competitive market. This review summarizes the technologies available for SC and also suggests the parameters for evaluation of a viable product.
Computationally efficient finite-difference modal method for the solution of Maxwell's equations.
Semenikhin, Igor; Zanuccoli, Mauro
2013-12-01
In this work, a new implementation of the finite-difference (FD) modal method (FDMM) based on an iterative approach to calculate the eigenvalues and corresponding eigenfunctions of the Helmholtz equation is presented. Two relevant enhancements that significantly increase the speed and accuracy of the method are introduced. First of all, the solution of the complete eigenvalue problem is avoided in favor of finding only the meaningful part of eigenmodes by using iterative methods. Second, a multigrid algorithm and Richardson extrapolation are implemented. Simultaneous use of these techniques leads to an enhancement in terms of accuracy, which allows a simple method such as the FDMM with a typical three-point difference scheme to be significantly competitive with an analytical modal method.
Investigation of methods to produce a uniform cloud of fuel particles in a flame tube
NASA Technical Reports Server (NTRS)
Siegert, Clifford E.; Pla, Frederic G.; Rubinstein, Robert; Niezgoda, Thomas F.; Burns, Robert J.; Johnson, Jerome A.
1990-01-01
The combustion of a uniform, quiescent cloud of 30-micron fuel particles in a flame tube was proposed as a space-based, low-gravity experiment. The subject is the normal- and low-gravity testing of several methods to produce such a cloud, including telescoping propeller fans, air pumps, axial and quadrature acoustical speakers, and combinations of these devices. When operated in steady state, none of the methods produced an acceptably uniform cloud (+ or - 5 percent of the mean concentration), and voids in the cloud were clearly visible. In some cases, severe particle agglomeration was observed; however, these clusters could be broken apart by a short acoustic burst from an axially in-line speaker. Analyses and experiments reported elsewhere suggest that transient, acoustic mixing methods can enhance cloud uniformity while minimizing particle agglomeration.
NASA Astrophysics Data System (ADS)
Jin, Daeseong; Kim, Hackjin
2018-03-01
We have investigated the agglomeration of magnetite nanoparticles in the aqueous solution under magnetic field by measuring temporal change of magnetic weight. The magnetic weight corresponds to the force due to the magnetization of magnetic materials. Superparamagnetic magnetite nanoparticles are synthesized and used in this work. When the aqueous solution of magnetite nanoparticle is placed under magnetic field, the magnetic weight of the sample jumps instantaneously by Neel and Brown mechanisms and thereafter increases steadily following a stretched exponential function as the nanoparticles agglomerate, which results from the distribution of energy barriers involved in the dynamics. Thermal motions of nanoparticles in the agglomerate perturb the ordered structure of the agglomerate to reduce the magnetic weight. Fluctuation of the structural order of the agglomerate by temperature change is much faster than the formation of agglomerate and explained well with the Boltzmann distribution, which suggests that the magnetic weight of the agglomerate works as a magnetic thermometer.
Multiscale Monte Carlo equilibration: Pure Yang-Mills theory
Endres, Michael G.; Brower, Richard C.; Orginos, Kostas; ...
2015-12-29
In this study, we present a multiscale thermalization algorithm for lattice gauge theory, which enables efficient parallel generation of uncorrelated gauge field configurations. The algorithm combines standard Monte Carlo techniques with ideas drawn from real space renormalization group and multigrid methods. We demonstrate the viability of the algorithm for pure Yang-Mills gauge theory for both heat bath and hybrid Monte Carlo evolution, and show that it ameliorates the problem of topological freezing up to controllable lattice spacing artifacts.
Arc-Length Continuation and Multi-Grid Techniques for Nonlinear Elliptic Eigenvalue Problems,
1981-03-19
size of the finest grid. We use the (AM) adaptive version of the Cycle C algorithm , unless otherwise stated. The first modified algorithm is the...by computing the derivative, uk, at a known solution and use it to get a better initial guess for the next value of X in a predictor - corrector fashion...factorization of the Jacobian Gu computed already in the Newton step. Using such a predictor - corrector method will often allow us to take a much bigger step
Iterative spectral methods and spectral solutions to compressible flows
NASA Technical Reports Server (NTRS)
Hussaini, M. Y.; Zang, T. A.
1982-01-01
A spectral multigrid scheme is described which can solve pseudospectral discretizations of self-adjoint elliptic problems in O(N log N) operations. An iterative technique for efficiently implementing semi-implicit time-stepping for pseudospectral discretizations of Navier-Stokes equations is discussed. This approach can handle variable coefficient terms in an effective manner. Pseudospectral solutions of compressible flow problems are presented. These include one dimensional problems and two dimensional Euler solutions. Results are given both for shock-capturing approaches and for shock-fitting ones.
CFD in the 1980's from one point of view
NASA Technical Reports Server (NTRS)
Lomax, Harvard
1991-01-01
The present interpretive treatment of the development history of CFD in the 1980s gives attention to advancements in such algorithmic techniques as flux Jacobian-based upwind differencing, total variation-diminishing and essentially nonoscillatory schemes, multigrid methods, unstructured grids, and nonrectangular structured grids. At the same time, computational turbulence research gave attention to turbulence modeling on the bases of increasingly powerful supercomputers and meticulously constructed databases. The major future developments in CFD will encompass such capabilities as structured and unstructured three-dimensional grids.
Fast GPU-based computation of spatial multigrid multiframe LMEM for PET.
Nassiri, Moulay Ali; Carrier, Jean-François; Després, Philippe
2015-09-01
Significant efforts were invested during the last decade to accelerate PET list-mode reconstructions, notably with GPU devices. However, the computation time per event is still relatively long, and the list-mode efficiency on the GPU is well below the histogram-mode efficiency. Since list-mode data are not arranged in any regular pattern, costly accesses to the GPU global memory can hardly be optimized and geometrical symmetries cannot be used. To overcome obstacles that limit the acceleration of reconstruction from list-mode on the GPU, a multigrid and multiframe approach of an expectation-maximization algorithm was developed. The reconstruction process is started during data acquisition, and calculations are executed concurrently on the GPU and the CPU, while the system matrix is computed on-the-fly. A new convergence criterion also was introduced, which is computationally more efficient on the GPU. The implementation was tested on a Tesla C2050 GPU device for a Gemini GXL PET system geometry. The results show that the proposed algorithm (multigrid and multiframe list-mode expectation-maximization, MGMF-LMEM) converges to the same solution as the LMEM algorithm more than three times faster. The execution time of the MGMF-LMEM algorithm was 1.1 s per million of events on the Tesla C2050 hardware used, for a reconstructed space of 188 x 188 x 57 voxels of 2 x 2 x 3.15 mm3. For 17- and 22-mm simulated hot lesions, the MGMF-LMEM algorithm led on the first iteration to contrast recovery coefficients (CRC) of more than 75 % of the maximum CRC while achieving a minimum in the relative mean square error. Therefore, the MGMF-LMEM algorithm can be used as a one-pass method to perform real-time reconstructions for low-count acquisitions, as in list-mode gated studies. The computation time for one iteration and 60 millions of events was approximately 66 s.
Process and apparatus for coal hydrogenation
Ruether, John A.
1988-01-01
In a coal liquefaction process an aqueous slurry of coal is prepared containing a dissolved liquefaction catalyst. A small quantity of oil is added to the slurry and then coal-oil agglomerates are prepared by agitation of the slurry at atmospheric pressure. The resulting mixture of agglomerates, excess water, dissolved catalyst, and unagglomerated solids is pumped to reaction pressure and then passed through a drainage device where all but a small amount of surface water is removed from the agglomerates. Sufficient catalyst for the reaction is contained in surface water remaining on the agglomerates. The agglomerates fall into the liquefaction reactor countercurrently to a stream of hot gas which is utilized to dry and preheat the agglomerates as well as deposit catalyst on the agglomerates before they enter the reactor where they are converted to primarily liquid products under hydrogen pressure.
Bed material agglomeration during fluidized bed combustion. Final report
DOE Office of Scientific and Technical Information (OSTI.GOV)
Brown, R.C.; Dawson, M.R.; Smeenk, J.L.
The purpose of this project is to determine the physical and chemical reactions which lead to the undesired agglomeration of bed material during fluidized bed combustion of coal and to relate these reactions to specific causes. A survey of agglomeration and deposit formation in industrial fluidized bed combustors (FBCs) indicate that at least five boilers were experiencing some form of bed material agglomeration. Deposit formation was reported at nine sites with deposits most commonly at coal feed locations and in cyclones. Other deposit locations included side walls and return loops. Three general types of mineralogic reactions were observed to occurmore » in the agglomerates and deposits. Although alkalies may play a role with some {open_quotes}high alkali{close_quotes} lignites, we found agglomeration was initiated due to fluxing reactions between iron (II) from pyrites and aluminosilicates from clays. This is indicated by the high amounts of iron, silica, and alumina in the agglomerates and the mineralogy of the agglomerates. Agglomeration likely originated in the dense phase of the FBC bed within the volatile plume which forms when coal is introduced to the boiler. Secondary mineral reactions appear to occur after the agglomerates have formed and tend to strengthen the agglomerates. When calcium is present in high amounts, most of the minerals in the resulting deposits are in the melilite group (gehlenite, melilite, and akermanite) and pyroxene group (diopside and augite). During these solid-phase reactions, the temperature of formation of the melilite minerals can be lowered by a reduction of the partial pressure of CO{sub 2} (Diopside + Calcite {r_arrow}Akermanite).« less
Riera-Franco de Sarabia, E; Elvira-Segura, L; González-Gómez, I; Rodríguez-Maroto, J J; Muñoz-Bueno, R; Dorronsoro-Areal, J L
2003-06-01
Removing very fine particles in the 0.01-1 micro m range generated in diesel combustion is important for air pollution abatement because of the impact such particles have on the environment. By forming larger particles, acoustic agglomeration of submicron particles is presented as a promising process for enhancing the efficiency of the current filtration systems for particle removal. Nevertheless, some authors have pointed out that acoustic agglomeration is much more efficient for larger particles than for smaller particles. This paper studies the effect of humidity on the acoustic agglomeration of diesel exhausts particles in the nanometer size range at 21 kHz. For the agglomeration tests, the experimental facility basically consists of a pilot scale plant with a diesel engine, an ultrasonic agglomeration chamber a dilution system, a nozzle atomizer, and an aerosol sampling and measuring station. The effect of the ultrasonic treatment, generated by a linear array of four high-power stepped-plate transducers on fumes at flow rates of 900 Nm(3)/h, was a small reduction in the number concentration of particles at the outlet of the chamber. However, the presence of humidity raised the agglomeration rate by decreasing the number particle concentration by up to 56%. A numerical study of the agglomeration process as a linear combination of the orthokinetic and hydrodynamic agglomeration coefficients resulting from mutual radiation pressure also found that acoustic agglomeration was enhanced by humidity. Both results confirm the benefit of using high-power ultrasound together with humidity to enhance the agglomeration of particles much smaller than 1 micro m.
Acoustic agglomeration of fine particles based on a high intensity acoustical resonator
NASA Astrophysics Data System (ADS)
Zhao, Yun; Zeng, Xinwu; Tian, Zhangfu
2015-10-01
Acoustic agglomeration (AA) is considered to be a promising method for reducing the air pollution caused by fine aerosol particles. Removal efficiency and energy consuming are primary parameters and generally have a conflict with each other for the industry applications. It was proved that removal efficiency is increased with sound intensity and optimal frequency is presented for certain polydisperse aerosol. As a result, a high efficiency and low energy cost removal system was constructed using acoustical resonance. High intensity standing wave is generated by a tube system with abrupt section driven by four loudspeakers. Numerical model of the tube system was built base on the finite element method, and the resonance condition and SPL increase were confirmd. Extensive tests were carried out to investigate the acoustic field in the agglomeration chamber. Removal efficiency of fine particles was tested by the comparison of filter paper mass and particle size distribution at different operating conditions including sound pressure level (SPL), and frequency. The experimental study has demonstrated that agglomeration increases with sound pressure level. Sound pressure level in the agglomeration chamber is between 145 dB and 165 dB from 500 Hz to 2 kHz. The resonance frequency can be predicted with the quarter tube theory. Sound pressure level gain of more than 10 dB is gained at resonance frequency. With the help of high intensity sound waves, fine particles are reduced greatly, and the AA effect is enhanced at high SPL condition. The optimal frequency is 1.1kHz for aerosol generated by coal ash. In the resonace tube, higher resonance frequencies are not the integral multiplies of the first one. As a result, Strong nonlinearity is avoided by the dissonant characteristic and shock wave is not found in the testing results. The mechanism and testing system can be used effectively in industrial processes in the future.
Production of iron from metallurgical waste
Hendrickson, David W; Iwasaki, Iwao
2013-09-17
A method of recovering metallic iron from iron-bearing metallurgical waste in steelmaking comprising steps of providing an iron-bearing metallurgical waste containing more than 55% by weight FeO and FeO equivalent and a particle size of at least 80% less than 10 mesh, mixing the iron-bearing metallurgical waste with a carbonaceous material to form a reducible mixture where the carbonaceous material is between 80 and 110% of the stoichiometric amount needed to reduce the iron-bearing waste to metallic iron, and as needed additions to provide a silica content between 0.8 and 8% by weight and a ratio of CaO/SiO.sub.2 between 1.4 and 1.8, forming agglomerates of the reducible mixture over a hearth material layer to protect the hearth, heating the agglomerates to a higher temperature above the melting point of iron to form nodules of metallic iron and slag material from the agglomerates by melting.
Asphaltene dispersants as demulsification aids
DOE Office of Scientific and Technical Information (OSTI.GOV)
Manek, M.B.
1995-11-01
Destabilization of petroleum asphaltenes may cause a multitude of problems in crude oil recovery and production. One major problem is their agglomeration at the water-oil interface of crude oil emulsions. Once agglomeration occurs, destabilized asphaltenes can form a thick pad in the dehydration equipment, which significantly reduces the demulsification rate. Certain polymeric dispersants increase asphaltene solubilization in hydrocarbon media, and when used in conjunction with emulsion breakers, facilitate the demulsification process. Two case studies are presented that demonstrate how asphaltene dispersants can efficiently inhibit pad formation and help reduce demulsifier dosage. Criteria for dispersant application and selection are discussed, whichmore » include the application of a novel laboratory technique to assess asphaltene stabilization in the crude oil. The technique monitors asphaltene agglomeration while undergoing titration with an incompatible solvent (precipitant). The method was used to evaluate stabilization of asphaltenes in the crude oil and to screen asphaltene dispersants.« less
Sathigari, Sateesh Kumar; Ober, Courtney A; Sanganwar, Ganesh P; Gupta, Ram B; Babu, R Jayachandra
2011-07-01
Itraconazole (ITZ) microflakes were produced by supercritical antisolvent (SAS) method and simultaneously mixed with pharmaceutical excipients in a single step to prevent drug agglomeration. Simultaneous ITZ particle formation and mixing with fast-flo lactose (FFL) was performed in a high-pressure stirred vessel at 116 bar and 40 °C by the SAS-drug excipient mixing (SAS-DEM) method. The effects of stabilizers, such as sodium dodecyl sulfate and poloxamer 407 (PLX), on particle formation and drug dissolution were studied. Drug-excipient formulations were characterized for surface morphology, crystallinity, drug-excipient interactions, drug content uniformity, and drug dissolution rate. Mixture of drug microflakes and FFL formed by the SAS-DEM process shows that the process was successful in overcoming drug-drug agglomeration. PLX produced crystalline drug flakes in loose agglomerates with superior dissolution and flow properties even at higher drug loadings. Characterization studies confirmed the crystallinity of the drug and absence of chemical interactions during the SAS process. The dissolution of ITZ was substantially higher due to SAS and SAS-DEM processes; this improvement can be attributed to the microflake particle structures, effective deagglomeration, and wetting of the drug flakes with the excipients. Copyright © 2011 Wiley-Liss, Inc. and the American Pharmacists Association
A diffuse-interface method for two-phase flows with soluble surfactants
Teigen, Knut Erik; Song, Peng; Lowengrub, John; Voigt, Axel
2010-01-01
A method is presented to solve two-phase problems involving soluble surfactants. The incompressible Navier–Stokes equations are solved along with equations for the bulk and interfacial surfactant concentrations. A non-linear equation of state is used to relate the surface tension to the interfacial surfactant concentration. The method is based on the use of a diffuse interface, which allows a simple implementation using standard finite difference or finite element techniques. Here, finite difference methods on a block-structured adaptive grid are used, and the resulting equations are solved using a non-linear multigrid method. Results are presented for a drop in shear flow in both 2D and 3D, and the effect of solubility is discussed. PMID:21218125
The Numerical Technique for the Landslide Tsunami Simulations Based on Navier-Stokes Equations
NASA Astrophysics Data System (ADS)
Kozelkov, A. S.
2017-12-01
The paper presents an integral technique simulating all phases of a landslide-driven tsunami. The technique is based on the numerical solution of the system of Navier-Stokes equations for multiphase flows. The numerical algorithm uses a fully implicit approximation method, in which the equations of continuity and momentum conservation are coupled through implicit summands of pressure gradient and mass flow. The method we propose removes severe restrictions on the time step and allows simulation of tsunami propagation to arbitrarily large distances. The landslide origin is simulated as an individual phase being a Newtonian fluid with its own density and viscosity and separated from the water and air phases by an interface. The basic formulas of equation discretization and expressions for coefficients are presented, and the main steps of the computation procedure are described in the paper. To enable simulations of tsunami propagation across wide water areas, we propose a parallel algorithm of the technique implementation, which employs an algebraic multigrid method. The implementation of the multigrid method is based on the global level and cascade collection algorithms that impose no limitations on the paralleling scale and make this technique applicable to petascale systems. We demonstrate the possibility of simulating all phases of a landslide-driven tsunami, including its generation, propagation and uprush. The technique has been verified against the problems supported by experimental data. The paper describes the mechanism of incorporating bathymetric data to simulate tsunamis in real water areas of the world ocean. Results of comparison with the nonlinear dispersion theory, which has demonstrated good agreement, are presented for the case of a historical tsunami of volcanic origin on the Montserrat Island in the Caribbean Sea.
Powder agglomeration in a microgravity environment
NASA Technical Reports Server (NTRS)
Cawley, James D.
1994-01-01
This is the final report for NASA Grant NAG3-755 entitled 'Powder Agglomeration in a Microgravity Environment.' The research program included both two types of numerical models and two types of experiments. The numerical modeling included the use of Monte Carlo type simulations of agglomerate growth including hydrodynamic screening and molecular dynamics type simulations of the rearrangement of particles within an agglomerate under a gravitational field. Experiments included direct observation of the agglomeration of submicron alumina and indirect observation, using small angle light scattering, of the agglomeration of colloidal silica and aluminum monohydroxide. In the former class of experiments, the powders were constrained to move on a two-dimensional surface oriented to minimize the effect of gravity. In the latter, some experiments involved mixture of suspensions containing particles of opposite charge which resulted in agglomeration on a very short time scale relative to settling under gravity.
NASA Astrophysics Data System (ADS)
Tong, M.; Jagarlapudi, S. C.; Patel, J. B.; Stone, I. C.; Fan, Z.; Browne, D. J.
2015-06-01
Physically conditioning molten scrap aluminium alloys using high shear processing (HSP) was recently found to be a promising technology for purification of contaminated alloys. HSP refines the solid oxide agglomerates in molten alloys, so that they can act as sites for the nucleation of Fe-rich intermetallic phases which can subsequently be removed by the downstream de-drossing process. In this paper, a computational modelling for predicting the evolution of size of oxide clusters during HSP is presented. We used CFD to predict the macroscopic flow features of the melt, and the resultant field predictions of temperature and melt shear rate were transferred to a population balance model (PBM) as its key inputs. The PBM is a macroscopic model that formulates the microscopic agglomeration and breakage of a population of a dispersed phase. Although it has been widely used to study conventional deoxidation of liquid metal, this is the first time that PBM has been used to simulate the melt conditioning process within a rotor/stator HSP device. We employed a method which discretizes the continuous profile of size of the dispersed phase into a collection of discrete bins of size, to solve the governing population balance equation for the size of agglomerates. A finite volume method was used to solve the continuity equation, the energy equation and the momentum equation. The overall computation was implemented mainly using the FLUENT module of ANSYS. The simulations showed that there is a relatively high melt shear rate between the stator and sweeping tips of the rotor blades. This high shear rate leads directly to significant fragmentation of the initially large oxide aggregates. Because the process of agglomeration is significantly slower than the breakage processes at the beginning of HSP, the mean size of oxide clusters decreases very rapidly. As the process of agglomeration gradually balances the process of breakage, the mean size of oxide clusters converges to a steady value. The model enables formulation of the quantitative relationship between the macroscopic flow features of liquid metal and the change of size of dispersed oxide clusters, during HSP. It predicted the variation in size of the dispersed phased with operational parameters (including the geometry and, particularly, the speed of the rotor), which is of direct use to experimentalists optimising the design of the HSP device and its implementation.
NASA Astrophysics Data System (ADS)
Gruber, Ralph; Periaux, Jaques; Shaw, Richard Paul
Recent advances in computational mechanics are discussed in reviews and reports. Topics addressed include spectral superpositions on finite elements for shear banding problems, strain-based finite plasticity, numerical simulation of hypersonic viscous continuum flow, constitutive laws in solid mechanics, dynamics problems, fracture mechanics and damage tolerance, composite plates and shells, contact and friction, metal forming and solidification, coupling problems, and adaptive FEMs. Consideration is given to chemical flows, convection problems, free boundaries and artificial boundary conditions, domain-decomposition and multigrid methods, combustion and thermal analysis, wave propagation, mixed and hybrid FEMs, integral-equation methods, optimization, software engineering, and vector and parallel computing.
Coarsening strategies for unstructured multigrid techniques with application to anisotropic problems
NASA Technical Reports Server (NTRS)
Morano, E.; Mavriplis, D. J.; Venkatakrishnan, V.
1995-01-01
Over the years, multigrid has been demonstrated as an efficient technique for solving inviscid flow problems. However, for viscous flows, convergence rates often degrade. This is generally due to the required use of stretched meshes (i.e., the aspect-ratio AR = delta y/delta x is much less than 1) in order to capture the boundary layer near the body. Usual techniques for generating a sequence of grids that produce proper convergence rates on isotopic meshes are not adequate for stretched meshes. This work focuses on the solution of Laplace's equation, discretized through a Galerkin finite-element formulation on unstructured stretched triangular meshes. A coarsening strategy is proposed and results are discussed.
Coarsening Strategies for Unstructured Multigrid Techniques with Application to Anisotropic Problems
NASA Technical Reports Server (NTRS)
Morano, E.; Mavriplis, D. J.; Venkatakrishnan, V.
1996-01-01
Over the years, multigrid has been demonstrated as an efficient technique for solving inviscid flow problems. However, for viscous flows, convergence rates often degrade. This is generally due to the required use of stretched meshes (i.e. the aspect-ratio AR = (delta)y/(delta)x much less than 1) in order to capture the boundary layer near the body. Usual techniques for generating a sequence of grids that produce proper convergence rates on isotropic meshes are not adequate for stretched meshes. This work focuses on the solution of Laplace's equation, discretized through a Galerkin finite-element formulation on unstructured stretched triangular meshes. A coarsening strategy is proposed and results are discussed.
Separation analysis, a tool for analyzing multigrid algorithms
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1995-01-01
The separation of vectors by multigrid (MG) algorithms is applied to the study of convergence and to the prediction of the performance of MG algorithms. The separation operator for a two level cycle algorithm is derived. It is used to analyze the efficiency of the cycle when mixing of eigenvectors occurs. In particular cases the separation analysis reduces to Fourier type analysis. The separation operator of a two level cycle for a Schridubger eigenvalue problem, is derived and analyzed in a Fourier basis. Separation analysis gives information on how to choose performance relaxations and inter-level transfers. Separation analysis is a tool for analyzing and designing algorithms, and for optimizing their performance.
NASA Astrophysics Data System (ADS)
Feng, Wenqiang; Guo, Zhenlin; Lowengrub, John S.; Wise, Steven M.
2018-01-01
We present a mass-conservative full approximation storage (FAS) multigrid solver for cell-centered finite difference methods on block-structured, locally cartesian grids. The algorithm is essentially a standard adaptive FAS (AFAS) scheme, but with a simple modification that comes in the form of a mass-conservative correction to the coarse-level force. This correction is facilitated by the creation of a zombie variable, analogous to a ghost variable, but defined on the coarse grid and lying under the fine grid refinement patch. We show that a number of different types of fine-level ghost cell interpolation strategies could be used in our framework, including low-order linear interpolation. In our approach, the smoother, prolongation, and restriction operations need never be aware of the mass conservation conditions at the coarse-fine interface. To maintain global mass conservation, we need only modify the usual FAS algorithm by correcting the coarse-level force function at points adjacent to the coarse-fine interface. We demonstrate through simulations that the solver converges geometrically, at a rate that is h-independent, and we show the generality of the solver, applying it to several nonlinear, time-dependent, and multi-dimensional problems. In several tests, we show that second-order asymptotic (h → 0) convergence is observed for the discretizations, provided that (1) at least linear interpolation of the ghost variables is employed, and (2) the mass conservation corrections are applied to the coarse-level force term.
NASA Astrophysics Data System (ADS)
Sun, X.; Cheng, S.
2017-12-01
This paper presents the first attempt to investigate the emission source control of the Middle Reaches of Yangtze River Urban Agglomerations (MRYRUA), one of the national urban agglomerations in China. An emission inventory of the MRYRUA was the first time to be developed as inputs to the CAMx model based on county-level activity data obtained by full-coverage investigation and source-based spatial surrogates. The emission inventory was proved to be acceptable owing to the atmospheric modeling verification. A classification technology method for atmospheric pollution source priority control was the first time to be introduced and applied in the MRYRUA for the evaluation of the emission sources control on the region-scale and city-scale. MICAPS (Meteorological Information comprehensive Analysis and Processing System) was applied for the regional meteorological condition and sensitivity analysis. The results demonstrated that the emission sources in the Hefei-center Urban Agglomerations contributed biggest on the mean PM2.5 concentrations of the MRYRUA and should be taken the priority to control. The emission sources in the Ma'anshan city, Xiangtan city, Hefei city and Wuhan city were the bigger contributors on the mean PM2.5 concentrations of the MRYRUA among the cities and should be taken the priority to control. In addition, the cities along the Yangtze River and the tributary should be given the special attention for the regional air quality target attainments. This study provide a valuable preference for policy makers to develop effective air pollution control strategies.
NASA Technical Reports Server (NTRS)
Oliger, Joseph
1997-01-01
Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project.
Ultrasonication effects on thermal and rheological properties of carbon nanotube suspensions
2012-01-01
The preparation of nanofluids is very important to their thermophysical properties. Nanofluids with the same nanoparticles and base fluids can behave differently due to different nanofluid preparation methods. The agglomerate sizes in nanofluids can significantly impact the thermal conductivity and viscosity of nanofluids and lead to a different heat transfer performance. Ultrasonication is a common way to break up agglomerates and promote dispersion of nanoparticles into base fluids. However, research reports of sonication effects on nanofluid properties are limited in the open literature. In this work, sonication effects on thermal conductivity and viscosity of carbon nanotubes (0.5 wt%) in an ethylene glycol-based nanofluid are investigated. The corresponding effects on the agglomerate sizes and the carbon nanotube lengths are observed. It is found that with an increased sonication time/energy, the thermal conductivity of the nanofluids increases nonlinearly, with the maximum enhancement of 23% at sonication time of 1,355 min. However, the viscosity of nanofluids increases to the maximum at sonication time of 40 min, then decreases, finally approaching the viscosity of the pure base fluid at a sonication time of 1,355 min. It is also observed that the sonication process not only reduces the agglomerate sizes but also decreases the length of carbon nanotubes. Over the current experimental range, the reduction in agglomerate size is more significant than the reduction of the carbon nanotube length. Hence, the maximum thermal conductivity enhancement and minimum viscosity increase are obtained using a lengthy sonication, which may have implications on application. PMID:22333487
Shahcheraghi, Seyed Hadi; Schaffie, Mahin; Ranjbar, Mohammad
2018-06-01
The main objective of this study was the development of a simple, clean, and industrial applicable electrochemical process for production of high pure nano-copper oxides from mining and industrial resources (e.g., ore, spent, slag and wastewater). To conduct the proposed process, a special set up containing an electrochemical cell in an ultrasonic system (28 kHz and 160 W) was proposed. Accordingly, using this set up and applying appropriate voltage (≈ 5 V) at 25 °C, in the presence of N 2 gas, the simultaneous anode dissolution and nano-copper oxides formation (≈ 24 nm) can be occurred, rapidly (less than 45 min). Then, the effect of N 2 gas and free radicals generated by ultrasonic irradiation was studied. The results showed, in the absence of ultrasonic irradiation and N 2 , an increase of electrolyte pH from 6.42 to 10.92, a decrease of electrolyte Eh from 285 mV to -1.14 V, and formation of copper nanoparticles. While, in the presence of ultrasonic and N 2 , the CuO nanoparticles were formed due to presence of H 2 O 2 generated by interaction of free radicals. Moreover, a novel method for kinetics modeling of nanoparticles agglomeration was proposed according to distributed activation energy model and Arrhenius parameters variation. The results showed that, in the absence of ultrasonic irradiation, the nanoparticle agglomerates were firstly formed (interface controlled mechanism) and then, the diffusion of nanoparticle agglomerates was occurred (diffusion controlled mechanism). Therefore, the control of nanoparticles size and shape may be impossible without surfactant. Also, in the presence of ultrasonic irradiation, the whole of agglomeration process followed interface controlled mechanism. Therefore, using ultrasonic irradiation, the nanoparticles shape and size don't change due to prevention of agglomerates diffusion. Copyright © 2018 Elsevier B.V. All rights reserved.
Assessment of Linear Finite-Difference Poisson-Boltzmann Solvers
Wang, Jun; Luo, Ray
2009-01-01
CPU time and memory usage are two vital issues that any numerical solvers for the Poisson-Boltzmann equation have to face in biomolecular applications. In this study we systematically analyzed the CPU time and memory usage of five commonly used finite-difference solvers with a large and diversified set of biomolecular structures. Our comparative analysis shows that modified incomplete Cholesky conjugate gradient and geometric multigrid are the most efficient in the diversified test set. For the two efficient solvers, our test shows that their CPU times increase approximately linearly with the numbers of grids. Their CPU times also increase almost linearly with the negative logarithm of the convergence criterion at very similar rate. Our comparison further shows that geometric multigrid performs better in the large set of tested biomolecules. However, modified incomplete Cholesky conjugate gradient is superior to geometric multigrid in molecular dynamics simulations of tested molecules. We also investigated other significant components in numerical solutions of the Poisson-Boltzmann equation. It turns out that the time-limiting step is the free boundary condition setup for the linear systems for the selected proteins if the electrostatic focusing is not used. Thus, development of future numerical solvers for the Poisson-Boltzmann equation should balance all aspects of the numerical procedures in realistic biomolecular applications. PMID:20063271
A practically unconditionally gradient stable scheme for the N-component Cahn-Hilliard system
NASA Astrophysics Data System (ADS)
Lee, Hyun Geun; Choi, Jeong-Whan; Kim, Junseok
2012-02-01
We present a practically unconditionally gradient stable conservative nonlinear numerical scheme for the N-component Cahn-Hilliard system modeling the phase separation of an N-component mixture. The scheme is based on a nonlinear splitting method and is solved by an efficient and accurate nonlinear multigrid method. The scheme allows us to convert the N-component Cahn-Hilliard system into a system of N-1 binary Cahn-Hilliard equations and significantly reduces the required computer memory and CPU time. We observe that our numerical solutions are consistent with the linear stability analysis results. We also demonstrate the efficiency of the proposed scheme with various numerical experiments.
A stopping criterion for the iterative solution of partial differential equations
NASA Astrophysics Data System (ADS)
Rao, Kaustubh; Malan, Paul; Perot, J. Blair
2018-01-01
A stopping criterion for iterative solution methods is presented that accurately estimates the solution error using low computational overhead. The proposed criterion uses information from prior solution changes to estimate the error. When the solution changes are noisy or stagnating it reverts to a less accurate but more robust, low-cost singular value estimate to approximate the error given the residual. This estimator can also be applied to iterative linear matrix solvers such as Krylov subspace or multigrid methods. Examples of the stopping criterion's ability to accurately estimate the non-linear and linear solution error are provided for a number of different test cases in incompressible fluid dynamics.
NASA Technical Reports Server (NTRS)
Moorthi, Shrinivas; Higgins, R. W.
1993-01-01
An efficient, direct, second-order solver for the discrete solution of a class of two-dimensional separable elliptic equations on the sphere (which generally arise in implicit and semi-implicit atmospheric models) is presented. The method involves a Fourier transformation in longitude and a direct solution of the resulting coupled second-order finite-difference equations in latitude. The solver is made efficient by vectorizing over longitudinal wave-number and by using a vectorized fast Fourier transform routine. It is evaluated using a prescribed solution method and compared with a multigrid solver and the standard direct solver from FISHPAK.
Low-rank coal oil agglomeration product and process
Knudson, Curtis L.; Timpe, Ronald C.; Potas, Todd A.; DeWall, Raymond A.; Musich, Mark A.
1992-01-01
A selectively-sized, raw, low-rank coal is processed to produce a low ash and relative water-free agglomerate with an enhanced heating value and a hardness sufficient to produce a non-decrepitating, shippable fuel. The low-rank coal is treated, under high shear conditions, in the first stage to cause ash reduction and subsequent surface modification which is necessary to facilitate agglomerate formation. In the second stage the treated low-rank coal is contacted with bridging and binding oils under low shear conditions to produce agglomerates of selected size. The bridging and binding oils may be coal or petroleum derived. The process incorporates a thermal deoiling step whereby the bridging oil may be completely or partially recovered from the agglomerate; whereas, partial recovery of the bridging oil functions to leave as an agglomerate binder, the heavy constituents of the bridging oil. The recovered oil is suitable for recycling to the agglomeration step or can serve as a value-added product.
Low-rank coal oil agglomeration product and process
Knudson, C.L.; Timpe, R.C.; Potas, T.A.; DeWall, R.A.; Musich, M.A.
1992-11-10
A selectively-sized, raw, low-rank coal is processed to produce a low ash and relative water-free agglomerate with an enhanced heating value and a hardness sufficient to produce a non-degradable, shippable fuel. The low-rank coal is treated, under high shear conditions, in the first stage to cause ash reduction and subsequent surface modification which is necessary to facilitate agglomerate formation. In the second stage the treated low-rank coal is contacted with bridging and binding oils under low shear conditions to produce agglomerates of selected size. The bridging and binding oils may be coal or petroleum derived. The process incorporates a thermal deoiling step whereby the bridging oil may be completely or partially recovered from the agglomerate; whereas, partial recovery of the bridging oil functions to leave as an agglomerate binder, the heavy constituents of the bridging oil. The recovered oil is suitable for recycling to the agglomeration step or can serve as a value-added product.
High concentration agglomerate dynamics at high temperatures.
Heine, M C; Pratsinis, S E
2006-11-21
The dynamics of agglomerate aerosols are investigated at high solids concentrations that are typical in industrial scale manufacture of fine particles (precursor mole fraction larger than 10 mol %). In particular, formation and growth of fumed silica at such concentrations by chemical reaction, coagulation, and sintering is simulated at nonisothermal conditions and compared to limited experimental data and commercial product specifications. Using recent chemical kinetics for silica formation by SiCl4 hydrolysis and neglecting aerosol polydispersity, the evolution of the diameter of primary particles (specific surface area, SSA), hard- and soft-agglomerates, along with agglomerate effective volume fraction (volume occupied by agglomerate) is investigated. Classic Smoluchowski theory is fundamentally limited for description of soft-agglomerate Brownian coagulation at high solids concentrations. In fact, these high concentrations affect little the primary particle diameter (or SSA) but dominate the soft-agglomerate diameter, structure, and volume fraction, leading to gelation consistent with experimental data. This indicates that restructuring and fragmentation should affect product particle characteristics during high-temperature synthesis of nanostructured particles at high concentrations in aerosol flow reactors.
Multifrequency scanning probe microscopy study of nanodiamond agglomerates
NASA Astrophysics Data System (ADS)
Aravind, Vasudeva; Lippold, Stephen; Li, Qian; Strelcov, Evgheny; Okatan, Baris; Legum, Benjamin; Kalinin, Sergei; Clarion University Team; Oak Ridge National Laboratory Team
Due to their rich surface chemistry and excellent mechanical properties and non-toxic nature, nanodiamond particles have found applications such as biomedicine, tribology and lubrication, targeted drug delivery systems, tissue scaffolds and surgical implants. Although single nanodiamond particles have diameters about 4-5nm, they tend to form agglomerates. While these agglomerates can be useful for some purposes, many applications of nanodiamonds require single particle, disaggregated nanodiamonds. This work is oriented towards studying forces and interactions that contribute to agglomeration in nanodiamonds. In this work, using multifrequency scanning probe microscopy techniques, we show that agglomerate sizes can vary between 50-100nm in raw nanodiamonds. Extremeties of particles and Interfaces between agglomerates show dissipative forces with scanning probe microscope tip, indicating agglomerates could act as points of increased adhesion, thus reducing lubricating efficiency when nanodiamonds are used as lubricant additives. This research was conducted at the Center for Nanophase Materials Sciences, which is a DOE Office of Science User Facility.
Microbial effects on colloidal agglomeration
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hersman, L.
1995-11-01
Colloidal particles are known to enhance the transport of radioactive metals through soil and rock systems. This study was performed to determine if a soil microorganism, isolated from the surface samples collected at Yucca Mountain, NV, could affect the colloidal properties of day particles. The agglomeration of a Wyoming bentonite clay in a sterile uninoculated microbial growth medium was compared to the agglomeration in the medium inoculated with a Pseudomonas sp. In a second experiment, microorganisms were cultured in the succinate medium for 50 h and removed by centrifugation. The agglomeration of the clay in this spent was compared tomore » sterile uninoculated medium. In both experiments, the agglomeration of the clay was greater than that of the sterile, uninoculated control. Based on these results, which indicate that this microorganism enhanced the agglomeration of the bentonite clay, it is possible to say that in the presence of microorganisms colloidal movement through a rock matrix could be reduced because of an overall increase in the size of colloidal particle agglomerates. 32 refs.« less
NASA Astrophysics Data System (ADS)
Sivayoganathan, Mugunthan; Tan, Bo; Venkatakrishnan, Krishnan
2012-11-01
We report a single step technique of synthesizing particle-agglomerated, amorphous 3-D nanostructures of Al and Si oxides on powder-fused aluminosilicate ceramic plates and a simple novel method of wafer-foil ablation to fabricate crystalline nanostructures of Al and Si oxides at ambient conditions. We also propose a particle size prediction mechanism to regulate the size of vapor-condensed agglomerated nanoparticles in these structures. Size characterization studies performed on the agglomerated nanoparticles of fabricated 3-D structures showed that the size distributions vary with the fluence-to-threshold ratio. The variation in laser parameters leads to varying plume temperature, pressure, amount of supersaturation, nucleation rate, and the growth rate of particles in the plume. The novel wafer-foil ablation technique could promote the possibilities of fabricating oxide nanostructures with varying Al/Si ratio, and the crystallinity of these structures enhances possible applications. The fabricated nanostructures of Al and Si oxides could have great potentials to be used in the fabrication of low power-consuming complementary metal-oxide-semiconductor circuits and in Mn catalysts to enhance the efficiency of oxidation on ethylbenzene to acetophenone in the super-critical carbon dioxide.
Sivayoganathan, Mugunthan; Tan, Bo; Venkatakrishnan, Krishnan
2012-11-09
We report a single step technique of synthesizing particle-agglomerated, amorphous 3-D nanostructures of Al and Si oxides on powder-fused aluminosilicate ceramic plates and a simple novel method of wafer-foil ablation to fabricate crystalline nanostructures of Al and Si oxides at ambient conditions. We also propose a particle size prediction mechanism to regulate the size of vapor-condensed agglomerated nanoparticles in these structures. Size characterization studies performed on the agglomerated nanoparticles of fabricated 3-D structures showed that the size distributions vary with the fluence-to-threshold ratio. The variation in laser parameters leads to varying plume temperature, pressure, amount of supersaturation, nucleation rate, and the growth rate of particles in the plume. The novel wafer-foil ablation technique could promote the possibilities of fabricating oxide nanostructures with varying Al/Si ratio, and the crystallinity of these structures enhances possible applications. The fabricated nanostructures of Al and Si oxides could have great potentials to be used in the fabrication of low power-consuming complementary metal-oxide-semiconductor circuits and in Mn catalysts to enhance the efficiency of oxidation on ethylbenzene to acetophenone in the super-critical carbon dioxide.
2012-01-01
We report a single step technique of synthesizing particle-agglomerated, amorphous 3-D nanostructures of Al and Si oxides on powder-fused aluminosilicate ceramic plates and a simple novel method of wafer-foil ablation to fabricate crystalline nanostructures of Al and Si oxides at ambient conditions. We also propose a particle size prediction mechanism to regulate the size of vapor-condensed agglomerated nanoparticles in these structures. Size characterization studies performed on the agglomerated nanoparticles of fabricated 3-D structures showed that the size distributions vary with the fluence-to-threshold ratio. The variation in laser parameters leads to varying plume temperature, pressure, amount of supersaturation, nucleation rate, and the growth rate of particles in the plume. The novel wafer-foil ablation technique could promote the possibilities of fabricating oxide nanostructures with varying Al/Si ratio, and the crystallinity of these structures enhances possible applications. The fabricated nanostructures of Al and Si oxides could have great potentials to be used in the fabrication of low power-consuming complementary metal-oxide-semiconductor circuits and in Mn catalysts to enhance the efficiency of oxidation on ethylbenzene to acetophenone in the super-critical carbon dioxide. PMID:23140103
NASA Astrophysics Data System (ADS)
Manoylov, Anton; Lebon, Bruno; Djambazov, Georgi; Pericleous, Koulis
2017-11-01
The aerospace and automotive industries are seeking advanced materials with low weight yet high strength and durability. Aluminum and magnesium-based metal matrix composites with ceramic micro- and nano-reinforcements promise the desirable properties. However, larger surface-area-to-volume ratio in micro- and especially nanoparticles gives rise to van der Waals and adhesion forces that cause the particles to agglomerate in clusters. Such clusters lead to adverse effects on final properties, no longer acting as dislocation anchors but instead becoming defects. Also, agglomeration causes the particle distribution to become uneven, leading to inconsistent properties. To break up clusters, ultrasonic processing may be used via an immersed sonotrode, or alternatively via electromagnetic vibration. This paper combines a fundamental study of acoustic cavitation in liquid aluminum with a study of the interaction forces causing particles to agglomerate, as well as mechanisms of cluster breakup. A non-linear acoustic cavitation model utilizing pressure waves produced by an immersed horn is presented, and then applied to cavitation in liquid aluminum. Physical quantities related to fluid flow and quantities specific to the cavitation solver are passed to a discrete element method particles model. The coupled system is then used for a detailed study of clusters' breakup by cavitation.
Automated detection of slum area change in Hyderabad, India using multitemporal satellite imagery
NASA Astrophysics Data System (ADS)
Kit, Oleksandr; Lüdeke, Matthias
2013-09-01
This paper presents an approach to automated identification of slum area change patterns in Hyderabad, India, using multi-year and multi-sensor very high resolution satellite imagery. It relies upon a lacunarity-based slum detection algorithm, combined with Canny- and LSD-based imagery pre-processing routines. This method outputs plausible and spatially explicit slum locations for the whole urban agglomeration of Hyderabad in years 2003 and 2010. The results indicate a considerable growth of area occupied by slums between these years and allow identification of trends in slum development in this urban agglomeration.
Fock, Jeppe; Parmvi, Mattias; Strömberg, Mattias; Svedlindh, Peter; Donolato, Marco; Hansen, Mikkel Fougt
2017-02-15
There is an increasing need to develop biosensor methods that are highly sensitive and that can be combined with low-cost consumables. The use of magnetic nanoparticles (MNPs) is attractive because their detection is compatible with low-cost disposables and because application of a magnetic field can be used to accelerate assay kinetics. We present the first study and comparison of the performance of magnetic susceptibility measurements and a newly proposed optomagnetic method. For the comparison we use the C-reactive protein (CRP) induced agglutination of identical samples of 100nm MNPs conjugated with CRP antibodies. Both methods detect agglutination as a shift to lower frequencies in measurements of the dynamics in response to an applied oscillating magnetic field. The magnetic susceptibility method probes the magnetic response whereas the optomagnetic technique probes the modulation of laser light transmitted through the sample. The two techniques provided highly correlated results upon agglutination when they measure the decrease of the signal from the individual MNPs (turn-off detection strategy), whereas the techniques provided different results, strongly depending on the read-out frequency, when detecting the signal due to MNP agglomerates (turn-on detection strategy). These observations are considered to be caused by differences in the volume-dependence of the magnetic and optical signals from agglomerates. The highest signal from agglomerates was found in the optomagnetic signal at low frequencies. Copyright © 2016 Elsevier B.V. All rights reserved.
A multilevel correction adaptive finite element method for Kohn-Sham equation
NASA Astrophysics Data System (ADS)
Hu, Guanghui; Xie, Hehu; Xu, Fei
2018-02-01
In this paper, an adaptive finite element method is proposed for solving Kohn-Sham equation with the multilevel correction technique. In the method, the Kohn-Sham equation is solved on a fixed and appropriately coarse mesh with the finite element method in which the finite element space is kept improving by solving the derived boundary value problems on a series of adaptively and successively refined meshes. A main feature of the method is that solving large scale Kohn-Sham system is avoided effectively, and solving the derived boundary value problems can be handled efficiently by classical methods such as the multigrid method. Hence, the significant acceleration can be obtained on solving Kohn-Sham equation with the proposed multilevel correction technique. The performance of the method is examined by a variety of numerical experiments.
NASA Technical Reports Server (NTRS)
Chung, T. J. (Editor); Karr, Gerald R. (Editor)
1989-01-01
Recent advances in computational fluid dynamics are examined in reviews and reports, with an emphasis on finite-element methods. Sections are devoted to adaptive meshes, atmospheric dynamics, combustion, compressible flows, control-volume finite elements, crystal growth, domain decomposition, EM-field problems, FDM/FEM, and fluid-structure interactions. Consideration is given to free-boundary problems with heat transfer, free surface flow, geophysical flow problems, heat and mass transfer, high-speed flow, incompressible flow, inverse design methods, MHD problems, the mathematics of finite elements, and mesh generation. Also discussed are mixed finite elements, multigrid methods, non-Newtonian fluids, numerical dissipation, parallel vector processing, reservoir simulation, seepage, shallow-water problems, spectral methods, supercomputer architectures, three-dimensional problems, and turbulent flows.
DOE Office of Scientific and Technical Information (OSTI.GOV)
Shadid, John Nicolas; Fish, Jacob; Waisman, Haim
Two heuristic strategies intended to enhance the performance of the generalized global basis (GGB) method [H. Waisman, J. Fish, R.S. Tuminaro, J. Shadid, The Generalized Global Basis (GGB) method, International Journal for Numerical Methods in Engineering 61(8), 1243-1269] applied to nonlinear systems are presented. The standard GGB accelerates a multigrid scheme by an additional coarse grid correction that filters out slowly converging modes. This correction requires a potentially costly eigen calculation. This paper considers reusing previously computed eigenspace information. The GGB? scheme enriches the prolongation operator with new eigenvectors while the modified method (MGGB) selectively reuses the same prolongation. Bothmore » methods use the criteria of principal angles between subspaces spanned between the previous and current prolongation operators. Numerical examples clearly indicate significant time savings in particular for the MGGB scheme.« less
Fragmentation and bond strength of airborne diesel soot agglomerates
Rothenbacher, Sonja; Messerer, Armin; Kasper, Gerhard
2008-01-01
Background The potential of diesel soot aerosol particles to break up into smaller units under mechanical stress was investigated by a direct impaction technique which measures the degree of fragmentation of individual agglomerates vs. impact energy. Diesel aerosol was generated by an idling diesel engine used for passenger vehicles. Both the aerosol emitted directly and aerosol that had undergone additional growth by Brownian coagulation ("aging") was investigated. Optionally a thermo-desoption technique at 280°C was used to remove all high-volatility and the majority of low-volatility HC adsorbates from the aerosol before aging. Results It was found that the primary soot agglomerates emitted directly from the engine could not be fragmented at all. Soot agglomerates permitted to grow additionally by Brownian coagulation of the primary emitted particles could be fragmented to a maximum of 75% and 60% respectively, depending on whether adsorbates were removed from their surface prior to aging or not. At most, these aged agglomerates could be broken down to roughly the size of the agglomerates from the primary emission. The energy required for a 50% fragmentation probability of all bonds within an agglomerate was reduced by roughly a factor of 2 when aging "dry" agglomerates. Average bond energies derived from the data were 0.52*10-16 and 1.2*10-16 J, respectively. This is about 2 orders of magnitude higher than estimates for pure van-der-Waals agglomerates, but agrees quite well with other observations. Conclusion Although direct conclusions regarding the behavior of inhaled diesel aerosol in contact with body fluids cannot be drawn from such measurements, the results imply that highly agglomerated soot aerosol particles are unlikely to break up into units smaller than roughly the size distribution emitted as tail pipe soot. PMID:18533015
Modeling of Particle Agglomeration in Nanofluids
NASA Astrophysics Data System (ADS)
Kanagala, Hari Krishna
Nanofluids are colloidal dispersions of nano sized particles (<100nm in diameter) in dispersion mediums. They are of great interest in industrial applications as heat transfer fluids owing to their enhanced thermal conductivities. Stability of nanofluids is a major problem hindering their industrial application. Agglomeration and then sedimentation are some reasons, which drastically decrease the shelf life of these nanofluids. Current research addresses the agglomeration effect and how it can affect the shelf life of a nanofluid. The reasons for agglomeration in nanofluids are attributable to the interparticle interactions which are quantified by the various theories. By altering the governing properties like volume fraction, pH and electrolyte concentration different nanofluids with instant agglomeration, slow agglomeration and no agglomeration can be produced. A numerical model is created based on the discretized population balance equations which analyses the particle size distribution at different times. Agglomeration effects have been analyzed for alumina nanoparticles with average particle size of 150nm dispersed in de-ionized water. As the pH was moved towards the isoelectric point of alumina nanofluids, the particle size distribution became broader and moved to bigger sizes rapidly with time. Particle size distributions became broader and moved to bigger sizes more quickly with time with increase in the electrolyte concentration. The two effects together can be used to create different temporal trends in the particle size distributions. Faster agglomeration is attributed to the decrease in the electrostatic double layer repulsion forces which is due to decrease in the induced charge and the double layer thickness around the particle. Bigger particle clusters show lesser agglomeration due to reaching the equilibrium size. The procedures and processes described in this work can be used to generate more stable nanofluids.
Adaptive Meshing Techniques for Viscous Flow Calculations on Mixed Element Unstructured Meshes
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.
1997-01-01
An adaptive refinement strategy based on hierarchical element subdivision is formulated and implemented for meshes containing arbitrary mixtures of tetrahendra, hexahendra, prisms and pyramids. Special attention is given to keeping memory overheads as low as possible. This procedure is coupled with an algebraic multigrid flow solver which operates on mixed-element meshes. Inviscid flows as well as viscous flows are computed an adaptively refined tetrahedral, hexahedral, and hybrid meshes. The efficiency of the method is demonstrated by generating an adapted hexahedral mesh containing 3 million vertices on a relatively inexpensive workstation.
Lee, Jai-Sung; Choi, Joon-Phil; Lee, Geon-Yong
2013-01-01
This paper provides an overview on our recent investigations on the consolidation of hierarchy-structured nanopowder agglomerates and related applications to net-shaping nanopowder materials. Understanding the nanopowder agglomerate sintering (NAS) process is essential to processing of net-shaped nanopowder materials and components with small and complex shape. The key concept of the NAS process is to enhance material transport through controlling the powder interface volume of nanopowder agglomerates. Based upon this concept, we have suggested a new idea of full density processing for fabricating micro-powder injection molded part using metal nanopowder agglomerates produced by hydrogen reduction of metal oxide powders. Studies on the full density sintering of die compacted- and powder injection molded iron base nano-agglomerate powders are introduced and discussed in terms of densification process and microstructure. PMID:28788317
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1994-01-01
This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.
The Development of a Factorizable Multigrid Algorithm for Subsonic and Transonic Flow
NASA Technical Reports Server (NTRS)
Roberts, Thomas W.
2001-01-01
The factorizable discretization of Sidilkover for the compressible Euler equations previously demonstrated for channel flows has been extended to external flows.The dissipation of the original scheme has been modified to maintain stability for moderately stretched grids. The discrete equations are solved by symmetric collective Gauss-Seidel relaxation and FAS multigrid. Unlike the earlier work ordering the grid vertices in the flow direction has been found to be unnecessary. Solutions for essential incompressible flow (Mach 0.01) and supercritical flows have obtained for a Karman-Trefftz airfoil with it conformally mapped grid,as well as a NACA 0012 on an algebraically generated grid. The current work demonstrates nearly 0(n) convergence for subsonic and slightly transonic flows.
NASA Astrophysics Data System (ADS)
Lee, Y. C.; Thompson, H. M.; Gaskell, P. H.
2009-12-01
FILMPAR is a highly efficient and portable parallel multigrid algorithm for solving a discretised form of the lubrication approximation to three-dimensional, gravity-driven, continuous thin film free-surface flow over substrates containing micro-scale topography. While generally applicable to problems involving heterogeneous and distributed features, for illustrative purposes the algorithm is benchmarked on a distributed memory IBM BlueGene/P computing platform for the case of flow over a single trench topography, enabling direct comparison with complementary experimental data and existing serial multigrid solutions. Parallel performance is assessed as a function of the number of processors employed and shown to lead to super-linear behaviour for the production of mesh-independent solutions. In addition, the approach is used to solve for the case of flow over a complex inter-connected topographical feature and a description provided of how FILMPAR could be adapted relatively simply to solve for a wider class of related thin film flow problems. Program summaryProgram title: FILMPAR Catalogue identifier: AEEL_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEEL_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 530 421 No. of bytes in distributed program, including test data, etc.: 1 960 313 Distribution format: tar.gz Programming language: C++ and MPI Computer: Desktop, server Operating system: Unix/Linux Mac OS X Has the code been vectorised or parallelised?: Yes. Tested with up to 128 processors RAM: 512 MBytes Classification: 12 External routines: GNU C/C++, MPI Nature of problem: Thin film flows over functional substrates containing well-defined single and complex topographical features are of enormous significance, having a wide variety of engineering, industrial and physical applications. However, despite recent modelling advances, the accurate numerical solution of the equations governing such problems is still at a relatively early stage. Indeed, recent studies employing a simplifying long-wave approximation have shown that highly efficient numerical methods are necessary to solve the resulting lubrication equations in order to achieve the level of grid resolution required to accurately capture the effects of micro- and nano-scale topographical features. Solution method: A portable parallel multigrid algorithm has been developed for the above purpose, for the particular case of flow over submerged topographical features. Within the multigrid framework adopted, a W-cycle is used to accelerate convergence in respect of the time dependent nature of the problem, with relaxation sweeps performed using a fixed number of pre- and post-Red-Black Gauss-Seidel Newton iterations. In addition, the algorithm incorporates automatic adaptive time-stepping to avoid the computational expense associated with repeated time-step failure. Running time: 1.31 minutes using 128 processors on BlueGene/P with a problem size of over 16.7 million mesh points.
NASA Astrophysics Data System (ADS)
Codd, A. L.; Gross, L.
2018-03-01
We present a new inversion method for Electrical Resistivity Tomography which, in contrast to established approaches, minimizes the cost function prior to finite element discretization for the unknown electric conductivity and electric potential. Minimization is performed with the Broyden-Fletcher-Goldfarb-Shanno method (BFGS) in an appropriate function space. BFGS is self-preconditioning and avoids construction of the dense Hessian which is the major obstacle to solving large 3-D problems using parallel computers. In addition to the forward problem predicting the measurement from the injected current, the so-called adjoint problem also needs to be solved. For this problem a virtual current is injected through the measurement electrodes and an adjoint electric potential is obtained. The magnitude of the injected virtual current is equal to the misfit at the measurement electrodes. This new approach has the advantage that the solution process of the optimization problem remains independent to the meshes used for discretization and allows for mesh adaptation during inversion. Computation time is reduced by using superposition of pole loads for the forward and adjoint problems. A smoothed aggregation algebraic multigrid (AMG) preconditioned conjugate gradient is applied to construct the potentials for a given electric conductivity estimate and for constructing a first level BFGS preconditioner. Through the additional reuse of AMG operators and coarse grid solvers inversion time for large 3-D problems can be reduced further. We apply our new inversion method to synthetic survey data created by the resistivity profile representing the characteristics of subsurface fluid injection. We further test it on data obtained from a 2-D surface electrode survey on Heron Island, a small tropical island off the east coast of central Queensland, Australia.
Krause, Maya; Blum, Jürgen
2004-07-09
In a second microgravity experiment on the formation of dust agglomerates by Brownian motion-induced collisions we find that the agglomerates have fractal dimensions as low as 1.4. Because of much better data, we are now able to derive the diffusion constant of the agglomerates as a function of mass, to show that a power law with an exponent of 1.7 describes the temporal evolution of the mean agglomerate mass very well and to prove that the collision cross section is proportional to the geometrical cross section. In addition to that we derived the universal mass-distribution function of the agglomerates.
Williams, Sarah; Currid-Halkett, Elizabeth
2014-01-01
Industrial agglomerations have long been thought to offer economic and social benefits to firms and people that are only captured by location within their specified geographies. Using the case study of New York City's garment industry along with data acquired from cell phones and social media, this study set out to understand the discrete activities underpinning the economic dynamics of an industrial agglomeration. Over a two week period, data was collected by employing the geolocative capabilities of Foursquare, a social media application, to record every movement of fashion workers employed at fashion design firms located both inside and outside the geographical boundaries of New York City's Garment District. This unique method of studying worker activity exposed the day-to-day dynamics of an industrial district with a precision thus far undocumented in literature. Our work suggests that having access to the cluster provides almost the same agglomeration economies as residing within its borders.
Consolidation of Partially Stabilized ZrO2 in the Presence of a Noncontacting Electric Field
NASA Astrophysics Data System (ADS)
Majidi, Hasti; van Benthem, Klaus
2015-05-01
Electric field-assisted sintering techniques demonstrate accelerated densification at lower temperatures than the conventional sintering methods. However, it is still debated whether the applied field and/or resulting currents are responsible for the densification enhancement. To distinguish the effects of an applied field from current flow, in situ scanning transmission electron microscopy experiments with soft agglomerates of partially stabilized yttria-doped zirconia particles are carried out. A new microelectromechanical system-based sample support is used to heat particle agglomerates while simultaneously exposing them to an externally applied noncontacting electric field. Under isothermal condition at 900 °C , an electric field strength of 500 V /cm shows a sudden threefold enhancement in the shrinkage of the agglomerates. The applied electrostatic potential lowers the activation energy for point defect formation within the space charge zone and therefore promotes consolidation. Obtaining similar magnitudes of shrinkage in the absence of any electric field requires a higher temperature and longer time.
Williams, Sarah; Currid-Halkett, Elizabeth
2014-01-01
Industrial agglomerations have long been thought to offer economic and social benefits to firms and people that are only captured by location within their specified geographies. Using the case study of New York City’s garment industry along with data acquired from cell phones and social media, this study set out to understand the discrete activities underpinning the economic dynamics of an industrial agglomeration. Over a two week period, data was collected by employing the geo-locative capabilities of Foursquare, a social media application, to record every movement of fashion workers employed at fashion design firms located both inside and outside the geographical boundaries of New York City’s Garment District. This unique method of studying worker activity exposed the day-to-day dynamics of an industrial district with a precision thus far undocumented in literature. Our work suggests that having access to the cluster provides almost the same agglomeration economies as residing within its borders. PMID:24505256
DOE Office of Scientific and Technical Information (OSTI.GOV)
Haas, J.C.; Olivo, C.A.; Wilson, K.B.
1994-04-01
An experimental test plan has been prepared for DOE/METC review and approval to develop a filter media suitable for multi-contaminant control in granular-bed filter (GBF) applications. The plan includes identification, development, and demonstration of methods for enhanced media morphology, chemical reactivity, and mechanical strength. The test plan includes media preparation methods, physical and chemical characterization methods for fresh and reacted media, media evaluation criteria, details of test and analytical equipment, and test matrix of the proposed media testing. A filter media composed of agglomerated limestone and clay was determined to be the best candidate for multi-contaminate control in GBF operation.more » The combined limestone/clay agglomerate has the potential to remove sulfur and alkali species, in addition to particulate, and possibly halogens and trace heavy metals from coal process streams.« less
Experimental study of acoustic agglomeration and fragmentation on coal-fired ash
NASA Astrophysics Data System (ADS)
Shen, Guoqing; Huang, Xiaoyu; He, Chunlong; Zhang, Shiping; An, Liansuo; Wang, Liang; Chen, Yanqiao; Li, Yongsheng
2018-02-01
As the major part of air pollution, inhalable particles, especially fine particles are doing great harm to human body due to smaller particle size and absorption of hazardous components. However, the removal efficiency of current particles filtering devices is low. Acoustic agglomeration is considered as a very effective pretreatment technique for removing particles. Fine particles collide, agglomerate and grow up in the sound field and the fine particles can be removed by conventional particles devices easily. In this paper, the agglomeration and fragmentation of 3 different kinds of particles with different size distributions are studied experimentally in the sound field. It is found that there exists an optimal frequency at 1200 Hz for different particles. The agglomeration efficiency of inhalable particles increases with SPL increasing for the unimodal particles with particle diameter less than 10 μm. For the bimodal particles, the optimal SPLs are 115 and 120 dB with the agglomeration efficiencies of 25% and 55%. A considerable effectiveness of agglomeration could only be obtained in a narrow SPL range and it decreases significantly over the range for the particles fragmentation.
Method for processing aluminum spent potliner in a graphite electrode ARC furnace
O'Connor, William K.; Turner, Paul C.; Addison, Gerald W.
2002-12-24
A method of processing spent aluminum pot liner containing carbon, cyanide compositions, fluorides and inorganic oxides. The spent aluminum pot liner is crushed iron oxide is added to form an agglomerated material. The agglomerated material is melted in an electric arc furnace having the electrodes submerged in the molten material to provide a reducing environment during the furnace operation. In the reducing environment, pot liner is oxidized while the iron oxides are reduced to produce iron and a slag substantially free of cyanide compositions and fluorides. An off-gas including carbon oxides and fluorine is treated in an air pollution control system with an afterburner and a scrubber to produce NaF, water and a gas vented to the atmosphere free of cyanide compositions, fluorine and CO.
Mixing of nanosize particles by magnetically assisted impaction techniques
NASA Astrophysics Data System (ADS)
Scicolone, James V.
Nanoparticles and nanocomposites offer unique properties that arise from their small size, large surface area, and the interactions of phases at their interfaces, and are attractive for their potential to improve performance of drugs, biomaterials, catalysts and other high-value-added materials. However, a major problem in utilizing nanoparticles is that they often lose their high surface area due to grain growth. Creating nanostructured composites where two or more nanosized constituents are intimately mixed can prevent this loss in surface area, but in order to obtain homogeneous mixing, de-agglomeration of the individual nanoparticle constituents is necessary. Due to high surface area, nano-particles form very large, fractal agglomerates. The structure of these agglomerates can have a large agglomerate composed of sub-agglomerates (SA), which itself consists of primary agglomerates (PA), that contain chain or net like nano-particle structures; typically sub-micron size. Thus the final agglomerate has a hierarchical, fractal structure, and depending upon the forces applied, it could break down to a certain size scale. The agglomerates can be fairly porous and fragile or they could be quite dense, based on primary particle size and its surface energy. Thus depending upon the agglomerate strength at different length scales, one could achieve deagglomeration and subsequent mixing at varying length scale. A better understanding of this can have a major impact on the field of nano-structured materials; thus the long term objective of this project is to gain fundamental understanding of deagglomeration and mixing of nano-agglomerates. Dry mixing is in general not effective in achieving desired mixing at nanoscale, whereas wet mixing suffers from different disadvantages like nanomaterial of interest should be insoluble, has to wet the liquid, and involves additional steps of filtration and drying. This research examines the use of environmentally friendly a novel approach based on use of small magnetic particles as mixing media is introduced that achieves a high-degree of mixing at scales of about a micron. The method is tested for binary mixture of alumina/silica and silica/titania. Various parameters such as processing time, size of the magnets, and magnetic particle to powder mixed ratio are considered. Experiments are carried out in batch containers in liquid and dry mediums, as well as a fluidized bed set-up. Homogeneity of Mixing (HoM), defined as the compliment of the Intensity of Segregation, was evaluated at the micron scale through field-emission scanning electron microscopy (FESEM) and the energy dispersive x-ray spectroscopy (EDS). Secondary electron images, along with elemental mappings, were used to visualize the change in agglomerate sizes. Compositional percent data of each element were obtained through an EDS spatial distribution point analysis and used to obtain quantitative analysis on the homogeneity of the mixture. The effect of magnet impaction on mixing quality was examined on the HoM of binary mixtures. The research shows that HoM improved with magnetically assisted impaction mixing techniques indicating that the HoM depends on the product of processing time with the number of magnets. In a fluidized bed set-up, MAIM not only improved dispersion, but it was also found that the magnetic particles served to break down the larger agglomerates, to reduce the minimum fluidization velocity, to delay the onset of bubbling, and to convert the fluidization behavior of ABF powder to APF. Thus MAIM techniques may be used to achieve mixing of nanopowders at a desired HoM through adjusting the number of magnets and processing time; and its inherent advantages are its simplicity, an environmentally benign operation, and reduced cost as compared with wet mixing techniques.
Influence of temperature and aging time on HA synthesized by the hydrothermal method.
Kothapalli, C R; Wei, M; Legeros, R Z; Shaw, M T
2005-05-01
The influence of temperature and aging time on the morphology and mechanical properties of nano-sized hydroxyapatite (HA) synthesized by a hydrothermal method is reported here. The pre-mixed reactants were poured into a stirred autoclave and reacted at temperatures between 25-250 degrees C for 2-10 h. HA powders thus obtained were examined using X-ray diffraction (XRD), high-resolution field emission scanning electron microscopy (FESEM) and a particle size analyzer. It was found that the aspect ratio of the particles increased with the reaction temperature. The length of the HA particles increased with the reaction temperature below 170 degrees C, but it decreased when the temperature was raised above 170 degrees C. The agglomerates of HA particles were formed during synthesis, and their sizes were strongly dependent on reaction temperatures. As the reaction temperature increased, the agglomerate size decreased (p = 0.008). The density of the discs pressed from these samples reached 85-90% of the theoretical density after sintering at 1200 degrees C for 1 h. No decomposition to other calcium phosphates was detected at this sintering temperature. A correlation existed (p = 0.05) between the agglomerate sizes of HA particles synthesized at various conditions and their sintered densities. With the increase of the agglomerate size, the sintered density of the HA compact decreased. It was found that both the sintered density and flexural strength increased with increasing aging time and reaction temperature. A maximum flexural strength of 78 MPa was observed for the samples synthesized at 170 degrees C for 5 h with the predicted average at these conditions being 65 MPa. These samples attained an average sintered density of 88%.
Low-rank coal oil agglomeration
Knudson, Curtis L.; Timpe, Ronald C.
1991-01-01
A low-rank coal oil agglomeration process. High mineral content, a high ash content subbituminous coals are effectively agglomerated with a bridging oil which is partially water soluble and capable of entering the pore structure, and usually coal derived.
The Magnet Cove Rutile Company mine, Hot Spring County, Arkansas
Kinney, Douglas M.
1949-01-01
The Magnet Cove Rutile Company mine was mapped by the U.S. Geological Survey in November 1944. The pits are on the northern edge of Magnet Cove and have been excavated in the oxidized zone of highly weathered and altered volcanic agglomerate. The agglomerate is composed of altered mafic igneous rocks in a matrix of white to gray clay, a highly altered tuff. The agglomerate appears layered and is composed of tuffaceous clay material below and igneous blocks above. The agglomerate is cut by aplite and lamprophyre dikes. Alkalic syenite dikes crop out on the ridge north of the pits. At the present stage of mine development the rutile seems to be concentrated in a narrow zone beneath the igneous blocks of the agglomerate. Rutile, associated with calcite and pyrite, occurs as disseminated acicular crystals and discontinuous vein-like masses in the altered tuff. Thin veins of rutile locally penetrate the mafic igneous blocks of the agglomerate.
Three-dimensional unstructured grid Euler computations using a fully-implicit, upwind method
NASA Technical Reports Server (NTRS)
Whitaker, David L.
1993-01-01
A method has been developed to solve the Euler equations on a three-dimensional unstructured grid composed of tetrahedra. The method uses an upwind flow solver with a linearized, backward-Euler time integration scheme. Each time step results in a sparse linear system of equations which is solved by an iterative, sparse matrix solver. Local-time stepping, switched evolution relaxation (SER), preconditioning and reuse of the Jacobian are employed to accelerate the convergence rate. Implicit boundary conditions were found to be extremely important for fast convergence. Numerical experiments have shown that convergence rates comparable to that of a multigrid, central-difference scheme are achievable on the same mesh. Results are presented for several grids about an ONERA M6 wing.
Composite propellant combustion with low aluminum agglomeration
NASA Astrophysics Data System (ADS)
Mullen, Jessica Christine
Aluminum behavior---accumulation, agglomeration and ignition---is studied in a unique, wide-distribution, ammonium perchlorate/hydroxyl-terminated polybutadiene (AP/HTPB) propellant formulation that results in low Al agglomeration, even at low pressures (1--30 atm). Variations in formulation---such as fine-AP/binder ratio, Al particle size, Al loading, coarse-AP size---are also examined. A fuel-rich, oxygenated binder matrix highly loaded with fine (2-mum) AP (FAP) at 75/25:FAP/binder (by mass) is found to have premixed flame conditions that produce minimal agglomeration (without ignition) of 15-mum Al. Coarse AP (CAP) is added to the system in the form of either particles (200 or 400 mum) or pressed-AP laminates (simulated CAP). In the 2-D laminate system the CAP/oxyfuel-matrix flame structure is seen to be similar to that previously described for non-aluminized laminates with split (diffusion) and merged (partially-premixed) flame regimes, depending on pressure and fuel-matrix thickness. Both laminate and particulate systems show that with CAP present, Al can agglomerate more extensively on CAP via lateral surface migration from fuel matrix to the CAP region. The particulate CAP system also shows that Al can accumulate/agglomerate via settling on CAP from above (in the direction of burning). Both systems, but more clearly the 2-D laminates, show that with CAP present, Al is ignited by the outer CAP/fuel-matrix canopy flames. Thus, a propellant formulation is proposed for reducing overall Al agglomeration through intrinsically reduced agglomeration in the fuel-matrix and a reduced number of CAP-particle agglomerates via higher FAP/CAP ratio.
Low-rank coal oil agglomeration
Knudson, C.L.; Timpe, R.C.
1991-07-16
A low-rank coal oil agglomeration process is described. High mineral content, a high ash content subbituminous coals are effectively agglomerated with a bridging oil which is partially water soluble and capable of entering the pore structure, and is usually coal-derived.
A multilevel finite element method for Fredholm integral eigenvalue problems
NASA Astrophysics Data System (ADS)
Xie, Hehu; Zhou, Tao
2015-12-01
In this work, we proposed a multigrid finite element (MFE) method for solving the Fredholm integral eigenvalue problems. The main motivation for such studies is to compute the Karhunen-Loève expansions of random fields, which play an important role in the applications of uncertainty quantification. In our MFE framework, solving the eigenvalue problem is converted to doing a series of integral iterations and eigenvalue solving in the coarsest mesh. Then, any existing efficient integration scheme can be used for the associated integration process. The error estimates are provided, and the computational complexity is analyzed. It is noticed that the total computational work of our method is comparable with a single integration step in the finest mesh. Several numerical experiments are presented to validate the efficiency of the proposed numerical method.
Modeling of particle agglomeration in nanofluids
DOE Office of Scientific and Technical Information (OSTI.GOV)
Krishna, K. Hari; Neti, S.; Oztekin, A.
2015-03-07
Agglomeration strongly influences the stability or shelf life of nanofluid. The present computational and experimental study investigates the rate of agglomeration quantitatively. Agglomeration in nanofluids is attributed to the net effect of various inter-particle interaction forces. For the nanofluid considered here, a net inter-particle force depends on the particle size, volume fraction, pH, and electrolyte concentration. A solution of the discretized and coupled population balance equations can yield particle sizes as a function of time. Nanofluid prepared here consists of alumina nanoparticles with the average particle size of 150 nm dispersed in de-ionized water. As the pH of the colloid wasmore » moved towards the isoelectric point of alumina nanofluids, the rate of increase of average particle size increased with time due to lower net positive charge on particles. The rate at which the average particle size is increased is predicted and measured for different electrolyte concentration and volume fraction. The higher rate of agglomeration is attributed to the decrease in the electrostatic double layer repulsion forces. The rate of agglomeration decreases due to increase in the size of nano-particle clusters thus approaching zero rate of agglomeration when all the clusters are nearly uniform in size. Predicted rates of agglomeration agree adequate enough with the measured values; validating the mathematical model and numerical approach is employed.« less
Spatial Linkage and Urban Expansion: AN Urban Agglomeration View
NASA Astrophysics Data System (ADS)
Jiao, L. M.; Tang, X.; Liu, X. P.
2017-09-01
Urban expansion displays different characteristics in each period. From the perspective of the urban agglomeration, studying the spatial and temporal characteristics of urban expansion plays an important role in understanding the complex relationship between urban expansion and network structure of urban agglomeration. We analyze urban expansion in the Yangtze River Delta Urban Agglomeration (YRD) through accessibility to and spatial interaction intensity from core cities as well as accessibility of road network. Results show that: (1) Correlation between urban expansion intensity and spatial indicators such as location and space syntax variables is remarkable and positive, while it decreases after rapid expansion. (2) Urban expansion velocity displays a positive correlation with spatial indicators mentioned above in the first (1980-1990) and second (1990-2000) period. However, it exhibits a negative relationship in the third period (2000-2010), i.e., cities located in the periphery of urban agglomeration developing more quickly. Consequently, the hypothesis of convergence of urban expansion in rapid expansion stage is put forward. (3) Results of Zipf's law and Gibrat's law show urban expansion in YRD displays a convergent trend in rapid expansion stage, small and medium-sized cities growing faster. This study shows that spatial linkage plays an important but evolving role in urban expansion within the urban agglomeration. In addition, it serves as a reference to the planning of Yangtze River Delta Urban Agglomeration and regulation of urban expansion of other urban agglomerations.
NASA Technical Reports Server (NTRS)
Mineck, Raymond E.; Thomas, James L.; Biedron, Robert T.; Diskin, Boris
2005-01-01
FMG3D (full multigrid 3 dimensions) is a pilot computer program that solves equations of fluid flow using a finite difference representation on a structured grid. Infrastructure exists for three dimensions but the current implementation treats only two dimensions. Written in Fortran 90, FMG3D takes advantage of the recursive subroutine feature, dynamic memory allocation, and structured-programming constructs of that language. FMG3D supports multi-block grids with three types of block-to-block interfaces: periodic, C-zero, and C-infinity. For all three types, grid points must match at interfaces. For periodic and C-infinity types, derivatives of grid metrics must be continuous at interfaces. The available equation sets are as follows: scalar elliptic equations, scalar convection equations, and the pressure-Poisson formulation of the Navier-Stokes equations for an incompressible fluid. All the equation sets are implemented with nonzero forcing functions to enable the use of user-specified solutions to assist in verification and validation. The equations are solved with a full multigrid scheme using a full approximation scheme to converge the solution on each succeeding grid level. Restriction to the next coarser mesh uses direct injection for variables and full weighting for residual quantities; prolongation of the coarse grid correction from the coarse mesh to the fine mesh uses bilinear interpolation; and prolongation of the coarse grid solution uses bicubic interpolation.
The Fate of Polyol-Made ZnO and CdS Nanoparticles in Seine River Water (Paris, France).
da Rocha, Alice; Sivry, Yann; Gelabert, Alexandre; Beji, Zyed; Benedetti, Marc F; Menguy, Nicolas; Brayner, Roberta
2015-05-01
This study aims to characterize nanoparticles with different compositions and structures as well as seeing their evolutions over time in a natural environment such as Seine river water (Paris, France). Face centered cubic (fcc) and hexagonal (hcp) CdS as well as hexagonal (hcp) ZnO nanoparticles were synthesized by the Polyol method. CdS nanoparticles (i) cfc structure: are agglomerated, present 100 nm length with heterogeneous diameter and 10 m2 g(-1) specific surface area (S(g)) from Brunauer Emett and Teller (BET) measurements; (ii) hcp structure: 20 nm and S(g) = 67 m2 g(-1). ZnO hcp nanoparticles presents 50 nm length and 15 nm diameter and S(g) = 54 m2 g(-1). These results are in agreement with X-ray diffraction (XRD), and small angle X-ray scattering (SAXs). After 48 h interaction with Seine river water, cryo-TEM analysis showed that ZnO nanoparticles form spherical agglomerates with 300 nm diameter; CdS nanoparticles (fcc) are agglomerated presenting large diameters (> 500 nm); and CdS nanoparticles (hcp) are not agglomerated and present the same characteristics of the starting material. After 168h of contact with Seine river water, CdS (fcc) presents only 14% of dissolution, CdS (hcp) presents both 60% dissolution and 30% reprecipitation in a cadmium carbonate form and finally almost 90% of ZnO nanoparticles are dissolved.
Construction, classification and parametrization of complex Hadamard matrices
NASA Astrophysics Data System (ADS)
Szöllősi, Ferenc
To improve the design of nuclear systems, high-fidelity neutron fluxes are required. Leadership-class machines provide platforms on which very large problems can be solved. Computing such fluxes efficiently requires numerical methods with good convergence properties and algorithms that can scale to hundreds of thousands of cores. Many 3-D deterministic transport codes are decomposable in space and angle only, limiting them to tens of thousands of cores. Most codes rely on methods such as Gauss Seidel for fixed source problems and power iteration for eigenvalue problems, which can be slow to converge for challenging problems like those with highly scattering materials or high dominance ratios. Three methods have been added to the 3-D SN transport code Denovo that are designed to improve convergence and enable the full use of cutting-edge computers. The first is a multigroup Krylov solver that converges more quickly than Gauss Seidel and parallelizes the code in energy such that Denovo can use hundreds of thousand of cores effectively. The second is Rayleigh quotient iteration (RQI), an old method applied in a new context. This eigenvalue solver finds the dominant eigenvalue in a mathematically optimal way and should converge in fewer iterations than power iteration. RQI creates energy-block-dense equations that the new Krylov solver treats efficiently. However, RQI can have convergence problems because it creates poorly conditioned systems. This can be overcome with preconditioning. The third method is a multigrid-in-energy preconditioner. The preconditioner takes advantage of the new energy decomposition because the grids are in energy rather than space or angle. The preconditioner greatly reduces iteration count for many problem types and scales well in energy. It also allows RQI to be successful for problems it could not solve otherwise. The methods added to Denovo accomplish the goals of this work. They converge in fewer iterations than traditional methods and enable the use of hundreds of thousands of cores. Each method can be used individually, with the multigroup Krylov solver and multigrid-in-energy preconditioner being particularly successful on their own. The largest benefit, though, comes from using these methods in concert.
A parallel finite-difference method for computational aerodynamics
NASA Technical Reports Server (NTRS)
Swisshelm, Julie M.
1989-01-01
A finite-difference scheme for solving complex three-dimensional aerodynamic flow on parallel-processing supercomputers is presented. The method consists of a basic flow solver with multigrid convergence acceleration, embedded grid refinements, and a zonal equation scheme. Multitasking and vectorization have been incorporated into the algorithm. Results obtained include multiprocessed flow simulations from the Cray X-MP and Cray-2. Speedups as high as 3.3 for the two-dimensional case and 3.5 for segments of the three-dimensional case have been achieved on the Cray-2. The entire solver attained a factor of 2.7 improvement over its unitasked version on the Cray-2. The performance of the parallel algorithm on each machine is analyzed.
Continuous Precipitation of Ceria Nanoparticles from a Continuous Flow Micromixer
DOE Office of Scientific and Technical Information (OSTI.GOV)
Tseng, Chih Heng; Paul, Brian; Chang, Chih-hung
2013-01-01
Cerium oxide nanoparticles were continuously precipitated from a solution of cerium(III) nitrate and ammonium hydroxide using a micro-scale T-mixer. Findings show that the method of mixing is important in the ceria precipitation process. In batch mixing and deposition, disintegration and agglomeration dominates the deposited film. In T-mixing and deposition, more uniform nanorod particles are attainable. In addition, it was found that the micromixing approach reduced the exposure of the Ce(OH)3 precipates to oxygen, yielding hydroxide precipates in place of CeO2 precipitates. Advantages of the micro-scale T-mixing approach include shorter mixing times, better control of nanoparticle shape and less agglomeration.
Textbook Multigrid Efficiency for Computational Fluid Dynamics Simulations
NASA Technical Reports Server (NTRS)
Brandt, Achi; Thomas, James L.; Diskin, Boris
2001-01-01
Considerable progress over the past thirty years has been made in the development of large-scale computational fluid dynamics (CFD) solvers for the Euler and Navier-Stokes equations. Computations are used routinely to design the cruise shapes of transport aircraft through complex-geometry simulations involving the solution of 25-100 million equations; in this arena the number of wind-tunnel tests for a new design has been substantially reduced. However, simulations of the entire flight envelope of the vehicle, including maximum lift, buffet onset, flutter, and control effectiveness have not been as successful in eliminating the reliance on wind-tunnel testing. These simulations involve unsteady flows with more separation and stronger shock waves than at cruise. The main reasons limiting further inroads of CFD into the design process are: (1) the reliability of turbulence models; and (2) the time and expense of the numerical simulation. Because of the prohibitive resolution requirements of direct simulations at high Reynolds numbers, transition and turbulence modeling is expected to remain an issue for the near term. The focus of this paper addresses the latter problem by attempting to attain optimal efficiencies in solving the governing equations. Typically current CFD codes based on the use of multigrid acceleration techniques and multistage Runge-Kutta time-stepping schemes are able to converge lift and drag values for cruise configurations within approximately 1000 residual evaluations. An optimally convergent method is defined as having textbook multigrid efficiency (TME), meaning the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in the discretized system of equations (residual equations). In this paper, a distributed relaxation approach to achieving TME for Reynolds-averaged Navier-Stokes (RNAS) equations are discussed along with the foundations that form the basis of this approach. Because the governing equations are a set of coupled nonlinear conservation equations with discontinuities (shocks, slip lines, etc.) and singularities (flow- or grid-induced), the difficulties are many. This paper summarizes recent progress towards the attainment of TME in basic CFD simulations.
Comments on an Analytical Thermal Agglomeration for Problems with Surface Growth
DOE Office of Scientific and Technical Information (OSTI.GOV)
Hodge, N. E.
2017-03-22
Up until Dec 2016, the thermal agglomeration was very heuristic, and as such, difficult to define. The lack of predictability became problematic, and the current notes represent the first real attempt to systematize the specification of the agglomerated process parameters.
Micro-Slit Collimators for X-Ray/Gamma-Ray Imaging
NASA Technical Reports Server (NTRS)
Appleby, Michael; Fraser, Iain; Klinger, Jill
2011-01-01
A hybrid photochemical-machining process is coupled with precision stack lamination to allow for the fabrication of multiple ultra-high-resolution grids on a single array substrate. In addition, special fixturing and etching techniques have been developed that allow higher-resolution multi-grid collimators to be fabricated. Building on past work of developing a manufacturing technique for fabricating multi-grid, high-resolution coating modulation collimators for arcsecond and subarcsecond x-ray and gamma-ray imaging, the current work reduces the grid pitch by almost a factor of two, down to 22 microns. Additionally, a process was developed for reducing thin, high-Z (tungsten or molybdenum) from the thinnest commercially available foil (25 microns thick) down to approximately equal to 10 microns thick using precisely controlled chemical etching
Alian, A R; Meguid, S A
2017-02-08
Most existing molecular dynamics simulations in nanoreinforced composites assume carbon nanotubes (CNTs) to be straight and uniformly dispersed within thermoplastics. In reality, however, CNTs are typically curved, agglomerated and aggregated as a result of van der Waal interactions and electrostatic forces. In this paper, we account for both curvature and agglomeration of CNTs in extensive molecular dynamic (MD) simulations. The purpose of these simulations is to evaluate the influence of waviness and agglomeration of these curved and agglomerated CNTs on the interfacial strength of thermoset nanocomposite and upon their load transfer capability. Two aspects of the work were accordingly examined. In the first, realistic carbon nanotubes (CNTs) of the same length but varied curvatures were embedded in thermoset polymer composites and simulations of pull-out tests were conducted to evaluate the corresponding interfacial shear strength (ISS). In the second, the effect of the agglomerate size upon the ISS was determined using bundles of CNTs of different diameters. The results of our MD simulations revealed the following. The pull-out force of the curved CNTs is significantly higher than its straight counterpart and increases further with the increase in the waviness of the CNTs. This is attributed to the added pull-out energy dissipated in straightening the CNTs during the pull-out process. It also reveals that agglomeration of CNTs leads to a reduction in the ISS and poor load transferability, and that this reduction is governed by the size of the agglomerate. The simulation results were also used to develop a generalized relation for the ISS that takes into consideration the effect of waviness and agglomeration of CNTs of CNT-polymer composites.
Simulation of deterministic energy-balance particle agglomeration in turbulent liquid-solid flows
NASA Astrophysics Data System (ADS)
Njobuenwu, Derrick O.; Fairweather, Michael
2017-08-01
An efficient technique to simulate turbulent particle-laden flow at high mass loadings within the four-way coupled simulation regime is presented. The technique implements large-eddy simulation, discrete particle simulation, a deterministic treatment of inter-particle collisions, and an energy-balanced particle agglomeration model. The algorithm to detect inter-particle collisions is such that the computational costs scale linearly with the number of particles present in the computational domain. On detection of a collision, particle agglomeration is tested based on the pre-collision kinetic energy, restitution coefficient, and van der Waals' interactions. The performance of the technique developed is tested by performing parametric studies on the influence of the restitution coefficient (en = 0.2, 0.4, 0.6, and 0.8), particle size (dp = 60, 120, 200, and 316 μm), Reynolds number (Reτ = 150, 300, and 590), and particle concentration (αp = 5.0 × 10-4, 1.0 × 10-3, and 5.0 × 10-3) on particle-particle interaction events (collision and agglomeration). The results demonstrate that the collision frequency shows a linear dependency on the restitution coefficient, while the agglomeration rate shows an inverse dependence. Collisions among smaller particles are more frequent and efficient in forming agglomerates than those of coarser particles. The particle-particle interaction events show a strong dependency on the shear Reynolds number Reτ, while increasing the particle concentration effectively enhances particle collision and agglomeration whilst having only a minor influence on the agglomeration rate. Overall, the sensitivity of the particle-particle interaction events to the selected simulation parameters is found to influence the population and distribution of the primary particles and agglomerates formed.
A scalable parallel black oil simulator on distributed memory parallel computers
NASA Astrophysics Data System (ADS)
Wang, Kun; Liu, Hui; Chen, Zhangxin
2015-11-01
This paper presents our work on developing a parallel black oil simulator for distributed memory computers based on our in-house parallel platform. The parallel simulator is designed to overcome the performance issues of common simulators that are implemented for personal computers and workstations. The finite difference method is applied to discretize the black oil model. In addition, some advanced techniques are employed to strengthen the robustness and parallel scalability of the simulator, including an inexact Newton method, matrix decoupling methods, and algebraic multigrid methods. A new multi-stage preconditioner is proposed to accelerate the solution of linear systems from the Newton methods. Numerical experiments show that our simulator is scalable and efficient, and is capable of simulating extremely large-scale black oil problems with tens of millions of grid blocks using thousands of MPI processes on parallel computers.
NASA Astrophysics Data System (ADS)
Kodama, Yasko; Rodrigues, Orlando, Jr.; Garcia, Rafael Henrique Lazzari; Santos, Paulo de Souza; Vasquez, Pablo A. S.
2016-07-01
Main subject of this article was to study room temperature stable radicals in Co-60 gamma irradiated contemporary paper using Electron Paramagnetic Resonance spectrometer (EPR). XRD was used to study the effect of ionizing radiation on the morphology of book paper. SEM images presented regions with cellulose fibers and regions with particles agglomeration on the cellulose fibers. Those agglomerations were rich in calcium, observed by EDS. XRD analysis confirmed presence of calcium carbonate diffraction peaks. The main objective of this study was to propose a method using conventional kinetics chemical reactions for the observed radical formed by ionizing radiation. Therefore, further analyses were made to study the half-life and the kinetics of the free radical created. This method can be suitably applied to study radicals on cultural heritage objects.
NASA Astrophysics Data System (ADS)
Tian, S.; Wang, J.; Gui, Z.; Wu, H.; Wang, Y.
2017-09-01
There has wide academic and policy attention on the issue of scale economy and industrial agglomeration, with most of the attention paid to industrial geography concentration. This paper adopted a scale-independent and distance-based measurement method, K-density function or known as Duranton and Overman (DO) index, to study the manufacturing industries localization in Shanghai, which is the most representative economic development zone in China and East Asia. The result indicates the industry has a growing tendency of localization, and various spatial distribution patterns in different distances. Furthermore, the class of industry also show significant influence on the concentration pattern. Besides, the method has been coded and published on GeoCommerce, a visualization and analysis portal for industrial big data, to provide geoprocessing and spatial decision support.
A MODEL FOR FINE PARTICLE AGGLOMERATION IN CIRCULATING FLUIDIZED BED ABSORBERS
A model for fine particle agglomeration in circulating fluidized bed absorbers (CFBAS) has been developed. It can model the influence of different factors on agglomeration, such as the geometry of CFBAs, superficial gas velocity, initial particle size distribution, and type of ag...
Nanoparticle agglomeration in an evaporating levitated droplet for different acoustic amplitudes
NASA Astrophysics Data System (ADS)
Tijerino, Erick; Basu, Saptarshi; Kumar, Ranganathan
2013-01-01
Radiatively heated levitated functional droplets with nanosilica suspensions exhibit three distinct stages namely pure evaporation, agglomeration, and finally structure formation. The temporal history of the droplet surface temperature shows two inflection points. One inflection point corresponds to a local maximum and demarcates the end of transient heating of the droplet and domination of vaporization. The second inflection point is a local minimum and indicates slowing down of the evaporation rate due to surface accumulation of nanoparticles. Morphology and final precipitation structures of levitated droplets are due to competing mechanisms of particle agglomeration, evaporation, and shape deformation. In this work, we provide a detailed analysis for each process and propose two important timescales for evaporation and agglomeration that determine the final diameter of the structure formed. It is seen that both agglomeration and evaporation timescales are similar functions of acoustic amplitude (sound pressure level), droplet size, viscosity, and density. However, we show that while the agglomeration timescale decreases with initial particle concentration, the evaporation timescale shows the opposite trend. The final normalized diameter can be shown to be dependent solely on the ratio of agglomeration to evaporation timescales for all concentrations and acoustic amplitudes. The structures also exhibit various aspect ratios (bowls, rings, spheroids) which depend on the ratio of the deformation timescale (tdef) and the agglomeration timescale (tg). For tdef
An algebraic multigrid method for Q2-Q1 mixed discretizations of the Navier-Stokes equations
DOE Office of Scientific and Technical Information (OSTI.GOV)
Prokopenko, Andrey; Tuminaro, Raymond S.
Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantities are not necessarily co-located at mesh points. Speci cally, we investigate a Q 2-Q 1 mixed finite element discretization of the incompressible Navier-Stokes equations where the number of velocity nodes is much greater than the number of pressure nodes. Consequently, some velocity degrees-of-freedom (dofs) are defined at spatial locations where there are no corresponding pressure dofs. Thus, AMG approaches lever- aging this co-located structure are not applicable. This paper instead proposes an automatic AMG coarsening that mimics certain pressure/velocitymore » dof relationships of the Q 2-Q 1 discretization. The main idea is to first automatically define coarse pressures in a somewhat standard AMG fashion and then to carefully (but automatically) choose coarse velocity unknowns so that the spatial location relationship between pressure and velocity dofs resembles that on the nest grid. To define coefficients within the inter-grid transfers, an energy minimization AMG (EMIN-AMG) is utilized. EMIN-AMG is not tied to specific coarsening schemes and grid transfer sparsity patterns, and so it is applicable to the proposed coarsening. Numerical results highlighting solver performance are given on Stokes and incompressible Navier-Stokes problems.« less
Transonic Drag Prediction Using an Unstructured Multigrid Solver
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.; Levy, David W.
2001-01-01
This paper summarizes the results obtained with the NSU-3D unstructured multigrid solver for the AIAA Drag Prediction Workshop held in Anaheim, CA, June 2001. The test case for the workshop consists of a wing-body configuration at transonic flow conditions. Flow analyses for a complete test matrix of lift coefficient values and Mach numbers at a constant Reynolds number are performed, thus producing a set of drag polars and drag rise curves which are compared with experimental data. Results were obtained independently by both authors using an identical baseline grid and different refined grids. Most cases were run in parallel on commodity cluster-type machines while the largest cases were run on an SGI Origin machine using 128 processors. The objective of this paper is to study the accuracy of the subject unstructured grid solver for predicting drag in the transonic cruise regime, to assess the efficiency of the method in terms of convergence, cpu time, and memory, and to determine the effects of grid resolution on this predictive ability and its computational efficiency. A good predictive ability is demonstrated over a wide range of conditions, although accuracy was found to degrade for cases at higher Mach numbers and lift values where increasing amounts of flow separation occur. The ability to rapidly compute large numbers of cases at varying flow conditions using an unstructured solver on inexpensive clusters of commodity computers is also demonstrated.
An algebraic multigrid method for Q2-Q1 mixed discretizations of the Navier-Stokes equations
Prokopenko, Andrey; Tuminaro, Raymond S.
2016-07-01
Algebraic multigrid (AMG) preconditioners are considered for discretized systems of partial differential equations (PDEs) where unknowns associated with different physical quantities are not necessarily co-located at mesh points. Speci cally, we investigate a Q 2-Q 1 mixed finite element discretization of the incompressible Navier-Stokes equations where the number of velocity nodes is much greater than the number of pressure nodes. Consequently, some velocity degrees-of-freedom (dofs) are defined at spatial locations where there are no corresponding pressure dofs. Thus, AMG approaches lever- aging this co-located structure are not applicable. This paper instead proposes an automatic AMG coarsening that mimics certain pressure/velocitymore » dof relationships of the Q 2-Q 1 discretization. The main idea is to first automatically define coarse pressures in a somewhat standard AMG fashion and then to carefully (but automatically) choose coarse velocity unknowns so that the spatial location relationship between pressure and velocity dofs resembles that on the nest grid. To define coefficients within the inter-grid transfers, an energy minimization AMG (EMIN-AMG) is utilized. EMIN-AMG is not tied to specific coarsening schemes and grid transfer sparsity patterns, and so it is applicable to the proposed coarsening. Numerical results highlighting solver performance are given on Stokes and incompressible Navier-Stokes problems.« less
NASA Astrophysics Data System (ADS)
Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María
2014-06-01
We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the parallel context.
On the implementation of an accurate and efficient solver for convection-diffusion equations
NASA Astrophysics Data System (ADS)
Wu, Chin-Tien
In this dissertation, we examine several different aspects of computing the numerical solution of the convection-diffusion equation. The solution of this equation often exhibits sharp gradients due to Dirichlet outflow boundaries or discontinuities in boundary conditions. Because of the singular-perturbed nature of the equation, numerical solutions often have severe oscillations when grid sizes are not small enough to resolve sharp gradients. To overcome such difficulties, the streamline diffusion discretization method can be used to obtain an accurate approximate solution in regions where the solution is smooth. To increase accuracy of the solution in the regions containing layers, adaptive mesh refinement and mesh movement based on a posteriori error estimations can be employed. An error-adapted mesh refinement strategy based on a posteriori error estimations is also proposed to resolve layers. For solving the sparse linear systems that arise from discretization, goemetric multigrid (MG) and algebraic multigrid (AMG) are compared. In addition, both methods are also used as preconditioners for Krylov subspace methods. We derive some convergence results for MG with line Gauss-Seidel smoothers and bilinear interpolation. Finally, while considering adaptive mesh refinement as an integral part of the solution process, it is natural to set a stopping tolerance for the iterative linear solvers on each mesh stage so that the difference between the approximate solution obtained from iterative methods and the finite element solution is bounded by an a posteriori error bound. Here, we present two stopping criteria. The first is based on a residual-type a posteriori error estimator developed by Verfurth. The second is based on an a posteriori error estimator, using local solutions, developed by Kay and Silvester. Our numerical results show the refined mesh obtained from the iterative solution which satisfies the second criteria is similar to the refined mesh obtained from the finite element solution.
Rock geochemistry in the Mahd adh Dhahab district, Kingdom of Saudi Arabia
Worl, R.G.; Doebrich, J.L.; Allen, M.S.; Afifi, A.M.; Ebens, R.J.
1987-01-01
Anomalous values of gold, silver, lead, and to a lesser extent copper and zinc in surface rock samples clearly delineated the northern mineralized zone in the upper agglomerate, and an east-vein area and west-vein area of the southern mineralized zone in the lower agglomerate. A third geochemically anomalous area occurs farther to the west in the lower agglomerate, suggesting that mineralization may have extended at least to this area along the lower agglomerate-lower tuff contact, and possibly even further to the west.
Search for the contamination source of butyltin compounds in wine: agglomerated cork stoppers.
Jiang, Gui-Bin; Liu, Ji-Yan; Zhou, Qun-Fang
2004-08-15
A possible butyltin contamination source in wine was studied in this paper. Agglomerated cork stoppers, which were produced in Portugal, Spain, and Italy, used in wine bottles were examined. The domestic cork products, cork granules, and mucus used for cork products were also analyzed. The levels of mono- and dibutyltin compounds in corks were found in the range from <0.0024 to 3.3 and from <0.0029 to 6.7 microg of Sn/g, respectively. A low level of tributyltin contamination was also found in 2 of 31 tested samples. The presence of butyltin compounds in agglomerated cork stoppers was confirmed by GC-MS. Experimental results indicated that all overseas agglomerated cork stoppers studied contained mono- and/or dibutyltins. Butyltins were not detected in cork granules, mucus, most of the natural cork stoppers, and domestic agglomerated cork products. The concentrations of mono- and dibutyltins increased with the time in a 30-day experiment, showing that butyltin compounds can leach from agglomerated cork to the wine. When the butyltin concentrations in wine samples were compared with their levels in the corresponding agglomerated cork stoppers, a correlation was found. The potential harm of such food contamination was evaluated by the toxic research of butyltin compounds using Daphnia sp. as the experimental model.
Centrifugal air-assisted melt agglomeration for fast-release "granulet" design.
Wong, Tin Wui; Musa, Nafisah
2012-07-01
Conventional melt pelletization and granulation processes produce round and dense, and irregularly shaped but porous agglomerates respectively. This study aimed to design centrifugal air-assisted melt agglomeration technology for manufacture of spherical and yet porous "granulets" for ease of downstream manufacturing and enhancing drug release. A bladeless agglomerator, which utilized shear-free air stream to mass the powder mixture of lactose filler, polyethylene glycol binder and poorly water-soluble tolbutamide drug into "granulets", was developed. The inclination angle and number of vane, air-impermeable surface area of air guide, processing temperature, binder content and molecular weight were investigated with reference to "granulet" size, shape, texture and drug release properties. Unlike fluid-bed melt agglomeration with vertical processing air flow, the air stream in the present technology moved centrifugally to roll the processing mass into spherical but porous "granulets" with a drug release propensity higher than physical powder mixture, unprocessed drug and dense pellets prepared using high shear mixer. The fast-release attribute of "granulets" was ascribed to porous matrix formed with a high level of polyethylene glycol as solubilizer. The agglomeration and drug release outcomes of centrifugal air-assisted technology are unmet by the existing high shear and fluid-bed melt agglomeration techniques. Copyright © 2012 Elsevier B.V. All rights reserved.
Light scattering by low-density agglomerates of micron-sized grains with the PROGRA2 experiment
NASA Astrophysics Data System (ADS)
Hadamcik, E.; Renard, J.-B.; Lasue, J.; Levasseur-Regourd, A. C.; Blum, J.; Schraepler, R.
2007-07-01
This work was carried out with the PROGRA2 experiment, specifically developed to measure the angular dependence of the polarization of light scattered by dust particles. The samples are small agglomerates of micron-sized grains and huge, low number density agglomerates of the same grains. The constituent grains (spherical or irregularly shaped) are made of different non-absorbing and absorbing materials. The small agglomerates, in a size range of a few microns, are lifted by an air draught. The huge centimeter-sized agglomerates, produced by random ballistic deposition of the grains, are deposited on a flat surface. The phase curves obtained for monodisperse, micron-sized spheres in agglomerates are obviously not comparable to the ‘smooth’ phase curves obtained by remote observations of cometary dust or asteroidal regoliths but they are used for comparison with numerical calculations to a better understanding of the light scattering processes. The phase curves obtained for irregular grains in agglomerates are similar to those obtained by remote observations, with a negative branch at phase angles smaller than 20° and a maximum polarization decreasing with increasing albedo. These results, coupled with remote observations in the solar system, should provide a better understanding of the physical properties of solid particles and their variation in cometary comae and asteroidal regoliths.
Mensch, Christopher D; Davis, Harrison B; Blue, Jeffrey T
2015-01-01
The purpose of this work was to investigate the susceptibility of an aluminum adjuvant and an aluminum-adjuvanted native outer membrane vesicle (nOMV) vaccine formulation to freeze/thaw-induced agglomeration using static light scattering and micro-flow Imaging analysis; and to evaluate the use of propylene glycol as a vaccine formulation excipient by which freeze/thaw-induced agglomeration of a nOMV vaccine formulation could be mitigated. Our results indicate that including 7% v/v propylene glycol in an nOMV containing aluminum adjuvanted vaccine formulation, mitigates freeze/thaw-induced agglomeration. We evaluated the effect of freeze-thawing on an aluminum adjuvant and an aluminum adjuvanted native outer membrane vesicle (nOMV) vaccine formulation. Specifically, we characterized the freeze/thaw-induced agglomeration through the use of static light scattering, micro-flow imaging, and cryo-electron microscopy analysis. Further, we evaluated the use of 0-9% v/v propylene glycol as an excipient which could be included in the formulation for the purpose of mitigating the agglomeration induced by freeze/thaw. The results indicate that using 7% v/v propylene glycol as a formulation excipient is effective at mitigating agglomeration of the nOMV vaccine formulation, otherwise induced by freeze-thawing. © PDA, Inc. 2015.
Numerical simulation and experimental investigation about internal and external flows†
NASA Astrophysics Data System (ADS)
Wang, Tao; Yang, Guowei; Huang, Guojun; Zhou, Liandi
2006-06-01
In this paper, TASCflow3D is used to solve inner and outer 3D viscous incompressible turbulent flow (Re=5.6×106) around axisymmetric body with duct. The governing equation is a RANS equation with standard k ɛ turbulence model. The discrete method used is a finite volume method based on the finite element approach. In this method, the description of geometry is very flexible and at the same time important conservative properties are retained. The multi-block and algebraic multi-grid techniques are used for the convergence acceleration. Agreement between experimental results and calculation is good. It indicates that this novel approach can be used to simulate complex flow such as the interaction between rotor and stator or propulsion systems containing tip clearance and cavitation.
Peering through the flames: imaging techniques for reacting aluminum powders
Zepper, Ethan T.; Pantoya, Michelle L.; Bhattacharya, Sukalyan; ...
2017-03-17
Combusting metals burn at high temperatures and emit high-intensity radiation in the visible spectrum which can over-saturate regular imaging sensors and obscure the field of view. Filtering the luminescence can result in limited information and hinder thorough combustion characterization. A method for “seeing through the flames” of a highly luminescent aluminum powder reaction is presented using copper vapor laser (CVL) illumination synchronized with a high-speed camera. A statistical comparison of combusting aluminum particle agglomerate between filtered halogen and CVL illumination shows the effectiveness of this diagnostic approach. When ignited by an electrically induced plasma, aluminum particles are entrained as solidmore » agglomerates that rotate about their centers of mass and are surrounded by emitted, burning gases. Furthermore, the average agglomerate diameter appears to be 160 micrometers when viewed with standard illumination and a high-speed camera. But, a significantly lower diameter of 50 micrometers is recorded when imaged with CVL illumination. Our results advocate that alternative imaging techniques are required to resolve the complexities of metal particle combustion.« less
Improving cycle stability of SnS anode for sodium-ion batteries by limiting Sn agglomeration
NASA Astrophysics Data System (ADS)
Wang, Wenhui; Shi, Liang; Lan, Danni; Li, Quan
2018-02-01
Flower-like SnS nanostructures are obtained by a simple solvothermal method for anode applications in Na-ion batteries. We show experimental evidence of progressive Sn agglomeration and crystalline Na2S enrichment at the end of de-sodiation process of the SnS electrode, both of which contribute to the capacity decay of the electrode upon repeated cycles. By replacing the commonly adopted acetylene black conductive additive with multi-wall carbon nanotubes (MWCNT), the cycle stability of the SnS electrode is largely improved, which correlates well with the observed suppression of both Sn agglomeration and Na2S enrichment at the end of de-sodiation cycle. A full cell is assembled with the SnS/MWCNT anode and the P2-Na2/3Ni1/3Mn1/2Ti1/6O2 cathode. An initial energy density of 262 Wh/kg (normalized to the total mass of cathode and anode) is demonstrated for the full cell, which retains 71% of the first discharge capacity after 40 cycles.
Process for the production of fuel gas from coal
Patel, Jitendra G.; Sandstrom, William A.; Tarman, Paul B.
1982-01-01
An improved apparatus and process for the conversion of hydrocarbonaceous materials, such as coal, to more valuable gaseous products in a fluidized bed gasification reaction and efficient withdrawal of agglomerated ash from the fluidized bed is disclosed. The improvements are obtained by introducing an oxygen containing gas into the bottom of the fluidized bed through a separate conduit positioned within the center of a nozzle adapted to agglomerate and withdraw the ash from the bottom of the fluidized bed. The conduit extends above the constricted center portion of the nozzle and preferably terminates within and does not extend from the nozzle. In addition to improving ash agglomeration and withdrawal, the present invention prevents sintering and clinkering of the ash in the fluidized bed and permits the efficient recycle of fine material recovered from the product gases by contacting the fines in the fluidized bed with the oxygen as it emanates from the conduit positioned within the withdrawal nozzle. Finally, the present method of oxygen introduction permits the efficient recycle of a portion of the product gases to the reaction zone to increase the reducing properties of the hot product gas.
Feathering effect detection and artifact agglomeration index-based video deinterlacing technique
NASA Astrophysics Data System (ADS)
Martins, André Luis; Rodrigues, Evandro Luis Linhari; de Paiva, Maria Stela Veludo
2018-03-01
Several video deinterlacing techniques have been developed, and each one presents a better performance in certain conditions. Occasionally, even the most modern deinterlacing techniques create frames with worse quality than primitive deinterlacing processes. This paper validates that the final image quality can be improved by combining different types of deinterlacing techniques. The proposed strategy is able to select between two types of deinterlaced frames and, if necessary, make the local correction of the defects. This decision is based on an artifact agglomeration index obtained from a feathering effect detection map. Starting from a deinterlaced frame produced by the "interfield average" method, the defective areas are identified, and, if deemed appropriate, these areas are replaced by pixels generated through the "edge-based line average" method. Test results have proven that the proposed technique is able to produce video frames with higher quality than applying a single deinterlacing technique through getting what is good from intra- and interfield methods.
Friction Stir Welding of Al Alloy 2219-T8: Part II-Mechanical and Corrosion
NASA Astrophysics Data System (ADS)
Kang, Ju; Feng, Zhi-Cao; Li, Ji-Chao; Frankel, G. S.; Wang, Guo-Qing; Wu, Ai-Ping
2016-09-01
In Part I of this series, abnormal agglomerations of θ particles with size of about 100 to 1000 µm were observed in friction stir welded AA2219-T8 joints. In this work, the effects of these agglomerated θ particles on the mechanical and corrosion properties of the joints are studied. Tensile testing with in situ SEM imaging was utilized to monitor crack initiation and propagation in base metal and weld nugget zone (WNZ) samples. These tests showed that cracks initiated in the θ particles and at the θ/matrix interfaces, but not in the matrix. The WNZ samples containing abnormal agglomerated θ particles had a similar ultimate tensile stress but 3 pct less elongation than other WNZ samples with only normal θ particles. Measurements using the microcell technique indicated that the agglomerated θ particles acted as a cathode causing the dissolution of adjacent matrix. The abnormal θ particle agglomerations led to more severe localized attack due to the large cathode/anode ratio. Al preferential dissolution occurred in the abnormal θ particle agglomerations, which was different from the corrosion behavior of normal size θ particles.
NASA Technical Reports Server (NTRS)
Wang, Gang
2003-01-01
A multi grid solution procedure for the numerical simulation of turbulent flows in complex geometries has been developed. A Full Multigrid-Full Approximation Scheme (FMG-FAS) is incorporated into the continuity and momentum equations, while the scalars are decoupled from the multi grid V-cycle. A standard kappa-Epsilon turbulence model with wall functions has been used to close the governing equations. The numerical solution is accomplished by solving for the Cartesian velocity components either with a traditional grid staggering arrangement or with a multiple velocity grid staggering arrangement. The two solution methodologies are evaluated for relative computational efficiency. The solution procedure with traditional staggering arrangement is subsequently applied to calculate the flow and temperature fields around a model Short Take-off and Vertical Landing (STOVL) aircraft hovering in ground proximity.
Adaptive multigrid domain decomposition solutions for viscous interacting flows
NASA Technical Reports Server (NTRS)
Rubin, Stanley G.; Srinivasan, Kumar
1992-01-01
Several viscous incompressible flows with strong pressure interaction and/or axial flow reversal are considered with an adaptive multigrid domain decomposition procedure. Specific examples include the triple deck structure surrounding the trailing edge of a flat plate, the flow recirculation in a trough geometry, and the flow in a rearward facing step channel. For the latter case, there are multiple recirculation zones, of different character, for laminar and turbulent flow conditions. A pressure-based form of flux-vector splitting is applied to the Navier-Stokes equations, which are represented by an implicit lowest-order reduced Navier-Stokes (RNS) system and a purely diffusive, higher-order, deferred-corrector. A trapezoidal or box-like form of discretization insures that all mass conservation properties are satisfied at interfacial and outflow boundaries, even for this primitive-variable, non-staggered grid computation.
Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model
NASA Technical Reports Server (NTRS)
Mavriplis, D. J.; Matinelli, L.
1994-01-01
The steady state solution of the system of equations consisting of the full Navier-Stokes equations and two turbulence equations has been obtained using a multigrid strategy of unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time-stepping scheme with a stability-bound local time step, while turbulence equations are advanced in a point-implicit scheme with a time step which guarantees stability and positivity. Low-Reynolds-number modifications to the original two-equation model are incorporated in a manner which results in well-behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved, initializing all quantities with uniform freestream values. Rapid and uniform convergence rates for the flow and turbulence equations are observed.
Sun, Xiaowei; Cheng, Shuiyuan; Lang, Jianlei; Ren, Zhenhai; Sun, Chao
2018-06-01
This paper presents the first attempt to investigate the emission source control of the Middle Reaches of Yangtze River Urban Agglomerations (MRYRUA), one of the national urban agglomerations in China. An emission inventory of the MRYRUA was developed as inputs to the CAMx model based on county-level activity data obtained by full-coverage investigation and source-based spatial surrogates. A classification technology method for priority control of atmospheric emission sources was introduced and applied in the MRYRUA for the evaluation of the emission sources control on the region-scale and city-scale, respectively. The results demonstrated that the emission sources in the Hefei-centered urban agglomerations contributed the biggest on the mean PM 2.5 concentrations of the MRYRUA and should be taken the priority to control. The emission sources in the Ma'anshan city, Xiangtan city, Hefei city and Wuhan city were the bigger contributors on the mean PM 2.5 concentrations of the MRYRUA among the cities and should be taken the priority to control. In generally, emission sources in cities along the Yangtze River and the tributary should be given the special attention for the regional air quality target attainments. This study can give an understanding of Chinese emissions and provide a valuable preference to policy makers for finding effective mitigation measures and control strategies for reducing national and regional air pollution in China. Copyright © 2017 Elsevier B.V. All rights reserved.