Science.gov

Sample records for algebraic multigrid method

  1. Adaptive Algebraic Multigrid Methods

    SciTech Connect

    Brezina, M; Falgout, R; MacLachlan, S; Manteuffel, T; McCormick, S; Ruge, J

    2004-04-09

    Our ability to simulate physical processes numerically is constrained by our ability to solve the resulting linear systems, prompting substantial research into the development of multiscale iterative methods capable of solving these linear systems with an optimal amount of effort. Overcoming the limitations of geometric multigrid methods to simple geometries and differential equations, algebraic multigrid methods construct the multigrid hierarchy based only on the given matrix. While this allows for efficient black-box solution of the linear systems associated with discretizations of many elliptic differential equations, it also results in a lack of robustness due to assumptions made on the near-null spaces of these matrices. This paper introduces an extension to algebraic multigrid methods that removes the need to make such assumptions by utilizing an adaptive process. The principles which guide the adaptivity are highlighted, as well as their application to algebraic multigrid solution of certain symmetric positive-definite linear systems.

  2. 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.

  3. Parallel Algebraic Multigrid Methods - High Performance Preconditioners

    SciTech Connect

    Yang, U M

    2004-11-11

    The development of high performance, massively parallel computers and the increasing demands of computationally challenging applications have necessitated the development of scalable solvers and preconditioners. One of the most effective ways to achieve scalability is the use of multigrid or multilevel techniques. Algebraic multigrid (AMG) is a very efficient algorithm for solving large problems on unstructured grids. While much of it can be parallelized in a straightforward way, some components of the classical algorithm, particularly the coarsening process and some of the most efficient smoothers, are highly sequential, and require new parallel approaches. This chapter presents the basic principles of AMG and gives an overview of various parallel implementations of AMG, including descriptions of parallel coarsening schemes and smoothers, some numerical results as well as references to existing software packages.

  4. 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.

  5. An Introduction to Algebraic Multigrid

    SciTech Connect

    Falgout, R D

    2006-04-25

    Algebraic multigrid (AMG) solves linear systems based on multigrid principles, but in a way that only depends on the coefficients in the underlying matrix. The author begins with a basic introduction to AMG methods, and then describes some more recent advances and theoretical developments

  6. Toward robust scalable algebraic multigrid solvers.

    SciTech Connect

    Waisman, Haim; Schroder, Jacob; Olson, Luke; Hiriyur, Badri; Gaidamour, Jeremie; Siefert, Christopher; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen

    2010-10-01

    This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.

  7. Filtering Algebraic Multigrid and Adaptive Strategies

    SciTech Connect

    Nagel, A; Falgout, R D; Wittum, G

    2006-01-31

    Solving linear systems arising from systems of partial differential equations, multigrid and multilevel methods have proven optimal complexity and efficiency properties. Due to shortcomings of geometric approaches, algebraic multigrid methods have been developed. One example is the filtering algebraic multigrid method introduced by C. Wagner. This paper proposes a variant of Wagner's method with substantially improved robustness properties. The method is used in an adaptive, self-correcting framework and tested numerically.

  8. Algebraic Multigrid Benchmark

    SciTech Connect

    2013-05-06

    AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumps and an anisotropy in one part.

  9. Algebraic Multigrid Benchmark

    2013-05-06

    AMG2013 is a parallel algebraic multigrid solver for linear systems arising from problems on unstructured grids. It has been derived directly from the Boomer AMG solver in the hypre library, a large linear solvers library that is being developed in the Center for Applied Scientific Computing (CASC) at LLNL. The driver provided in the benchmark can build various test problems. The default problem is a Laplace type problem on an unstructured domain with various jumpsmore » and an anisotropy in one part.« less

  10. Comparison of the deflated preconditioned conjugate gradient method and algebraic multigrid for composite materials

    NASA Astrophysics Data System (ADS)

    Jönsthövel, T. B.; van Gijzen, M. B.; MacLachlan, S.; Vuik, C.; Scarpas, A.

    2012-09-01

    Many applications in computational science and engineering concern composite materials, which are characterized by large discontinuities in the material properties. Such applications require fine-scale finite-element meshes, which lead to large linear systems that are challenging to solve with current direct and iterative solutions algorithms. In this paper, we consider the simulation of asphalt concrete, which is a mixture of components with large differences in material stiffness. The discontinuities in material stiffness give rise to many small eigenvalues that negatively affect the convergence of iterative solution algorithms such as the preconditioned conjugate gradient (PCG) method. This paper considers the deflated preconditioned conjugate gradient (DPCG) method in which the rigid body modes of sets of elements with homogeneous material properties are used as deflation vectors. As preconditioner we consider several variants of the algebraic multigrid smoothed aggregation method. We evaluate the performance of the DPCG method on a parallel computer using up to 64 processors. Our test problems are derived from real asphalt core samples, obtained using CT scans. We show that the DPCG method is an efficient and robust technique for solving these challenging linear systems.

  11. Report on the Copper Mountain Conference on Multigrid Methods

    SciTech Connect

    2001-04-06

    OAK B188 Report on the Copper Mountain Conference on Multigrid Methods. The Copper Mountain Conference on Multigrid Methods was held on April 11-16, 1999. Over 100 mathematicians from all over the world attended the meeting. The conference had two major themes: algebraic multigrid and parallel multigrid. During the five day meeting 69 talks on current research topics were presented as well as 3 tutorials. Talks with similar content were organized into sessions. Session topics included: Fluids; Multigrid and Multilevel Methods; Applications; PDE Reformulation; Inverse Problems; Special Methods; Decomposition Methods; Student Paper Winners; Parallel Multigrid; Parallel Algebraic Multigrid; and FOSLS.

  12. Compatible Relaxation and Coarsening in Algebraic Multigrid

    SciTech Connect

    Brannick, J J; Falgout, R D

    2009-09-22

    We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.

  13. 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.

  14. Reducing Communication in Algebraic Multigrid Using Additive Variants

    SciTech Connect

    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 good performance on future exascale architectures.

  15. Parallel Algebraic Multigrids for Structural mechanics

    SciTech Connect

    Brezina, M; Tong, C; Becker, R

    2004-05-11

    This paper presents the results of a comparison of three parallel algebraic multigrid (AMG) preconditioners for structural mechanics applications. In particular, they are interested in investigating both the scalability and robustness of the preconditioners. Numerical results are given for a range of structural mechanics problems with various degrees of difficulty.

  16. Multiple Vector Preserving Interpolation Mappings in Algebraic Multigrid

    SciTech Connect

    Vassilevski, P S; Zikatanov, L T

    2004-11-03

    We propose algorithms for the construction of AMG (algebraic multigrid) interpolation mappings such that the resulting coarse space to span (locally and globally) any number of a priori given set of vectors. Specific constructions in the case of element agglomeration AMG methods are given. Some numerical illustration is also provided.

  17. Scalable Parallel Algebraic Multigrid Solvers

    SciTech Connect

    Bank, R; Lu, S; Tong, C; Vassilevski, P

    2005-03-23

    The authors propose a parallel algebraic multilevel algorithm (AMG), which has the novel feature that the subproblem residing in each processor is defined over the entire partition domain, although the vast majority of unknowns for each subproblem are associated with the partition owned by the corresponding processor. This feature ensures that a global coarse description of the problem is contained within each of the subproblems. The advantages of this approach are that interprocessor communication is minimized in the solution process while an optimal order of convergence rate is preserved; and the speed of local subproblem solvers can be maximized using the best existing sequential algebraic solvers.

  18. Reducing Communication in Algebraic Multigrid Using Additive Variants

    DOE PAGESBeta

    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

  19. Challenges of Algebraic Multigrid across Multicore Architectures

    SciTech Connect

    Baker, A H; Gamblin, T; Schulz, M; Yang, U M

    2010-04-12

    Algebraic multigrid (AMG) is a popular solver for large-scale scientific computing and an essential component of many simulation codes. AMG has shown to be extremely efficient on distributed-memory architectures. However, when executed on modern multicore architectures, we face new challenges that can significantly deteriorate AMG's performance. We examine its performance and scalability on three disparate multicore architectures: a cluster with four AMD Opteron Quad-core processors per node (Hera), a Cray XT5 with two AMD Opteron Hex-core processors per node (Jaguar), and an IBM BlueGene/P system with a single Quad-core processor (Intrepid). We discuss our experiences on these platforms and present results using both an MPI-only and a hybrid MPI/OpenMP model. We also discuss a set of techniques that helped to overcome the associated problems, including thread and process pinning and correct memory associations.

  20. Coarse Spaces by Algebraic Multigrid: Multigrid Convergence and Upscaled Error Estimates

    SciTech Connect

    Vassilevski, P S

    2010-04-30

    We give an overview of a number of algebraic multigrid methods targeting finite element discretization problems. The focus is on the properties of the constructed hierarchy of coarse spaces that guarantee (two-grid) convergence. In particular, a necessary condition known as 'weak approximation property', and a sufficient one, referred to as 'strong approximation property' are discussed. Their role in proving convergence of the TG method (as iterative method) and also on the approximation properties of the AMG coarse spaces if used as discretization tool is pointed out. Some preliminary numerical results illustrating the latter aspect are also reported.

  1. Anatomically accurate high resolution modeling of human whole heart electromechanics: A strongly scalable algebraic multigrid solver method for nonlinear deformation

    PubMed Central

    Augustin, Christoph M.; Neic, Aurel; Liebmann, Manfred; Prassl, Anton J.; Niederer, Steven A.; Haase, Gundolf; Plank, Gernot

    2016-01-01

    Electromechanical (EM) models of the heart have been used successfully to study fundamental mechanisms underlying a heart beat in health and disease. However, in all modeling studies reported so far numerous simplifications were made in terms of representing biophysical details of cellular function and its heterogeneity, gross anatomy and tissue microstructure, as well as the bidirectional coupling between electrophysiology (EP) and tissue distension. One limiting factor is the employed spatial discretization methods which are not sufficiently flexible to accommodate complex geometries or resolve heterogeneities, but, even more importantly, the limited efficiency of the prevailing solver techniques which are not sufficiently scalable to deal with the incurring increase in degrees of freedom (DOF) when modeling cardiac electromechanics at high spatio-temporal resolution. This study reports on the development of a novel methodology for solving the nonlinear equation of finite elasticity using human whole organ models of cardiac electromechanics, discretized at a high para-cellular resolution. Three patient-specific, anatomically accurate, whole heart EM models were reconstructed from magnetic resonance (MR) scans at resolutions of 220 μm, 440 μm and 880 μm, yielding meshes of approximately 184.6, 24.4 and 3.7 million tetrahedral elements and 95.9, 13.2 and 2.1 million displacement DOF, respectively. The same mesh was used for discretizing the governing equations of both electrophysiology (EP) and nonlinear elasticity. A novel algebraic multigrid (AMG) preconditioner for an iterative Krylov solver was developed to deal with the resulting computational load. The AMG preconditioner was designed under the primary objective of achieving favorable strong scaling characteristics for both setup and solution runtimes, as this is key for exploiting current high performance computing hardware. Benchmark results using the 220 μm, 440 μm and 880 μm meshes demonstrate

  2. Anatomically accurate high resolution modeling of human whole heart electromechanics: A strongly scalable algebraic multigrid solver method for nonlinear deformation

    NASA Astrophysics Data System (ADS)

    Augustin, Christoph M.; Neic, Aurel; Liebmann, Manfred; Prassl, Anton J.; Niederer, Steven A.; Haase, Gundolf; Plank, Gernot

    2016-01-01

    Electromechanical (EM) models of the heart have been used successfully to study fundamental mechanisms underlying a heart beat in health and disease. However, in all modeling studies reported so far numerous simplifications were made in terms of representing biophysical details of cellular function and its heterogeneity, gross anatomy and tissue microstructure, as well as the bidirectional coupling between electrophysiology (EP) and tissue distension. One limiting factor is the employed spatial discretization methods which are not sufficiently flexible to accommodate complex geometries or resolve heterogeneities, but, even more importantly, the limited efficiency of the prevailing solver techniques which is not sufficiently scalable to deal with the incurring increase in degrees of freedom (DOF) when modeling cardiac electromechanics at high spatio-temporal resolution. This study reports on the development of a novel methodology for solving the nonlinear equation of finite elasticity using human whole organ models of cardiac electromechanics, discretized at a high para-cellular resolution. Three patient-specific, anatomically accurate, whole heart EM models were reconstructed from magnetic resonance (MR) scans at resolutions of 220 μm, 440 μm and 880 μm, yielding meshes of approximately 184.6, 24.4 and 3.7 million tetrahedral elements and 95.9, 13.2 and 2.1 million displacement DOF, respectively. The same mesh was used for discretizing the governing equations of both electrophysiology (EP) and nonlinear elasticity. A novel algebraic multigrid (AMG) preconditioner for an iterative Krylov solver was developed to deal with the resulting computational load. The AMG preconditioner was designed under the primary objective of achieving favorable strong scaling characteristics for both setup and solution runtimes, as this is key for exploiting current high performance computing hardware. Benchmark results using the 220 μm, 440 μm and 880 μm meshes demonstrate

  3. 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.

  4. Geometric and algebraic multigrid techniques for fluid dynamics problems on unstructured grids

    NASA Astrophysics Data System (ADS)

    Volkov, K. N.; Emel'yanov, V. N.; Teterina, I. V.

    2016-02-01

    Issues concerning the implementation and practical application of geometric and algebraic multigrid techniques for solving systems of difference equations generated by the finite volume discretization of the Euler and Navier-Stokes equations on unstructured grids are studied. The construction of prolongation and interpolation operators, as well as grid levels of various resolutions, is discussed. The results of the application of geometric and algebraic multigrid techniques for the simulation of inviscid and viscous compressible fluid flows over an airfoil are compared. Numerical results show that geometric methods ensure faster convergence and weakly depend on the method parameters, while the efficiency of algebraic methods considerably depends on the input parameters.

  5. Multigrid methods for isogeometric discretization.

    PubMed

    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 [Formula: see text], whereas for three dimensions, only the constant coefficient problem in a unit cube is considered. The numerical results are complete up to polynomial order [Formula: see text], and for [Formula: see text] and [Formula: see text] smoothness. PMID:24511168

  6. Multigrid methods for isogeometric discretization

    PubMed Central

    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

  7. Coarse-grid selection for parallel algebraic multigrid

    SciTech Connect

    Cleary, A. J., LLNL

    1998-06-01

    The need to solve linear systems arising from problems posed on extremely large, unstructured grids has sparked great interest in parallelizing algebraic multigrid (AMG) To date, however, no parallel AMG algorithms exist We introduce a parallel algorithm for the selection of coarse-grid points, a crucial component of AMG, based on modifications of certain paallel independent set algorithms and the application of heuristics designed to insure the quality of the coarse grids A prototype serial version of the algorithm is implemented, and tests are conducted to determine its effect on multigrid convergence, and AMG complexity

  8. Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

    DOE PAGESBeta

    Bank, R.; Falgout, R. D.; Jones, T.; Manteuffel, T. A.; McCormick, S. F.; Ruge, J. W.

    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

  9. Algebraic multigrid domain and range decomposition (AMG-DD / AMG-RD)*

    SciTech Connect

    Bank, R.; Falgout, R. D.; Jones, T.; Manteuffel, T. A.; McCormick, S. F.; Ruge, J. W.

    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 in 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.

  10. Non-Galerkin Coarse Grids for Algebraic Multigrid

    SciTech Connect

    Falgout, Robert D.; Schroder, Jacob B.

    2014-06-26

    Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

  11. Algebraic multigrid preconditioner for the cardiac bidomain model.

    PubMed

    Plank, Gernot; Liebmann, Manfred; Weber dos Santos, Rodrigo; Vigmond, Edward J; Haase, Gundolf

    2007-04-01

    The bidomain equations are considered to be one of the most complete descriptions of the electrical activity in cardiac tissue, but large scale simulations, as resulting from discretization of an entire heart, remain a computational challenge due to the elliptic portion of the problem, the part associated with solving the extracellular potential. In such cases, the use of iterative solvers and parallel computing environments are mandatory to make parameter studies feasible. The preconditioned conjugate gradient (PCG) method is a standard choice for this problem. Although robust, its efficiency greatly depends on the choice of preconditioner. On structured grids, it has been demonstrated that a geometric multigrid preconditioner performs significantly better than an incomplete LU (ILU) preconditioner. However, unstructured grids are often preferred to better represent organ boundaries and allow for coarser discretization in the bath far from cardiac surfaces. Under these circumstances, algebraic multigrid (AMG) methods are advantageous since they compute coarser levels directly from the system matrix itself, thus avoiding the complexity of explicitly generating coarser, geometric grids. In this paper, the performance of an AMG preconditioner (BoomerAMG) is compared with that of the standard ILU preconditioner and a direct solver. BoomerAMG is used in two different ways, as a preconditioner and as a standalone solver. Two 3-D simulation examples modeling the induction of arrhythmias in rabbit ventricles were used to measure performance in both sequential and parallel simulations. It is shown that the AMG preconditioner is very well suited for the solution of the bidomain equation, being clearly superior to ILU preconditioning in all regards, with speedups by factors in the range 5.9-7.7. PMID:17405366

  12. Scaling Algebraic Multigrid Solvers: On the Road to Exascale

    SciTech Connect

    Baker, A H; Falgout, R D; Gamblin, T; Kolev, T; Schulz, M; Yang, U M

    2010-12-12

    Algebraic Multigrid (AMG) solvers are an essential component of many large-scale scientific simulation codes. Their continued numerical scalability and efficient implementation is critical for preparing these codes for exascale. Our experiences on modern multi-core machines show that significant challenges must be addressed for AMG to perform well on such machines. We discuss our experiences and describe the techniques we have used to overcome scalability challenges for AMG on hybrid architectures in preparation for exascale.

  13. Distance-Two Interpolation for Parallel Algebraic Multigrid

    SciTech Connect

    De Sterck, H; Falgout, R; Nolting, J; Yang, U M

    2007-05-08

    Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large three-dimensional problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such as those obtained by the Parallel Modified Independent Set coarsening algorithm (PMIS) [7], remedy this complexity growth, but lead to non-scalable AMG convergence factors when traditional distance-one interpolation methods are used. In this paper we study the scalability of AMG methods that combine PMIS coarse grids with long distance interpolation methods. AMG performance and scalability is compared for previously introduced interpolation methods as well as new variants of them for a variety of relevant test problems on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability of AMG convergence factors for PMIS-coarsened grids, and in combination with complexity reducing methods, such as interpolation truncation, one obtains a class of parallel AMG methods that enjoy excellent scalability properties on large parallel computers.

  14. Final report on the Copper Mountain conference on multigrid methods

    SciTech Connect

    1997-10-01

    The Copper Mountain Conference on Multigrid Methods was held on April 6-11, 1997. It took the same format used in the previous Copper Mountain Conferences on Multigrid Method conferences. Over 87 mathematicians from all over the world attended the meeting. 56 half-hour talks on current research topics were presented. Talks with similar content were organized into sessions. Session topics included: fluids; domain decomposition; iterative methods; basics; adaptive methods; non-linear filtering; CFD; applications; transport; algebraic solvers; supercomputing; and student paper winners.

  15. The mixed finite element multigrid method for stokes equations.

    PubMed

    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 Q2-Q1 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

  16. The Mixed Finite Element Multigrid Method for Stokes Equations

    PubMed Central

    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 Q2-Q1 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

  17. Preconditioners for the spectral multigrid method

    NASA Technical Reports Server (NTRS)

    Phillips, T. N.; Zang, T. A.; Hussaini, M. Y.

    1983-01-01

    The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

  18. Preconditioners for the spectral multigrid method

    NASA Technical Reports Server (NTRS)

    Phillips, T. N.; Hussaini, M. Y.; Zang, T. A.

    1986-01-01

    The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

  19. 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.

  20. A Parallel Multigrid Method for Neutronics Applications

    SciTech Connect

    Alcouffe, Raymond E.

    2001-01-01

    The multigrid method has been shown to be the most effective general method for solving the multi-dimensional diffusion equation encountered in neutronics. This being the method of choice, we develop a strategy for implementing the multigrid method on computers of massively parallel architecture. This leads us to strategies for parallelizing the relaxation, contraction (interpolation), and prolongation operators involved in the method. We then compare the efficiency of our parallel multigrid with other parallel methods for solving the diffusion equation on selected problems encountered in reactor physics.

  1. 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

  2. Some Aspects of Multigrid Methods on Non-Structured Meshes

    NASA Technical Reports Server (NTRS)

    Guillard, H.; Marco, N.

    1996-01-01

    To solve a given fine mesh problem, the design of a multigrid method requires the definition of coarse levels, associated coarse grid operators and inter-grid transfer operators. For non-structured simplified meshes, these definitions can rely on the use of non-nested triangulations. These definitions can also be founded on agglomeration/aggregation techniques in a purely algebraic manner. This paper analyzes these two options, shows the connections of the volume-agglomeration method with algebraic methods and proposes a new definition of prolongation operator suitable for the application of the volume-agglomeration method to elliptic problems.

  3. Extending the applicability of multigrid methods

    SciTech Connect

    Brannick, J; Brezina, M; Falgout, R; Manteuffel, T; McCormick, S; Ruge, J; Sheehan, B; Xu, J; Zikatanov, L

    2006-09-25

    Multigrid methods are ideal for solving the increasingly large-scale problems that arise in numerical simulations of physical phenomena because of their potential for computational costs and memory requirements that scale linearly with the degrees of freedom. Unfortunately, they have been historically limited by their applicability to elliptic-type problems and the need for special handling in their implementation. In this paper, we present an overview of several recent theoretical and algorithmic advances made by the TOPS multigrid partners and their collaborators in extending applicability of multigrid methods. Specific examples that are presented include quantum chromodynamics, radiation transport, and electromagnetics.

  4. A multigrid method for the Euler equations

    NASA Technical Reports Server (NTRS)

    Jespersen, D. C.

    1983-01-01

    A multigrid algorithm has been developed for the numerical solution of the steady two-dimensional Euler equations. Flux vector splitting and one-sided differencing are employed to define the spatial discretization. Newton's method is used to solve the nonlinear equations, and a multigrid solver is used on each linear problem. The relaxation scheme for the linear problems is symmetric Gauss-Seidel. Standard restriction and interpolation operators are employed. Local mode analysis is used to predict the convergence rate of the multigrid process on the linear problems. Computed results for transonic flows over airfoils are presented.

  5. The development of an algebraic multigrid algorithm for symmetric positive definite linear systems

    SciTech Connect

    Vanek, P.; Mandel, J.; Brezina, M.

    1996-12-31

    An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically. We present a set of requirements motivated heuristically by a convergence theory. The algorithm then attempts to satisfy the requirements. Input to the method are the coefficient matrix and zero energy modes, which are determined from nodal coordinates and knowledge of the differential equation. Efficiency of the resulting algorithm is demonstrated by computational results on real world problems from solid elasticity, plate blending, and shells.

  6. A multigrid method for variational inequalities

    SciTech Connect

    Oliveira, S.; Stewart, D.E.; Wu, W.

    1996-12-31

    Multigrid methods have been used with great success for solving elliptic partial differential equations. Penalty methods have been successful in solving finite-dimensional quadratic programs. In this paper these two techniques are combined to give a fast method for solving obstacle problems. A nonlinear penalized problem is solved using Newton`s method for large values of a penalty parameter. Multigrid methods are used to solve the linear systems in Newton`s method. The overall numerical method developed is based on an exterior penalty function, and numerical results showing the performance of the method have been obtained.

  7. Algebraic Multigrid by Smoothed Aggregation for Second and Fourth Order Elliptic Problems

    NASA Technical Reports Server (NTRS)

    Vanek, Petr; Mandel, Jan; Brezina, Marian

    1996-01-01

    Multigrid methods are very efficient iterative solvers for system of algebraic equations arising from finite element and finite difference discretization of elliptic boundary value problems. The main principle of multigrid methods is to complement the local exchange of information in point-wise iterative methods by a global one utilizing several related systems, called coarse levels, with a smaller number of variables. The coarse levels are often obtained as a hierarchy of discretizations with different characteristic meshsizes, but this requires that the discretization is controlled by the iterative method. To solve linear systems produced by existing finite element software, one needs to create an artificial hierarchy of coarse problems. The principal issue is then to obtain computational complexity and approximation properties similar to those for nested meshes, using only information in the matrix of the system and as little extra information as possible. Such algebraic multigrid method that uses the system matrix only was developed by Ruge. The prolongations were based on the matrix of the system by partial solution from given values at selected coarse points. The coarse grid points were selected so that each point would be interpolated to via so-called strong connections. Our approach is based on smoothed aggregation introduced recently by Vanek. First the set of nodes is decomposed into small mutually disjoint subsets. A tentative piecewise constant interpolation (in the discrete sense) is then defined on those subsets as piecewise constant for second order problems, and piecewise linear for fourth order problems. The prolongation operator is then obtained by smoothing the output of the tentative prolongation and coarse level operators are defined variationally.

  8. Multigrid methods with applications to reservoir simulation

    SciTech Connect

    Xiao, Shengyou

    1994-05-01

    Multigrid methods are studied for solving elliptic partial differential equations. Focus is on parallel multigrid methods and their use for reservoir simulation. Multicolor Fourier analysis is used to analyze the behavior of standard multigrid methods for problems in one and two dimensions. Relation between multicolor and standard Fourier analysis is established. Multiple coarse grid methods for solving model problems in 1 and 2 dimensions are considered; at each coarse grid level we use more than one coarse grid to improve convergence. For a given Dirichlet problem, a related extended problem is first constructed; a purification procedure can be used to obtain Moore-Penrose solutions of the singular systems encountered. For solving anisotropic equations, semicoarsening and line smoothing techniques are used with multiple coarse grid methods to improve convergence. Two-level convergence factors are estimated using multicolor. In the case where each operator has the same stencil on each grid point on one level, exact multilevel convergence factors can be obtained. For solving partial differential equations with discontinuous coefficients, interpolation and restriction operators should include information about the equation coefficients. Matrix-dependent interpolation and restriction operators based on the Schur complement can be used in nonsymmetric cases. A semicoarsening multigrid solver with these operators is used in UTCOMP, a 3-D, multiphase, multicomponent, compositional reservoir simulator. The numerical experiments are carried out on different computing systems. Results indicate that the multigrid methods are promising.

  9. Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

    NASA Technical Reports Server (NTRS)

    Golik, W. L.

    1996-01-01

    A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

  10. Spectral multigrid methods for elliptic equations

    NASA Technical Reports Server (NTRS)

    Zang, T. A.; Wong, Y. S.; Hussaini, M. Y.

    1981-01-01

    An alternative approach which employs multigrid concepts in the iterative solution of spectral equations was examined. Spectral multigrid methods are described for self adjoint elliptic equations with either periodic or Dirichlet boundary conditions. For realistic fluid calculations the relevant boundary conditions are periodic in at least one (angular) coordinate and Dirichlet (or Neumann) in the remaining coordinates. Spectral methods are always effective for flows in strictly rectangular geometries since corners generally introduce singularities into the solution. If the boundary is smooth, then mapping techniques are used to transform the problem into one with a combination of periodic and Dirichlet boundary conditions. It is suggested that spectral multigrid methods in these geometries can be devised by combining the techniques.

  11. A new Rayleigh quotient minimization algorithm based on algebraic multigrid.

    SciTech Connect

    Lehoucq, Richard B.; Hetmaniuk, Ulrich L.

    2005-01-01

    Mandel and McCormick [2] introduced the RQMG method, which approximately minimizes the Rayleigh quotient over a sequence of grids. In this talk, we will present an algebraic extension. We replace the geometric mesh information with the algebraic information defined by an AMG preconditioner. At each level, we improve the smoother to accelerate the convergence. With a series of numerical experiments, we assess the efficiency of this new algorithm to compute several eigenpairs.

  12. Multigrid Methods for Nonlinear Problems: An Overview

    SciTech Connect

    Henson, V E

    2002-12-23

    Since their early application to elliptic partial differential equations, multigrid methods have been applied successfully to a large and growing class of problems, from elasticity and computational fluid dynamics to geodetics and molecular structures. Classical multigrid begins with a two-grid process. First, iterative relaxation is applied, whose effect is to smooth the error. Then a coarse-grid correction is applied, in which the smooth error is determined on a coarser grid. This error is interpolated to the fine grid and used to correct the fine-grid approximation. Applying this method recursively to solve the coarse-grid problem leads to multigrid. The coarse-grid correction works because the residual equation is linear. But this is not the case for nonlinear problems, and different strategies must be employed. In this presentation we describe how to apply multigrid to nonlinear problems. There are two basic approaches. The first is to apply a linearization scheme, such as the Newton's method, and to employ multigrid for the solution of the Jacobian system in each iteration. The second is to apply multigrid directly to the nonlinear problem by employing the so-called Full Approximation Scheme (FAS). In FAS a nonlinear iteration is applied to smooth the error. The full equation is solved on the coarse grid, after which the coarse-grid error is extracted from the solution. This correction is then interpolated and applied to the fine grid approximation. We describe these methods in detail, and present numerical experiments that indicate the efficacy of them.

  13. Lecture Notes on Multigrid Methods

    SciTech Connect

    Vassilevski, P S

    2010-06-28

    The Lecture Notes are primarily based on a sequence of lectures given by the author while been a Fulbright scholar at 'St. Kliment Ohridski' University of Sofia, Sofia, Bulgaria during the winter semester of 2009-2010 academic year. The notes are somewhat expanded version of the actual one semester class he taught there. The material covered is slightly modified and adapted version of similar topics covered in the author's monograph 'Multilevel Block-Factorization Preconditioners' published in 2008 by Springer. The author tried to keep the notes as self-contained as possible. That is why the lecture notes begin with some basic introductory matrix-vector linear algebra, numerical PDEs (finite element) facts emphasizing the relations between functions in finite dimensional spaces and their coefficient vectors and respective norms. Then, some additional facts on the implementation of finite elements based on relation tables using the popular compressed sparse row (CSR) format are given. Also, typical condition number estimates of stiffness and mass matrices, the global matrix assembly from local element matrices are given as well. Finally, some basic introductory facts about stationary iterative methods, such as Gauss-Seidel and its symmetrized version are presented. The introductory material ends up with the smoothing property of the classical iterative methods and the main definition of two-grid iterative methods. From here on, the second part of the notes begins which deals with the various aspects of the principal TG and the numerous versions of the MG cycles. At the end, in part III, we briefly introduce algebraic versions of MG referred to as AMG, focusing on classes of AMG specialized for finite element matrices.

  14. Spectral multigrid methods for elliptic equations II

    NASA Technical Reports Server (NTRS)

    Zang, T. A.; Wong, Y. S.; Hussaini, M. Y.

    1984-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.

  15. 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.

  16. Relaxation schemes for Chebyshev spectral multigrid methods

    NASA Technical Reports Server (NTRS)

    Kang, Yimin; Fulton, Scott R.

    1993-01-01

    Two relaxation schemes for Chebyshev spectral multigrid methods are presented for elliptic equations with Dirichlet boundary conditions. The first scheme is a pointwise-preconditioned Richardson relaxation scheme and the second is a line relaxation scheme. The line relaxation scheme provides an efficient and relatively simple approach for solving two-dimensional spectral equations. Numerical examples and comparisons with other methods are given.

  17. NON-CONFORMING FINITE ELEMENTS; MESH GENERATION, ADAPTIVITY AND RELATED ALGEBRAIC MULTIGRID AND DOMAIN DECOMPOSITION METHODS IN MASSIVELY PARALLEL COMPUTING ENVIRONMENT

    SciTech Connect

    Lazarov, R; Pasciak, J; Jones, J

    2002-02-01

    Construction, analysis and numerical testing of efficient solution techniques for solving elliptic PDEs that allow for parallel implementation have been the focus of the research. A number of discretization and solution methods for solving second order elliptic problems that include mortar and penalty approximations and domain decomposition methods for finite elements and finite volumes have been investigated and analyzed. Techniques for parallel domain decomposition algorithms in the framework of PETC and HYPRE have been studied and tested. Hierarchical parallel grid refinement and adaptive solution methods have been implemented and tested on various model problems. A parallel code implementing the mortar method with algebraically constructed multiplier spaces was developed.

  18. Multigrid Methods for Mesh Relaxation

    SciTech Connect

    O'Brien, M J

    2006-06-12

    When generating a mesh for the initial conditions for a computer simulation, you want the mesh to be as smooth as possible. A common practice is to use equipotential mesh relaxation to smooth out a distorted computational mesh. Typically a Laplace-like equation is set up for the mesh coordinates and then one or more Jacobi iterations are performed to relax the mesh. As the zone count gets really large, the Jacobi iteration becomes less and less effective and we are stuck with our original unrelaxed mesh. This type of iteration can only damp high frequency errors and the smooth errors remain. When the zone count is large, almost everything looks smooth so relaxation cannot solve the problem. In this paper we examine a multigrid technique which effectively smooths out the mesh, independent of the number of zones.

  19. 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)

  20. Parallel Multigrid Equation Solver

    2001-09-07

    Prometheus is a fully parallel multigrid equation solver for matrices that arise in unstructured grid finite element applications. It includes a geometric and an algebraic multigrid method and has solved problems of up to 76 mullion degrees of feedom, problems in linear elasticity on the ASCI blue pacific and ASCI red machines.

  1. Grandchild of the frequency: Decomposition multigrid method

    SciTech Connect

    Dendy, J.E. Jr.; Tazartes, C.C.

    1994-12-31

    Previously the authors considered the frequency decomposition multigrid method and rejected it because it was not robust for problems with discontinuous coefficients. In this paper they show how to modify the method so as to obtain such robustness while retaining robustness for problems with anisotropic coefficients. They also discuss application of this method to a problem arising in global ocean modeling on the CM-5.

  2. 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.

  3. The multigrid method: Fast relaxation

    NASA Technical Reports Server (NTRS)

    South, J. C., Jr.; Brandt, A.

    1976-01-01

    A multi-level grid method was studied as a possible means of accelerating convergence in relaxation calculations for transonic flows. The method employs a hierarchy of grids, ranging from very coarse (e.g. 4 x 2 mesh cells) to fine (e.g. 64 x 32); the coarser grids are used to diminish the magnitude of the smooth part of the residuals, hopefully with far less total work than would be required with optimal iterations on the finest grid. To date the method was applied quite successfully to the solution of the transonic small-disturbance equation for the velocity potential in conservation form. Nonlifting transonic flow past a parabolic arc airfoil is the example studied, with meshes of both constant and variable step size.

  4. Implementing abstract multigrid or multilevel methods

    NASA Technical Reports Server (NTRS)

    Douglas, Craig C.

    1993-01-01

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

  5. Time-parallel iterative methods for parabolic PDES: Multigrid waveform relaxation and time-parallel multigrid

    SciTech Connect

    Vandewalle, S.

    1994-12-31

    Time-stepping methods for parabolic partial differential equations are essentially sequential. This prohibits the use of massively parallel computers unless the problem on each time-level is very large. This observation has led to the development of algorithms that operate on more than one time-level simultaneously; that is to say, on grids extending in space and in time. The so-called parabolic multigrid methods solve the time-dependent parabolic PDE as if it were a stationary PDE discretized on a space-time grid. The author has investigated the use of multigrid waveform relaxation, an algorithm developed by Lubich and Ostermann. The algorithm is based on a multigrid acceleration of waveform relaxation, a highly concurrent technique for solving large systems of ordinary differential equations. Another method of this class is the time-parallel multigrid method. This method was developed by Hackbusch and was recently subject of further study by Horton. It extends the elliptic multigrid idea to the set of equations that is derived by discretizing a parabolic problem in space and in time.

  6. Semi-coarsening multigrid methods for parallel computing

    SciTech Connect

    Jones, J.E.

    1996-12-31

    Standard multigrid methods are not well suited for problems with anisotropic coefficients which can occur, for example, on grids that are stretched to resolve a boundary layer. There are several different modifications of the standard multigrid algorithm that yield efficient methods for anisotropic problems. In the paper, we investigate the parallel performance of these multigrid algorithms. Multigrid algorithms which work well for anisotropic problems are based on line relaxation and/or semi-coarsening. In semi-coarsening multigrid algorithms a grid is coarsened in only one of the coordinate directions unlike standard or full-coarsening multigrid algorithms where a grid is coarsened in each of the coordinate directions. When both semi-coarsening and line relaxation are used, the resulting multigrid algorithm is robust and automatic in that it requires no knowledge of the nature of the anisotropy. This is the basic multigrid algorithm whose parallel performance we investigate in the paper. The algorithm is currently being implemented on an IBM SP2 and its performance is being analyzed. In addition to looking at the parallel performance of the basic semi-coarsening algorithm, we present algorithmic modifications with potentially better parallel efficiency. One modification reduces the amount of computational work done in relaxation at the expense of using multiple coarse grids. This modification is also being implemented with the aim of comparing its performance to that of the basic semi-coarsening algorithm.

  7. 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.

  8. 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.

  9. On the Performance of an Algebraic MultigridSolver on Multicore Clusters

    SciTech Connect

    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.

  10. On the Performance of an Algebraic Multigrid Solver on Multicore Clusters

    SciTech Connect

    Baker, A; Schulz, M; Yang, U M

    2009-11-24

    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.

  11. LDRD Final Report-New Directions for Algebraic Multigrid: Solutions for Large Scale Multiphysics Problems

    SciTech Connect

    Henson, V E

    2003-02-06

    The purpose of this research project was to investigate, design, and implement new algebraic multigrid (AMG) algorithms to enable the effective use of AMG in large-scale multiphysics simulation codes. These problems are extremely large; storage requirements and excessive run-time make direct solvers infeasible. The problems are highly ill-conditioned, so that existing iterative solvers either fail or converge very slowly. While existing AMG algorithms have been shown to be robust and stable for a large class of problems, there are certain problems of great interest to the Laboratory for which no effective algorithm existed prior to this research.

  12. Spectral multigrid methods with applications to transonic potential flow

    NASA Technical Reports Server (NTRS)

    Streett, C. L.; Zang, T. A.; Hussaini, M. Y.

    1983-01-01

    Spectral multigrid methods are demonstrated to be a competitive technique for solving the transonic potential flow equation. The spectral discretization, the relaxation scheme, and the multigrid techniques are described in detail. Significant departures from current approaches are first illustrated on several linear problems. The principal applications and examples, however, are for compressible potential flow. These examples include the relatively challenging case of supercritical flow over a lifting airfoil.

  13. Spectral multigrid methods with applications to transonic potential flow

    NASA Technical Reports Server (NTRS)

    Streett, C. L.; Zang, T. A.; Hussaini, M. Y.

    1985-01-01

    Spectral multigrid methods are demonstrated to be a competitive technique for solving the transonic potential flow equation. The spectral discretization, the relaxation scheme, and the multigrid techniques are described in detail. Significant departures from current approaches are first illustrated on several linear problems. The principal applications and examples, however, are for compressible potential flow. These examples include the relatively challenging case of supercritical flow over a lifting airfoil.

  14. 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.

  15. 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.

  16. Smoothed aggregation adaptive spectral element-based algebraic multigrid

    2015-01-20

    SAAMGE provides parallel methods for building multilevel hierarchies and solvers that can be used for elliptic equations with highly heterogeneous coefficients. Additionally, hierarchy adaptation is implemented allowing solving multiple problems with close coefficients without rebuilding the hierarchy.

  17. 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.

  18. 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.

  19. Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

    SciTech Connect

    Kalchev, D

    2012-04-02

    This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-{rho}AMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the

  20. A multigrid solution method for mixed hybrid finite elements

    SciTech Connect

    Schmid, W.

    1996-12-31

    We consider the multigrid solution of linear equations arising within the discretization of elliptic second order boundary value problems of the form by mixed hybrid finite elements. Using the equivalence of mixed hybrid finite elements and non-conforming nodal finite elements, we construct a multigrid scheme for the corresponding non-conforming finite elements, and, by this equivalence, for the mixed hybrid finite elements, following guidelines from Arbogast/Chen. For a rectangular triangulation of the computational domain, this non-conforming schemes are the so-called nodal finite elements. We explicitly construct prolongation and restriction operators for this type of non-conforming finite elements. We discuss the use of plain multigrid and the multilevel-preconditioned cg-method and compare their efficiency in numerical tests.

  1. 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.

  2. Geometric multigrid for an implicit-time immersed boundary method

    SciTech Connect

    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 methods 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.

  3. Geometric multigrid for an implicit-time immersed boundary method

    DOE PAGESBeta

    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

  4. 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.

  5. On several aspects and applications of the multigrid method for solving partial differential equations

    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.

  6. Comparison of an algebraic multigrid algorithm to two iterative solvers used for modeling ground water flow and transport

    USGS Publications Warehouse

    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.

  7. Comparison of an algebraic multigrid algorithm to two iterative solvers used for modeling ground water flow and transport.

    PubMed

    Detwiler, Russell L; Mehl, Steffen; Rajaram, Harihar; Cheung, Wendy 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. PMID:12019641

  8. 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.

  9. A Full Multi-Grid Method for the Solution of the Cell Vertex Finite Volume Cauchy-Riemann Equations

    NASA Technical Reports Server (NTRS)

    Borzi, A.; Morton, K. W.; Sueli, E.; Vanmaele, M.

    1996-01-01

    The system of inhomogeneous Cauchy-Riemann equations defined on a square domain and subject to Dirichlet boundary conditions is considered. This problem is discretised by using the cell vertex finite volume method on quadrilateral meshes. The resulting algebraic problem is overdetermined and the solution is defined in a least squares sense. By this approach a consistent algebraic problem is obtained which differs from the original one by O(h(exp 2)) perturbations of the right-hand side. A suitable cell-based convergent smoothing iteration is presented which is naturally linked to the least squares formulation. Hence, a standard multi-grid algorithm is reported which combines the given smoother and cell-based transfer operators. Some remarkable reduction properties of these operators are shown. A full multi-grid method is discussed which solves the discrete problem to the level of truncation error by employing one multi-grid cycle at each current level of discretisation. Experiments and applications of the full multi-grid scheme are presented.

  10. A parallel multigrid method for data-driven multiprocessor systems

    SciTech Connect

    Lin, C.H.; Gaudiot, J.L.; Proskurowski, W.

    1989-12-31

    The multigrid algorithm (MG) is recognized as an efficient and rapidly converging method to solve a wide family of partial differential equations (PDE). When this method is implemented on a multiprocessor system, its major drawback is the low utilization of processors. Due to the sequentiality of the standard algorithm, the fine grid levels cannot start relaxation until the coarse grid levels complete their own relaxation. Indeed, of all processors active on the fine two dimensional grid level only one fourth will be active at the coarse grid level, leaving full 75% idle. In this paper, a novel parallel V-cycle multigrid (PVM) algorithm is proposed to cure the idle processors` problem. Highly programmable systems such as data-flow architectures are then applied to support this new algorithm. The experiments based on the proposed architecture show that the convergence rate of the new algorithm is about twice faster than that of the standard method and twice as efficient system utilization is achieved.

  11. Monolithic multigrid methods for two-dimensional resistive magnetohydrodynamics

    DOE PAGESBeta

    Adler, James H.; Benson, Thomas R.; Cyr, Eric C.; MacLachlan, Scott P.; Tuminaro, Raymond S.

    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

  12. 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.

  13. 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.

  14. 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.

  15. Multigrid methods and the surface consistent equations of Geophysics

    NASA Astrophysics Data System (ADS)

    Millar, John

    The surface consistent equations are a large linear system that is frequently used in signal enhancement for land seismic surveys. Different signatures may be consistent with a particular dynamite (or other) source. Each receiver and the conditions around the receiver will have different impact on the signal. Seismic deconvolution operators, amplitude corrections and static shifts of traces are calculated using the surface consistent equations, both in commercial and scientific seismic processing software. The system of equations is singular, making direct methods such as Gaussian elimination impossible to implement. Iterative methods such as Gauss-Seidel and conjugate gradient are frequently used. A limitation in the nature of the methods leave the long wavelengths of the solution poorly resolved. To reduce the limitations of traditional iterative methods, we employ a multigrid method. Multigrid methods re-sample the entire system of equations on a more coarse grid. An iterative method is employed on the coarse grid. The long wavelengths of the solutions that traditional iterative methods were unable to resolve are calculated on the reduced system of equations. The coarse estimate can be interpolated back up to the original sample rate, and refined using a standard iterative procedure. Multigrid methods provide more accurate solutions to the surface consistent equations, with the largest improvement concentrated in the long wavelengths. Synthetic models and tests on field data show that multigrid solutions to the system of equations can significantly increase the resolution of the seismic data, when used to correct both static time shifts and in calculating deconvolution operators. The first chapter of this thesis is a description of the physical model we are addressing. It reviews some of the literature concerning the surface consistent equations, and provides background on the nature of the problem. Chapter 2 contains a review of iterative and multigrid methods

  16. An angular multigrid method for computing mono-energetic particle beams in Flatland

    SciTech Connect

    Boergers, Christoph MacLachlan, Scott

    2010-04-20

    Beams of microscopic particles penetrating scattering background matter play an important role in several applications. The parameter choices made here are motivated by the problem of electron-beam cancer therapy planning. Mathematically, a steady particle beam penetrating matter, or a configuration of several such beams, is modeled by a boundary value problem for a Boltzmann equation. Grid-based discretization of such a problem leads to a system of algebraic equations. This system is typically very large because of the large number of independent variables in the Boltzmann equation-six if no dimension-reducing assumptions other than time independence are made. If grid-based methods are to be practical for these problems, it is therefore necessary to develop very fast solvers for the discretized problems. For beams of mono-energetic particles interacting with a passive background, but not with each other, in two space dimensions, the first author proposed such a solver, based on angular domain decomposition, some time ago. Here, we propose and test an angular multigrid algorithm for the same model problem. Our numerical experiments show rapid, grid-independent convergence. For high-resolution calculations, our method is substantially more efficient than the angular domain decomposition method. In addition, unlike angular domain decomposition, the angular multigrid method works well even when the angular diffusion coefficient is fairly large.

  17. Algebraic multigrid preconditioning within parallel finite-element solvers for 3-D electromagnetic modelling problems in geophysics

    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

  18. 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.

  19. 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.

  20. 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.

  1. Final Report on Subcontract B591217: Multigrid Methods for Systems of PDEs

    SciTech Connect

    Xu, J; Brannick, J J; Zikatanov, L

    2011-10-25

    Progress is summarized in the following areas of study: (1) Compatible relaxation; (2) Improving aggregation-based MG solver performance - variable cycle; (3) First Order System Least Squares (FOSLS) for LQCD; (4) Auxiliary space preconditioners; (5) Bootstrap algebraic multigrid; and (6) Practical applications of AMG and fast auxiliary space preconditioners.

  2. A generalized BPX multigrid framework covering nonnested V-cycle methods

    NASA Astrophysics Data System (ADS)

    Duan, Huo-Yuan; Gao, Shao-Qin; Tan, Roger C. E.; Zhang, Shangyou

    2007-03-01

    More than a decade ago, Bramble, Pasciak and Xu developed a framework in analyzing the multigrid methods with nonnested spaces or noninherited quadratic forms. It was subsequently known as the BPX multigrid framework, which was widely used in the analysis of multigrid and domain decomposition methods. However, the framework has an apparent limit in the analysis of nonnested V-cycle methods, and it produces a variable V-cycle, or nonuniform convergence rate V-cycle methods, or other nonoptimal results in analysis thus far. This paper completes a long-time effort in extending the BPX multigrid framework so that it truly covers the nonnested V-cycle. We will apply the extended BPX framework to the analysis of many V-cycle nonnested multigrid methods. Some of them were proven previously only for two-level and W-cycle iterations. Some numerical results are presented to support the theoretical analysis of this paper.

  3. A multigrid method for variable coefficient Maxwell's equations

    SciTech Connect

    Jones, J E; Lee, B

    2004-05-13

    This paper presents a multigrid method for solving variable coefficient Maxwell's equations. The novelty in this method is the use of interpolation operators that do not produce multilevel commutativity complexes that lead to multilevel exactness. Rather, the effects of multilevel exactness are built into the level equations themselves--on the finest level using a discrete T-V formulation, and on the coarser grids through the Galerkin coarsening procedure of a T-V formulation. These built-in structures permit the levelwise use of an effective hybrid smoother on the curl-free near-nullspace components, and these structures permit the development of interpolation operators for handling the curl-free and divergence-free error components separately, with the resulting block diagonal interpolation operator not satisfying multilevel commutativity but having good approximation properties for both of these error components. Applying operator-dependent interpolation for each of these error components leads to an effective multigrid scheme for variable coefficient Maxwell's equations, where multilevel commutativity-based methods can degrade. Numerical results are presented to verify the effectiveness of this new scheme.

  4. Constructive interference II: Semi-chaotic multigrid methods

    SciTech Connect

    Douglas, C.C.

    1994-12-31

    Parallel computer vendors have mostly decided to move towards multi-user, multi-tasking per node machines. A number of these machines already exist today. Self load balancing on these machines is not an option to the users except when the user can convince someone to boot the entire machine in single user mode, which may have to be done node by node. Chaotic relaxation schemes were considered for situations like this as far back as the middle 1960`s. However, very little convergence theory exists. Further, what exists indicates that this is not really a good method. Besides chaotic relaxation, chaotic conjugate direction and minimum residual methods are explored as smoothers for symmetric and nonsymmetric problems. While having each processor potentially going off in a different direction from the rest is not what one would strive for in a unigrid situation, the change of grid procedures in multigrid provide a natural way of aiming all of the processors in the right direction. The author presents some new results for multigrid methods in which synchronization of the calculations on one or more levels is not assumed. However, he assumes that he knows how far out of synch neighboring subdomains are with respect to each other. Thus the author can show that the combination of a limited chaotic smoother and coarse level corrections produces a better algorithm than would be expected.

  5. Self-correcting Multigrid Solver

    SciTech Connect

    Jerome L.V. Lewandowski

    2004-06-29

    A new multigrid algorithm based on the method of self-correction for the solution of elliptic problems is described. The method exploits information contained in the residual to dynamically modify the source term (right-hand side) of the elliptic problem. It is shown that the self-correcting solver is more efficient at damping the short wavelength modes of the algebraic error than its standard equivalent. When used in conjunction with a multigrid method, the resulting solver displays an improved convergence rate with no additional computational work.

  6. Large-Eddy Simulation and Multigrid Methods

    SciTech Connect

    Falgout,R D; Naegle,S; Wittum,G

    2001-06-18

    A method to simulate turbulent flows with Large-Eddy Simulation on unstructured grids is presented. Two kinds of dynamic models are used to model the unresolved scales of motion and are compared with each other on different grids. Thereby the behavior of the models is shown and additionally the feature of adaptive grid refinement is investigated. Furthermore the parallelization aspect is addressed.

  7. Multigrid hierarchical simulated annealing method for reconstructing heterogeneous media.

    PubMed

    Pant, Lalit M; Mitra, Sushanta K; Secanell, Marc

    2015-12-01

    A reconstruction methodology based on different-phase-neighbor (DPN) pixel swapping and multigrid hierarchical annealing is presented. The method performs reconstructions by starting at a coarse image and successively refining it. The DPN information is used at each refinement stage to freeze interior pixels of preformed structures. This preserves the large-scale structures in refined images and also reduces the number of pixels to be swapped, thereby resulting in a decrease in the necessary computational time to reach a solution. Compared to conventional single-grid simulated annealing, this method was found to reduce the required computation time to achieve a reconstruction by around a factor of 70-90, with the potential of even higher speedups for larger reconstructions. The method is able to perform medium sized (up to 300(3) voxels) three-dimensional reconstructions with multiple correlation functions in 36-47 h. PMID:26764849

  8. Solving nonlinear heat conduction problems with multigrid preconditioned Newton-Krylov methods

    SciTech Connect

    Rider, W.J.; Knoll, D.A.

    1997-09-01

    Our objective is to investigate the utility of employing multigrid preconditioned Newton-Krylov methods for solving initial value problems. Multigrid based method promise better performance from the linear scaling associated with them. Our model problem is nonlinear heat conduction which can model idealized Marshak waves. Here we will investigate the efficiency of using a linear multigrid method to precondition a Krylov subspace method. In effect we will show that a fixed point nonlinear iterative method provides an effective preconditioner for the nonlinear problem.

  9. Sixth Copper Mountain Conference on Multigrid Methods. Final report

    SciTech Connect

    Not Available

    1994-07-01

    During the 5-day meeting, 112 half-hour talks on current research topics were presented. Session topics included: fluids, domain decomposition, iterative methods, Basics I and II, adaptive methods, nonlinear filtering, CFD I, II, and III, applications, transport, algebraic solvers, supercomputing, and student paper winners.

  10. 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.

  11. Stability analysis of multigrid acceleration methods for the solution of partial differential 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.

  12. Copper Mountain conference on multigrid methods. Preliminary proceedings -- List of abstracts

    SciTech Connect

    1995-12-31

    This report contains abstracts of the papers presented at the conference. Papers cover multigrid algorithms and applications of multigrid methods. Applications include the following: solution of elliptical problems; electric power grids; fluid mechanics; atmospheric data assimilation; thermocapillary effects on weld pool shape; boundary-value problems; prediction of hurricane tracks; modeling multi-dimensional combustion and detailed chemistry; black-oil reservoir simulation; image processing; and others.

  13. 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.

  14. Application of the multigrid method to grid generation

    NASA Technical Reports Server (NTRS)

    Ohring, S.

    1980-01-01

    The multigrid method (MGM), used to numerically solve the pair of nonlinear elliptic equations commonly used to generate two dimensional boundary-fitted coordinate systems is discussed. Two different geometries are considered: one involving a coordinate system fitted about a circle and the other selected for an impinging jet flow problem. Two different relaxation schemes are tried: one is successive point overrelaxation and the other is a four-color scheme vectorizeable to take advantage of a parallel processor computer for greater computational speed. Results using MGM are compared with those using SOR (doing successive overrelaxations with the corresponding relaxation scheme on the fine grid only). It is found that MGM becomes significantly more effective than SOR as more accuracy is demanded and as more corrective grids, or more grid points, are used. For the accuracy required, it is found that MGM is two to three times faster than SOR in computing time. With the four-color relaxation scheme as applied to the impinging jet problem, the advantage of MGM over SOR is not as great. This may be due to the effect of a poor initial guess on MGM for this problem.

  15. 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.

  16. Recent developments in multigrid methods for the steady Euler equations

    NASA Technical Reports Server (NTRS)

    Jespersen, D. C.

    1984-01-01

    The solution by multigrid techniques of the steady inviscid compressible equations of gas dynamics, the Euler equations is investigated. Steady two dimensional transonic flow over an airfoil section is studied intensively. Most of the material is applicable to three dimensional flow problems of aerodynamic interest.

  17. New Multigrid Solver Advances in TOPS

    SciTech Connect

    Falgout, R D; Brannick, J; Brezina, M; Manteuffel, T; McCormick, S

    2005-06-27

    In this paper, we highlight new multigrid solver advances in the Terascale Optimal PDE Simulations (TOPS) project in the Scientific Discovery Through Advanced Computing (SciDAC) program. We discuss two new algebraic multigrid (AMG) developments in TOPS: the adaptive smoothed aggregation method ({alpha}SA) and a coarse-grid selection algorithm based on compatible relaxation (CR). The {alpha}SA method is showing promising results in initial studies for Quantum Chromodynamics (QCD) applications. The CR method has the potential to greatly improve the applicability of AMG.

  18. Multigrid lattice Boltzmann method for accelerated solution of elliptic equations

    NASA Astrophysics Data System (ADS)

    Patil, Dhiraj V.; Premnath, Kannan N.; Banerjee, Sanjoy

    2014-05-01

    A new solver for second-order elliptic partial differential equations (PDEs) based on the lattice Boltzmann method (LBM) and the multigrid (MG) technique is presented. Several benchmark elliptic equations are solved numerically with the inclusion of multiple grid-levels in two-dimensional domains at an optimal computational cost within the LB framework. The results are compared with the corresponding analytical solutions and numerical solutions obtained using the Stone's strongly implicit procedure. The classical PDEs considered in this article include the Laplace and Poisson equations with Dirichlet boundary conditions, with the latter involving both constant and variable coefficients. A detailed analysis of solution accuracy, convergence and computational efficiency of the proposed solver is given. It is observed that the use of a high-order stencil (for smoothing) improves convergence and accuracy for an equivalent number of smoothing sweeps. The effect of the type of scheduling cycle (V- or W-cycle) on the performance of the MG-LBM is analyzed. Next, a parallel algorithm for the MG-LBM solver is presented and then its parallel performance on a multi-core cluster is analyzed. Lastly, a practical example is provided wherein the proposed elliptic PDE solver is used to compute the electro-static potential encountered in an electro-chemical cell, which demonstrates the effectiveness of this new solver in complex coupled systems. Several orders of magnitude gains in convergence and parallel scaling for the canonical problems, and a factor of 5 reduction for the multiphysics problem are achieved using the MG-LBM.

  19. Inverse airfoil design procedure using a multigrid Navier-Stokes method

    NASA Technical Reports Server (NTRS)

    Malone, J. B.; Swanson, R. C.

    1991-01-01

    The Modified Garabedian McFadden (MGM) design procedure was incorporated into an existing 2-D multigrid Navier-Stokes airfoil analysis method. The resulting design method is an iterative procedure based on a residual correction algorithm and permits the automated design of airfoil sections with prescribed surface pressure distributions. The new design method, Multigrid Modified Garabedian McFadden (MG-MGM), is demonstrated for several different transonic pressure distributions obtained from both symmetric and cambered airfoil shapes. The airfoil profiles generated with the MG-MGM code are compared to the original configurations to assess the capabilities of the inverse design method.

  20. Multigrid for the Galerkin least squares method in linear elasticity: The pure displacement problem

    SciTech Connect

    Yoo, Jaechil

    1996-12-31

    Franca and Stenberg developed several Galerkin least squares methods for the solution of the problem of linear elasticity. That work concerned itself only with the error estimates of the method. It did not address the related problem of finding effective methods for the solution of the associated linear systems. In this work, we prove the convergence of a multigrid (W-cycle) method. This multigrid is robust in that the convergence is uniform as the parameter, v, goes to 1/2 Computational experiments are included.

  1. Advanced discretizations and multigrid methods for liquid crystal configurations

    NASA Astrophysics Data System (ADS)

    Emerson, David B.

    addition, we present two novel, optimally scaling, multigrid approaches for these systems based on Vanka- and Braess-Sarazin-type relaxation. Both approaches outperform direct methods and represent highly efficient and scalable iterative solvers. Finally, a three-dimensional problem considering the effects of geometrically patterned surfaces is presented, which gives rise to a nonlinear anisotropic reaction-diffusion equation. Well-posedness is shown for the intermediate linearization systems of the proposed Newton linearization. The configurations under consideration are part of ongoing physics research seeking new bistable configurations induced by geometric nano-patterning.

  2. 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.

  3. 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

  4. MueLu Multigrid Preconditioning Package

    SciTech Connect

    2012-09-11

    MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.

  5. MueLu Multigrid Preconditioning Package

    2012-09-11

    MueLu is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software provides multigrid source code, test programs, and short example programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueLu currently provides an implementation of smoothed aggregation algebraic multigrid method and interfaces to many commonly used smoothers. However, the software is intended to bemore » extensible, and new methods can be incorporated easily. MueLu also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. All algorithms and methods in MueLu have been or will be published in the open scientific literature.« less

  6. Simulation of viscous flows using a multigrid-control volume finite element method

    SciTech Connect

    Hookey, N.A.

    1994-12-31

    This paper discusses a multigrid control volume finite element method (MG CVFEM) for the simulation of viscous fluid flows. The CVFEM is an equal-order primitive variables formulation that avoids spurious solution fields by incorporating an appropriate pressure gradient in the velocity interpolation functions. The resulting set of discretized equations is solved using a coupled equation line solver (CELS) that solves the discretized momentum and continuity equations simultaneously along lines in the calculation domain. The CVFEM has been implemented in the context of both FMV- and V-cycle multigrid algorithms, and preliminary results indicate a five to ten fold reduction in execution times.

  7. 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.

  8. A multigrid method for N-component nucleation.

    PubMed

    van Putten, Dennis S; Glazenborg, Simon P; Hagmeijer, Rob; Venner, Cornelis H

    2011-07-01

    A multigrid algorithm has been developed enabling more efficient solution of the cluster size distribution for N-component nucleation from the Becker-Döring equations. The theoretical derivation is valid for an arbitrary number of condensing components, making the simulation of many-component nucleating systems feasible. A steady state ternary nucleation problem is defined to demonstrate its efficiency. The results are used as a validation for existing nucleation theories. The non-steady state ternary problem provides useful insight into the initial stages of the nucleation process. We observe that for the ideal mixture the main nucleation flux bypasses the saddle point. PMID:21744895

  9. 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.

  10. A multigrid Newton-Krylov method for flux-limited radiation diffusion

    SciTech Connect

    Rider, W.J.; Knoll, D.A.; Olson, G.L.

    1998-09-01

    The authors focus on the integration of radiation diffusion including flux-limited diffusion coefficients. The nonlinear integration is accomplished with a Newton-Krylov method preconditioned with a multigrid Picard linearization of the governing equations. They investigate the efficiency of the linear and nonlinear iterative techniques.

  11. Black box multigrid

    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.

  12. 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.

  13. 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.

  14. 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.

  15. A multigrid method for a model of the implicit immersed boundary equations

    SciTech Connect

    Guy, Robert; Philip, Bobby

    2012-01-01

    Explicit time stepping schemes for the immersed boundary method require very small time steps in order to maintain stability. Solving the equations that arise from an implicit discretization is difficult. Recently, several different approaches have been proposed, but a complete understanding of this problem is still emerging. A multigrid method is developed and explored for solving the equations in an implicit time discretization of a model of the immersed boundary equations. The model problem consists of a scalar Poisson equation with conformation-dependent singular forces on an immersed boundary. This model does not include the inertial terms or the incompressibility constraint. The method is more efficient than an explicit method, but the efficiency gain is limited. The multigrid method alone may not be an effective solver, but when used as a preconditioner for Krylov methods, the speed-up over the explicit time method is substantial. For example, depending on the constitutive law for the boundary force, with a time step 100 times larger than the explicit method, the implicit method is about 15-100 times more efficient than the explicit method. A very attractive feature of this method is that the efficiency of the multigrid preconditioned Krylov solver is shown to be independent of the number of immersed boundary points.

  16. Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

    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

  17. Multilevel local refinement and multigrid methods for 3-D turbulent flow

    SciTech Connect

    Liao, C.; Liu, C.; Sung, C.H.; Huang, T.T.

    1996-12-31

    A numerical approach based on multigrid, multilevel local refinement, and preconditioning methods for solving incompressible Reynolds-averaged Navier-Stokes equations is presented. 3-D turbulent flow around an underwater vehicle is computed. 3 multigrid levels and 2 local refinement grid levels are used. The global grid is 24 x 8 x 12. The first patch is 40 x 16 x 20 and the second patch is 72 x 32 x 36. 4th order artificial dissipation are used for numerical stability. The conservative artificial compressibility method are used for further improvement of convergence. To improve the accuracy of coarse/fine grid interface of local refinement, flux interpolation method for refined grid boundary is used. The numerical results are in good agreement with experimental data. The local refinement can improve the prediction accuracy significantly. The flux interpolation method for local refinement can keep conservation for a composite grid, therefore further modify the prediction accuracy.

  18. 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.

  19. Adaptive Algebraic Smoothers

    SciTech Connect

    Philip, Bobby; Chartier, Dr Timothy

    2012-01-01

    methods based on Local Sensitivity Analysis (LSA). The method can be used in the context of geometric and algebraic multigrid methods for constructing smoothers, and in the context of Krylov methods for constructing block preconditioners. It is suitable for both constant and variable coecient problems. Furthermore, the method can be applied to systems arising from both scalar and coupled system partial differential equations (PDEs), as well as linear systems that do not arise from PDEs. The simplicity of the method will allow it to be easily incorporated into existing multigrid and Krylov solvers while providing a powerful tool for adaptively constructing methods tuned to a problem.

  20. 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.

  1. Numerical solution of flame sheet problems with and without multigrid methods

    NASA Technical Reports Server (NTRS)

    Douglas, Craig C.; Ern, Alexandre

    1993-01-01

    Flame sheet problems are on the natural route to the numerical solution of multidimensional flames, which, in turn, are important in many engineering applications. In order to model the structure of flames more accurately, we use the vorticity-velocity formulation of the fluid flow equations, as opposed to the streamfunction-vorticity approach. The numerical solution of the resulting nonlinear coupled elliptic partial differential equations involves a pseudo transient process and a steady state Newton iteration. Rather than working with dimensionless variables, we introduce scale factors that can yield significant savings in the execution time. In this context, we also investigate the applicability and performance of several multigrid methods, focusing on nonlinear damped Newton multigrid, using either one way or correction schemes.

  2. A Parallel Multigrid Method for the Finite Element Analysis of Mechanical Contact

    SciTech Connect

    Hales, J D; Parsons, I D

    2002-03-21

    A geometrical multigrid method for solving the linearized matrix equations arising from node-on-face three-dimensional finite element contact is described. The development of an efficient implementation of this combination that minimizes both the memory requirements and the computational cost requires careful construction and storage of the portion of the coarse mesh stiffness matrices that are associated with the contact stiffness on the fine mesh. The multigrid contact algorithm is parallelized in a manner suitable for distributed memory architectures: results are presented that demonstrates the scheme's scalability. The solution of a large contact problem derived from an analysis of the factory joints present in the Space Shuttle reusable solid rocket motor demonstrates the usefulness of the general approach.

  3. Rotor-stator interaction analysis using the Navier-Stokes equations and a multigrid method

    SciTech Connect

    Arnone, A.; Pacciani, R.

    1996-10-01

    A recently developed, time-accurate multigrid viscous solver has been extended to the analysis of unsteady rotor-stator interaction. In the proposed method, a fully implicit discretization is used to remove stability limitations. By means of a dual time-stepping approach, a four-stage Runge-Kutta scheme is used in conjunction with several accelerating techniques typical of steady-state solvers, instead of traditional time-expensive factorizations. The accelerating strategies include local time stepping, residual smoothing, and multigrid. Two-dimensional viscous calculations of unsteady rotor-stator interaction in the first stage of a modern gas turbine are presented. The stage analysis is based on the introduction of several blade passages to approximate the stator:rotor count ratio. Particular attention is dedicated to grid dependency in space and time as well as to the influence of the number of blades included in the calculations.

  4. 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.

  5. Algebraic method for finding equivalence groups

    NASA Astrophysics Data System (ADS)

    Bihlo, Alexander; Dos Santos Cardoso-Bihlo, Elsa; Popovych, Roman O.

    2015-06-01

    The algebraic method for computing the complete point symmetry group of a system of differential equations is extended to finding the complete equivalence group of a class of such systems. The extended method uses the knowledge of the corresponding equivalence algebra. Two versions of the method are presented, where the first involves the automorphism group of this algebra and the second is based on a list of its megaideals. We illustrate the megaideal-based version of the method with the computation of the complete equivalence group of a class of nonlinear wave equations with applications in nonlinear elasticity.

  6. Algebraic methods in system theory

    NASA Technical Reports Server (NTRS)

    Brockett, R. W.; Willems, J. C.; Willsky, A. S.

    1975-01-01

    Investigations on problems of the type which arise in the control of switched electrical networks are reported. The main results concern the algebraic structure and stochastic aspects of these systems. Future reports will contain more detailed applications of these results to engineering studies.

  7. Final Report on Subcontract B605152. Multigrid Methods for Systems of PDEs

    SciTech Connect

    Brannick, James; Xu, Jinchao

    2015-07-07

    The project team has continued with work on developing aggressive coarsening techniques for AMG methods. Of particular interest is the idea to use aggressive coarsening with polynomial smoothing. Using local Fourier analysis the optimal values for the parameters involved in defining the polynomial smoothers are determined automatically in a way to achieve fast convergence of cycles with aggressive coarsening. Numerical tests have the sharpness of the theoretical results. The methods are highly parallelizable and efficient multigrid algorithms on structured and semistructured grids in two and three spatial dimensions.

  8. 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.

  9. An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems

    SciTech Connect

    Oosterlee, C.W.; Washio, T.

    1996-12-31

    In this paper we try to achieve h-independent convergence with preconditioned GMRES and BiCGSTAB for 2D singular perturbed equations. Three recently developed multigrid methods are adopted as a preconditioner. They are also used as solution methods in order to compare the performance of the methods as solvers and as preconditioners. Two of the multigrid methods differ only in the transfer operators. One uses standard matrix- dependent prolongation operators from. The second uses {open_quotes}upwind{close_quotes} prolongation operators, developed. Both employ the Galerkin coarse grid approximation and an alternating zebra line Gauss-Seidel smoother. The third method is based on the block LU decomposition of a matrix and on an approximate Schur complement. This multigrid variant is presented in. All three multigrid algorithms are algebraic methods.

  10. 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.

  11. 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.

  12. High order finite difference and multigrid methods for spatially evolving instability in a planar channel

    NASA Technical Reports Server (NTRS)

    Liu, C.; Liu, Z.

    1993-01-01

    The fourth-order finite-difference scheme with fully implicit time-marching presently used to computationally study the spatial instability of planar Poiseuille flow incorporates a novel treatment for outflow boundary conditions that renders the buffer area as short as one wavelength. A semicoarsening multigrid method accelerates convergence for the implicit scheme at each time step; a line-distributive relaxation is developed as a robust fast solver that is efficient for anisotropic grids. Computational cost is no greater than that of explicit schemes, and excellent agreement with linear theory is obtained.

  13. A multigrid integral equation method for large-scale models with inhomogeneous backgrounds

    NASA Astrophysics Data System (ADS)

    Endo, Masashi; Čuma, Martin; Zhdanov, Michael S.

    2008-12-01

    We present a multigrid integral equation (IE) method for three-dimensional (3D) electromagnetic (EM) field computations in large-scale models with inhomogeneous background conductivity (IBC). This method combines the advantages of the iterative IBC IE method and the multigrid quasi-linear (MGQL) approximation. The new EM modelling method solves the corresponding systems of linear equations within the domains of anomalous conductivity, Da, and inhomogeneous background conductivity, Db, separately on coarse grids. The observed EM fields in the receivers are computed using grids with fine discretization. The developed MGQL IBC IE method can also be applied iteratively by taking into account the return effect of the anomalous field inside the domain of the background inhomogeneity Db, and vice versa. The iterative process described above is continued until we reach the required accuracy of the EM field calculations in both domains, Da and Db. The method was tested for modelling the marine controlled-source electromagnetic field for complex geoelectrical structures with hydrocarbon petroleum reservoirs and a rough sea-bottom bathymetry.

  14. Quasi-Newton and multigrid methods for semiconductor device simulation

    SciTech Connect

    Slamet, S.

    1983-12-01

    A finite difference approximation to the semiconductor device equations using the Bernoulli function approximation to the exponential function is described, and the robustness of this approximation is demonstrated. Sheikh's convergence analysis of Gummel's method and quasi-Newton methods is extended to a nonuniform mesh and the Bernoulli function discretization. It is proved that Gummel's method and the quasi-Newton methods for the scaled carrier densities and carrier densities converge locally for sufficiently smooth problems.

  15. 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.

  16. Adaptive multi-grid method for a periodic heterogeneous medium in 1-D

    SciTech Connect

    Fish, J.; Belsky, V.

    1995-12-31

    A multi-grid method for a periodic heterogeneous medium in 1-D is presented. Based on the homogenization theory special intergrid connection operators have been developed to imitate a low frequency response of the differential equations with oscillatory coefficients. The proposed multi-grid method has been proved to have a fast rate of convergence governed by the ratio q/(4-q), where o

  17. Combustor flow computations in general coordinates with a multigrid method

    NASA Astrophysics Data System (ADS)

    Shyy, Wei; Braaten, Mark E.

    The computational approach presented for single-phase combusting turbulent flowfields balances the requirements of complex physical and chemical flow interactions with those of resolving the three-dimensional geometrical constraints of the combustor contours, film cooling slots, and circular dilution holes. Attention is given to the three-dimensional grid-generation algorithm, the two-dimensional adaptive grid method applied to recirculating turbulent reacting flows, and theory/data assessments for three-dimensional combusting flows in an annular gas turbine combustor.

  18. On multigrid methods for image reconstruction from projections

    SciTech Connect

    Henson, V.E.; Robinson, B.T.; Limber, M.

    1994-12-31

    The sampled Radon transform of a 2D function can be represented as a continuous linear map R : L{sup 1} {yields} R{sup N}. The image reconstruction problem is: given a vector b {element_of} R{sup N}, find an image (or density function) u(x, y) such that Ru = b. Since in general there are infinitely many solutions, the authors pick the solution with minimal 2-norm. Numerous proposals have been made regarding how best to discretize this problem. One can, for example, select a set of functions {phi}{sub j} that span a particular subspace {Omega} {contained_in} L{sup 1}, and model R : {Omega} {yields} R{sup N}. The subspace {Omega} may be chosen as a member of a sequence of subspaces whose limit is dense in L{sup 1}. One approach to the choice of {Omega} gives rise to a natural pixel discretization of the image space. Two possible choices of the set {phi}{sub j} are the set of characteristic functions of finite-width `strips` representing energy transmission paths and the set of intersections of such strips. The authors have studied the eigenstructure of the matrices B resulting from these choices and the effect of applying a Gauss-Seidel iteration to the problem Bw = b. There exists a near null space into which the error vectors migrate with iteration, after which Gauss-Seidel iteration stalls. The authors attempt to accelerate convergence via a multilevel scheme, based on the principles of McCormick`s Multilevel Projection Method (PML). Coarsening is achieved by thickening the rays which results in a much smaller discretization of an optimal grid, and a halving of the number of variables. This approach satisfies all the requirements of the PML scheme. They have observed that a multilevel approach based on this idea accelerates convergence at least to the point where noise in the data dominates.

  19. Multigrid Methods

    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.

  20. Multigrid on massively parallel architectures

    SciTech Connect

    Falgout, R D; Jones, J E

    1999-09-17

    The scalable implementation of multigrid methods for machines with several thousands of processors is investigated. Parallel performance models are presented for three different structured-grid multigrid algorithms, and a description is given of how these models can be used to guide implementation. Potential pitfalls are illustrated when moving from moderate-sized parallelism to large-scale parallelism, and results are given from existing multigrid codes to support the discussion. Finally, the use of mixed programming models is investigated for multigrid codes on clusters of SMPs.

  1. 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.

  2. Numerical Evaluation of P-Multigrid Method for the Solution of Discontinuous Galerkin Discretizations of Diffusive Equations

    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.

  3. 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.

  4. 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.

  5. Practical improvements of multi-grid iteration for adaptive mesh refinement method

    NASA Astrophysics Data System (ADS)

    Miyashita, Hisashi; Yamada, Yoshiyuki

    2005-03-01

    Adaptive mesh refinement(AMR) is a powerful tool to efficiently solve multi-scaled problems. However, the vanilla AMR method has a well-known critical demerit, i.e., it cannot be applied to non-local problems. Although multi-grid iteration (MGI) can be regarded as a good remedy for a non-local problem such as the Poisson equation, we observed fundamental difficulties in applying the MGI technique in AMR to realistic problems under complicated mesh layouts because it does not converge or it requires too many iterations even if it does converge. To cope with the problem, when updating the next approximation in the MGI process, we calculate the precise total corrections that are relatively accurate to the current residual by introducing a new iteration for such a total correction. This procedure greatly accelerates the MGI convergence speed especially under complicated mesh layouts.

  6. Numerical study of a multigrid method with four smoothing methods for the incompressible Navier-Stokes equations in general coordinates

    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.

  7. A parallel geometric multigrid method for finite elements on octree meshes

    SciTech Connect

    Sampath, Rahul S; Biros, George

    2010-01-01

    In this article, we present a parallel geometric multigrid algorithm for solving variable-coefficient elliptic partial differential equations on the unit box (with Dirichlet or Neumann boundary conditions) using highly nonuniform, octree-based, conforming finite element discretizations. Our octrees are 2:1 balanced, that is, we allow no more than one octree-level difference between octants that share a face, edge, or vertex. We describe a parallel algorithm whose input is an arbitrary 2:1 balanced fine-grid octree and whose output is a set of coarser 2:1 balanced octrees that are used in the multigrid scheme. Also, we derive matrix-free schemes for the discretized finite element operators and the intergrid transfer operations. The overall scheme is second-order accurate for sufficiently smooth right-hand sides and material properties; its complexity for nearly uniform trees is {Omicron}(N/n{sub p} log N/n{sub p}) + {Omicron}(n{sub p} log n{sub p}), where N is the number of octree nodes and n{sub p} is the number of processors. Our implementation uses the Message Passing Interface standard. We present numerical experiments for the Laplace and Navier (linear elasticity) operators that demonstrate the scalability of our method. Our largest run was a highly nonuniform, 8-billion-unknown, elasticity calculation using 32,000 processors on the Teragrid system, 'Ranger,' at the Texas Advanced Computing Center. Our implementation is publically available in the Dendro library, which is built on top of the PETSc library from Argonne National Laboratory.

  8. Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids

    NASA Astrophysics Data System (ADS)

    Langer, Stefan

    2014-11-01

    For unstructured finite volume methods an agglomeration multigrid with an implicit multistage Runge-Kutta method as a smoother is developed for solving the compressible Reynolds averaged Navier-Stokes (RANS) equations. The implicit Runge-Kutta method is interpreted as a preconditioned explicit Runge-Kutta method. The construction of the preconditioner is based on an approximate derivative. The linear systems are solved approximately with a symmetric Gauss-Seidel method. To significantly improve this solution method grid anisotropy is treated within the Gauss-Seidel iteration in such a way that the strong couplings in the linear system are resolved by tridiagonal systems constructed along these directions of strong coupling. The agglomeration strategy is adapted to this procedure by taking into account exactly these anisotropies in such a way that a directional coarsening is applied along these directions of strong coupling. Turbulence effects are included by a Spalart-Allmaras model, and the additional transport-type equation is approximately solved in a loosely coupled manner with the same method. For two-dimensional and three-dimensional numerical examples and a variety of differently generated meshes we show the wide range of applicability of the solution method. Finally, we exploit the GMRES method to determine approximate spectral information of the linearized RANS equations. This approximate spectral information is used to discuss and compare characteristics of multistage Runge-Kutta methods.

  9. Classical versus Computer Algebra Methods in Elementary Geometry

    ERIC Educational Resources Information Center

    Pech, Pavel

    2005-01-01

    Computer algebra methods based on results of commutative algebra like Groebner bases of ideals and elimination of variables make it possible to solve complex, elementary and non elementary problems of geometry, which are difficult to solve using a classical approach. Computer algebra methods permit the proof of geometric theorems, automatic…

  10. A multiple-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations

    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.

  11. Nested multigrid vector and scalar potential finite element method for three-dimensional time-harmonic electromagnetic analysis

    NASA Astrophysics Data System (ADS)

    Zhu, Yu; Cangellaris, Andreas C.

    2002-05-01

    A new finite element methodology is presented for fast and robust numerical simulation of three-dimensional electromagnetic wave phenomena. The new methodology combines nested multigrid techniques with the ungauged vector and scalar potential formulation of the finite element method. The finite element modeling is performed on nested meshes over the computational domain of interest. The iterative solution of the finite element matrix on the finest mesh is performed using the conjugate gradient method, while the nested multigrid vector and scalar potential algorithm acts as the preconditioner for the iterative solver. Numerical experiments from the application of the new methodology to three-dimensional electromagnetic scattering are used to demonstrate its superior numerical convergence and efficient memory usage.

  12. Structured adaptive grid generation using algebraic methods

    NASA Technical Reports Server (NTRS)

    Yang, Jiann-Cherng; Soni, Bharat K.; Roger, R. P.; Chan, Stephen C.

    1993-01-01

    The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration

  13. 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.

  14. The multigrid POTFIT (MGPF) method: grid representations of potentials for quantum dynamics of large systems.

    PubMed

    Peláez, Daniel; Meyer, Hans-Dieter

    2013-01-01

    In this article, a new method, multigrid POTFIT (MGPF), is presented. MGPF is a grid-based algorithm which transforms a general potential energy surface into product form, that is, a sum of products of one-dimensional functions. This form is necessary to profit from the computationally advantageous multiconfiguration time-dependent Hartree method for quantum dynamics. MGPF circumvents the dimensionality related issues present in POTFIT [A. Jäckle and H.-D. Meyer, J. Chem. Phys. 104, 7974 (1996)], allowing quantum dynamical studies of systems up to about 12 dimensions. MGPF requires the definition of a fine grid and a coarse grid, the latter being a subset of the former. The MGPF approximation relies on a series of underlying POTFIT calculations on grids which are smaller than the fine one and larger than or equal to the coarse one. This aspect makes MGPF a bit less accurate than POTFIT but orders of magnitude faster and orders of magnitude less memory demanding than POTFIT. Moreover, like POTFIT, MGPF is variational and provides an efficient error control. PMID:23298029

  15. Multigrid methods and high order finite difference for flow in transition - Effects of isolated and distributed roughness elements

    NASA Technical Reports Server (NTRS)

    Liu, C.; Liu, Z.

    1993-01-01

    The high order finite difference and multigrid methods have been successfully applied to direct numerical simulation (DNS) for flow transition in 3D channels and 3D boundary layers with 2D and 3D 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 semicoarsening multigrid method associated with line distributive relaxation scheme, and a new treatment of the outflow boundary condition, which needs only a very short buffer domain to damp all wave reflection, are developed. These approaches make the multigrid DNS code very accurate and efficient. This makes us not only able to do spatial DNS for the 3D channel and flat plate at low computational costs, but also able to do spatial DNS for transition in the 3D boundary layer with 3D single and multiple roughness elements. Numerical results show good agreement with the linear stability theory, the secondary instability theory, and a number of laboratory experiments.

  16. 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.

  17. Investigation of upwind, multigrid, multiblock numerical schemes for three dimensional flows. Volume 1: Runge-Kutta methods for a thin layer Navier-Stokes solver

    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.

  18. Comparative Convergence Analysis of Nonlinear AMLI-Cycle Multigrid

    SciTech Connect

    Hu, Xiaozhe; Vassilevski, Panayot S.; Xu, Jinchao

    2013-04-30

    The purpose of our paper is to provide a comprehensive convergence analysis of the nonlinear algebraic multilevel iteration (AMLI)-cycle multigrid (MG) method for symmetric positive definite problems. We show that the nonlinear AMLI-cycle MG method is uniformly convergent, based on classical assumptions for approximation and smoothing properties. Furthermore, under only the assumption that the smoother is convergent, we show that the nonlinear AMLI-cycle method is always better (or not worse) than the respective V-cycle MG method. Finally, numerical experiments are presented to illustrate the theoretical results.

  19. Another look at neural multigrid

    SciTech Connect

    Baeker, M.

    1997-04-01

    We present a new multigrid method called neural multigrid which is based on joining multigrid ideas with concepts from neural nets. The main idea is to use the Greenbaum criterion as a cost functional for the neural net. The algorithm is able to learn efficient interpolation operators in the case of the ordered Laplace equation with only a very small critical slowing down and with a surprisingly small amount of work comparable to that of a Conjugate Gradient solver. In the case of the two-dimensional Laplace equation with SU(2) gauge fields at {beta}=0 the learning exhibits critical slowing down with an exponent of about z {approx} 0.4. The algorithm is able to find quite good interpolation operators in this case as well. Thereby it is proven that a practical true multigrid algorithm exists even for a gauge theory. An improved algorithm using dynamical blocks that will hopefully overcome the critical slowing down completely is sketched.

  20. New convergence estimates for multigrid algorithms

    SciTech Connect

    Bramble, J.H.; Pasciak, J.E.

    1987-10-01

    In this paper, new convergence estimates are proved for both symmetric and nonsymmetric multigrid algorithms applied to symmetric positive definite problems. Our theory relates the convergence of multigrid algorithms to a ''regularity and approximation'' parameter ..cap alpha.. epsilon (0, 1) and the number of relaxations m. We show that for the symmetric and nonsymmetric ..nu.. cycles, the multigrid iteration converges for any positive m at a rate which deteriorates no worse than 1-cj/sup -(1-//sup ..cap alpha..//sup )///sup ..cap alpha../, where j is the number of grid levels. We then define a generalized ..nu.. cycle algorithm which involves exponentially increasing (for example, doubling) the number of smoothings on successively coarser grids. We show that the resulting symmetric and nonsymmetric multigrid iterations converge for any ..cap alpha.. with rates that are independent of the mesh size. The theory is presented in an abstract setting which can be applied to finite element multigrid and finite difference multigrid methods.

  1. Calculation of 3D turbulent jets in crossflow with a multigrid method and a second-moment closure model

    NASA Technical Reports Server (NTRS)

    Demuren, A. O.

    1990-01-01

    A multigrid method is presented for calculating turbulent jets in crossflow. Fairly rapid convergence is obtained with the k-epsilon turbulence model, but computations with a full Reynolds stress turbulence model (RSM) are not yet very efficient. Grid dependency tests show that there are slight differences between results obtained on the two finest grid levels. Computations using the RSM are significantly different from those with k-epsilon model and compare better to experimental data. Some work is still required to improve the efficiency of the computations with the RSM.

  2. 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.

  3. A Novel Multigrid Method for Sn Discretizations of the Mono-Energetic Boltzmann Transport Equation in the Optically Thick and Thin Regimes with Anisotropic Scattering, Part I

    SciTech Connect

    Lee, Barry

    2010-05-01

    This paper presents a new multigrid method applied to the most common Sn discretizations (Petrov-Galerkin, diamond-differenced, corner-balanced, and discontinuous Galerkin) of the mono-energetic Boltzmann transport equation in the optically thick and thin regimes, and with strong anisotropic scattering. Unlike methods that use scalar DSA diffusion preconditioners for the source iteration, this multigrid method is applied directly to an integral equation for the scalar flux. Thus, unlike the former methods that apply a multigrid strategy to the scalar DSA diffusion operator, this method applies a multigrid strategy to the integral source iteration operator, which is an operator for 5 independent variables in spatial 3-d (3 in space and 2 in angle) and 4 independent variables in spatial 2-d (2 in space and 2 in angle). The core smoother of this multigrid method involves applications of the integral operator. Since the kernel of this integral operator involves the transport sweeps, applying this integral operator requires a transport sweep (an inversion of an upper triagular matrix) for each of the angles used. As the equation is in 5-space or 4-space, the multigrid approach in this paper coarsens in both angle and space, effecting efficient applications of the coarse integral operators. Although each V-cycle of this method is more expensive than a V-cycle for the DSA preconditioner, since the DSA equation does not have angular dependence, the overall computational efficiency is about the same for problems where DSA preconditioning {\\it is} effective. This new method also appears to be more robust over all parameter regimes than DSA approaches. Moreover, this new method is applicable to a variety of Sn spatial discretizations, to problems involving a combination of optically thick and thin regimes, and more importantly, to problems with anisotropic scattering cross-sections, all of which DSA approaches perform poorly or not applicable at all. This multigrid approach

  4. Algebraic multiscale method for flow in heterogeneous porous media with embedded discrete fractures (F-AMS)

    NASA Astrophysics Data System (ADS)

    Ţene, Matei; Al Kobaisi, Mohammed Saad; Hajibeygi, Hadi

    2016-09-01

    This paper introduces an Algebraic MultiScale method for simulation of flow in heterogeneous porous media with embedded discrete Fractures (F-AMS). First, multiscale coarse grids are independently constructed for both porous matrix and fracture networks. Then, a map between coarse- and fine-scale is obtained by algebraically computing basis functions with local support. In order to extend the localization assumption to the fractured media, four types of basis functions are investigated: (1) Decoupled-AMS, in which the two media are completely decoupled, (2) Frac-AMS and (3) Rock-AMS, which take into account only one-way transmissibilities, and (4) Coupled-AMS, in which the matrix and fracture interpolators are fully coupled. In order to ensure scalability, the F-AMS framework permits full flexibility in terms of the resolution of the fracture coarse grids. Numerical results are presented for two- and three-dimensional heterogeneous test cases. During these experiments, the performance of F-AMS, paired with ILU(0) as second-stage smoother in a convergent iterative procedure, is studied by monitoring CPU times and convergence rates. Finally, in order to investigate the scalability of the method, an extensive benchmark study is conducted, where a commercial algebraic multigrid solver is used as reference. The results show that, given an appropriate coarsening strategy, F-AMS is insensitive to severe fracture and matrix conductivity contrasts, as well as the length of the fracture networks. Its unique feature is that a fine-scale mass conservative flux field can be reconstructed after any iteration, providing efficient approximate solutions in time-dependent simulations.

  5. Linear Algebraic Method for Non-Linear Map Analysis

    SciTech Connect

    Yu,L.; Nash, B.

    2009-05-04

    We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.

  6. Large full band gaps for photonic crystals in two dimensions computed by an inverse method with multigrid acceleration

    NASA Astrophysics Data System (ADS)

    Chern, R. L.; Chang, C. Chung; Chang, Chien C.; Hwang, R. R.

    2003-08-01

    In this study, two fast and accurate methods of inverse iteration with multigrid acceleration are developed to compute band structures of photonic crystals of general shape. In particular, we report two-dimensional photonic crystals of silicon air with an optimal full band gap of gap-midgap ratio Δω/ωmid=0.2421, which is 30% larger than ever reported in the literature. The crystals consist of a hexagonal array of circular columns, each connected to its nearest neighbors by slender rectangular rods. A systematic study with respect to the geometric parameters of the photonic crystals was made possible with the present method in drawing a three-dimensional band-gap diagram with reasonable computing time.

  7. Large full band gaps for photonic crystals in two dimensions computed by an inverse method with multigrid acceleration.

    PubMed

    Chern, R L; Chang, C Chung; Chang, Chien C; Hwang, R R

    2003-08-01

    In this study, two fast and accurate methods of inverse iteration with multigrid acceleration are developed to compute band structures of photonic crystals of general shape. In particular, we report two-dimensional photonic crystals of silicon air with an optimal full band gap of gap-midgap ratio Deltaomega/omega(mid)=0.2421, which is 30% larger than ever reported in the literature. The crystals consist of a hexagonal array of circular columns, each connected to its nearest neighbors by slender rectangular rods. A systematic study with respect to the geometric parameters of the photonic crystals was made possible with the present method in drawing a three-dimensional band-gap diagram with reasonable computing time. PMID:14525145

  8. Multigrid for locally refined meshes

    SciTech Connect

    Shapira, Y.

    1999-12-01

    A multilevel method for the solution of finite element schemes on locally refined meshes is introduced. For isotropic diffusion problems, the condition number of the two-level method is bounded independently of the mesh size and the discontinuities in the diffusion coefficient. The curves of discontinuity need not be aligned with the coarse mesh. Indeed, numerical applications with 10 levels of local refinement yield a rapid convergence of the corresponding 10-level, multigrid V-cycle and other multigrid cycles which are more suitable for parallelism even when the discontinuities are invisible on most of the coarse meshes.

  9. Canonical-variables multigrid method for steady-state Euler equations

    NASA Technical Reports Server (NTRS)

    Taasan, Shlomo

    1994-01-01

    A novel approach for the solution of inviscid flow problems for subsonic compressible flows is described. The approach is based on canonical forms of the equations, in which subsystems governed by hyperbolic operators are separated from those governed by elliptic ones. The discretizations used as well as the iterative techniques for the different subsystems are inherently different. Hyperbolic parts, which describe, in general, propagation phenomena, are discretized using upwind schemes and are solved by marching techniques. Elliptic parts, which are directionally unbiased, are discretized using h-elliptic central discretizations, and are solved by pointwise relaxations together with coarse grid acceleration. The resulting discretization schemes introduce artificial viscosity only for the hyperbolic parts of the system; thus a smaller total artificial viscosity is used, while the multigrid solvers used are much more efficient. Solutions of the subsonic compressible Euler equations are achieved at the same efficiency as the full potential equation.

  10. MGLab: An Interactive Multigrid Environment

    NASA Technical Reports Server (NTRS)

    Bordner, James; Saied, Faisal

    1996-01-01

    MGLab is a set of Matlab functions that defines an interactive environment for experimenting with multigrid algorithms. The package solves two-dimensional elliptic partial differential equations discretized using either finite differences or finite volumes, depending on the problem. Built-in problems include the Poisson equation, the Helmholtz equation, a convection-diffusion problem, and a discontinuous coefficient problem. A number of parameters controlling the multigrid V-cycle can be set using a point-and-click mechanism. The menu-based user interface also allows a choice of several Krylov subspace methods, including CG, GMRES(k), and Bi-CGSTAB, which can be used either as stand-alone solvers or as multigrid acceleration schemes. The package exploits Matlab's visualization and sparse matrix features and has been structured to be easily extensible.

  11. A Renormalisation Group Method. I. Gaussian Integration and Normed Algebras

    NASA Astrophysics Data System (ADS)

    Brydges, David C.; Slade, Gordon

    2015-05-01

    This paper is the first in a series devoted to the development of a rigorous renormalisation group method for lattice field theories involving boson fields, fermion fields, or both. Our immediate motivation is a specific model, involving both boson and fermion fields, which arises as a representation of the continuous-time weakly self-avoiding walk. In this paper, we define normed algebras suitable for a renormalisation group analysis, and develop methods for performing analysis on these algebras. We also develop the theory of Gaussian integration on these normed algebras, and prove estimates for Gaussian integrals. The concepts and results developed here provide a foundation for the continuation of the method presented in subsequent papers in the series.

  12. Exact solution of some linear matrix equations using algebraic methods

    NASA Technical Reports Server (NTRS)

    Djaferis, T. E.; Mitter, S. K.

    1977-01-01

    A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.

  13. Algebraic methods for the solution of some linear matrix equations

    NASA Technical Reports Server (NTRS)

    Djaferis, T. E.; Mitter, S. K.

    1979-01-01

    The characterization of polynomials whose zeros lie in certain algebraic domains (and the unification of the ideas of Hermite and Lyapunov) is the basis for developing finite algorithms for the solution of linear matrix equations. Particular attention is given to equations PA + A'P = Q (the Lyapunov equation) and P - A'PA = Q the (discrete Lyapunov equation). The Lyapunov equation appears in several areas of control theory such as stability theory, optimal control (evaluation of quadratic integrals), stochastic control (evaluation of covariance matrices) and in the solution of the algebraic Riccati equation using Newton's method.

  14. Exact solution of some linear matrix equations using algebraic methods

    NASA Technical Reports Server (NTRS)

    Djaferis, T. E.; Mitter, S. K.

    1979-01-01

    Algebraic methods are used to construct the exact solution P of the linear matrix equation PA + BP = - C, where A, B, and C are matrices with real entries. The emphasis of this equation is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The paper is divided into six sections which include the proof of the basic lemma, the Liapunov equation, and the computer implementation for the rational, integer and modular algorithms. Two numerical examples are given and the entire calculation process is depicted.

  15. Application of an Upwind High Resolution Finite-Differencing Scheme and Multigrid Method in Steady-State Incompressible Flow Simulations

    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.

  16. An Analysis of the Algebraic Method for Balancing Chemical Reactions.

    ERIC Educational Resources Information Center

    Olson, John A.

    1997-01-01

    Analyzes the algebraic method for balancing chemical reactions. Introduces a third general condition that involves a balance between the total amount of oxidation and reduction. Requires the specification of oxidation states for all elements throughout the reaction. Describes the general conditions, the mathematical treatment, redox reactions, and…

  17. Divergence of Scientific Heuristic Method and Direct Algebraic Instruction

    ERIC Educational Resources Information Center

    Calucag, Lina S.

    2016-01-01

    This is an experimental study, made used of the non-randomized experimental and control groups, pretest-posttest designs. The experimental and control groups were two separate intact classes in Algebra. For a period of twelve sessions, the experimental group was subjected to the scientific heuristic method, but the control group instead was given…

  18. A Cognitive Model of Experts' Algebraic Solving Methods

    ERIC Educational Resources Information Center

    Cortes, Anibal

    2003-01-01

    We studied experts' solving methods and analyzed the nature of mathematical knowledge as well as their efficiency in algebraic calculations. We constructed a model of the experts cognitive functioning (notably teachers) in which the observed automatisms were modeled in terms of schemes and instruments. Mathematical justification of transformation…

  19. Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems

    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

  20. 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.

  1. 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.

  2. 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.

  3. 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.

  4. Application of the multigrid amplitude function method for time-dependent transport equation using MOC

    SciTech Connect

    Tsujita, K.; Endo, T.; Yamamoto, A.

    2013-07-01

    An efficient numerical method for time-dependent transport equation, the mutigrid amplitude function (MAF) method, is proposed. The method of characteristics (MOC) is being widely used for reactor analysis thanks to the advances of numerical algorithms and computer hardware. However, efficient kinetic calculation method for MOC is still desirable since it requires significant computation time. Various efficient numerical methods for solving the space-dependent kinetic equation, e.g., the improved quasi-static (IQS) and the frequency transform methods, have been developed so far mainly for diffusion calculation. These calculation methods are known as effective numerical methods and they offer a way for faster computation. However, they have not been applied to the kinetic calculation method using MOC as the authors' knowledge. Thus, the MAF method is applied to the kinetic calculation using MOC aiming to reduce computation time. The MAF method is a unified numerical framework of conventional kinetic calculation methods, e.g., the IQS, the frequency transform, and the theta methods. Although the MAF method is originally developed for the space-dependent kinetic calculation based on the diffusion theory, it is extended to transport theory in the present study. The accuracy and computational time are evaluated though the TWIGL benchmark problem. The calculation results show the effectiveness of the MAF method. (authors)

  5. Differential algebraic method for aberration analysis of typical electrostatic lenses.

    PubMed

    Liu, Zhixiong

    2006-02-01

    In this paper up to fifth-order geometric and third-order chromatic aberration coefficients of typical electrostatic lenses are calculated by means of the charged particle optics code, COSY INFINITY, based on the differential algebraic (DA) method. A two-tube immersion lens and a symmetric einzel lens have been chosen as two examples, whose axial potential distributions are numerically calculated by a FORTRAN program using the finite difference method. The DA results are in good agreement with those evaluated by the aberration integrals in electron optics. The DA method presented here can easily be extended to aberration analysis of other numerically computed electron lenses, including magnetic lenses. PMID:16125845

  6. Numerical boundary condition procedures and multigrid methods; Proceedings of the Symposium, NASA Ames Research Center, Moffett Field, CA, October 19-22, 1981

    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.

  7. Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

    SciTech Connect

    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, 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.

  8. Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

    DOE PAGESBeta

    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

  9. Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

    SciTech Connect

    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, 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.

  10. Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

    SciTech Connect

    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, 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.

  11. Performance of preconditioned iterative and multigrid solvers in solving the three-dimensional magnetotelluric modeling problem using the staggered finite-difference method: a comparative study

    NASA Astrophysics Data System (ADS)

    Li, Gang; Zhang, Lili; Hao, Tianyao

    2016-02-01

    An effective solver for the large complex system of linear equations is critical for improving the accuracy of numerical solutions in three-dimensional (3D) magnetotelluric (MT) modeling using the staggered finite-difference (SFD) method. In electromagnetic modeling, the formed system of linear equations is commonly solved using preconditioned iterative relaxation methods. We present 3D MT modeling using the SFD method, based on former work. The multigrid solver and three solvers preconditioned by incomplete Cholesky decomposition—the minimum residual method, the generalized product bi-conjugate gradient method and the bi-conjugate gradient stabilized method—are used to solve the formed system of linear equations. Divergence correction for the magnetic field is applied. We also present a comparison of the stability and convergence of these iterative solvers if divergence correction is used. Model tests show that divergence correction improves the convergence of iterative solvers and the accuracy of numerical results. Divergence correction can also decrease the number of iterations for fast convergence without changing the stability of linear solvers. For consideration of the computation time and memory requirements, the multigrid solver combined with divergence correction is preferred for 3D MT field simulation.

  12. Multigrid method applied to the solution of an elliptic, generalized eigenvalue problem

    SciTech Connect

    Alchalabi, R.M.; Turinsky, P.J.

    1996-12-31

    The work presented in this paper is concerned with the development of an efficient MG algorithm for the solution of an elliptic, generalized eigenvalue problem. The application is specifically applied to the multigroup neutron diffusion equation which is discretized by utilizing the Nodal Expansion Method (NEM). The underlying relaxation method is the Power Method, also known as the (Outer-Inner Method). The inner iterations are completed using Multi-color Line SOR, and the outer iterations are accelerated using Chebyshev Semi-iterative Method. Furthermore, the MG algorithm utilizes the consistent homogenization concept to construct the restriction operator, and a form function as a prolongation operator. The MG algorithm was integrated into the reactor neutronic analysis code NESTLE, and numerical results were obtained from solving production type benchmark problems.

  13. A fast and robust computational method for the ionization cross sections of the driven Schrödinger equation using an O (N) multigrid-based scheme

    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]).

  14. 3D magnetospheric parallel hybrid multi-grid method applied to planet-plasma interactions

    NASA Astrophysics Data System (ADS)

    Leclercq, L.; Modolo, R.; Leblanc, F.; Hess, S.; Mancini, M.

    2016-03-01

    We present a new method to exploit multiple refinement levels within a 3D parallel hybrid model, developed to study planet-plasma interactions. This model is based on the hybrid formalism: ions are kinetically treated whereas electrons are considered as a inertia-less fluid. Generally, ions are represented by numerical particles whose size equals the volume of the cells. Particles that leave a coarse grid subsequently entering a refined region are split into particles whose volume corresponds to the volume of the refined cells. The number of refined particles created from a coarse particle depends on the grid refinement rate. In order to conserve velocity distribution functions and to avoid calculations of average velocities, particles are not coalesced. Moreover, to ensure the constancy of particles' shape function sizes, the hybrid method is adapted to allow refined particles to move within a coarse region. Another innovation of this approach is the method developed to compute grid moments at interfaces between two refinement levels. Indeed, the hybrid method is adapted to accurately account for the special grid structure at the interfaces, avoiding any overlapping grid considerations. Some fundamental test runs were performed to validate our approach (e.g. quiet plasma flow, Alfven wave propagation). Lastly, we also show a planetary application of the model, simulating the interaction between Jupiter's moon Ganymede and the Jovian plasma.

  15. An algebraic method for constructing stable and consistent autoregressive filters

    NASA Astrophysics Data System (ADS)

    Harlim, John; Hong, Hoon; Robbins, Jacob L.

    2015-02-01

    In this paper, we introduce an algebraic method to construct stable and consistent univariate autoregressive (AR) models of low order for filtering and predicting nonlinear turbulent signals with memory depth. By stable, we refer to the classical stability condition for the AR model. By consistent, we refer to the classical consistency constraints of Adams-Bashforth methods of order-two. One attractive feature of this algebraic method is that the model parameters can be obtained without directly knowing any training data set as opposed to many standard, regression-based parameterization methods. It takes only long-time average statistics as inputs. The proposed method provides a discretization time step interval which guarantees the existence of stable and consistent AR model and simultaneously produces the parameters for the AR models. In our numerical examples with two chaotic time series with different characteristics of decaying time scales, we find that the proposed AR models produce significantly more accurate short-term predictive skill and comparable filtering skill relative to the linear regression-based AR models. These encouraging results are robust across wide ranges of discretization times, observation times, and observation noise variances. Finally, we also find that the proposed model produces an improved short-time prediction relative to the linear regression-based AR-models in forecasting a data set that characterizes the variability of the Madden-Julian Oscillation, a dominant tropical atmospheric wave pattern.

  16. An algebraic method for constructing stable and consistent autoregressive filters

    SciTech Connect

    Harlim, John; Hong, Hoon; Robbins, Jacob L.

    2015-02-15

    In this paper, we introduce an algebraic method to construct stable and consistent univariate autoregressive (AR) models of low order for filtering and predicting nonlinear turbulent signals with memory depth. By stable, we refer to the classical stability condition for the AR model. By consistent, we refer to the classical consistency constraints of Adams–Bashforth methods of order-two. One attractive feature of this algebraic method is that the model parameters can be obtained without directly knowing any training data set as opposed to many standard, regression-based parameterization methods. It takes only long-time average statistics as inputs. The proposed method provides a discretization time step interval which guarantees the existence of stable and consistent AR model and simultaneously produces the parameters for the AR models. In our numerical examples with two chaotic time series with different characteristics of decaying time scales, we find that the proposed AR models produce significantly more accurate short-term predictive skill and comparable filtering skill relative to the linear regression-based AR models. These encouraging results are robust across wide ranges of discretization times, observation times, and observation noise variances. Finally, we also find that the proposed model produces an improved short-time prediction relative to the linear regression-based AR-models in forecasting a data set that characterizes the variability of the Madden–Julian Oscillation, a dominant tropical atmospheric wave pattern.

  17. Algebraic and analytic reconstruction methods for dynamic tomography.

    PubMed

    Desbat, L; Rit, S; Clackdoyle, R; Mennessier, C; Promayon, E; Ntalampeki, S

    2007-01-01

    In this work, we discuss algebraic and analytic approaches for dynamic tomography. We present a framework of dynamic tomography for both algebraic and analytic approaches. We finally present numerical experiments. PMID:18002059

  18. Some multigrid algorithms for SIMD machines

    SciTech Connect

    Dendy, J.E. Jr.

    1996-12-31

    Previously a semicoarsening multigrid algorithm suitable for use on SIMD architectures was investigated. Through the use of new software tools, the performance of this algorithm has been considerably improved. The method has also been extended to three space dimensions. The method performs well for strongly anisotropic problems and for problems with coefficients jumping by orders of magnitude across internal interfaces. The parallel efficiency of this method is analyzed, and its actual performance on the CM-5 is compared with its performance on the CRAY-YMP. A standard coarsening multigrid algorithm is also considered, and we compare its performance on these two platforms as well.

  19. Application of multigrid methods to the solution of liquid crystal equations on a SIMD computer

    NASA Technical Reports Server (NTRS)

    Farrell, Paul A.; Ruttan, Arden; Zeller, Reinhardt R.

    1993-01-01

    We will describe a finite difference code for computing the equilibrium configurations of the order-parameter tensor field for nematic liquid crystals in rectangular regions by minimization of the Landau-de Gennes Free Energy functional. The implementation of the free energy functional described here includes magnetic fields, quadratic gradient terms, and scalar bulk terms through the fourth order. Boundary conditions include the effects of strong surface anchoring. The target architectures for our implementation are SIMD machines, with interconnection networks which can be configured as 2 or 3 dimensional grids, such as the Wavetracer DTC. We also discuss the relative efficiency of a number of iterative methods for the solution of the linear systems arising from this discretization on such architectures.

  20. ODE methods for the solution of differential/algebraic systems

    SciTech Connect

    Gear, C.W.; Petzold, L.R.

    1982-09-01

    In this paper we study the numerical solution of the differential/algebraic systems F(t, y, y') = 0. Many of these systems can be solved conveniently and economically using a range of ODE methods. Others can be solved only by a small subset of ODE methods, and still others present insurmountable difficulty for all current ODE methods. We examine the first two groups of problems and indicate which methods we believe to be best for them. Then we explore the properties of the third group which cause the methods to fail. We describe a reduction technique which allows systems to be reduced to ones that can be solved. It also provides a tool for the analytical study of the structure of systems.

  1. Numerical Methods for Forward and Inverse Problems in Discontinuous Media

    SciTech Connect

    Chartier, Timothy P.

    2011-03-08

    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 to 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.

  2. Phased-mission system analysis using Boolean algebraic methods

    NASA Technical Reports Server (NTRS)

    Somani, Arun K.; Trivedi, Kishor S.

    1993-01-01

    Most reliability analysis techniques and tools assume that a system is used for a mission consisting of a single phase. However, multiple phases are natural in many missions. The failure rates of components, system configuration, and success criteria may vary from phase to phase. In addition, the duration of a phase may be deterministic or random. Recently, several researchers have addressed the problem of reliability analysis of such systems using a variety of methods. A new technique for phased-mission system reliability analysis based on Boolean algebraic methods is described. Our technique is computationally efficient and is applicable to a large class of systems for which the failure criterion in each phase can be expressed as a fault tree (or an equivalent representation). Our technique avoids state space explosion that commonly plague Markov chain-based analysis. A phase algebra to account for the effects of variable configurations and success criteria from phase to phase was developed. Our technique yields exact (as opposed to approximate) results. The use of our technique was demonstrated by means of an example and present numerical results to show the effects of mission phases on the system reliability.

  3. 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.

  4. The linear algebraic method for electron-molecule collisions

    SciTech Connect

    Collins, L.A.; Schneider, B.I.

    1995-09-01

    In order to find numerical solutions to many problems in physics, chemistry and engineering it is necessary to place the equations of motion (classical or quantal) of the variables of dynamical interest on a discrete mesh. The formulation of scattering theory in quantum mechanics is no exception and leads to partial differential or integral equations which may only be solved on digital computers. Typical approaches introduce a numerical grid or basis set expansion of the scattering wavefunction in order to reduce `the problem to the solution of a set of algebraic equations. Often it is more convenient to deal with the scattering matrix or phase amplitude rather than the wavefunction but the essential features of the numerics are unchanged. In this section we will formulate the Linear Algebraic Method (LAM) for electron-atom/molecule scattering for a simple, one-dimensional radial potential. This will illustrate the basic approach and enable the uninitiated reader to follow the subsequent discussion of the general, multi-channel, electron-molecule formulation without undue difficulty. We begin by writing the Schroedinger equation for the s-wave scattering of a structureless particle by a short-range, local potential.

  5. Element Agglomeration Algebraic Multigrid and Upscaling Library

    2015-02-11

    ELAG is a serial C++ library for numerical upscaling of finite element discretizations. It provides optimal complexity algorithms to build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equation (elliptic, hyperbolic, saddle point problems) on general unstructured mesh. Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

  6. Unstructured multigrid through agglomeration

    NASA Technical Reports Server (NTRS)

    Venkatakrishnan, V.; Mavriplis, D. J.; Berger, M. J.

    1993-01-01

    In this work the compressible Euler equations are solved using finite volume techniques on unstructured grids. The spatial discretization employs a central difference approximation augmented by dissipative terms. Temporal discretization is done using a multistage Runge-Kutta scheme. A multigrid technique is used to accelerate convergence to steady state. The coarse grids are derived directly from the given fine grid through agglomeration of the control volumes. This agglomeration is accomplished by using a greedy-type algorithm and is done in such a way that the load, which is proportional to the number of edges, goes down by nearly a factor of 4 when moving from a fine to a coarse grid. The agglomeration algorithm has been implemented and the grids have been tested in a multigrid code. An area-weighted restriction is applied when moving from fine to coarse grids while a trivial injection is used for prolongation. Across a range of geometries and flows, it is shown that the agglomeration multigrid scheme compares very favorably with an unstructured multigrid algorithm that makes use of independent coarse meshes, both in terms of convergence and elapsed times.

  7. 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.

  8. Intertextuality and Sense Production in the Learning of Algebraic Methods

    ERIC Educational Resources Information Center

    Rojano, Teresa; Filloy, Eugenio; Puig, Luis

    2014-01-01

    In studies carried out in the 1980s the algebraic symbols and expressions are revealed through prealgebraic readers as non-independent texts, as texts that relate to other texts that in some cases belong to the reader's native language or to the arithmetic sign system. Such outcomes suggest that the act of reading algebraic texts submerges…

  9. 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.

  10. Soft Error Vulnerability of Iterative Linear Algebra Methods

    SciTech Connect

    Bronevetsky, G; de Supinski, B

    2007-12-15

    Devices become increasingly vulnerable to soft errors as their feature sizes shrink. Previously, soft errors primarily caused problems for space and high-atmospheric computing applications. Modern architectures now use features so small at sufficiently low voltages that soft errors are becoming significant even at terrestrial altitudes. The soft error vulnerability of iterative linear algebra methods, which many scientific applications use, is a critical aspect of the overall application vulnerability. These methods are often considered invulnerable to many soft errors because they converge from an imprecise solution to a precise one. However, we show that iterative methods can be vulnerable to soft errors, with a high rate of silent data corruptions. We quantify this vulnerability, with algorithms generating up to 8.5% erroneous results when subjected to a single bit-flip. Further, we show that detecting soft errors in an iterative method depends on its detailed convergence properties and requires more complex mechanisms than simply checking the residual. Finally, we explore inexpensive techniques to tolerate soft errors in these methods.

  11. An algebra-based method for inferring gene regulatory networks

    PubMed Central

    2014-01-01

    Background The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. Results This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also

  12. 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.

  13. Matrix-dependent multigrid-homogenization for diffusion problems

    SciTech Connect

    Knapek, S.

    1996-12-31

    We present a method to approximately determine the effective diffusion coefficient on the coarse scale level of problems with strongly varying or discontinuous diffusion coefficients. It is based on techniques used also in multigrid, like Dendy`s matrix-dependent prolongations and the construction of coarse grid operators by means of the Galerkin approximation. In numerical experiments, we compare our multigrid-homogenization method with homogenization, renormalization and averaging approaches.

  14. 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.

  15. Multigrid techniques for the numerical solution of the diffusion equation

    NASA Technical Reports Server (NTRS)

    Phillips, R. E.; Schmidt, F. W.

    1984-01-01

    An accurate numerical solution of diffusion problems containing large local gradients can be obtained with a significant reduction in computational time by using a multigrid computational scheme. The spatial domain is covered with sets of uniform square grids of different sizes. The finer grid patterns overlap the coarse grid patterns. The finite-difference expressions for each grid pattern are solved independently by iterative techniques. Two interpolation methods were used to establish the values of the potential function on the fine grid boundaries with information obtained from the coarse grid solution. The accuracy and computational requirements for solving a test problem by a simple multigrid and a multilevel-multigrid method were compared. The multilevel-multigrid method combined with a Taylor series interpolation scheme was found to be best.

  16. 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.

  17. 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.

  18. 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.

  19. Progress with multigrid schemes for hypersonic flow problems

    SciTech Connect

    Radespiel, R.; Swanson, R.C.

    1995-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 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{sup 6} and Mach numbers up to 25. 32 refs., 31 figs., 1 tab.

  20. Non-Traditional Methods of Teaching Abstract Algebra

    ERIC Educational Resources Information Center

    Capaldi, Mindy

    2014-01-01

    This article reports on techniques of teaching abstract algebra which were developed to achieve multiple student objectives: reasoning and communication skills, deep content knowledge, student engagement, independence, and pride. The approach developed included a complementary combination of inquiry-based learning, individual (not group) homework…

  1. Hidden algebra method (quasi-exact-solvability in quantum mechanics)

    SciTech Connect

    Turbiner, Alexander

    1996-02-20

    A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland N-body problems ass ociated with an existence of the hidden algebra slN is discussed extensively.

  2. Algebraic methods for diagonalization of a quaternion matrix in quaternionic quantum theory

    SciTech Connect

    Jiang Tongsong

    2005-05-01

    By means of complex representation and real representation of a quaternion matrix, this paper studies the problem of diagonalization of a quaternion matrix, gives two algebraic methods for diagonalization of quaternion matrices in quaternionic quantum theory.

  3. Formulation of boundary conditions for the multigrid acceleration of the Euler and Navier Stokes equations

    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.

  4. Full Multigrid Flow Solver

    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.

  5. αAMG based on Weighted Matching for Systems of Elliptic PDEs Arising From Displacement and Mixed Methods

    SciTech Connect

    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”. In 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.

  6. Hidden algebra method (quasi-exact-solvability in quantum mechanics)

    SciTech Connect

    Turbiner, A. |

    1996-02-01

    A general introduction to quasi-exactly-solvable problems of quantum mechanics is presented. Main attention is given to multidimensional quasi-exactly-solvable and exactly-solvable Schroedinger operators. Exact-solvability of the Calogero and Sutherland {ital N}-body problems ass ociated with an existence of the hidden algebra {ital sl}{sub {ital N}} is discussed extensively. {copyright} {ital 1996 American Institute of Physics.}

  7. Algebraic filter approach for fast approximation of nonlinear tomographic reconstruction methods

    NASA Astrophysics Data System (ADS)

    Plantagie, Linda; Batenburg, Kees Joost

    2015-01-01

    We present a computational approach for fast approximation of nonlinear tomographic reconstruction methods by filtered backprojection (FBP) methods. Algebraic reconstruction algorithms are the methods of choice in a wide range of tomographic applications, yet they require significant computation time, restricting their usefulness. We build upon recent work on the approximation of linear algebraic reconstruction methods and extend the approach to the approximation of nonlinear reconstruction methods which are common in practice. We demonstrate that if a blueprint image is available that is sufficiently similar to the scanned object, our approach can compute reconstructions that approximate iterative nonlinear methods, yet have the same speed as FBP.

  8. 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.

  9. On the applications of algebraic grid generation methods based on transfinite interpolation

    NASA Technical Reports Server (NTRS)

    Nguyen, Hung Lee

    1989-01-01

    Algebraic grid generation methods based on transfinite interpolation called the two-boundary and four-boundary methods are applied for generating grids with highly complex boundaries. These methods yield grid point distributions that allow for accurate application to regions of sharp gradients in the physical domain or time-dependent problems with small length scale phenomena. Algebraic grids are derived using the two-boundary and four-boundary methods for applications in both two- and three-dimensional domains. Grids are developed for distinctly different geometrical problems and the two-boundary and four-boundary methods are demonstrated to be applicable to a wide class of geometries.

  10. A grid spacing control technique for algebraic grid generation methods

    NASA Technical Reports Server (NTRS)

    Smith, R. E.; Kudlinski, R. A.; Everton, E. L.

    1982-01-01

    A technique which controls the spacing of grid points in algebraically defined coordinate transformations is described. The technique is based on the generation of control functions which map a uniformly distributed computational grid onto parametric variables defining the physical grid. The control functions are smoothed cubic splines. Sets of control points are input for each coordinate directions to outline the control functions. Smoothed cubic spline functions are then generated to approximate the input data. The technique works best in an interactive graphics environment where control inputs and grid displays are nearly instantaneous. The technique is illustrated with the two-boundary grid generation algorithm.

  11. Numerical analyses of elastohydrodynamically lubricated line and point contacts with rough surfaces by using semi-system and multigrid methods (volumes 1 and 2)

    NASA Astrophysics Data System (ADS)

    Ai, Xiaolan

    Surface topography has long been recognized to have a significant influence on lubricated contacts. This thesis deals with the subject of elastohydrodynamic lubricated line and point contacts with rough surfaces (rough EHL contacts). As an introduction to this subject, a brief historical review is provided, followed by the mathematical descriptions of the rough EHL contacts for both Newtonian and non-Newtonian lubricants. On the basis of the merits of presently used numerical algorithms, two numerical methods, the semi-system method and the multigrid method, were adopted for developing fast numerical solvers to simulate the rough EHL contact problems. For line contact geometry, numerical simulations were performed for both steady and transient conditions. The surface irregularities examined range from single transverse bump or groove to random surface roughness. Based on the simulation results, an empirical formula for pressure fluctuations was regressed, and a fast pressure calculation model for EHL contact with arbitrary surface profiles was developed. As an extension to the 2-D surface irregularities, the problems of 3-D surface irregularities in line contact geometry were also examined. Parallel simulations were performed for point contact geometry. The types of surface irregularities studied included single asperity, dent, bump, multiple asperities, waviness, and random surface roughness. The orientation of the surface irregularities varies from transverse to striated to longitudinal. The simulation results reveal the fundamental fact that under heavily loaded conditions the domination of pressure flow yields to the unidirectional shear flow in the EHL conjunction. Lubricant passes though the EHL conjunction at approximately the rolling speed. For sliding contact with moving surface roughness, the rolling speed transport behavior leads to an induced transient image. This transient phenomena will be fully developed under steady-state conditions; and, as a

  12. Multigrid solution of the convection-diffusion equation with high-Reynolds number

    SciTech Connect

    Zhang, Jun

    1996-12-31

    A fourth-order compact finite difference scheme is employed with the multigrid technique to solve the variable coefficient convection-diffusion equation with high-Reynolds number. Scaled inter-grid transfer operators and potential on vectorization and parallelization are discussed. The high-order multigrid method is unconditionally stable and produces solution of 4th-order accuracy. Numerical experiments are included.

  13. Diagonally Implicit Symplectic Runge-Kutta Methods with High Algebraic and Dispersion Order

    PubMed Central

    Cong, Y. H.; Jiang, C. X.

    2014-01-01

    The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented. Numerical experiments with some Hamiltonian oscillatory problems are presented to show the proposed method is as competitive as the existing same type Runge-Kutta methods. PMID:24977178

  14. Diagonally implicit symplectic Runge-Kutta methods with high algebraic and dispersion order.

    PubMed

    Cong, Y H; Jiang, C X

    2014-01-01

    The numerical integration of Hamiltonian systems with oscillating solutions is considered in this paper. A diagonally implicit symplectic nine-stages Runge-Kutta method with algebraic order 6 and dispersion order 8 is presented. Numerical experiments with some Hamiltonian oscillatory problems are presented to show the proposed method is as competitive as the existing same type Runge-Kutta methods. PMID:24977178

  15. Towards Optimal Multigrid Efficiency for the Navier-Stokes Equations

    NASA Technical Reports Server (NTRS)

    Swanson, R. C.

    2001-01-01

    A fast multigrid solver for the steady incompressible Navier-Stokes 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. Numerical solutions are shown for flow over a flat plate and a Karman-Trefftz airfoil. Using collective Gauss-Seidel line relaxation in both the vertical and horizontal directions, multigrid convergence behavior approaching that of O(N) methods is achieved. The computational efficiency of the numerical scheme is compared with that of a Runge-Kutta based multigrid method.

  16. A multigrid fluid pressure solver handling separating solid boundary conditions.

    PubMed

    Chentanez, Nuttapong; Müller-Fischer, Matthias

    2012-08-01

    We present a multigrid method for solving the linear complementarity problem (LCP) resulting from discretizing the Poisson equation subject to separating solid boundary conditions in an Eulerian liquid simulation’s pressure projection step. The method requires only a few small changes to a multigrid solver for linear systems. Our generalized solver is fast enough to handle 3D liquid simulations with separating boundary conditions in practical domain sizes. Previous methods could only handle relatively small 2D domains in reasonable time, because they used expensive quadratic programming (QP) solvers. We demonstrate our technique in several practical scenarios, including nonaxis-aligned containers and moving solids in which the omission of separating boundary conditions results in disturbing artifacts of liquid sticking to solids. Our measurements show, that the convergence rate of our LCP solver is close to that of a standard multigrid solver. PMID:22411885

  17. 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.

  18. Fast Multigrid Techniques in Total Variation-Based Image Reconstruction

    NASA Technical Reports Server (NTRS)

    Oman, Mary Ellen

    1996-01-01

    Existing multigrid techniques are used to effect an efficient method for reconstructing an image from noisy, blurred data. Total Variation minimization yields a nonlinear integro-differential equation which, when discretized using cell-centered finite differences, yields a full matrix equation. A fixed point iteration is applied with the intermediate matrix equations solved via a preconditioned conjugate gradient method which utilizes multi-level quadrature (due to Brandt and Lubrecht) to apply the integral operator and a multigrid scheme (due to Ewing and Shen) to invert the differential operator. With effective preconditioning, the method presented seems to require Omicron(n) operations. Numerical results are given for a two-dimensional example.

  19. Some multigrid algorithms for elliptic problems on data parallel machines

    SciTech Connect

    Bandy, V.A.; Dendy, J.E. Jr.; Spangenberg, W.H.

    1998-01-01

    Previously a semicoarsening multigrid algorithm suitable for use on data parallel architectures was investigated. Through the use of new software tools, the performance of this algorithm has been considerably improved. The method has also been extended to three space dimensions. The method performs well for strongly anisotropic problems and for problems with coefficients jumping by orders of magnitude across internal interfaces. The parallel efficiency of this method is analyzed, and its actual performance on the CM-5 is compared with its performance on the CRAY Y-MP and the Sparc-5. A standard coarsening multigrid algorithm is also considered, and they compare its performance on these three platforms as well.

  20. Black box multigrid solver for definite and indefinite problems

    SciTech Connect

    Shapira, Yair

    1997-02-01

    A two-level analysis method for certain separable problems is introduced. It motivates the definition of improved versions of Black Box Multigrid for diffusion problems with discontinuous coefficients and indefinite Helmholtz equations. For anisotropic problems, it helps in choosing suitable implementations for frequency decomposition multigrid methods. For highly indefinite problems, it provides a way to choose in advance a suitable mesh size for the coarsest grid used. Numerical experiments confirm the analysis and show the advantage of the present methods for several examples.

  1. A diagonally inverted LU implicit multigrid scheme

    NASA Technical Reports Server (NTRS)

    Yokota, Jeffrey W.; Caughey, David A.; Chima, Rodrick V.

    1988-01-01

    A new Diagonally Inverted LU Implicit scheme is developed within the framework of the multigrid method for the 3-D unsteady Euler equations. The matrix systems that are to be inverted in the LU scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations. Unlike the Diagonalized ADI method, the time accuracy of the LU scheme is not reduced since the diagonalization procedure does not destroy time conservation. Even more importantly, this diagonalization significantly reduces the computational effort required to solve the LU approximation and therefore transforms it into a more efficient method of numerically solving the 3-D Euler equations.

  2. Examinations in the Final Year of Transition to Mathematical Methods Computer Algebra System (CAS)

    ERIC Educational Resources Information Center

    Leigh-Lancaster, David; Les, Magdalena; Evans, Michael

    2010-01-01

    2009 was the final year of parallel implementation for Mathematical Methods Units 3 and 4 and Mathematical Methods (CAS) Units 3 and 4. From 2006-2009 there was a common technology-free short answer examination that covered the same function, algebra, calculus and probability content for both studies with corresponding expectations for key…

  3. The Model Method: Singapore Children's Tool for Representing and Solving Algebraic Word Problems

    ERIC Educational Resources Information Center

    Ng, Swee Fong; Lee, Kerry

    2009-01-01

    Solving arithmetic and algebraic word problems is a key component of the Singapore elementary mathematics curriculum. One heuristic taught, the model method, involves drawing a diagram to represent key information in the problem. We describe the model method and a three-phase theoretical framework supporting its use. We conducted 2 studies to…

  4. Using The Algebra Project Method To Regiment Discourse In An Energy Course for Teachers

    NASA Astrophysics Data System (ADS)

    Close, Hunter G.; De Water, Lezlie S.; Close, Eleanor W.; Scherr, Rachel E.; McKagan, Sarah B.

    2010-10-01

    The Algebra Project, led by R. Moses, provides access to understanding of algebra for middle school students and their teachers by guiding them to participate actively and communally in the construction of regimented symbolic systems. We have extended this work by applying it to the professional development of science teachers (K-12) in energy. As we apply the Algebra Project method, the focus of instruction shifts from the learning of specific concepts within the broad theme of energy to the gradual regimentation of the interplay between learners' observation, thinking, graphic representation, and communication. This approach is suitable for teaching energy, which by its transcendence can seem to defy a linear instructional sequence. The learning of specific energy content thus becomes more learner-directed and unpredictable, though at no apparent cost to its extent. Meanwhile, teachers seem empowered by this method to see beginners as legitimate participants in the scientific process.

  5. Multigrid and cyclic reduction applied to the Helmholtz equation

    NASA Technical Reports Server (NTRS)

    Brackenridge, Kenneth

    1993-01-01

    We consider the Helmholtz equation with a discontinuous complex parameter and inhomogeneous Dirichlet boundary conditions in a rectangular domain. A variant of the direct method of cyclic reduction (CR) is employed to facilitate the design of improved multigrid (MG) components, resulting in the method of CR-MG. We demonstrate the improved convergence properties of this method.

  6. 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.

  7. Multigrid and multilevel domain decomposition for unstructured grids

    SciTech Connect

    Chan, T.; Smith, B.

    1994-12-31

    Multigrid has proven itself to be a very versatile method for the iterative solution of linear and nonlinear systems of equations arising from the discretization of PDES. In some applications, however, no natural multilevel structure of grids is available, and these must be generated as part of the solution procedure. In this presentation the authors will consider the problem of generating a multigrid algorithm when only a fine, unstructured grid is given. Their techniques generate a sequence of coarser grids by first forming an approximate maximal independent set of the vertices and then applying a Cavendish type algorithm to form the coarser triangulation. Numerical tests indicate that convergence using this approach can be as fast as standard multigrid on a structured mesh, at least in two dimensions.

  8. Online signal filtering based on the algebraic method and its experimental validation

    NASA Astrophysics Data System (ADS)

    Morales, R.; Segura, E.; Somolinos, J. A.; Núñez, L. R.; Sira-Ramírez, H.

    2016-01-01

    An on-line algebraic filtering scheme, based on the recently introduced algebraic approach to parameter and state estimation, is presented along with successful experimental results. The proposed filtering algorithm is based on the connections between a time derivative estimator and an algebraically based signal filtering option. The main advantages of the proposed approach are: (i) there are no appreciable delays in the filtered signal; (ii) the method does not require any statistical assessment of the noises corrupting the signal; (iii) high attenuation of the noise effects is achieved; (iv) the on-line computations are carried out in real time; and (v) high versatility and ease of implementation. Several experiments related to real depth measurements were conducted to show the effectiveness of the proposed algorithm. Comparisons are performed with different filtering alternatives.

  9. 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.

  10. 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

  11. A 3D agglomeration multigrid solver for the Reynolds-averaged Navier-Stokes equations on unstructured meshes

    NASA Technical Reports Server (NTRS)

    Marvriplis, D. J.; Venkatakrishnan, V.

    1995-01-01

    An agglomeration multigrid strategy is developed and implemented for the solution of three-dimensional steady viscous flows. The method enables convergence acceleration with minimal additional memory overheads, and is completely automated, in that it can deal with grids of arbitrary construction. The multigrid technique is validated by comparing the delivered convergence rates with those obtained by a previously developed overset-mesh multigrid approach, and by demonstrating grid independent convergence rates for aerodynamic problems on very large grids. Prospects for further increases in multigrid efficiency for high-Reynolds number viscous flows on highly stretched meshes are discussed.

  12. A multigrid preconditioner for the semiconductor equations

    SciTech Connect

    Meza, J.C.; Tuminaro, R.S.

    1994-12-31

    Currently, integrated circuits are primarily designed in a {open_quote}trial and error{close_quote} fashion. That is, prototypes are built and improved via experimentation and testing. In the near future, however, it may be possible to significantly reduce the time and cost of designing new devices by using computer simulations. To accurately perform these complex simulations in three dimensions, however, new algorithms and high performance computers are necessary. In this paper the authors discuss the use of multigrid preconditioning inside a semiconductor device modeling code, DANCIR. The DANCIR code is a full three-dimensional simulator capable of computing steady-state solutions of the drift-diffusion equations for a single semiconductor device and has been used to simulate a wide variety of different devices. At the inner core of DANCIR is a solver for the nonlinear equations that arise from the spatial discretization of the drift-diffusion equations on a rectangular grid. These nonlinear equations are resolved using Gummel`s method which requires three symmetric linear systems to be solved within each Gummel iteration. It is the resolution of these linear systems which comprises the dominant computational cost of this code. The original version of DANCIR uses a Cholesky preconditioned conjugate gradient algorithm to solve these linear systems. Unfortunately, this algorithm has a number of disadvantages: (1) it takes many iterations to converge (if it converges), (2) it can require a significant amount of computing time, and (3) it is not very parallelizable. To improve the situation, the authors consider a multigrid preconditioner. The multigrid method uses iterations on a hierarchy of grids to accelerate the convergence on the finest grid.

  13. 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.

  14. Leapfrog variants of iterative methods for linear algebra equations

    NASA Technical Reports Server (NTRS)

    Saylor, Paul E.

    1988-01-01

    Two iterative methods are considered, Richardson's method and a general second order method. For both methods, a variant of the method is derived for which only even numbered iterates are computed. The variant is called a leapfrog method. Comparisons between the conventional form of the methods and the leapfrog form are made under the assumption that the number of unknowns is large. In the case of Richardson's method, it is possible to express the final iterate in terms of only the initial approximation, a variant of the iteration called the grand-leap method. In the case of the grand-leap variant, a set of parameters is required. An algorithm is presented to compute these parameters that is related to algorithms to compute the weights and abscissas for Gaussian quadrature. General algorithms to implement the leapfrog and grand-leap methods are presented. Algorithms for the important special case of the Chebyshev method are also given.

  15. Algebraic Singularity Method for Mass Measurements with Missing Energy

    SciTech Connect

    Kim, Ian-Woo

    2010-02-26

    We propose a novel generalized method for mass measurements based on phase space singularity structures that can be applied to any event topology with missing energy. Our method subsumes the well-known end point and transverse mass methods and yields new techniques for studying 'missing particle' events, such as the double chain production of stable neutral particles at the LHC.

  16. Parallelization of an Adaptive Multigrid Algorithm for Fast Solution of Finite Element Structural Problems

    SciTech Connect

    Crane, N K; Parsons, I D; Hjelmstad, K D

    2002-03-21

    Adaptive mesh refinement selectively subdivides the elements of a coarse user supplied mesh to produce a fine mesh with reduced discretization error. Effective use of adaptive mesh refinement coupled with an a posteriori error estimator can produce a mesh that solves a problem to a given discretization error using far fewer elements than uniform refinement. A geometric multigrid solver uses increasingly finer discretizations of the same geometry to produce a very fast and numerically scalable solution to a set of linear equations. Adaptive mesh refinement is a natural method for creating the different meshes required by the multigrid solver. This paper describes the implementation of a scalable adaptive multigrid method on a distributed memory parallel computer. Results are presented that demonstrate the parallel performance of the methodology by solving a linear elastic rocket fuel deformation problem on an SGI Origin 3000. Two challenges must be met when implementing adaptive multigrid algorithms on massively parallel computing platforms. First, although the fine mesh for which the solution is desired may be large and scaled to the number of processors, the multigrid algorithm must also operate on much smaller fixed-size data sets on the coarse levels. Second, the mesh must be repartitioned as it is adapted to maintain good load balancing. In an adaptive multigrid algorithm, separate mesh levels may require separate partitioning, further complicating the load balance problem. This paper shows that, when the proper optimizations are made, parallel adaptive multigrid algorithms perform well on machines with several hundreds of processors.

  17. Comparison of Two Algebraic Methods for Curve/curve Intersection

    NASA Technical Reports Server (NTRS)

    Demontaudouin, Y.; Tiller, W.

    1985-01-01

    Most geometric modeling systems use either polynomial or rational functions to represent geometry. In such systems most computational problems can be formulated as systems of polynomials in one or more variables. Classical elimination theory can be used to solve such systems. Here Cayley's method of elimination is summarized and it is shown how it can best be used to solve the curve/curve intersection problem. Cayley's method was found to be a more straightforward approach. Furthermore, it is computationally simpler, since the elements of the Cayley matrix are one variable instead of two variable polynomials. Researchers implemented and tested both methods and found Cayley's to be more efficient. Six pairs of curves, representing mixtures of lines, circles, and cubic arcs were used. Several examples had multiple intersection points. For all six cases Cayley's required less CPU time than the other method. The average time ratio of method 1 to method 2 was 3.13:1, the least difference was 2.33:1, and the most dramatic was 6.25:1. Both of the above methods can be extended to solve the surface/surface intersection problem.

  18. On the parallel efficiency of the Frederickson-McBryan multigrid

    NASA Technical Reports Server (NTRS)

    Decker, Naomi H.

    1990-01-01

    To take full advantage of the parallelism in a standard multigrid algorithm requires as many processors as points. However, since coarse grids contain fewer points, most processors are idle during the coarse grid iterations. Frederickson and McBryan claim that retaining all points on all grid levels (using all processors) can lead to a superconvergent algorithm. The purpose of this work is to show that the parellel superconvergent multigrid (PSMG) algorithm of Frederickson and McBryan, though it achieves perfect processor utilization, is no more efficient than a parallel implementation of standard multigrid methods. PSMG is simply a new and perhaps simpler way of achieving the same results.

  19. A Hexahedral Multigrid Approach for Simulating Cuts in Deformable Objects.

    PubMed

    Dick, C; Georgii, J; Westermann, R

    2011-11-01

    We present a hexahedral finite element method for simulating cuts in deformable bodies using the corotational formulation of strain at high computational efficiency. Key to our approach is a novel embedding of adaptive element refinements and topological changes of the simulation grid into a geometric multigrid solver. Starting with a coarse hexahedral simulation grid, this grid is adaptively refined at the surface of a cutting tool until a finest resolution level, and the cut is modeled by separating elements along the cell faces at this level. To represent the induced discontinuities on successive multigrid levels, the affected coarse grid cells are duplicated and the resulting connectivity components are distributed to either side of the cut. Drawing upon recent work on octree and multigrid schemes for the numerical solution of partial differential equations, we develop efficient algorithms for updating the systems of equations of the adaptive finite element discretization and the multigrid hierarchy. To construct a surface that accurately aligns with the cuts, we adapt the splitting cubes algorithm to the specific linked voxel representation of the simulation domain we use. The paper is completed by a convergence analysis of the finite element solver and a performance comparison to alternative numerical solution methods. These investigations show that our approach offers high computational efficiency and physical accuracy, and that it enables cutting of deformable bodies at very high resolutions. PMID:21173453

  20. An algebraic topological method for multimodal brain networks comparisons

    PubMed Central

    Simas, Tiago; Chavez, Mario; Rodriguez, Pablo R.; Diaz-Guilera, Albert

    2015-01-01

    Understanding brain connectivity is one of the most important issues in neuroscience. Nonetheless, connectivity data can reflect either functional relationships of brain activities or anatomical connections between brain areas. Although both representations should be related, this relationship is not straightforward. We have devised a powerful method that allows different operations between networks that share the same set of nodes, by embedding them in a common metric space, enforcing transitivity to the graph topology. Here, we apply this method to construct an aggregated network from a set of functional graphs, each one from a different subject. Once this aggregated functional network is constructed, we use again our method to compare it with the structural connectivity to identify particular brain regions that differ in both modalities (anatomical and functional). Remarkably, these brain regions include functional areas that form part of the classical resting state networks. We conclude that our method -based on the comparison of the aggregated functional network- reveals some emerging features that could not be observed when the comparison is performed with the classical averaged functional network. PMID:26217258

  1. Emergy Algebra: Improving Matrix Methods for Calculating Tranformities

    EPA Science Inventory

    Transformity is one of the core concepts in Energy Systems Theory and it is fundamental to the calculation of emergy. Accurate evaluation of transformities and other emergy per unit values is essential for the broad acceptance, application and further development of emergy method...

  2. 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.

  3. Operator induced multigrid algorithms using semirefinement

    NASA Technical Reports Server (NTRS)

    Decker, Naomi Henderson; Van Rosendale, 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.

  4. 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.

  5. The multigrid algorithm applied to a degenerate equation: A convergence analysis

    NASA Astrophysics Data System (ADS)

    Almendral Vázquez, Ariel; Fredrik Nielsen, Bjørn

    2009-03-01

    In this paper we analyze the convergence properties of the Multigrid Method applied to the Black-Scholes differential equation arising in mathematical finance. We prove, for the discretized single-asset Black-Scholes equation, that the multigrid V-cycle possesses optimal convergence properties. Furthermore, through a series of numerical experiments we test the performance of the method for single-asset option problems. Throughout the paper we focus on models of European options.

  6. 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).

  7. Uniform convergence of multigrid v-cycle iterations for indefinite and nonsymmetric problems

    SciTech Connect

    Bramble, J.H. . Dept. of Mathematics); Kwak, D.Y. . Dept. of Mathematics); Pasciak, J.E. . Dept. of Applied Science)

    1994-12-01

    In this paper, an analysis of a multigrid method for nonsymmetric and/or indefinite elliptic problems is presented. In this multigrid method various types of smothers may be used. One type of smoother considered is defined in terms of an associated symmetric problem and includes point and line, Jacobi, and Gauss-Seidel iterations. Smothers based entirely on the original operator are also considered. One smoother is based on the normal form, that is, the product of the operator and its transpose. Other smothers studied include point and line, Jacobi, and Gauss-Seidel. It is shown 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 dependent on the number of multigrid levels).

  8. Multigrid algorithms for tensor network states.

    PubMed

    Dolfi, Michele; Bauer, Bela; Troyer, Matthias; Ristivojevic, Zoran

    2012-07-13

    The widely used density matrix renormalization group (DRMG) method often fails to converge in systems with multiple length scales, such as lattice discretizations of continuum models and dilute or weakly doped lattice models. The local optimization employed by DMRG to optimize the wave function is ineffective in updating large-scale features. Here we present a multigrid algorithm that solves these convergence problems by optimizing the wave function at different spatial resolutions. We demonstrate its effectiveness by simulating bosons in continuous space and study nonadiabaticity when ramping up the amplitude of an optical lattice. The algorithm can be generalized to tensor network methods and combined with the contractor renormalization group method to study dilute and weakly doped lattice models. PMID:23030148

  9. Adaptive Multigrid Solution of Stokes' Equation on CELL Processor

    NASA Astrophysics Data System (ADS)

    Elgersma, M. R.; Yuen, D. A.; Pratt, S. G.

    2006-12-01

    We are developing an adaptive multigrid solver for treating nonlinear elliptic partial-differential equations, needed for mantle convection problems. Since multigrid is being used for the complete solution, not just as a preconditioner, spatial difference operators are kept nearly diagonally dominant by increasing density of the coarsest grid in regions where coefficients have rapid spatial variation. At each time step, the unstructured coarse grid is refined in regions where coefficients associated with the differential operators or boundary conditions have rapid spatial variation, and coarsened in regions where there is more gradual spatial variation. For three-dimensional problems, the boundary is two-dimensional, and regions where coefficients change rapidly are often near two-dimensional surfaces, so the coarsest grid is only fine near two-dimensional subsets of the three-dimensional space. Coarse grid density drops off exponentially with distance from boundary surfaces and rapid-coefficient-change surfaces. This unstructured coarse grid results in the number of coarse grid voxels growing proportional to surface area, rather than proportional to volume. This results in significant computational savings for the coarse-grid solution. This coarse-grid solution is then refined for the fine-grid solution, and multigrid methods have memory usage and runtime proportional to the number of fine-grid voxels. This adaptive multigrid algorithm is being implemented on the CELL processor, where each chip has eight floating point processors and each processor operates on four floating point numbers each clock cycle. Both the adaptive grid algorithm and the multigrid solver have very efficient parallel implementations, in order to take advantage of the CELL processor architecture.

  10. Construction of invariants of the coadjoint representation of Lie groups using linear algebra methods

    NASA Astrophysics Data System (ADS)

    Kurnyavko, O. L.; Shirokov, I. V.

    2016-07-01

    We offer a method for constructing invariants of the coadjoint representation of Lie groups that reduces this problem to known problems of linear algebra. This method is based on passing to symplectic coordinates on the coadjoint representation orbits, which play the role of local coordinates on those orbits. The corresponding transition functions are their parametric equations. Eliminating the symplectic coordinates from the transition functions, we can obtain the complete set of invariants. The proposed method allows solving the problem of constructing invariants of the coadjoint representation for Lie groups with an arbitrary dimension and structure.

  11. Improved Linear Algebra Methods for Redshift Computation from Limited Spectrum Data - II

    NASA Technical Reports Server (NTRS)

    Foster, Leslie; Waagen, Alex; Aijaz, Nabella; Hurley, Michael; Luis, Apolo; Rinsky, Joel; Satyavolu, Chandrika; Gazis, Paul; Srivastava, Ashok; Way, Michael

    2008-01-01

    Given photometric broadband measurements of a galaxy, Gaussian processes may be used with a training set to solve the regression problem of approximating the redshift of this galaxy. However, in practice solving the traditional Gaussian processes equation is too slow and requires too much memory. We employed several methods to avoid this difficulty using algebraic manipulation and low-rank approximation, and were able to quickly approximate the redshifts in our testing data within 17 percent of the known true values using limited computational resources. The accuracy of one method, the V Formulation, is comparable to the accuracy of the best methods currently used for this problem.

  12. An algebraic sub-structuring method for large-scale eigenvaluecalculation

    SciTech Connect

    Yang, C.; Gao, W.; Bai, Z.; Li, X.; Lee, L.; Husbands, P.; Ng, E.

    2004-05-26

    We examine sub-structuring methods for solving large-scalegeneralized eigenvalue problems from a purely algebraic point of view. Weuse the term "algebraic sub-structuring" to refer to the process ofapplying matrix reordering and partitioning algorithms to divide a largesparse matrix into smaller submatrices from which a subset of spectralcomponents are extracted and combined to provide approximate solutions tothe original problem. We are interested in the question of which spectralcomponentsone should extract from each sub-structure in order to producean approximate solution to the original problem with a desired level ofaccuracy. Error estimate for the approximation to the small esteigen pairis developed. The estimate leads to a simple heuristic for choosingspectral components (modes) from each sub-structure. The effectiveness ofsuch a heuristic is demonstrated with numerical examples. We show thatalgebraic sub-structuring can be effectively used to solve a generalizedeigenvalue problem arising from the simulation of an acceleratorstructure. One interesting characteristic of this application is that thestiffness matrix produced by a hierarchical vector finite elements schemecontains a null space of large dimension. We present an efficient schemeto deflate this null space in the algebraic sub-structuringprocess.

  13. Scale-adaptive tensor algebra for local many-body methods of electronic structure theory

    SciTech Connect

    Liakh, Dmitry I

    2014-01-01

    While the formalism of multiresolution analysis (MRA), based on wavelets and adaptive integral representations of operators, is actively progressing in electronic structure theory (mostly on the independent-particle level and, recently, second-order perturbation theory), the concepts of multiresolution and adaptivity can also be utilized within the traditional formulation of correlated (many-particle) theory which is based on second quantization and the corresponding (generally nonorthogonal) tensor algebra. In this paper, we present a formalism called scale-adaptive tensor algebra (SATA) which exploits an adaptive representation of tensors of many-body operators via the local adjustment of the basis set quality. Given a series of locally supported fragment bases of a progressively lower quality, we formulate the explicit rules for tensor algebra operations dealing with adaptively resolved tensor operands. The formalism suggested is expected to enhance the applicability and reliability of local correlated many-body methods of electronic structure theory, especially those directly based on atomic orbitals (or any other localized basis functions).

  14. Grade 11 Students' Interconnected Use of Conceptual Knowledge, Procedural Skills, and Strategic Competence in Algebra: A Mixed Method Study of Error Analysis

    ERIC Educational Resources Information Center

    Egodawatte, Gunawardena; Stoilescu, Dorian

    2015-01-01

    The purpose of this mixed-method study was to investigate grade 11 university/college stream mathematics students' difficulties in applying conceptual knowledge, procedural skills, strategic competence, and algebraic thinking in solving routine (instructional) algebraic problems. A standardized algebra test was administered to thirty randomly…

  15. Parabolic orbit determination. Comparison of the Olbers method and algebraic equations

    NASA Astrophysics Data System (ADS)

    Kuznetsov, V. B.

    2016-05-01

    In this paper, the Olbers method for the preliminary parabolic orbit determination (in the Lagrange-Subbotin modification) and the method based on systems of algebraic equations for two or three variables proposed by the author are compared. The maximum number of possible solutions is estimated. The problem of selection of the true solution from the set of solutions obtained both using additional equations and by the problem reduction to finding the objective function minimum is considered. The results of orbit determination of the comets 153P/Ikeya-Zhang and 2007 N3 Lulin are cited as examples.

  16. Differential algebraic methods for space charge modeling and applications to the University of Maryland Electron Ring

    NASA Astrophysics Data System (ADS)

    Nissen, Edward W.

    2011-12-01

    The future of particle accelerators is moving towards the intensity frontier; the need to place more particles into a smaller space is a common requirement of nearly all applications of particle accelerators. Putting large numbers of particles in a small space means that the mutual repulsion of these charged particles becomes a significant factor, this effect is called space charge. In this work we develop a series of differential algebra based methods to simulate the effects of space charge in particle accelerators. These methods were used to model the University of Maryland Electron Ring, a small 3.8 meter diameter 10 KeV electron storage ring designed to observe the effects of space charge in a safe, cost effective manner. The methods developed here are designed to not only simulate the effects of space charge on the motions of the test particles in the system but to add their effects to the transfer map of the system. Once they have been added useful information about the beam, such as tune shifts and chromaticities, can be extracted directly from the map. In order to make the simulation self consistent, the statistical moments of the distribution are used to create a self consistent Taylor series representing the distribution function, which is combined with pre-stored integrals solved using a Duffy transformation to find the potential. This method can not only find the map of the system, but also advance the particles under most conditions. For conditions where it cannot be used to accurately advance the particles a differential algebra based fast multipole method is implemented. By using differential algebras to create local expansions, noticeable time savings are found.

  17. An algebraic homotopy method for generating quasi-three-dimensional grids for high-speed configurations

    NASA Technical Reports Server (NTRS)

    Moitra, Anutosh

    1989-01-01

    A fast and versatile procedure for algebraically generating boundary conforming computational grids for use with finite-volume Euler flow solvers is presented. A semi-analytic homotopic procedure is used to generate the grids. Grids generated in two-dimensional planes are stacked to produce quasi-three-dimensional grid systems. The body surface and outer boundary are described in terms of surface parameters. An interpolation scheme is used to blend between the body surface and the outer boundary in order to determine the field points. The method, albeit developed for analytically generated body geometries is equally applicable to other classes of geometries. The method can be used for both internal and external flow configurations, the only constraint being that the body geometries be specified in two-dimensional cross-sections stationed along the longitudinal axis of the configuration. Techniques for controlling various grid parameters, e.g., clustering and orthogonality are described. Techniques for treating problems arising in algebraic grid generation for geometries with sharp corners are addressed. A set of representative grid systems generated by this method is included. Results of flow computations using these grids are presented for validation of the effectiveness of the method.

  18. An adaptive multigrid model for hurricane track prediction

    NASA Technical Reports Server (NTRS)

    Fulton, Scott R.

    1993-01-01

    This paper describes a simple numerical model for hurricane track prediction which uses a multigrid method to adapt the model resolution as the vortex moves. The model is based on the modified barotropic vorticity equation, discretized in space by conservative finite differences and in time by a Runge-Kutta scheme. A multigrid method is used to solve an elliptic problem for the streamfunction at each time step. Nonuniform resolution is obtained by superimposing uniform grids of different spatial extent; these grids move with the vortex as it moves. Preliminary numerical results indicate that the local mesh refinement allows accurate prediction of the hurricane track with substantially less computer time than required on a single uniform grid.

  19. Multi-grid calculation of transonic potential flows

    NASA Technical Reports Server (NTRS)

    Caughey, D. A.; Shmilovich, A.

    1985-01-01

    The finite-volume method discussed by Jameson and Caughey (1977), and Caughey and Jameson (1979, 1980) has made it possible to calculate the transonic potential flow past any configuration for which a suitable boundary-conforming coordinate grid can be constructed. However, computations for practical three-dimensional problems have remained quite expensive in terms of the required computer time. The reason for this is primarily related to the large number of grid cells necessary for adequate resolution in these complex three-dimensional problems, taking into account the large number of iterations required to achieve even modest convergence on these fine grids. The present chapter provides a description of work directed at removing this latter difficulty by making use of the multigrid method. Attention is given to finite-volume formulation, multigrid iteration, geometrical aspects, and computed results.

  20. 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 remove 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 viscous flow over a blunt biconic.

  1. Teaching Algebra without Algebra

    ERIC Educational Resources Information Center

    Kalman, Richard S.

    2008-01-01

    Algebra is, among other things, a shorthand way to express quantitative reasoning. This article illustrates ways for the classroom teacher to convert algebraic solutions to verbal problems into conversational solutions that can be understood by students in the lower grades. Three reasonably typical verbal problems that either appeared as or…

  2. A novel technique to solve nonlinear higher-index Hessenberg differential-algebraic equations by Adomian decomposition method.

    PubMed

    Benhammouda, Brahim

    2016-01-01

    Since 1980, the Adomian decomposition method (ADM) has been extensively used as a simple powerful tool that applies directly to solve different kinds of nonlinear equations including functional, differential, integro-differential and algebraic equations. However, for differential-algebraic equations (DAEs) the ADM is applied only in four earlier works. There, the DAEs are first pre-processed by some transformations like index reductions before applying the ADM. The drawback of such transformations is that they can involve complex algorithms, can be computationally expensive and may lead to non-physical solutions. The purpose of this paper is to propose a novel technique that applies the ADM directly to solve a class of nonlinear higher-index Hessenberg DAEs systems efficiently. The main advantage of this technique is that; firstly it avoids complex transformations like index reductions and leads to a simple general algorithm. Secondly, it reduces the computational work by solving only linear algebraic systems with a constant coefficient matrix at each iteration, except for the first iteration where the algebraic system is nonlinear (if the DAE is nonlinear with respect to the algebraic variable). To demonstrate the effectiveness of the proposed technique, we apply it to a nonlinear index-three Hessenberg DAEs system with nonlinear algebraic constraints. This technique is straightforward and can be programmed in Maple or Mathematica to simulate real application problems. PMID:27330880

  3. A study of the bending motion in tetratomic molecules by the algebraic operator expansion method.

    PubMed

    Larese, Danielle; Caprio, Mark A; Pérez-Bernal, Francisco; Iachello, Francesco

    2014-01-01

    We study the bending motion in the tetratomic molecules C2H2 (X̃ (1)Σg (+)), C2H2 (Ã (1)Au) trans-S1, C2H2 (Ã (1)A2) cis-S1, and X̃ (1)A1 H2CO. We show that the algebraic operator expansion method with only linear terms comprised of the basic operators is able to describe the main features of the level energies in these molecules in terms of two (linear) or three (trans-bent, cis-bent, and branched) parameters. By including quadratic terms, the rms deviation in comparison with experiment goes down to typically ∼10 cm(-1) over the entire range of energy 0-6000 cm(-1). We determine the parameters by fitting the available data, and from these parameters we construct the algebraic potential functions. Our results are of particular interest in high-energy regions where spectra are very congested and conventional methods, force-field expansions or Dunham-expansions plus perturbations, are difficult to apply. PMID:24410226

  4. 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.

  5. A new mathematical evaluation of smoking problem based of algebraic statistical method.

    PubMed

    Mohammed, Maysaa J; Rakhimov, Isamiddin S; Shitan, Mahendran; Ibrahim, Rabha W; Mohammed, Nadia F

    2016-01-01

    Smoking problem is considered as one of the hot topics for many years. In spite of overpowering facts about the dangers, smoking is still a bad habit widely spread and socially accepted. Many people start smoking during their gymnasium period. The discovery of the dangers of smoking gave a warning sign of danger for individuals. There are different statistical methods used to analyze the dangers of smoking. In this study, we apply an algebraic statistical method to analyze and classify real data using Markov basis for the independent model on the contingency table. Results show that the Markov basis based classification is able to distinguish different date elements. Moreover, we check our proposed method via information theory by utilizing the Shannon formula to illustrate which one of these alternative tables is the best in term of independent. PMID:26858555

  6. Parallel Element Agglomeration Algebraic Multigrid and Upscaling Library

    2015-02-19

    ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro 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 mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.

  7. 3DRISM Multigrid Algorithm for Fast Solvation Free Energy Calculations.

    PubMed

    Sergiievskyi, Volodymyr P; Fedorov, Maxim V

    2012-06-12

    In this paper we present a fast and accurate method for modeling solvation properties of organic molecules in water with a main focus on predicting solvation (hydration) free energies of small organic compounds. The method is based on a combination of (i) a molecular theory, three-dimensional reference interaction sites model (3DRISM); (ii) a fast multigrid algorithm for solving the high-dimensional 3DRISM integral equations; and (iii) a recently introduced universal correction (UC) for the 3DRISM solvation free energies by properly scaled molecular partial volume (3DRISM-UC, Palmer et al., J. Phys.: Condens. Matter2010, 22, 492101). A fast multigrid algorithm is the core of the method because it helps to reduce the high computational costs associated with solving the 3DRISM equations. To facilitate future applications of the method, we performed benchmarking of the algorithm on a set of several model solutes in order to find optimal grid parameters and to test the performance and accuracy of the algorithm. We have shown that the proposed new multigrid algorithm is on average 24 times faster than the simple Picard method and at least 3.5 times faster than the MDIIS method which is currently actively used by the 3DRISM community (e.g., the MDIIS method has been recently implemented in a new 3DRISM implicit solvent routine in the recent release of the AmberTools 1.4 molecular modeling package (Luchko et al. J. Chem. Theory Comput. 2010, 6, 607-624). Then we have benchmarked the multigrid algorithm with chosen optimal parameters on a set of 99 organic compounds. We show that average computational time required for one 3DRISM calculation is 3.5 min per a small organic molecule (10-20 atoms) on a standard personal computer. We also benchmarked predicted solvation free energy values for all of the compounds in the set against the corresponding experimental data. We show that by using the proposed multigrid algorithm and the 3DRISM-UC model, it is possible to obtain good

  8. An Algebraic Method for Exploring Quantum Monodromy and Quantum Phase Transitions in Non-Rigid Molecules

    NASA Astrophysics Data System (ADS)

    Larese, D.; Iachello, F.

    2011-06-01

    A simple algebraic Hamiltonian has been used to explore the vibrational and rotational spectra of the skeletal bending modes of HCNO, BrCNO, NCNCS, and other ``floppy`` (quasi-linear or quasi-bent) molecules. These molecules have large-amplitude, low-energy bending modes and champagne-bottle potential surfaces, making them good candidates for observing quantum phase transitions (QPT). We describe the geometric phase transitions from bent to linear in these and other non-rigid molecules, quantitatively analysing the spectroscopy signatures of ground state QPT, excited state QPT, and quantum monodromy.The algebraic framework is ideal for this work because of its small calculational effort yet robust results. Although these methods have historically found success with tri- and four-atomic molecules, we now address five-atomic and simple branched molecules such as CH_3NCO and GeH_3NCO. Extraction of potential functions is completed for several molecules, resulting in predictions of barriers to linearity and equilibrium bond angles.

  9. Analytical potential curves of some hydride molecules using algebraic and energy-consistent method

    NASA Astrophysics Data System (ADS)

    Fan, Qunchao; Sun, Weiguo; Feng, Hao; Zhang, Yi; Wang, Qi

    2014-01-01

    Based on the algebraic method (AM) and the energy consistent method (ECM), an AM-ECM protocol for analytical potential energy curves of stable diatomic electronic states is proposed as functions of the internuclear distance. Applications of the AM-ECM to the 6 hydride electronic states of HF-X1Σ+, DF-X1Σ+, D35Cl-X1Σ+, 6LiH-X1Σ+, 7LiH-X1Σ+, and 7LiD-X1Σ+ show that the AM-ECM potentials are in excellent agreement with the experimental RKR data and the full AM-RKR data, and that the AM-ECM can obtain reliable analytical potential energies in the molecular asymptotic and dissociation region for these molecular electronic states.

  10. Multigrid solution of incompressible turbulent flows by using two-equation turbulence models

    SciTech Connect

    Zheng, X.; Liu, C.; Sung, C.H.

    1996-12-31

    Most of practical flows are turbulent. From the interest of engineering applications, simulation of realistic flows is usually done through solution of Reynolds-averaged Navier-Stokes equations and turbulence model equations. It has been widely accepted that turbulence modeling plays a very important role in numerical simulation of practical flow problem, particularly when the accuracy is of great concern. Among the most used turbulence models today, two-equation models appear to be favored for the reason that they are more general than algebraic models and affordable with current available computer resources. However, investigators using two-equation models seem to have been more concerned with the solution of N-S equations. Less attention is paid to the solution method for the turbulence model equations. In most cases, the turbulence model equations are loosely coupled with N-S equations, multigrid acceleration is only applied to the solution of N-S equations due to perhaps the fact the turbulence model equations are source-term dominant and very stiff in sublayer region.

  11. Interactive multigrid refinement for deformable image registration.

    PubMed

    Zhou, Wu; Xie, Yaoqin

    2013-01-01

    Deformable image registration is the spatial mapping of corresponding locations between images and can be used for important applications in radiotherapy. Although numerous methods have attempted to register deformable medical images automatically, such as salient-feature-based registration (SFBR), free-form deformation (FFD), and demons, no automatic method for registration is perfect, and no generic automatic algorithm has shown to work properly for clinical applications due to the fact that the deformation field is often complex and cannot be estimated well by current automatic deformable registration methods. This paper focuses on how to revise registration results interactively for deformable image registration. We can manually revise the transformed image locally in a hierarchical multigrid manner to make the transformed image register well with the reference image. The proposed method is based on multilevel B-spline to interactively revise the deformable transformation in the overlapping region between the reference image and the transformed image. The resulting deformation controls the shape of the transformed image and produces a nice registration or improves the registration results of other registration methods. Experimental results in clinical medical images for adaptive radiotherapy demonstrated the effectiveness of the proposed method. PMID:24232828

  12. Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees' Cognitive Skills in Algebra on the SAT

    ERIC Educational Resources Information Center

    Gierl, Mark J.; Wang, Changjiang; Zhou, Jiawen

    2008-01-01

    The purpose of this study is to apply the attribute hierarchy method (AHM) to a sample of SAT algebra items administered in March 2005. The AHM is a psychometric method for classifying examinees' test item responses into a set of structured attribute patterns associated with different components from a cognitive model of task performance. An…

  13. Algebraic dynamic multilevel (ADM) method for fully implicit simulations of multiphase flow in porous media

    NASA Astrophysics Data System (ADS)

    Cusini, Matteo; van Kruijsdijk, Cor; Hajibeygi, Hadi

    2016-06-01

    This paper presents the development of an algebraic dynamic multilevel method (ADM) for fully implicit simulations of multiphase flow in homogeneous and heterogeneous porous media. Built on the fine-scale fully implicit (FIM) discrete system, ADM constructs a multilevel FIM system describing the coupled process on a dynamically defined grid of hierarchical nested topology. The multilevel adaptive resolution is determined at each time step on the basis of an error criterion. Once the grid resolution is established, ADM employs sequences of restriction and prolongation operators in order to map the FIM system across the considered resolutions. Several choices can be considered for prolongation (interpolation) operators, e.g., constant, bilinear and multiscale basis functions, all of which form partition of unity. The adaptive multilevel restriction operators, on the other hand, are constructed using a finite-volume scheme. This ensures mass conservation of the ADM solutions, and as such, the stability and accuracy of the simulations with multiphase transport. For several homogeneous and heterogeneous test cases, it is shown that ADM applies only a small fraction of the full FIM fine-scale grid cells in order to provide accurate solutions. The sensitivity of the solutions with respect to the employed fraction of grid cells (determined automatically based on the threshold value of the error criterion) is investigated for all test cases. ADM is a significant step forward in the application of dynamic local grid refinement methods, in the sense that it is algebraic, allows for systematic mapping across different scales, and applicable to heterogeneous test cases without any upscaling of fine-scale high resolution quantities. It also develops a novel multilevel multiscale method for FIM multiphase flow simulations in natural subsurface formations.

  14. Non-Commutative Methods for the K-Theory of C*-Algebras of Aperiodic Patterns from Cut-and-Project Systems

    NASA Astrophysics Data System (ADS)

    Putnam, Ian F.

    2010-03-01

    We investigate the C*-algebras associated to aperiodic structures called model sets obtained by the cut-and-project method. These C*-algebras are Morita equivalent to crossed product C*-algebras obtained from dynamics on a disconnected version of the internal space. This construction may be made from more general data, which we call a hyperplane system. From a hyperplane system, others may be constructed by a process of reduction and we show how the C*-algebras involved are related to each other. In particular, there are natural elements in the Kasparov KK-groups for the C*-algebra of a hyperplane system and that of its reduction. The induced map on K-theory fits in a six-term exact sequence. This provides a new method of the computation of the K-theory of such C*-algebras which is done completely in the setting of non-commutative geometry.

  15. A parallel multigrid-based preconditioner for the 3D heterogeneous high-frequency Helmholtz equation

    SciTech Connect

    Riyanti, C.D. . E-mail: C.D.Riyanti@tudelft.nl; Kononov, A.; Erlangga, Y.A.; Vuik, C.; Oosterlee, C.W.; Plessix, R.-E.; Mulder, W.A.

    2007-05-20

    We investigate the parallel performance of an iterative solver for 3D heterogeneous Helmholtz problems related to applications in seismic wave propagation. For large 3D problems, the computation is no longer feasible on a single processor, and the memory requirements increase rapidly. Therefore, parallelization of the solver is needed. We employ a complex shifted-Laplace preconditioner combined with the Bi-CGSTAB iterative method and use a multigrid method to approximate the inverse of the resulting preconditioning operator. A 3D multigrid method with 2D semi-coarsening is employed. We show numerical results for large problems arising in geophysical applications.

  16. Algebraic reconstruction combined with the signal space separation method for the inverse magnetoencephalography problem with a dipole-quadrupole source

    NASA Astrophysics Data System (ADS)

    Nara, T.; Koiwa, K.; Takagi, S.; Oyama, D.; Uehara, G.

    2014-05-01

    This paper presents an algebraic reconstruction method for dipole-quadrupole sources using magnetoencephalography data. Compared to the conventional methods with the equivalent current dipoles source model, our method can more accurately reconstruct two close, oppositely directed sources. Numerical simulations show that two sources on both sides of the longitudinal fissure of cerebrum are stably estimated. The method is verified using a quadrupolar source phantom, which is composed of two isosceles-triangle-coils with parallel bases.

  17. 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.

  18. Implementation and Optimization of miniGMG - a Compact Geometric Multigrid Benchmark

    SciTech Connect

    Williams, Samuel; Kalamkar, Dhiraj; Singh, Amik; Deshpande, Anand M.; Straalen, Brian Van; Smelyanskiy, Mikhail; Almgren, Ann; Dubey, Pradeep; Shalf, John; Oliker, Leonid

    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, 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.

  19. Fast and Robust Sixth Order Multigrid Computation for 3D Convection Diffusion Equation.

    PubMed

    Wang, Yin; Zhang, Jun

    2010-10-15

    We present a sixth order explicit compact finite difference scheme to solve the three dimensional (3D) convection diffusion equation. We first use multiscale multigrid method to solve the linear systems arising from a 19-point fourth order discretization scheme to compute the fourth order solutions on both the coarse grid and the fine grid. Then an operator based interpolation scheme combined with an extrapolation technique is used to approximate the sixth order accurate solution on the fine grid. Since the multigrid method using a standard point relaxation smoother may fail to achieve the optimal grid independent convergence rate for solving convection diffusion equation with a high Reynolds number, we implement the plane relaxation smoother in the multigrid solver to achieve better grid independency. Supporting numerical results are presented to demonstrate the efficiency and accuracy of the sixth order compact scheme (SOC), compared with the previously published fourth order compact scheme (FOC). PMID:21151737

  20. Multigrid-based 'shifted-Laplacian' preconditioning for the time-harmonic elastic wave equation

    NASA Astrophysics Data System (ADS)

    Rizzuti, G.; Mulder, W. A.

    2016-07-01

    We investigate the numerical performance of an iterative solver for a frequency-domain finite-difference discretization of the isotropic elastic wave equation. The solver is based on the 'shifted-Laplacian' preconditioner, originally designed for the acoustic wave equation. This preconditioner represents a discretization of a heavily damped wave equation and can be efficiently inverted by a multigrid iteration. However, the application of multigrid to the elastic case is not straightforward because standard methods, such as point-Jacobi, fail to smooth the S-wave wavenumber components of the error when high P-to-S velocity ratios are present. We consider line smoothers as an alternative and apply local-mode analysis to evaluate the performance of the various components of the multigrid preconditioner. Numerical examples in 2-D demonstrate the efficacy of our method.

  1. BOLD response analysis by iterated local multigrid priors.

    PubMed

    da Rocha Amaral, Selene; Rabbani, Said R; Caticha, Nestor

    2007-06-01

    We present a non parametric Bayesian multiscale method to characterize the Hemodynamic Response HR as function of time. This is done by extending and adapting the Multigrid Priors (MGP) method proposed in (S.D.R. Amaral, S.R. Rabbani, N. Caticha, Multigrid prior for a Bayesian approach to fMRI, NeuroImage 23 (2004) 654-662; N. Caticha, S.D.R. Amaral, S.R. Rabbani, Multigrid Priors for fMRI time series analysis, AIP Conf. Proc. 735 (2004) 27-34). We choose an initial HR model and apply the MGP method to assign a posterior probability of activity for every pixel. This can be used to construct the map of activity. But it can also be used to construct the posterior averaged time series activity for different regions. This permits defining a new model which is only data-dependent. Now in turn it can be used as the model behind a new application of the MGP method to obtain another posterior probability of activity. The method converges in just a few iterations and is quite independent of the original HR model, as long as it contains some information of the activity/rest state of the patient. We apply this method of HR inference both to simulated and real data of blocks and event-related experiments. Receiver operating characteristic (ROC) curves are used to measure the number of errors with respect to a few hyperparameters. We also study the deterioration of the results for real data, under information loss. This is done by decreasing the signal to noise ratio and also by decreasing the number of images available for analysis and compare the robustness to other methods. PMID:17258909

  2. Algebraic methods for the identification problem with short arcs of observations.

    NASA Astrophysics Data System (ADS)

    Gronchi, G. F.

    The identification problem of short arcs of asteroid observations is related with the determination of the orbits of the observed asteroids. Recently this problem has been faced with algebraic methods using the first integrals of Kepler's problem. These methods allow us to solve the problem in an efficient way, keeping under control also alternative solutions, that may occur. However, the huge and continuously increasing amount of data produced by the new asteroid surveys suggests us to search for new algorithms, with shorter computation times. In this communication I'll review the known methods \\cite{p1}, \\cite{p2}, that lead to polynomial equations of degree 48 and 20 respectively. Then I'll present a new algorithm \\cite{p3}, that we are currently studying, allowing to deal with this problem with a polynomial of degree 9, thus decreasing the computation times in a significant way. Finally, I'll show some examples of computation of asteroid orbits using these methods.

  3. 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.

  4. Multicloud: Multigrid convergence with a meshless operator

    SciTech Connect

    Katz, Aaron Jameson, Antony

    2009-08-01

    The primary objective of this work is to develop and test a new convergence acceleration technique we call multicloud. Multicloud is well-founded in the mathematical basis of multigrid, but relies on a meshless operator on coarse levels. The meshless operator enables extremely simple and automatic coarsening procedures for arbitrary meshes using arbitrary fine level discretization schemes. The performance of multicloud is compared with established multigrid techniques for structured and unstructured meshes for the Euler equations on two-dimensional test cases. Results indicate comparable convergence rates per unit work for multicloud and multigrid. However, because of its mesh and scheme transparency, multicloud may be applied to a wide array of problems with no modification of fine level schemes as is often required with agglomeration techniques. The implication is that multicloud can be implemented in a completely modular fashion, allowing researchers to develop fine level algorithms independent of the convergence accelerator for complex three-dimensional problems.

  5. 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.

  6. Parallel multigrid solver of radiative transfer equation for photon transport via graphics processing unit.

    PubMed

    Gao, Hao; Phan, Lan; Lin, Yuting

    2012-09-01

    A graphics processing unit-based parallel multigrid solver for a radiative transfer equation with vacuum boundary condition or reflection boundary condition is presented for heterogeneous media with complex geometry based on two-dimensional triangular meshes or three-dimensional tetrahedral meshes. The computational complexity of this parallel solver is linearly proportional to the degrees of freedom in both angular and spatial variables, while the full multigrid method is utilized to minimize the number of iterations. The overall gain of speed is roughly 30 to 300 fold with respect to our prior multigrid solver, which depends on the underlying regime and the parallelization. The numerical validations are presented with the MATLAB codes at https://sites.google.com/site/rtefastsolver/. PMID:23085905

  7. Multigrid on unstructured grids using an auxiliary set of structured grids

    SciTech Connect

    Douglas, C.C.; Malhotra, S.; Schultz, M.H.

    1996-12-31

    Unstructured grids do not have a convenient and natural multigrid framework for actually computing and maintaining a high floating point rate on standard computers. In fact, just the coarsening process is expensive for many applications. Since unstructured grids play a vital role in many scientific computing applications, many modifications have been proposed to solve this problem. One suggested solution is to map the original unstructured grid onto a structured grid. This can be used as a fine grid in a standard multigrid algorithm to precondition the original problem on the unstructured grid. We show that unless extreme care is taken, this mapping can lead to a system with a high condition number which eliminates the usefulness of the multigrid method. Theorems with lower and upper bounds are provided. Simple examples show that the upper bounds are sharp.

  8. The Competent Use of the Analytic Method in the Solution of Algebraic Word Problems: A Didactical Model Based on a Numerical Approach with Junior High Students

    ERIC Educational Resources Information Center

    Rubio, Guillermo; del Valle, Rafael

    2004-01-01

    The study proves that a didactical model based in a method to solve word problems of increasing complexity which uses a numerical approach was essential to develop the analytical ability and the competent use of the algebraic language with students from three different performance levels in elementary algebra. It is shown that before using the…

  9. 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.

  10. Multigrid in energy preconditioner for Krylov solvers

    SciTech Connect

    Slaybaugh, R.N.; Evans, T.M.; Davidson, G.G.; Wilson, P.P.H.

    2013-06-01

    We have added a new multigrid in energy (MGE) preconditioner to the Denovo discrete-ordinates radiation transport code. This preconditioner takes advantage of a new multilevel parallel decomposition. A multigroup Krylov subspace iterative solver that is decomposed in energy as well as space-angle forms the backbone of the transport solves in Denovo. The space-angle-energy decomposition facilitates scaling to hundreds of thousands of cores. The multigrid in energy preconditioner scales well in the energy dimension and significantly reduces the number of Krylov iterations required for convergence. This preconditioner is well-suited for use with advanced eigenvalue solvers such as Rayleigh Quotient Iteration and Arnoldi.

  11. Highly indefinite multigrid for eigenvalue problems

    SciTech Connect

    Borges, L.; Oliveira, S.

    1996-12-31

    Eigenvalue problems are extremely important in understanding dynamic processes such as vibrations and control systems. Large scale eigenvalue problems can be very difficult to solve, especially if a large number of eigenvalues and the corresponding eigenvectors need to be computed. For solving this problem a multigrid preconditioned algorithm is presented in {open_quotes}The Davidson Algorithm, preconditioning and misconvergence{close_quotes}. Another approach for solving eigenvalue problems is by developing efficient solutions for highly indefinite problems. In this paper we concentrate on the use of new highly indefinite multigrid algorithms for the eigenvalue problem.

  12. Algebraic Nonoverlapping Domain Decomposition Methods for Stabilized FEM and FV Discretizations

    NASA Technical Reports Server (NTRS)

    Barth, Timothy J.; Bailey, David (Technical Monitor)

    1998-01-01

    We consider preconditioning methods for convection dominated fluid flow problems based on a nonoverlapping Schur complement domain decomposition procedure for arbitrary triangulated domains. The triangulation is first partitioned into a number of subdomains and interfaces which induce a natural 2 x 2 partitioning of the p.d.e. discretization matrix. We view the Schur complement induced by this partitioning as an algebraically derived coarse space approximation. This avoids the known difficulties associated with the direct formation of an effective coarse discretization for advection dominated equations. By considering various approximations of the block factorization of the 2 x 2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 using MPI message passing protocol. A number of 2-D CFD calculations will be presented for both scalar advection-diffusion equations and the Euler equations discretized using stabilized finite element and finite volume methods. These results show very good scalability of the preconditioner for various discretizations as the number of processors is increased while the number of degrees of freedom per processor is fixed.

  13. 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.

  14. Using elimination methods to compute thermophysical algebraic invariants from infrared imagery

    SciTech Connect

    Michel, J.D.; Nandhakumar, N.; Saxena, T.

    1996-12-31

    We describe a new approach for computing invariant features in infrared (IR) images. Our approach is unique in the field since it considers not just surface reflection and surface geometry in the specification of invariant features, but it also takes into account internal object composition and thermal state which affect images sensed in the non-visible spectrum. We first establish a non-linear energy balance equation using the principle of conservation of energy at the surface of the imaged object. We then derive features that depend only on material parameters of the object and the sensed radiosity. These features are independent of the scene conditions and the scene-to-scene transformation of the {open_quotes}driving conditions{close_quotes} such as ambient temperature, and wind speed. The algorithm for deriving the invariant features is based on the algebraic elimination of the transformation parameters from the non-linear relationships. The elimination approach is a general method based on the extended Dixon resultant. Results on real IR imagery are shown to illustrate the performance of the features derived in this manner when used for an object recognition system that deals with multiple classes of objects.

  15. Multigrid properties of upwind-biased data reconstructions

    NASA Technical Reports Server (NTRS)

    Warren, Gary P.; Roberts, Thomas W.

    1993-01-01

    The multigrid properties of two data reconstruction methods used for achieving second-order spatial accuracy when solving the two-dimensional Euler equations are examined. The data reconstruction methods are used with an implicit upwind algorithm which uses linearized backward-Euler time-differencing. The solution of the resulting linear system is performed by an iterative procedure. In the present study only regular quadrilateral grids are considered, so a red-black Gauss-Seidel iteration is used. Although the Jacobian is approximated by first-order upwind extrapolation, two alternative data reconstruction techniques for the flux integral that yield higher-order spatial accuracy at steady state are examined. The first method, probably most popular for structured quadrilateral grids, is based on estimating the cell gradients using one-dimensional reconstruction along curvilinear coordinates. The second method is based on Green's theorem. Analysis and numerical results for the two dimensional Euler equations show that data reconstruction based on Green's theorem has superior multigrid properties as compared to the one-dimensional data reconstruction method.

  16. 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.

  17. A method to convert algebraic boundary representations to CSG representations for three-dimensional solids

    SciTech Connect

    Buchele, S.F.; Ellingson, W.A.

    1997-06-01

    Recent advances in reverse engineering have focused on recovering a boundary representation (b-rep) of an object, often for integration with rapid prototyping. This boundary representation may be a 3-D point cloud, a triangulation of points, or piecewise algebraic or parametric surfaces. This paper presents work in progress to develop an algorithm to extend the current state of the art in reverse engineering of mechanical parts. This algorithm will take algebraic surface representations as input and will produce a constructive solid geometry (CSG) description that uses solid primitives such as rectangular block, pyramid, sphere, cylinder, and cone. The proposed algorithm will automatically generate a CSG solid model of a part given its algebraic b-rep, thus allowing direct input into a CAD system and subsequent CSG model generation.

  18. An efficient non-linear multigrid procedure for the incompressible Navier-Stokes equations

    NASA Astrophysics Data System (ADS)

    Sivaloganathan, S.; Shaw, G. J.

    An efficient Full Approximation multigrid scheme for finite volume discretizations of the Navier-Stokes equations is presented. The algorithm is applied to the driven cavity test problem. Numerical results are presented and a comparison made with PACE, a Rolls-Royce industrial code, which uses the SIMPLE pressure correction method as an iterative solver.

  19. A fast multigrid algorithm for energy minimization under planar density constraints.

    SciTech Connect

    Ron, D.; Safro, I.; Brandt, A.; Mathematics and Computer Science; Weizmann Inst. of Science

    2010-09-07

    The two-dimensional layout optimization problem reinforced by the efficient space utilization demand has a wide spectrum of practical applications. Formulating the problem as a nonlinear minimization problem under planar equality and/or inequality density constraints, we present a linear time multigrid algorithm for solving a correction to this problem. The method is demonstrated in various graph drawing (visualization) instances.

  20. How Our Methods of Writing Algebra Have Evolved: A Thread through History

    ERIC Educational Resources Information Center

    Oliver, Jack

    2007-01-01

    Today's generation does not always have its clever ways of writing algebraic equations and expressions. This paper attempts to trace how this system has developed since the dawn of civilization. The author looks at a few snapshots taken at distinct times to illustrate this progress. (Contains 4 tables.)

  1. Methods of Instructional Improvement in Algebra: A Systematic Review and Meta-Analysis

    ERIC Educational Resources Information Center

    Rakes, Christopher R.; Valentine, Jeffrey C.; McGatha, Maggie B.; Ronau, Robert N.

    2010-01-01

    This systematic review of algebra instructional improvement strategies identified 82 relevant studies with 109 independent effect sizes representing a sample of 22,424 students. Five categories of improvement strategies emerged: technology curricula, nontechnology curricula, instructional strategies, manipulatives, and technology tools. All five…

  2. Exploring Algebra Based Problem Solving Methods and Strategies of Spanish-Speaking High School Students

    ERIC Educational Resources Information Center

    Hernandez, Andrea C.

    2013-01-01

    This dissertation analyzes differences found in Spanish-speaking middle school and high school students in algebra-based problem solving. It identifies the accuracy differences between word problems presented in English, Spanish and numerically based problems. The study also explores accuracy differences between each subgroup of Spanish-speaking…

  3. Algebraic grid adaptation method using non-uniform rational B-spline surface modeling

    NASA Technical Reports Server (NTRS)

    Yang, Jiann-Cherng; Soni, B. K.

    1992-01-01

    An algebraic adaptive grid system based on equidistribution law and utilized by the Non-Uniform Rational B-Spline (NURBS) surface for redistribution is presented. A weight function, utilizing a properly weighted boolean sum of various flow field characteristics is developed. Computational examples are presented to demonstrate the success of this technique.

  4. 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.

  5. Simultaneous multiplicative column-normalized method (SMART) for 3-D ionosphere tomography in comparison to other algebraic methods

    NASA Astrophysics Data System (ADS)

    Gerzen, T.; Minkwitz, D.

    2016-01-01

    The accuracy and availability of satellite-based applications like GNSS positioning and remote sensing crucially depends on the knowledge of the ionospheric electron density distribution. The tomography of the ionosphere is one of the major tools to provide link specific ionospheric corrections as well as to study and monitor physical processes in the ionosphere. In this paper, we introduce a simultaneous multiplicative column-normalized method (SMART) for electron density reconstruction. Further, SMART+ is developed by combining SMART with a successive correction method. In this way, a balancing between the measurements of intersected and not intersected voxels is realised. The methods are compared with the well-known algebraic reconstruction techniques ART and SART. All the four methods are applied to reconstruct the 3-D electron density distribution by ingestion of ground-based GNSS TEC data into the NeQuick model. The comparative case study is implemented over Europe during two periods of the year 2011 covering quiet to disturbed ionospheric conditions. In particular, the performance of the methods is compared in terms of the convergence behaviour and the capability to reproduce sTEC and electron density profiles. For this purpose, independent sTEC data of four IGS stations and electron density profiles of four ionosonde stations are taken as reference. The results indicate that SMART significantly reduces the number of iterations necessary to achieve a predefined accuracy level. Further, SMART+ decreases the median of the absolute sTEC error up to 15, 22, 46 and 67 % compared to SMART, SART, ART and NeQuick respectively.

  6. Multigrid-Based Methodology for Implicit Solvation Models in Periodic DFT.

    PubMed

    Garcia-Ratés, Miquel; López, Núria

    2016-03-01

    Continuum solvation models have become a widespread approach for the study of environmental effects in Density Functional Theory (DFT) methods. Adding solvation contributions mainly relies on the solution of the Generalized Poisson Equation (GPE) governing the behavior of the electrostatic potential of a system. Although multigrid methods are especially appropriate for the solution of partial differential equations, up to now, their use is not much extended in DFT-based codes because of their high memory requirements. In this Article, we report the implementation of an accelerated multigrid solver-based approach for the treatment of solvation effects in the Vienna ab initio Simulation Package (VASP). The stated implicit solvation model, named VASP-MGCM (VASP-Multigrid Continuum Model), uses an efficient and transferable algorithm for the product of sparse matrices that highly outperforms serial multigrid solvers. The calculated solvation free energies for a set of molecules, including neutral and ionic species, as well as adsorbed molecules on metallic surfaces, agree with experimental data and with simulation results obtained with other continuum models. PMID:26771105

  7. Least-squares finite element methods for quantum chromodynamics

    SciTech Connect

    Ketelsen, Christian; Brannick, J; Manteuffel, T; Mccormick, S

    2008-01-01

    A significant amount of the computational time in large Monte Carlo simulations of lattice quantum chromodynamics (QCD) is spent inverting the discrete Dirac operator. Unfortunately, traditional covariant finite difference discretizations of the Dirac operator present serious challenges for standard iterative methods. For interesting physical parameters, the discretized operator is large and ill-conditioned, and has random coefficients. More recently, adaptive algebraic multigrid (AMG) methods have been shown to be effective preconditioners for Wilson's discretization of the Dirac equation. This paper presents an alternate discretization of the Dirac operator based on least-squares finite elements. The discretization is systematically developed and physical properties of the resulting matrix system are discussed. Finally, numerical experiments are presented that demonstrate the effectiveness of adaptive smoothed aggregation ({alpha}SA ) multigrid as a preconditioner for the discrete field equations resulting from applying the proposed least-squares FE formulation to a simplified test problem, the 2d Schwinger model of quantum electrodynamics.

  8. Multigrid MALDI mass spectrometry imaging (mMALDI MSI).

    PubMed

    Urbanek, Annett; Hölzer, Stefan; Knop, Katrin; Schubert, Ulrich S; von Eggeling, Ferdinand

    2016-05-01

    Matrix-assisted laser desorption/ionization mass spectrometry imaging (MALDI MSI) is an important technique for the spatially resolved molecular analysis of tissue sections. The selection of matrices influences the resulting mass spectra to a high degree. For extensive and simultaneous analysis, the application of different matrices to one tissue sample is desirable. To date, only a single matrix could be applied to a tissue section per experiment. However, repetitive removal of the matrix makes this approach time-consuming and damaging to tissue samples. To overcome these drawbacks, we developed a multigrid MALDI MSI technique (mMALDI MSI) that relies on automated inkjet printing to place differing matrices onto predefined dot grids. We used a cooled printhead to prevent cavitation of low viscosity solvents in the printhead nozzle. Improved spatial resolution of the dot grids was achieved by using a triple-pulse procedure that reduced droplet volume. The matrices can either be applied directly to the thaw-mounted tissue sample or by precoating the slide followed by mounting of the tissue sample. During the MALDI imaging process, we were able to precisely target different matrix point grids with the laser to simultaneously produce distinct mass spectra. Unlike the standard method, the prespotting approach optimizes the spectra quality, avoids analyte delocalization, and enables subsequent hematoxylin and eosin (H&E) staining. Graphical Abstract Scheme of the pre-spotted multigrid MALDI MSI workflow. PMID:27039200

  9. Multigrid calculations of 3-D turbulent viscous flows

    NASA Technical Reports Server (NTRS)

    Yokota, Jeffrey W.

    1989-01-01

    Convergence properties of a multigrid algorithm, developed to calculate compressible viscous flows, are analyzed by a vector sequence eigenvalue estimate. The full 3-D Reynolds-averaged Navier-Stokes equations are integrated by an implicit multigrid scheme while a k-epsilon turbulence model is solved, uncoupled from the flow equations. Estimates of the eigenvalue structure for both single and multigrid calculations are compared in an attempt to analyze the process as well as the results of the multigrid technique. The flow through an annular turbine is used to illustrate the scheme's ability to calculate complex 3-D flows.

  10. Agglomeration multigrid for viscous turbulent flows

    NASA Technical Reports Server (NTRS)

    Mavriplis, D. J.; Venkatakrishnan, V.

    1994-01-01

    Agglomeration multigrid, which has been demonstrated as an efficient and automatic technique for the solution of the Euler equations on unstructured meshes, is extended to viscous turbulent flows. For diffusion terms, coarse grid discretizations are not possible, and more accurate grid transfer operators are required as well. A Galerkin coarse grid operator construction and an implicit prolongation operator are proposed. Their suitability is evaluated by examining their effect on the solution of Laplace's equation. The resulting strategy is employed to solve the Reynolds-averaged Navier-Stokes equations for aerodynamic flows. Convergence rates comparable to those obtained by a previously developed non-nested mesh multigrid approach are demonstrated, and suggestions for further improvements are given.

  11. Textbook Multigrid Efficiency for Fluid Simulations

    NASA Astrophysics Data System (ADS)

    Thomas, James L.

    Recent advances in achieving textbook multigrid efficiency for fluid simulations are presented. Textbook multigrid efficiency is defined as attaining the solution to the governing system of equations in a computational work that is a small multiple of the operation counts associated with discretizing the system. Strategies are reviewed to attain this efficiency by exploiting the factorizability properties inherent to a range of fluid simulations, including the compressible Navier-Stokes equations. Factorizability is used to separate the elliptic and hyperbolic factors contributing to the target system; each of the factors can then be treated individually and optimally. Boundary regions and discontinuities are addressed with separate (local) treatments. New formulations and recent calculations demonstrating the attainment of textbook efficiency for aerodynamic simulations are shown.

  12. Multigrid shallow water equations on an FPGA

    NASA Astrophysics Data System (ADS)

    Jeffress, Stephen; Duben, Peter; Palmer, Tim

    2015-04-01

    A novel computing technology for multigrid shallow water equations is investigated. As power consumption begins to constrain traditional supercomputing advances, weather and climate simulators are exploring alternative technologies that achieve efficiency gains through massively parallel and low power architectures. In recent years FPGA implementations of reduced complexity atmospheric models have shown accelerated speeds and reduced power consumption compared to multi-core CPU integrations. We continue this line of research by designing an FPGA dataflow engine for a mulitgrid version of the 2D shallow water equations. The multigrid algorithm couples grids of variable resolution to improve accuracy. We show that a significant reduction of precision in the floating point representation of the fine grid variables allows greater parallelism and thus improved overall peformance while maintaining accurate integrations. Preliminary designs have been constructed by software emulation. Results of the hardware implementation will be presented at the conference.

  13. Fast Tree Multigrid Transport Application for the Simplified P{sub 3} Approximation

    SciTech Connect

    Kotiluoto, Petri

    2001-07-15

    Calculation of neutron flux in three-dimensions is a complex problem. A novel approach for solving complicated neutron transport problems is presented, based on the tree multigrid technique and the Simplified P{sub 3} (SP{sub 3}) approximation. Discretization of the second-order elliptic SP{sub 3} equations is performed for a regular three-dimensional octree grid by using an integrated scheme. The octree grid is generated directly from STL files, which can be exported from practically all computer-aided design-systems. Marshak-like boundary conditions are utilized. Iterative algorithms are constructed for SP{sub 3} approximation with simple coarse-to-fine prolongation and fine-to-coarse restriction operations of the tree multigrid technique. Numerical results are presented for a simple cylindrical homogeneous one-group test case and for a simplistic two-group pressurized water reactor pressure vessel fluence calculation benchmark. In the former homogeneous test case, a very good agreement with 1.6% maximal deviation compared with DORT results was obtained. In the latter test case, however, notable discrepancies were observed. These comparisons show that the tree multigrid technique is capable of solving three-dimensional neutron transport problems with a very low computational cost, but that the SP{sub 3} approximation itself is not satisfactory for all problems. However, the tree multigrid technique is a very promising new method for neutron transport.

  14. Multiple solution of linear algebraic systems by an iterative method with recomputed preconditioner in the analysis of microstrip structures

    NASA Astrophysics Data System (ADS)

    Ahunov, Roman R.; Kuksenko, Sergey P.; Gazizov, Talgat R.

    2016-06-01

    A multiple solution of linear algebraic systems with dense matrix by iterative methods is considered. To accelerate the process, the recomputing of the preconditioning matrix is used. A priory condition of the recomputing based on change of the arithmetic mean of the current solution time during the multiple solution is proposed. To confirm the effectiveness of the proposed approach, the numerical experiments using iterative methods BiCGStab and CGS for four different sets of matrices on two examples of microstrip structures are carried out. For solution of 100 linear systems the acceleration up to 1.6 times, compared to the approach without recomputing, is obtained.

  15. Multigrid with red black SOR revisited

    SciTech Connect

    Yavneh, I.

    1994-12-31

    Optimal relaxation parameters are obtained for red-black point Gauss-Seidel relaxation in multigrid solvers of a family of elliptic equations. The resulting relaxation schemes are found to retain high efficiency over an appreciable range of coefficients of the elliptic operator, yielding simple, inexpensive and fully parallelizable smoothers in many situations where more complicated and less cost-effective block-relaxation and/or partial coarsening are commonly used.

  16. Development of a multigrid transonic potential flow code for cascades

    NASA Technical Reports Server (NTRS)

    Steinhoff, John

    1992-01-01

    Finite-volume methods for discretizing transonic potential flow equations have proven to be very flexible and accurate for both two and three dimensional problems. Since they only use local properties of the mapping, they allow decoupling of the grid generation from the rest of the problem. A very effective method for solving the discretized equations and converging to a solution is the multigrid-ADI technique. It has been successfully applied to airfoil problems where O type, C type and slit mappings have been used. Convergence rates for these cases are more than an order of magnitude faster than with relaxation techniques. In this report, we describe a method to extend the above methods, with the C type mappings, to airfoil cascade problems.

  17. From Earth Algebra to Earth Math: An Expansion and Dissemination of the Methods of Earth Algebra [and] Proceedings, Earth Math Conference (Kennesaw, Georgia, April 19-20, 1996).

    ERIC Educational Resources Information Center

    Zumoff, Nancy; Schaufele, Christopher

    This final report and appended conference proceedings describe activities of the Earth Math project, a 3-year effort at Kennesaw State University (Georgia) to broaden and disseminate the concept of Earth Algebra to precalculus and mathematics education courses. Major outcomes of the project were the draft of a precalculus textbook now being…

  18. Element Agglomeration Algebraic Multilevel Monte-Carlo Library

    SciTech Connect

    2015-02-19

    ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizations of subsurface flow problems.

  19. Element Agglomeration Algebraic Multilevel Monte-Carlo Library

    2015-02-19

    ElagMC is a parallel C++ library for Multilevel Monte Carlo simulations with algebraically constructed coarse spaces. ElagMC enables Multilevel variance reduction techniques in the context of general unstructured meshes by using the specialized element-based agglomeration techniques implemented in ELAG (the Element-Agglomeration Algebraic Multigrid and Upscaling Library developed by U. Villa and P. Vassilevski and currently under review for public release). The ElabMC library can support different type of deterministic problems, including mixed finite element discretizationsmore » of subsurface flow problems.« less

  20. An efficient fully-discrete local discontinuous Galerkin method for the Cahn-Hilliard-Hele-Shaw system

    NASA Astrophysics Data System (ADS)

    Guo, Ruihan; Xia, Yinhua; Xu, Yan

    2014-05-01

    In this paper, we develop an efficient and energy stable fully-discrete local discontinuous Galerkin (LDG) method for the Cahn-Hilliard-Hele-Shaw (CHHS) system. The semi-discrete energy stability of the LDG method is proved firstly. Due to the strict time step restriction (Δt=O(Δx4)) of explicit time discretization methods for stability, we introduce a semi-implicit time integration scheme which is based on a convex splitting of the discrete Cahn-Hilliard energy. The unconditional energy stability has been proved for this fully-discrete LDG scheme. The fully-discrete equations at the implicit time level are nonlinear. Thus, the nonlinear Full Approximation Scheme (FAS) multigrid method has been applied to solve this system of algebraic equations, which has been shown the nearly optimal complexity numerically. Numerical results are also given to illustrate the accuracy and capability of the LDG method coupled with the multigrid solver.

  1. A Generalized Eigensolver based on Smoothed Aggregation (GES-SA) for Initializing Smoothed Aggregation Multigrid (SA)

    SciTech Connect

    Brezina, M; Manteuffel, T; McCormick, S; Ruge, J; Sanders, G; Vassilevski, P S

    2007-05-31

    Consider the linear system Ax = b, where A is a large, sparse, real, symmetric, and positive definite matrix and b is a known vector. Solving this system for unknown vector x using a smoothed aggregation multigrid (SA) algorithm requires a characterization of the algebraically smooth error, meaning error that is poorly attenuated by the algorithm's relaxation process. For relaxation processes that are typically used in practice, algebraically smooth error corresponds to the near-nullspace of A. Therefore, having a good approximation to a minimal eigenvector is useful to characterize the algebraically smooth error when forming a linear SA solver. This paper discusses the details of a generalized eigensolver based on smoothed aggregation (GES-SA) that is designed to produce an approximation to a minimal eigenvector of A. GES-SA might be very useful as a standalone eigensolver for applications that desire an approximate minimal eigenvector, but the primary aim here is for GES-SA to produce an initial algebraically smooth component that may be used to either create a black-box SA solver or initiate the adaptive SA ({alpha}SA) process.

  2. Earth Algebra.

    ERIC Educational Resources Information Center

    Schaufele, Christopher; Zumoff, Nancy

    Earth Algebra is an entry level college algebra course that incorporates the spirit of the National Council of Teachers of Mathematics (NCTM) Curriculum and Evaluation Standards for School Mathematics at the college level. The context of the course places mathematics at the center of one of the major current concerns of the world. Through…

  3. Kiddie Algebra

    ERIC Educational Resources Information Center

    Cavanagh, Sean

    2009-01-01

    As educators and policymakers search for ways to prepare students for the rigors of algebra, teachers in the Helena, Montana, school system are starting early by attempting to nurture students' algebraic-reasoning ability, as well as their basic number skills, in early elementary school, rather than waiting until middle or early high school.…

  4. Multigrid solver for the reference interaction site model of molecular liquids theory.

    PubMed

    Sergiievskyi, Volodymyr P; Hackbusch, Wolfgang; Fedorov, Maxim V

    2011-07-15

    In this article, we propose a new multigrid-based algorithm for solving integral equations of the reference interactions site model (RISM). We also investigate the relationship between the parameters of the algorithm and the numerical accuracy of the hydration free energy calculations by RISM. For this purpose, we analyzed the performance of the method for several numerical tests with polar and nonpolar compounds. The results of this analysis provide some guidelines for choosing an optimal set of parameters to minimize computational expenses. We compared the performance of the proposed multigrid-based method with the one-grid Picard iteration and nested Picard iteration methods. We show that the proposed method is over 30 times faster than the one-grid iteration method, and in the high accuracy regime, it is almost seven times faster than the nested Picard iteration method. PMID:21455965

  5. Analyzing the nonlinear vibrational wave differential equation for the simplified model of Tower Cranes by Algebraic Method

    NASA Astrophysics Data System (ADS)

    Akbari, M. R.; Ganji, D. D.; Ahmadi, A. R.; Kachapi, Sayyid H. Hashemi

    2014-03-01

    In the current paper, a simplified model of Tower Cranes has been presented in order to investigate and analyze the nonlinear differential equation governing on the presented system in three different cases by Algebraic Method (AGM). Comparisons have been made between AGM and Numerical Solution, and these results have been indicated that this approach is very efficient and easy so it can be applied for other nonlinear equations. It is citable that there are some valuable advantages in this way of solving differential equations and also the answer of various sets of complicated differential equations can be achieved in this manner which in the other methods, so far, they have not had acceptable solutions. The simplification of the solution procedure in Algebraic Method and its application for solving a wide variety of differential equations not only in Vibrations but also in different fields of study such as fluid mechanics, chemical engineering, etc. make AGM be a powerful and useful role model for researchers in order to solve complicated nonlinear differential equations.

  6. Agglomeration multigrid for the three-dimensional Euler equations

    NASA Technical Reports Server (NTRS)

    Venkatakrishnan, V.; Mavriplis, D. J.

    1994-01-01

    A multigrid procedure that makes use of coarse grids generated by the agglomeration of control volumes is advocated as a practical approach for solving the three dimensional Euler equations on unstructured grids about complex configurations. It is shown that the agglomeration procedure can be tailored to achieve certain coarse grid properties such as the sizes of the coarse grids and aspect ratios of the coarse grid cells. The agglomeration is done as a preprocessing step and runs in linear time. The implications for multigrid of using arbitrary polyhedral coarse grids are discussed. The agglomeration multigrid technique compares very favorably with existing multigrid procedures both in terms of convergence rates and elapsed times. The main advantage of the present approach is the ease with which coarse grids of any desired degree of coarseness may be generated in three dimensions, without being constrained by considerations of geometry. Inviscid flows over a variety of complex configurations are computed using the agglomeration multigrid strategy.

  7. 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.

  8. 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.

  9. Interpolation between Sobolev spaces in Lipschitz domains with an application to multigrid theory

    SciTech Connect

    Bramble, J.H. |

    1995-10-01

    In this paper the author describes an interpolation result for the Sobolev spaces H{sub 0}{sup S}({Omega}) where {Omega} is a bounded domain with a Lipschitz boundary. This result is applied to derive discrete norm estimates related to multilevel preconditioners and multigrid methods in the finite element method. The estimates are valid for operators of order 2m with Dirichlet boundary conditions. 11 refs.

  10. Algebraic geometry methods associated to the one-dimensional Hubbard model

    NASA Astrophysics Data System (ADS)

    Martins, M. J.

    2016-06-01

    In this paper we study the covering vertex model of the one-dimensional Hubbard Hamiltonian constructed by Shastry in the realm of algebraic geometry. We show that the Lax operator sits in a genus one curve which is not isomorphic but only isogenous to the curve suitable for the AdS/CFT context. We provide an uniformization of the Lax operator in terms of ratios of theta functions allowing us to establish relativistic like properties such as crossing and unitarity. We show that the respective R-matrix weights lie on an Abelian surface being birational to the product of two elliptic curves with distinct J-invariants. One of the curves is isomorphic to that of the Lax operator but the other is solely fourfold isogenous. These results clarify the reason the R-matrix can not be written using only difference of spectral parameters of the Lax operator.

  11. 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.

  12. 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.

  13. MGGHAT: Elliptic PDE software with adaptive refinement, multigrid and high order finite elements

    NASA Technical Reports Server (NTRS)

    Mitchell, William F.

    1993-01-01

    MGGHAT (MultiGrid Galerkin Hierarchical Adaptive Triangles) is a program for the solution of linear second order elliptic partial differential equations in two dimensional polygonal domains. This program is now available for public use. It is a finite element method with linear, quadratic or cubic elements over triangles. The adaptive refinement via newest vertex bisection and the multigrid iteration are both based on a hierarchical basis formulation. Visualization is available at run time through an X Window display, and a posteriori through output files that can be used as GNUPLOT input. In this paper, we describe the methods used by MGGHAT, define the problem domain for which it is appropriate, illustrate use of the program, show numerical and graphical examples, and explain how to obtain the software.

  14. Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

    NASA Technical Reports Server (NTRS)

    Demuren, A. O.

    1992-01-01

    A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds stress model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method to be obtained with both turbulence models. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equation in the latter may be responsible. Computed results with both turbulence models are compared to experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement for the mean flow velocity, but RSM yields better predictions of the Reynolds stresses.

  15. Multigrid acceleration and turbulence models for computations of 3D turbulent jets in crossflow

    NASA Technical Reports Server (NTRS)

    Demuren, A. O.

    1991-01-01

    A multigrid method is presented for the calculation of three-dimensional turbulent jets in crossflow. Turbulence closure is achieved with either the standard k-epsilon model or a Reynolds Stress Model (RSM). Multigrid acceleration enables convergence rates which are far superior to that for a single grid method. With the k-epsilon model the rate approaches that for laminar flow, but with RSM it is somewhat slower. The increased stiffness of the system of equations in the latter may be responsible. Computed results with both turbulence models are compared with experimental data for a pair of opposed jets in crossflow. Both models yield reasonable agreement with mean flow velocity but RSM yields better prediction of the Reynolds stresses.

  16. 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.

  17. Multigrid for refined triangle meshes

    SciTech Connect

    Shapira, Yair

    1997-02-01

    A two-level preconditioning method for the solution of (locally) refined finite element schemes using triangle meshes is introduced. In the isotropic SPD case, it is shown that the condition number of the preconditioned stiffness matrix is bounded uniformly for all sufficiently regular triangulations. This is also verified numerically for an isotropic diffusion problem with highly discontinuous coefficients.

  18. Acceleration of k-Eigenvalue / Criticality Calculations using the Jacobian-Free Newton-Krylov Method

    SciTech Connect

    Dana Knoll; HyeongKae Park; Chris Newman

    2011-02-01

    We present a new approach for the $k$--eigenvalue problem using a combination of classical power iteration and the Jacobian--free Newton--Krylov method (JFNK). The method poses the $k$--eigenvalue problem as a fully coupled nonlinear system, which is solved by JFNK with an effective block preconditioning consisting of the power iteration and algebraic multigrid. We demonstrate effectiveness and algorithmic scalability of the method on a 1-D, one group problem and two 2-D two group problems and provide comparison to other efforts using silmilar algorithmic approaches.

  19. A monolithic FEM-multigrid solver for non-isothermal incompressible flow on general meshes

    NASA Astrophysics Data System (ADS)

    Damanik, H.; Hron, J.; Ouazzi, A.; Turek, S.

    2009-06-01

    We present special numerical simulation methods for non-isothermal incompressible viscous fluids which are based on LBB-stable FEM discretization techniques together with monolithic multigrid solvers. For time discretization, we apply the fully implicit Crank-Nicolson scheme of 2nd order accuracy while we utilize the high order Q2P1 finite element pair for discretization in space which can be applied on general meshes together with local grid refinement strategies including hanging nodes. To treat the nonlinearities in each time step as well as for direct steady approaches, the resulting discrete systems are solved via a Newton method based on divided differences to calculate explicitly the Jacobian matrices. In each nonlinear step, the coupled linear subproblems are solved simultaneously for all quantities by means of a monolithic multigrid method with local multilevel pressure Schur complement smoothers of Vanka type. For validation and evaluation of the presented methodology, we perform the MIT benchmark 2001 [M.A. Christon, P.M. Gresho, S.B. Sutton, Computational predictability of natural convection flows in enclosures, in: First MIT Conference on Computational Fluid and Solid Mechanics, vol. 40, Elsevier, 2001, pp. 1465-1468] of natural convection flow in enclosures to compare our results with respect to accuracy and efficiency. Additionally, we simulate problems with temperature and shear dependent viscosity and analyze the effect of an additional dissipation term inside the energy equation. Moreover, we discuss how these FEM-multigrid techniques can be extended to monolithic approaches for viscoelastic flow problems.

  20. Analysis of Angular V-Cycle Multigrid Formulation for Three-Dimensional Discrete Ordinates Shielding Problems

    SciTech Connect

    Kucukboyaci, Vefa; Haghighat, Alireza

    2001-06-17

    New angular multigrid formulations have been developed, including the Simplified Angular Multigrid (SAM), Nested Iteration (NI), and V-Cycle schemes, which are compatible with the parallel environment and the adaptive differencing strategy of the PENTRAN three-dimensional parallel S{sub N} code. Through use of the Fourier analysis method for an infinite, homogeneous medium, the effectiveness of the V-Cycle scheme was investigated for different problem parameters including scattering ratio, spatial differencing weights, quadrature order, and mesh size. The theoretical analysis revealed that the V-Cycle scheme is effective for a large range of scattering ratios and is insensitive to mesh size. The effectiveness of the new schemes was also investigated for practical shielding applications such as the Kobayashi benchmark problem and the boiling water reactor core shroud problem.

  1. Design and implementation of a multigrid code for the Euler equations

    NASA Technical Reports Server (NTRS)

    Jespersen, D. C.

    1983-01-01

    The steady-state equations of inviscid fluid flow, the Euler equations, are a nonlinear nonelliptic system of equations admitting solutions with discontinuities (for example, shocks). The efficient numerical solution of these equations poses a strenuous challenge to multigrid methods. A multigrid code has been developed for the numerical solution of the Euler equations. In this paper some of the factors that had to be taken into account in the design and development of the code are reviewed. These factors include the importance of choosing an appropriate difference scheme, the usefulness of local mode analysis as a design tool, and the crucial question of how to treat the nonlinearity. Sample calculations of transonic flow about airfoils will be presented. No claim is made that the particular algorithm presented is optimal.

  2. 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.

  3. Performance of a parallel algebraic multilevel preconditioner for stabilized finite element semiconductor device modeling

    SciTech Connect

    Lin, Paul T. Shadid, John N.; Sala, Marzio; Tuminaro, Raymond S.; Hennigan, Gary L.; Hoekstra, Robert J.

    2009-09-20

    In this study results are presented for the large-scale parallel performance of an algebraic multilevel preconditioner for solution of the drift-diffusion model for semiconductor devices. The preconditioner is the key numerical procedure determining the robustness, efficiency and scalability of the fully-coupled Newton-Krylov based, nonlinear solution method that is employed for this system of equations. The coupled system is comprised of a source term dominated Poisson equation for the electric potential, and two convection-diffusion-reaction type equations for the electron and hole concentration. The governing PDEs are discretized in space by a stabilized finite element method. Solution of the discrete system is obtained through a fully-implicit time integrator, a fully-coupled Newton-based nonlinear solver, and a restarted GMRES Krylov linear system solver. The algebraic multilevel preconditioner is based on an aggressive coarsening graph partitioning of the nonzero block structure of the Jacobian matrix. Representative performance results are presented for various choices of multigrid V-cycles and W-cycles and parameter variations for smoothers based on incomplete factorizations. Parallel scalability results are presented for solution of up to 10{sup 8} unknowns on 4096 processors of a Cray XT3/4 and an IBM POWER eServer system.

  4. Performance of a parallel algebraic multilevel preconditioner for stabilized finite element semiconductor device modeling

    NASA Astrophysics Data System (ADS)

    Lin, Paul T.; Shadid, John N.; Sala, Marzio; Tuminaro, Raymond S.; Hennigan, Gary L.; Hoekstra, Robert J.

    2009-09-01

    In this study results are presented for the large-scale parallel performance of an algebraic multilevel preconditioner for solution of the drift-diffusion model for semiconductor devices. The preconditioner is the key numerical procedure determining the robustness, efficiency and scalability of the fully-coupled Newton-Krylov based, nonlinear solution method that is employed for this system of equations. The coupled system is comprised of a source term dominated Poisson equation for the electric potential, and two convection-diffusion-reaction type equations for the electron and hole concentration. The governing PDEs are discretized in space by a stabilized finite element method. Solution of the discrete system is obtained through a fully-implicit time integrator, a fully-coupled Newton-based nonlinear solver, and a restarted GMRES Krylov linear system solver. The algebraic multilevel preconditioner is based on an aggressive coarsening graph partitioning of the nonzero block structure of the Jacobian matrix. Representative performance results are presented for various choices of multigrid V-cycles and W-cycles and parameter variations for smoothers based on incomplete factorizations. Parallel scalability results are presented for solution of up to 108 unknowns on 4096 processors of a Cray XT3/4 and an IBM POWER eServer system.

  5. Semigroups and computer algebra in algebraic structures

    NASA Astrophysics Data System (ADS)

    Bijev, G.

    2012-11-01

    Some concepts in semigroup theory can be interpreted in several algebraic structures. A generalization fA,B,fA,B(X) = A(X')B of the complement operator (') on Boolean matrices is made, where A and B denote any rectangular Boolean matrices. While (') is an isomorphism between Boolean semilattices, the generalized complement operator is homomorphism in the general case. The map fA,B and its general inverse (fA,B)+ have quite similar properties to those in the linear algebra and are useful for solving linear equations in Boolean matrix algebras. For binary relations on a finite set, necessary and sufficient conditions for the equation αξβ = γ to have a solution ξ are proved. A generalization of Green's equivalence relations in semigroups for rectangular matrices is proposed. Relationships between them and the Moore-Penrose inverses are investigated. It is shown how any generalized Green's H-class could be constructed by given its corresponding linear subspaces and converted into a group isomorphic to a linear group. Some information about using computer algebra methods concerning this paper is given.

  6. Curvature calculations with spacetime algebra

    SciTech Connect

    Hestenes, D.

    1986-06-01

    A new method for calculating the curvature tensor is developed and applied to the Scharzschild case. The method employs Clifford algebra and has definite advantages over conventional methods using differential forms or tensor analysis.

  7. Handheld Computer Algebra Systems in the Pre-Algebra Classroom

    ERIC Educational Resources Information Center

    Gantz, Linda Ann Galofaro

    2010-01-01

    This mixed method analysis sought to investigate several aspects of student learning in pre-algebra through the use of computer algebra systems (CAS) as opposed to non-CAS learning. This research was broken into two main parts, one which compared results from both the experimental group (instruction using CAS, N = 18) and the control group…

  8. Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

    NASA Technical Reports Server (NTRS)

    Mavriplis, Dimitri J.

    1989-01-01

    The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

  9. Implicit multigrid algorithms for the three-dimensional flux split Euler equations. Ph.D. Thesis

    NASA Technical Reports Server (NTRS)

    Anderson, W. K.

    1986-01-01

    The full approximation scheme multigrid method is applied to several implicit flux-split algorithms for solving the three-dimensional Euler equations in a body fitted coordinate system. Each uses a variation of approximate factorization and is implemented in a finite volume formulation. The algorithms are all vectorizable with little or no scalar computations required. The flux vectors are split into upwind components using both the splittings of Steger-Warming and Van Leer. Results comparing pressure distributions with experimental data using both splitting types are shown. 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. Using the multigrid method on both subsonic and transonic wing calculations, the final lift coefficient is obtained to within 0.1 percent of its final value in a few as 15 cycles for a mesh with over 210,000 points. A spectral radius of 0.89 is achieved for both subsonic and transonic flow over the ONERA M6 wing while a spectral radius of 0.83 is obtained for supersonic flow over an analytically defined forebody. Results compared with experiment for all cases show good agreement.

  10. Multigrid-based reconstruction algorithm for quantitative photoacoustic tomography

    PubMed Central

    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

  11. Multigrid-based reconstruction algorithm for quantitative photoacoustic tomography.

    PubMed

    Li, Shengfu; Montcel, Bruno; Yuan, Zhen; Liu, Wanyu; Vray, Didier

    2015-07-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

  12. Exploring Algebraic Patterns through Literature.

    ERIC Educational Resources Information Center

    Austin, Richard A.; Thompson, Denisse R.

    1997-01-01

    Presents methods for using literature to develop algebraic thinking in an environment that connects algebra to various situations. Activities are based on the book "Anno's Magic Seeds" with additional resources listed. Students express a constant function, exponential function, and a recursive function in their own words as well as writing about…

  13. A Method for Using Adjacency Matrices to Analyze the Connections Students Make within and between Concepts: The Case of Linear Algebra

    ERIC Educational Resources Information Center

    Selinski, Natalie E.; Rasmussen, Chris; Wawro, Megan; Zandieh, Michelle

    2014-01-01

    The central goals of most introductory linear algebra courses are to develop students' proficiency with matrix techniques, to promote their understanding of key concepts, and to increase their ability to make connections between concepts. In this article, we present an innovative method using adjacency matrices to analyze students'…

  14. A Multigrid Algorithm for Immersed Interface Problems

    NASA Technical Reports Server (NTRS)

    Adams, Loyce

    1996-01-01

    Many physical problems involve interior interfaces across which the coefficients in the problem, the solution, its derivatives, the flux, or the source term may have jumps. These interior interfaces may or may not align with a underlying Cartesian grid. Zhilin Li, in his dissertation, showed how to discretize such elliptic problems using only a Cartesian grid and the known jump conditions to second order accuracy. In this paper, we describe how to apply the full multigrid algorithm in this context. In particular, the restriction, interpolation, and coarse grid problem will be described. Numerical results for several model problems are given to demonstrate that good rates can be obtained even when jumps in the coefficients are large and do not align with the grid.

  15. New family of Maxwell like algebras

    NASA Astrophysics Data System (ADS)

    Concha, P. K.; Durka, R.; Merino, N.; Rodríguez, E. K.

    2016-08-01

    We introduce an alternative way of closing Maxwell like algebras. We show, through a suitable change of basis, that resulting algebras are given by the direct sums of the AdS and the Maxwell algebras already known in the literature. Casting the result into the S-expansion method framework ensures the straightaway construction of the gravity theories based on a found enlargement.

  16. Methods to Improve Performance of Students with Weaker Math Skills in an Algebra-based Physics Course

    NASA Astrophysics Data System (ADS)

    Smith, Leigh

    2015-03-01

    I will describe methods used at the University of Cincinnati to enhance student success in an algebra-based physics course. The first method is to use ALEKS, an adaptive online mathematics tutorial engine, before the term begins. Approximately three to four weeks before the beginning of the term, the professor in the course emails all of the students in the course informing them of the possibility of improving their math proficiency by using ALEKS. Using only a minimal reward on homework, we have achieved a 70% response rate with students spending an average of 8 hours working on their math skills before classes start. The second method is to use a flipped classroom approach. The class of 135 meets in a tiered classroom twice per week for two hours. Over the previous weekend students spend approximately 2 hours reading the book, taking short multiple choice conceptual quizzes, and viewing videos covering the material. In class, students use Learning Catalytics to work through homework problems in groups, guided by the instructor and one learning assistant. Using these interventions, we have reduced the student DWF rate (the fraction of students receiving a D or lower in the class) from an historical average of 35 to 40% to less than 20%.

  17. Implementations of the optimal multigrid algorithm for the cell-centered finite difference on equilateral triangular grids

    SciTech Connect

    Ewing, R.E.; Saevareid, O.; Shen, J.

    1994-12-31

    A multigrid algorithm for the cell-centered finite difference on equilateral triangular grids for solving second-order elliptic problems is proposed. This finite difference is a four-point star stencil in a two-dimensional domain and a five-point star stencil in a three dimensional domain. According to the authors analysis, the advantages of this finite difference are that it is an O(h{sup 2})-order accurate numerical scheme for both the solution and derivatives on equilateral triangular grids, the structure of the scheme is perhaps the simplest, and its corresponding multigrid algorithm is easily constructed with an optimal convergence rate. They are interested in relaxation of the equilateral triangular grid condition to certain general triangular grids and the application of this multigrid algorithm as a numerically reasonable preconditioner for the lowest-order Raviart-Thomas mixed triangular finite element method. Numerical test results are presented to demonstrate their analytical results and to investigate the applications of this multigrid algorithm on general triangular grids.

  18. Simulation and optimization of Al-Fe aerospace alloy processed by laser surface remelting using geometric Multigrid solver and experimental validation

    NASA Astrophysics Data System (ADS)

    Pariona, Moisés Meza; de Oliveira, Fabiane; Teleginski, Viviane; Machado, Siliane; Pinto, Marcio Augusto Villela

    2016-05-01

    Al-1.5 wt% Fe alloy was irradiate by Yb-fiber laser beam using the laser surface remelting (LSR) technique, generating weld fillets that covered the whole surface of the sample. The laser-treatment showed to be an efficient technology for corrosion resistance improvements. In this study, the finite element method was used to simulate the solidification processes by LSR technique. The method Multigrid was employed in order to reduce the CPU time, which is important to the viability for industrial applications. Multigrid method is a technique very promising of optimization that reduced drastically the CPU time. The result was highly satisfactory, because the CPU time has fallen dramatically in comparison when it was not used Multigrid method. To validate the result of numerical simulation with the experimental result was done the microstructural characterization of laser-treated layer by the optical microscopy and SEM techniques and however, that both results showing be consistent.

  19. 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.

  20. Multigrid solution for the compressible Euler equations by an implicit characteristic-flux-averaging

    NASA Astrophysics Data System (ADS)

    Kanarachos, A.; Vournas, I.

    A formulation of an implicit characteristic-flux-averaging method for the compressible Euler equations combined with the multigrid method is presented. The method is based on correction scheme and implicit Gudunov type finite volume scheme and is applied to two dimensional cases. Its principal feature is an averaging procedure based on the eigenvalue analysis of the Euler equations by means of which the fluxes are evaluated at the finite volume faces. The performance of the method is demonstrated for different flow problems around RAE-2922 and NACA-0012 airfoils and an internal flow over a circular arc.

  1. Comparisons and Limitations of Gradient Augmented Level Set and Algebraic Volume of Fluid Methods

    NASA Astrophysics Data System (ADS)

    Anumolu, Lakshman; Ryddner, Douglas; Trujillo, Mario

    2014-11-01

    Recent numerical methods for implicit interface transport are generally presented as enjoying higher order of spatial-temporal convergence when compared to classical methods or less sophisticated approaches. However, when applied to test cases, which are designed to simulate practical industrial conditions, significant reduction in convergence is observed in higher-order methods, whereas for the less sophisticated approaches same convergence is achieved but a growth in the error norms occurs. This provides an opportunity to understand the underlying issues which causes this decrease in accuracy in both types of methods. As an example we consider the Gradient Augmented Level Set method (GALS) and a variant of the Volume of Fluid (VoF) method in our study. Results show that while both methods do suffer from a loss of accuracy, it is the higher order method that suffers more. The implication is a significant reduction in the performance advantage of the GALS method over the VoF scheme. Reasons for this lie in the behavior of the higher order derivatives, particular in situations where the level set field is highly distorted. For the VoF approach, serious spurious deformations of the interface are observed, albeit with a deceptive zero loss of mass.

  2. Using Homemade Algebra Tiles To Develop Algebra and Prealgebra Concepts.

    ERIC Educational Resources Information Center

    Leitze, Annette Ricks; Kitt, Nancy A.

    2000-01-01

    Describes how to use homemade tiles, sketches, and the box method to reach a broader group of students for successful algebra learning. Provides a list of concepts appropriate for such an approach. (KHR)

  3. 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

  4. Mapping robust parallel multigrid algorithms to scalable memory architectures

    NASA Technical Reports Server (NTRS)

    Overman, Andrea; Vanrosendale, John

    1993-01-01

    The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. In this paper, we look at the parallel implementation of a V-cycle multiple semicoarsened grid (MSG) algorithm on distributed-memory architectures such as the Intel iPSC/860 and Paragon computers. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. This paper describes a mapping of an MSG algorithm to distributed-memory architectures that demonstrates how both levels of parallelism can be exploited. The result is a robust and effective multigrid algorithm for distributed-memory machines.

  5. Mapping robust parallel multigrid algorithms to scalable memory architectures

    NASA Technical Reports Server (NTRS)

    Overman, Andrea; Vanrosendale, John

    1993-01-01

    The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than line relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. The parallel implementation of a V-cycle multiple semi-coarsened grid (MSG) algorithm or distributed-memory architectures such as the Intel iPSC/860 and Paragon computers is addressed. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. A mapping of an MSG algorithm to distributed-memory architectures that demonstrate how both levels of parallelism can be exploited is described. The results is a robust and effective multigrid algorithm for distributed-memory machines.

  6. A diagonally inverted LU implicit multigrid scheme for the 3-D Navier-Stokes equations and a two equation model of turbulence

    NASA Technical Reports Server (NTRS)

    Yokota, Jeffrey W.

    1988-01-01

    An LU implicit multigrid algorithm is developed to calculate 3-D compressible viscous flows. This scheme solves the full 3-D Reynolds-Averaged Navier-Stokes equation with a two-equation kappa-epsilon model of turbulence. The flow equations are integrated by an efficient, diagonally inverted, LU implicit multigrid scheme while the kappa-epsilon equations are solved, uncoupled from the flow equations, by a block LU implicit algorithm. The flow equations are solved within the framework of the multigrid method using a four-grid level W-cycle, while the kappa-epsilon equations are iterated only on the finest grid. This treatment of the Reynolds-Averaged Navier-Stokes equations proves to be an efficient method for calculating 3-D compressible viscous flows.

  7. Quantum mechanical algebraic variational methods for inelastic and reactive molecular collisions

    NASA Technical Reports Server (NTRS)

    Schwenke, David W.; Haug, Kenneth; Zhao, Meishan; Truhlar, Donald G.; Sun, Yan

    1988-01-01

    The quantum mechanical problem of reactive or nonreactive scattering of atoms and molecules is formulated in terms of square-integrable basis sets with variational expressions for the reactance matrix. Several formulations involving expansions of the wave function (the Schwinger variational principle) or amplitude density (a generalization of the Newton variational principle), single-channel or multichannel distortion potentials, and primitive or contracted basis functions are presented and tested. The test results, for inelastic and reactive atom-diatom collisions, suggest that the methods may be useful for a variety of collision calculations and may allow the accurate quantal treatment of systems for which other available methods would be prohibitively expensive.

  8. Predicting High School Completion Using Student Performance in High School Algebra: A Mixed Methods Research Study

    ERIC Educational Resources Information Center

    Chiado, Wendy S.

    2012-01-01

    Too many of our nation's youth have failed to complete high school. Determining why so many of our nation's students fail to graduate is a complex, multi-faceted problem and beyond the scope of any one study. The study presented herein utilized a thirteen-step mixed methods model developed by Leech and Onwuegbuzie (2007) to demonstrate…

  9. 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.

  10. 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.

  11. Twisted Quantum Toroidal Algebras

    NASA Astrophysics Data System (ADS)

    Jing, Naihuan; Liu, Rongjia

    2014-09-01

    We construct a principally graded quantum loop algebra for the Kac-Moody algebra. As a special case a twisted analog of the quantum toroidal algebra is obtained together with the quantum Serre relations.

  12. Analysis of multigrid algorithms for nonsymmetric and indefinite elliptic problems

    SciTech Connect

    Bramble, J.H.; Pasciak, J.E.; Xu, J.

    1988-10-01

    We prove some new estimates for the convergence of multigrid algorithms applied to nonsymmetric and indefinite elliptic boundary value problems. We provide results for the so-called 'symmetric' multigrid schemes. We show that for the variable V-script-cycle and the W-script-cycle schemes, multigrid algorithms with any amount of smoothing on the finest grid converge at a rate that is independent of the number of levels or unknowns, provided that the initial grid is sufficiently fine. We show that the V-script-cycle algorithm also converges (under appropriate assumptions on the coarsest grid) but at a rate which may deteriorate as the number of levels increases. This deterioration for the V-script-cycle may occur even in the case of full elliptic regularity. Finally, the results of numerical experiments are given which illustrate the convergence behavior suggested by the theory.

  13. 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.

  14. A multigrid scheme for three dimensional body-fitted coordinates in turbomachine applications

    SciTech Connect

    Camarero, R.; Reggio, M.

    1983-03-01

    An efficient numerical scheme for the generation of curvilinear body-fitted coordinate systems in three dimensions is presented. The grid is obtained by the solution of a system of three elliptic partial differential equations. The method is based on the classical SOR scheme with an acceleration of convergence using the multigrid technique. The full approximation scheme has been used and is described with the overall algorithm. A number of numerical experiments are given with comparisons to illustrate the efficiency of the method. Practical applications to typical three-dimensional turbomachinery geometries are then shown.

  15. An algebraic formulation and implementation of the tetrahedron linear method for the Brillouin zone integration of spectral functions

    NASA Astrophysics Data System (ADS)

    Kaprzyk, S.

    2012-02-01

    A package of FORTRAN subroutines is provided for the Brillouin zone (BZ) integration of the Green's functions (GF) and spectral functions. The relevant weighting factors at sampling points in the BZ are evaluated to high precision with the help of the formulas for both the real and imaginary parts. The analytical properties of implemented expressions are discussed, and their range of validity is determined. The limiting cases when values at the tetrahedron corners coincide are worked out in terms of the finite difference quotients and replaced by the derivatives. The present numerical algorithms are developed for one-, two- and three-dimensional simplexes, with the potential ability of handling simplexes with higher dimensions as well. As an example, the results of computation the simple cubic lattice GF's are presented. Program summaryProgram title: SimTet Catalogue identifier: AEKF_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKF_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.: 3176 No. of bytes in distributed program, including test data, etc.: 19 416 Distribution format: tar.gz Programming language: Fortran Computer: Any computer with a Fortran compiler Operating system: Unix, Linux, Windows RAM: 512 Mbytes Classification: 4.11, 7.3 Nature of problem: The integration of the Green's function over the Brillouin zone appears in the computations of many physical quantities in solid-state physics. Solution method: The integral over the Brillouin zone is computed with the tetrahedron linear method. The complex weights are generated with the novel algebraic formulas free of apparent singularities and well suited for automatic computations. Running time: A few μsec per integral.

  16. Vectorizable multigrid algorithms for transonic-flow calculations

    NASA Technical Reports Server (NTRS)

    Melson, N. D.

    1986-01-01

    The analysis and the incorporation into a multigrid scheme of several vectorizable algorithms are discussed. von Neumann analyses of vertical-line, horizontal-line, and alternating-direction ZEBRA algorithms were performed; and the results were used to predict their multigrid damping rates. The algorithms were then successfully implemented in a transonic conservative full-potential computer program. The convergence acceleration effect of multiple grids is shown, and the convergence rates of the vectorizable algorithms are compared with those of standard successive-line overrelaxation (SLOR) algorithms.

  17. Multigrid solution of internal flows using unstructured solution adaptive meshes

    NASA Astrophysics Data System (ADS)

    Smith, Wayne A.; Blake, Kenneth R.

    1992-11-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.

  18. A constrained regularization method for inverting data represented by linear algebraic or integral equations

    NASA Astrophysics Data System (ADS)

    Provencher, Stephen W.

    1982-09-01

    CONTIN is a portable Fortran IV package for inverting noisy linear operator equations. These problems occur in the analysis of data from a wide variety experiments. They are generally ill-posed problems, which means that errors in an unregularized inversion are unbounded. Instead, CONTIN seeks the optimal solution by incorporating parsimony and any statistical prior knowledge into the regularizor and absolute prior knowledge into equallity and inequality constraints. This can be greatly increase the resolution and accuracyh of the solution. CONTIN is very flexible, consisting of a core of about 50 subprograms plus 13 small "USER" subprograms, which the user can easily modify to specify special-purpose constraints, regularizors, operator equations, simulations, statistical weighting, etc. Specjial collections of USER subprograms are available for photon correlation spectroscopy, multicomponent spectra, and Fourier-Bessel, Fourier and Laplace transforms. Numerically stable algorithms are used throughout CONTIN. A fairly precise definition of information content in terms of degrees of freedom is given. The regularization parameter can be automatically chosen on the basis of an F-test and confidence region. The interpretation of the latter and of error estimates based on the covariance matrix of the constrained regularized solution are discussed. The strategies, methods and options in CONTIN are outlined. The program itself is described in the following paper.

  19. Algebraic vs physical N = 6 3-algebras

    SciTech Connect

    Cantarini, Nicoletta; Kac, Victor G.

    2014-01-15

    In our previous paper, we classified linearly compact algebraic simple N = 6 3-algebras. In the present paper, we classify their “physical” counterparts, which actually appear in the N = 6 supersymmetric 3-dimensional Chern-Simons theories.

  20. A nonlinear multigrid solver for a semi-Lagrangian potential vorticity-based barotropic model on the sphere

    SciTech Connect

    Ruge, J.; Li, Y.; McCormick, S.F.

    1994-12-31

    The formulation and time discretization of problems in meteorology are often tailored to the type of efficient solvers available for use on the discrete problems obtained. A common procedure is to formulate the problem so that a constant (or latitude-dependent) coefficient Poisson-like equation results at each time step, which is then solved using spectral methods. This both limits the scope of problems that can be handled and requires linearization by forward extrapolation of nonlinear terms, which, in turn, requires filtering to control noise. Multigrid methods do not suffer these limitations, and can be applied directly to systems of nonlinear equations with variable coefficients. Here, a global barotropic semi-Lagrangian model, developed by the authors, is presented which results in a system of three coupled nonlinear equations to be solved at each time step. A multigrid method for the solution of these equations is described, and results are presented.

  1. Filiform Lie algebras of order 3

    SciTech Connect

    Navarro, R. M.

    2014-04-15

    The aim of this work is to generalize a very important type of Lie algebras and superalgebras, i.e., filiform Lie (super)algebras, into the theory of Lie algebras of order F. Thus, the concept of filiform Lie algebras of order F is obtained. In particular, for F = 3 it has been proved that by using infinitesimal deformations of the associated model elementary Lie algebra it can be obtained families of filiform elementary lie algebras of order 3, analogously as that occurs into the theory of Lie algebras [M. Vergne, “Cohomologie des algèbres de Lie nilpotentes. Application à l’étude de la variété des algèbres de Lie nilpotentes,” Bull. Soc. Math. France 98, 81–116 (1970)]. Also we give the dimension, using an adaptation of the sl(2,C)-module Method, and a basis of such infinitesimal deformations in some generic cases.

  2. FINAL REPORT (MILESTONE DATE 9/30/11) FOR SUBCONTRACT NO. B594099 NUMERICAL METHODS FOR LARGE-SCALE DATA FACTORIZATION

    SciTech Connect

    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 of 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

  3. Adaptive parallel multigrid for Euler and incompressible Navier-Stokes equations

    SciTech Connect

    Trottenberg, U.; Oosterlee, K.; Ritzdorf, H.

    1996-12-31

    The combination of (1) very efficient solution methods (Multigrid), (2) adaptivity, and (3) parallelism (distributed memory) clearly is absolutely necessary for future oriented numerics but still regarded as extremely difficult or even unsolved. We show that very nice results can be obtained for real life problems. Our approach is straightforward (based on {open_quotes}MLAT{close_quotes}). But, of course, reasonable refinement and load-balancing strategies have to be used. Our examples are 2D, but 3D is on the way.

  4. Multigrid solution of the nonlinear Poisson-Boltzmann equation and calculation of titration curves.

    PubMed Central

    Oberoi, H; Allewell, N M

    1993-01-01

    Although knowledge of the pKa values and charge states of individual residues is critical to understanding the role of electrostatic effects in protein structure and function, calculating these quantities is challenging because of the sensitivity of these parameters to the position and distribution of charges. Values for many different proteins which agree well with experimental results have been obtained with modified Tanford-Kirkwood theory in which the protein is modeled as a sphere (reviewed in Ref. 1); however, convergence is more difficult to achieve with finite difference methods, in which the protein is mapped onto a grid and derivatives of the potential function are calculated as differences between the values of the function at grid points (reviewed in Ref. 6). Multigrid methods, in which the size of the grid is varied from fine to coarse in several cycles, decrease computational time, increase rates of convergence, and improve agreement with experiment. Both the accuracy and computational advantage of the multigrid approach increase with grid size, because the time required to achieve a solution increases slowly with grid size. We have implemented a multigrid procedure for solving the nonlinear Poisson-Boltzmann equation, and, using lysozyme as a test case, compared calculations for several crystal forms, different refinement procedures, and different charge assignment schemes. The root mean square difference between calculated and experimental pKa values for the crystal structure which yields best agreement with experiment (1LZT) is 1.1 pH units, with the differences in calculated and experimental pK values being less than 0.6 pH units for 16 out of 21 residues. The calculated titration curves of several residues are biphasic. Images FIGURE 8 PMID:8369451

  5. Algebraic turbulence modeling for unstructured and adaptive meshes

    NASA Technical Reports Server (NTRS)

    Mavriplis, Dimitri J.

    1990-01-01

    An algebraic turbulence model based on the Baldwin-Lomax model, has been implemented for use on unstructured grids. The implementation is based on the use of local background structured turbulence meshes. At each time-step, flow variables are interpolated from the unstructured mesh onto the background structured meshes, the turbulence model is executed on these meshes, and the resulting eddy viscosity values are interpolated back to the unstructured mesh. Modifications to the algebraic model were required to enable the treatment of more complicated flows, such as confluent boundary layers and wakes. The model is used in conjuction with an efficient unstructured multigrid finite-element Navier-Stokes solver in order to compute compressible turbulent flows on fully unstructured meshes. Solutions about single and multiple element airfoils are obtained and compared with experimental data.

  6. Alternative algebraic approaches in quantum chemistry

    SciTech Connect

    Mezey, Paul G.

    2015-01-22

    Various algebraic approaches of quantum chemistry all follow a common principle: the fundamental properties and interrelations providing the most essential features of a quantum chemical representation of a molecule or a chemical process, such as a reaction, can always be described by algebraic methods. Whereas such algebraic methods often provide precise, even numerical answers, nevertheless their main role is to give a framework that can be elaborated and converted into computational methods by involving alternative mathematical techniques, subject to the constraints and directions provided by algebra. In general, algebra describes sets of interrelations, often phrased in terms of algebraic operations, without much concern with the actual entities exhibiting these interrelations. However, in many instances, the very realizations of two, seemingly unrelated algebraic structures by actual quantum chemical entities or properties play additional roles, and unexpected connections between different algebraic structures are often giving new insight. Here we shall be concerned with two alternative algebraic structures: the fundamental group of reaction mechanisms, based on the energy-dependent topology of potential energy surfaces, and the interrelations among point symmetry groups for various distorted nuclear arrangements of molecules. These two, distinct algebraic structures provide interesting interrelations, which can be exploited in actual studies of molecular conformational and reaction processes. Two relevant theorems will be discussed.

  7. Parallel multigrid preconditioner for the cardiac bidomain model.

    PubMed

    Weber dos Santos, Rodrigo; Plank, Gernot; Bauer, Steffen; Vigmond, Edward J

    2004-11-01

    The bidomain equations are widely used for the simulation of electrical activity in cardiac tissue but are computationally expensive, limiting the size of the problem which can be modeled. The purpose of this study is to determine more efficient ways to solve the elliptic portion of the bidomain equations, the most computationally expensive part of the computation. Specifically, we assessed the performance of a parallel multigrid (MG) preconditioner for a conjugate gradient solver. We employed an operator splitting technique, dividing the computation in a parabolic equation, an elliptical equation, and a nonlinear system of ordinary differential equations at each time step. The elliptic equation was solved by the preconditioned conjugate gradient method, and the traditional block incomplete LU parallel preconditioner (ILU) was compared to MG. Execution time was minimized for each preconditioner by adjusting the fill-in factor for ILU, and by choosing the optimal number of levels for MG. The parallel implementation was based on the PETSc library and we report results for up to 16 nodes on a distributed cluster, for two and three dimensional simulations. A direct solver was also available to compare results for single processor runs. MG was found to solve the system in one third of the time required by ILU but required about 40% more memory. Thus, MG offered an attractive tradeoff between memory usage and speed, since its performance lay between those of the classic iterative methods (slow and low memory consumption) and direct methods (fast and high memory consumption). Results suggest the MG preconditioner is well suited for quickly and accurately solving the bidomain equations. PMID:15536898

  8. 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.

  9. Historical Topics in Algebra.

    ERIC Educational Resources Information Center

    National Council of Teachers of Mathematics, Inc., Reston, VA.

    This is a reprint of the historical capsules dealing with algebra from the 31st Yearbook of NCTM,"Historical Topics for the Mathematics Classroom." Included are such themes as the change from a geometric to an algebraic solution of problems, the development of algebraic symbolism, the algebraic contributions of different countries, the origin and…

  10. Semiclassical states on Lie algebras

    SciTech Connect

    Tsobanjan, Artur

    2015-03-15

    The effective technique for analyzing representation-independent features of quantum systems based on the semiclassical approximation (developed elsewhere) has been successfully used in the context of the canonical (Weyl) algebra of the basic quantum observables. Here, we perform the important step of extending this effective technique to the quantization of a more general class of finite-dimensional Lie algebras. The case of a Lie algebra with a single central element (the Casimir element) is treated in detail by considering semiclassical states on the corresponding universal enveloping algebra. Restriction to an irreducible representation is performed by “effectively” fixing the Casimir condition, following the methods previously used for constrained quantum systems. We explicitly determine the conditions under which this restriction can be consistently performed alongside the semiclassical truncation.

  11. Deformations of 3-algebras

    SciTech Connect

    Figueroa-O'Farrill, Jose Miguel

    2009-11-15

    We phrase deformations of n-Leibniz algebras in terms of the cohomology theory of the associated Leibniz algebra. We do the same for n-Lie algebras and for the metric versions of n-Leibniz and n-Lie algebras. We place particular emphasis on the case of n=3 and explore the deformations of 3-algebras of relevance to three-dimensional superconformal Chern-Simons theories with matter.

  12. The fast multipole method in the differential algebra framework for the calculation of 3D space charge fields

    NASA Astrophysics Data System (ADS)

    Zhang, He

    2013-01-01

    The space charge effect is one of the most important collective effects in beam dynamic studies. In many cases, numerical simulations are inevitable in order to get a clear understanding of this effect. The particle-particle interaction algorithms and the article-in-cell algorithms are widely used in space charge effect simulations. But they both have difficulties in dealing with highly correlated beams with abnormal distributions or complicated geometries. We developed a new algorithm to calculate the three dimensional self-field between charged particles by combining the differential algebra (DA) techniques with the fast multi-pole method (FMM). The FMM hierarchically decomposes the whole charged domain into many small regions. For each region it uses multipole expansions to represent the potential/field contributions from the particles far away from the region and then converts the multipole expansions into a local expansion inside the region. The potential/field due to the far away particles is calculated from the expansions and the potential/field due to the nearby particles is calculated from the Coulomb force law. The DA techniques are used in the calculation, translation and converting of the expansions. The new algorithm scales linearly with the total number of particles and it is suitable for any arbitrary charge distribution. Using the DA techniques, we can calculate both the potential/field and its high order derivatives, which will be useful for the purpose of including the space charge effect into transfer maps in the future. We first present the single level FMM, which decomposes the whole domain into boxes of the same size. It works best for charge distributions that are not overly non-uniform. Then we present the multilevel fast multipole algorithm (MLFMA), which decomposes the whole domain into different sized boxes according to the charge density. Finer boxes are generated where the higher charge density exists; thus the algorithm works for any

  13. 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.

  14. Quantum cluster algebras and quantum nilpotent algebras

    PubMed Central

    Goodearl, Kenneth R.; Yakimov, Milen T.

    2014-01-01

    A major direction in the theory of cluster algebras is to construct (quantum) cluster algebra structures on the (quantized) coordinate rings of various families of varieties arising in Lie theory. We prove that all algebras in a very large axiomatically defined class of noncommutative algebras possess canonical quantum cluster algebra structures. Furthermore, they coincide with the corresponding upper quantum cluster algebras. We also establish analogs of these results for a large class of Poisson nilpotent algebras. Many important families of coordinate rings are subsumed in the class we are covering, which leads to a broad range of applications of the general results to the above-mentioned types of problems. As a consequence, we prove the Berenstein–Zelevinsky conjecture [Berenstein A, Zelevinsky A (2005) Adv Math 195:405–455] for the quantized coordinate rings of double Bruhat cells and construct quantum cluster algebra structures on all quantum unipotent groups, extending the theorem of Geiß et al. [Geiß C, et al. (2013) Selecta Math 19:337–397] for the case of symmetric Kac–Moody groups. Moreover, we prove that the upper cluster algebras of Berenstein et al. [Berenstein A, et al. (2005) Duke Math J 126:1–52] associated with double Bruhat cells coincide with the corresponding cluster algebras. PMID:24982197

  15. An algebraic approach to the scattering equations

    NASA Astrophysics Data System (ADS)

    Huang, Rijun; Rao, Junjie; Feng, Bo; He, Yang-Hui

    2015-12-01

    We employ the so-called companion matrix method from computational algebraic geometry, tailored for zero-dimensional ideals, to study the scattering equations. The method renders the CHY-integrand of scattering amplitudes computable using simple linear algebra and is amenable to an algorithmic approach. Certain identities in the amplitudes as well as rationality of the final integrand become immediate in this formalism.

  16. Inversion of photon correlation spectroscopy based on truncated singular value decomposition and cascadic multigrid technology.

    PubMed

    Wang, Yajing; Shen, Jin; Wei, Liu; Dou, Zhenhai; Gao, Shanshan

    2013-04-20

    For the low accuracy of single-scale inversion method in photon correlation spectroscopy technology, a cascadic multigrid (CMG)-truncated singular value decomposition (TSVD) inversion method that combines the TSVD regularization with CMG technology is proposed. This method decomposes the original problem into several subproblems in different scale grid space. According to the particle sizes inverted from the coarsest scale to the finest scale, the solution of an original inversion problem can be obtained. For the inversion of each subproblem, TSVD method is used. The simulation and experimental data were respectively inverted by TSVD and CMG-TSVD methods. The inversion results demonstrate that the CMG-TSVD method has higher accuracy, more strong noise immunity and better smoothness than the TSVD method. PMID:23669690

  17. 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.

  18. Linear Multigrid Techniques in Self-consistent Electronic Structure Calculations

    SciTech Connect

    Fattebert, J-L

    2000-05-23

    Ab initio DFT electronic structure calculations involve an iterative process to solve the Kohn-Sham equations for an Hamiltonian depending on the electronic density. We discretize these equations on a grid by finite differences. Trial eigenfunctions are improved at each step of the algorithm using multigrid techniques to efficiently reduce the error at all length scale, until self-consistency is achieved. In this paper we focus on an iterative eigensolver based on the idea of inexact inverse iteration, using multigrid as a preconditioner. We also discuss how this technique can be used for electrons described by general non-orthogonal wave functions, and how that leads to a linear scaling with the system size for the computational cost of the most expensive parts of the algorithm.

  19. 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.

  20. Learning Algebra in a Computer Algebra Environment

    ERIC Educational Resources Information Center

    Drijvers, Paul

    2004-01-01

    This article summarises a doctoral thesis entitled "Learning algebra in a computer algebra environment, design research on the understanding of the concept of parameter" (Drijvers, 2003). It describes the research questions, the theoretical framework, the methodology and the results of the study. The focus of the study is on the understanding of…

  1. Representations of Super Yang-Mills Algebras

    NASA Astrophysics Data System (ADS)

    Herscovich, Estanislao

    2013-06-01

    We study in this article the representation theory of a family of super algebras, called the super Yang-Mills algebras, by exploiting the Kirillov orbit method à la Dixmier for nilpotent super Lie algebras. These super algebras are an extension of the so-called Yang-Mills algebras, introduced by A. Connes and M. Dubois-Violette in (Lett Math Phys 61(2):149-158, 2002), and in fact they appear as a "background independent" formulation of supersymmetric gauge theory considered in physics, in a similar way as Yang-Mills algebras do the same for the usual gauge theory. Our main result states that, under certain hypotheses, all Clifford-Weyl super algebras {{Cliff}q(k) ⊗ Ap(k)}, for p ≥ 3, or p = 2 and q ≥ 2, appear as a quotient of all super Yang-Mills algebras, for n ≥ 3 and s ≥ 1. This provides thus a family of representations of the super Yang-Mills algebras.

  2. Realizations of Galilei algebras

    NASA Astrophysics Data System (ADS)

    Nesterenko, Maryna; Pošta, Severin; Vaneeva, Olena

    2016-03-01

    All inequivalent realizations of the Galilei algebras of dimensions not greater than five are constructed using the algebraic approach proposed by Shirokov. The varieties of the deformed Galilei algebras are discussed and families of one-parametric deformations are presented in explicit form. It is also shown that a number of well-known and physically interesting equations and systems are invariant with respect to the considered Galilei algebras or their deformations.

  3. Algebraic Geodesics on Three-Dimensional Quadrics

    NASA Astrophysics Data System (ADS)

    Kai, Yue

    2015-12-01

    By Hamilton-Jacobi method, we study the problem of algebraic geodesics on the third-order surface. By the implicit function theorem, we proved the existences of the real geodesics which are the intersections of two algebraic surfaces, and we also give some numerical examples.

  4. Young Mathematicians at Work: Constructing Algebra

    ERIC Educational Resources Information Center

    Fosnot, Catherine Twomey; Jacob, Bill

    2010-01-01

    This book provides a landscape of learning that helps teachers recognize, support, and celebrate their students' capacity to structure their worlds algebraically. It identifies the models, contexts, and landmarks that facilitate algebraic thinking in young students and provides insightful and practical methods for teachers, math supervisors, and…

  5. A multigrid preconditioner and automatic differentiation for non-equilibrium radiation diffusion problems

    SciTech Connect

    Glowinski, Roland . E-mail: roland@math.uh.edu; Toivanen, Jari . E-mail: jatoivan@ncsu.edu

    2005-07-20

    We study the efficient solution of non-equilibrium radiation diffusion problems. An implicit time discretization leads to the solution of systems of non-linear equations which couple radiation energy and material temperature. We consider the implicit Euler method, the mid-point scheme, the two-step backward differentiation formula, and a two-stage implicit Runge-Kutta method for time discretization. We employ a Newton-Krylov method in the solution of arising non-linear problems. We describe the computation of the Jacobian matrix for Newton's method using automatic differentiation based on the operator overloading in Fortran 90. For GMRES iterations, we propose a simple multigrid preconditioner applied directly to the coupled linearized problems. We demonstrate the efficiency and scalability of the proposed solution procedure by solving one-dimensional and two-dimensional model problems.

  6. Algebraic theory of molecules

    NASA Technical Reports Server (NTRS)

    Iachello, Franco

    1995-01-01

    An algebraic formulation of quantum mechanics is presented. In this formulation, operators of interest are expanded onto elements of an algebra, G. For bound state problems in nu dimensions the algebra G is taken to be U(nu + 1). Applications to the structure of molecules are presented.

  7. Orientation in operator algebras

    PubMed Central

    Alfsen, Erik M.; Shultz, Frederic W.

    1998-01-01

    A concept of orientation is relevant for the passage from Jordan structure to associative structure in operator algebras. The research reported in this paper bridges the approach of Connes for von Neumann algebras and ourselves for C*-algebras in a general theory of orientation that is of geometric nature and is related to dynamics. PMID:9618457

  8. Developing Thinking in Algebra

    ERIC Educational Resources Information Center

    Mason, John; Graham, Alan; Johnson-Wilder, Sue

    2005-01-01

    This book is for people with an interest in algebra whether as a learner, or as a teacher, or perhaps as both. It is concerned with the "big ideas" of algebra and what it is to understand the process of thinking algebraically. The book has been structured according to a number of pedagogic principles that are exposed and discussed along the way,…

  9. Connecting Arithmetic to Algebra

    ERIC Educational Resources Information Center

    Darley, Joy W.; Leapard, Barbara B.

    2010-01-01

    Algebraic thinking is a top priority in mathematics classrooms today. Because elementary school teachers lay the groundwork to develop students' capacity to think algebraically, it is crucial for teachers to have a conceptual understanding of the connections between arithmetic and algebra and be confident in communicating these connections. Many…

  10. Applied Algebra Curriculum Modules.

    ERIC Educational Resources Information Center

    Texas State Technical Coll., Marshall.

    This collection of 11 applied algebra curriculum modules can be used independently as supplemental modules for an existing algebra curriculum. They represent diverse curriculum styles that should stimulate the teacher's creativity to adapt them to other algebra concepts. The selected topics have been determined to be those most needed by students…

  11. Profiles of Algebraic Competence

    ERIC Educational Resources Information Center

    Humberstone, J.; Reeve, R.A.

    2008-01-01

    The algebraic competence of 72 12-year-old female students was examined to identify profiles of understanding reflecting different algebraic knowledge states. Beginning algebraic competence (mapping abilities: word-to-symbol and vice versa, classifying, and solving equations) was assessed. One week later, the nature of assistance required to map…

  12. Ternary Virasoro - Witt algebra.

    SciTech Connect

    Zachos, C.; Curtright, T.; Fairlie, D.; High Energy Physics; Univ. of Miami; Univ. of Durham

    2008-01-01

    A 3-bracket variant of the Virasoro-Witt algebra is constructed through the use of su(1,1) enveloping algebra techniques. The Leibniz rules for 3-brackets acting on other 3-brackets in the algebra are discussed and verified in various situations.

  13. Beyond Dirac - a Unified Algebra

    NASA Astrophysics Data System (ADS)

    Lundberg, Wayne R.

    2001-10-01

    A introductory insight will be shared regarding a 'separation of variables' approach to understanding the relationship between QCD and the origins of cosmological and particle mass. The discussion will then build upon work presented at DFP 2000, focussing on the formal basis for using 3x3x3 matrix algebra as it underlies and extends Dirac notation. A set of restrictions are established which break the multiple symmetries of the 3x3x3 matrix algebra, yielding Standard Model QCD objects and interactions. It will be shown that the 3x3x3 matrix representation unifies the algebra of strong and weak (and by extension, electromagnetic) interactions. A direct correspondence to string theoretic objects is established by considering the string to be partitioned in thirds. Rubik's cube is used as a graphical means of handling algebraic manipulation of 3x3x3 algebra. Further, its potential utility for advancing pedagogical methods through active engagement is discussed. A simulated classroom exercize will be conducted.

  14. Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

    NASA Astrophysics Data System (ADS)

    Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

    2015-08-01

    The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

  15. Computer algebra and operators

    NASA Technical Reports Server (NTRS)

    Fateman, Richard; Grossman, Robert

    1989-01-01

    The symbolic computation of operator expansions is discussed. Some of the capabilities that prove useful when performing computer algebra computations involving operators are considered. These capabilities may be broadly divided into three areas: the algebraic manipulation of expressions from the algebra generated by operators; the algebraic manipulation of the actions of the operators upon other mathematical objects; and the development of appropriate normal forms and simplification algorithms for operators and their actions. Brief descriptions are given of the computer algebra computations that arise when working with various operators and their actions.

  16. Supersymmetry algebra cohomology. I. Definition and general structure

    NASA Astrophysics Data System (ADS)

    Brandt, Friedemann

    2010-12-01

    This paper concerns standard supersymmetry algebras in diverse dimensions, involving bosonic translational generators and fermionic supersymmetry generators. A cohomology related to these supersymmetry algebras, termed supersymmetry algebra cohomology, and corresponding "primitive elements" are defined by means of a BRST (Becchi-Rouet-Stora-Tyutin)-type coboundary operator. A method to systematically compute this cohomology is outlined and illustrated by simple examples.

  17. Architecting the Finite Element Method Pipeline for the GPU.

    PubMed

    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. PMID:25202164

  18. Architecting the Finite Element Method Pipeline for the GPU

    PubMed Central

    Fu, Zhisong; Lewis, T. James; Kirby, Robert M.

    2014-01-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. PMID:25202164

  19. A Parallel, Fully Coupled, Fully Implicit Solution to Reactive Transport in Porous Media Using the Preconditioned Jacobian-Free Newton-Krylov Method

    SciTech Connect

    Luanjing Guo; Hai Huang; Derek Gaston; Cody Permann; David Andrs; George Redden; Chuan Lu; Don Fox; Yoshiko Fujita

    2013-03-01

    Modeling large multicomponent reactive transport systems in porous media is particularly challenging when the governing partial differential algebraic equations (PDAEs) are highly nonlinear and tightly coupled due to complex nonlinear reactions and strong solution-media interactions. Here we present a preconditioned Jacobian-Free Newton-Krylov (JFNK) solution approach to solve the governing PDAEs in a fully coupled and fully implicit manner. A well-known advantage of the JFNK method is that it does not require explicitly computing and storing the Jacobian matrix during Newton nonlinear iterations. Our approach further enhances the JFNK method by utilizing physics-based, block preconditioning and a multigrid algorithm for efficient inversion of the preconditioner. This preconditioning strategy accounts for self- and optionally, cross-coupling between primary variables using diagonal and off-diagonal blocks of an approximate Jacobian, respectively. Numerical results are presented demonstrating the efficiency and massive scalability of the solution strategy for reactive transport problems involving strong solution-mineral interactions and fast kinetics. We found that the physics-based, block preconditioner significantly decreases the number of linear iterations, directly reducing computational cost; and the strongly scalable algebraic multigrid algorithm for approximate inversion of the preconditioner leads to excellent parallel scaling performance.

  20. Fast multigrid-based computation of the induced electric field for transcranial magnetic stimulation.

    PubMed

    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. PMID:23128377

  1. Celestial mechanics with geometric algebra

    NASA Technical Reports Server (NTRS)

    Hestenes, D.

    1983-01-01

    Geometric algebra is introduced as a general tool for Celestial Mechanics. A general method for handling finite rotations and rotational kinematics is presented. The constants of Kepler motion are derived and manipulated in a new way. A new spinor formulation of perturbation theory is developed.

  2. 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.

  3. The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

    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.

  4. The solution of the Elrod algorithm for a dynamically loaded journal bearing using multigrid techniques

    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.

  5. The analysis of multigrid algorithms for pseudodifferential operators of order minus one

    SciTech Connect

    Bramble, J.H.; Leyk, Z.; Pasciak, J.E. ||

    1994-10-01

    Multigrid algorithms are developed to solve the discrete systems approximating the solutions of operator equations involving pseudodifferential operators of order minus one. Classical multigrid theory deals with the case of differential operators of positive order. The pseudodifferential operator gives rise to a coercive form on H{sup {minus}1/2}({Omega}). Effective multigrid algorithms are developed for this problem. These algorithms are novel in that they use the inner product on H{sup {minus}1}({Omega}) as a base inner product for the multigrid development. The authors show that the resulting rate of iterative convergence can, at worst, depend linearly on the number of levels in these novel multigrid algorithms. In addition, it is shown that the convergence rate is independent of the number of levels (and unknowns) in the case of a pseudodifferential operator defined by a single-layer potential. Finally, the results of numerical experiments illustrating the theory are presented. 19 refs., 1 fig., 2 tabs.

  6. Implementation of algebraic stress models in a general 3-D Navier-Stokes method (PAB3D)

    NASA Technical Reports Server (NTRS)

    Abdol-Hamid, Khaled S.

    1995-01-01

    A three-dimensional multiblock Navier-Stokes code, PAB3D, which was developed for propulsion integration and general aerodynamic analysis, has been used extensively by NASA Langley and other organizations to perform both internal (exhaust) and external flow analysis of complex aircraft configurations. This code was designed to solve the simplified Reynolds Averaged Navier-Stokes equations. A two-equation k-epsilon turbulence model has been used with considerable success, especially for attached flows. Accurate predicting of transonic shock wave location and pressure recovery in separated flow regions has been more difficult. Two algebraic Reynolds stress models (ASM) have been recently implemented in the code that greatly improved the code's ability to predict these difficult flow conditions. Good agreement with Direct Numerical Simulation (DNS) for a subsonic flat plate was achieved with ASM's developed by Shih, Zhu, and Lumley and Gatski and Speziale. Good predictions were also achieved at subsonic and transonic Mach numbers for shock location and trailing edge boattail pressure recovery on a single-engine afterbody/nozzle model.

  7. A catheterization-training simulator based on a fast multigrid solver.

    PubMed

    Li, Shun; Guo, Jixiang; Wang, Qiong; Meng, Qiang; Chui, Yim-Pan; Qin, Jing; Heng, Pheng-Ann

    2012-01-01

    A VR-based simulator helps trainees develop skills for catheterization, a fundamental but difficult procedure in vascular interventional radiology. A deformable model simulates the complicated behavior of guide wires and catheters, using the principle of minimum total potential energy. A fast, stable multigrid solver ensures realistic simulation and real-time interaction. In addition, the system employs geometrically and topologically accurate vascular models based on improved parallel-transport frames, and it implements efficient collision detection. Experiments evaluated the method's stability, the solver's execution time, how well the simulation preserved the catheter's curved tip, and the catheter deformation's realism. An empirical study based on a typical selective-catheterization procedure assessed the system's feasibility and effectiveness. PMID:24807310

  8. Implicit/Multigrid Algorithms for Incompressible Turbulent Flows on Unstructured Grids

    NASA Technical Reports Server (NTRS)

    Anderson, W. Kyle; Rausch, Russ D.; Bonhaus, Daryl L.

    1997-01-01

    An implicit code for computing inviscid and viscous incompressible flows on unstructured grids is described. The foundation of the code is a backward Euler time discretization for which the linear system is approximately solved at each time step with either a point implicit method or a preconditioned Generalized Minimal Residual (GMRES) technique. For the GMRES calculations, several techniques are investigated for forming the matrix-vector product. Convergence acceleration is achieved through a multigrid scheme that uses non-nested coarse grids that are generated using a technique described in the present paper. Convergence characteristics are investigated and results are compared with an exact solution for the inviscid flow over a four-element airfoil. Viscous results, which are compared with experimental data, include the turbulent flow over a NACA 4412 airfoil, a three-element airfoil for which Mach number effects are investigated, and three-dimensional flow over a wing with a partial-span flap.

  9. A Richer Understanding of Algebra

    ERIC Educational Resources Information Center

    Foy, Michelle

    2008-01-01

    Algebra is one of those hard-to-teach topics where pupils seem to struggle to see it as more than a set of rules to learn, but this author recently used the software "Grid Algebra" from ATM, which engaged her Year 7 pupils in exploring algebraic concepts for themselves. "Grid Algebra" allows pupils to experience number, pre-algebra, and algebra…

  10. College Student Competency and Attitudes in Algebra Classes: A Comparison of Traditional and Online Delivery Methods in Exponents and Polynomials Concepts

    ERIC Educational Resources Information Center

    Huang, Kai-Yi Clark

    2012-01-01

    The purpose of this study was to measure the difference in achievement between those students enrolled in a beginning-level, university Algebra course in southeastern Idaho university the spring semester of 2012 who received an Algebra Exponents and Polynomials instructional unit in a traditional face-to-face setting and those students who…

  11. Adaptive Multigrid Algorithm for the Lattice Wilson-Dirac Operator

    SciTech Connect

    Babich, R.; Brower, R. C.; Rebbi, C.; Brannick, J.; Clark, M. A.; Manteuffel, T. A.; McCormick, S. F.; Osborn, J. C.

    2010-11-12

    We present an adaptive multigrid solver for application to the non-Hermitian Wilson-Dirac system of QCD. The key components leading to the success of our proposed algorithm are the use of an adaptive projection onto coarse grids that preserves the near null space of the system matrix together with a simplified form of the correction based on the so-called {gamma}{sub 5}-Hermitian symmetry of the Dirac operator. We demonstrate that the algorithm nearly eliminates critical slowing down in the chiral limit and that it has weak dependence on the lattice volume.

  12. Adaptive multigrid algorithm for the lattice Wilson-Dirac operator.

    PubMed

    Babich, R; Brannick, J; Brower, R C; Clark, M A; Manteuffel, T A; McCormick, S F; Osborn, J C; Rebbi, C

    2010-11-12

    We present an adaptive multigrid solver for application to the non-Hermitian Wilson-Dirac system of QCD. The key components leading to the success of our proposed algorithm are the use of an adaptive projection onto coarse grids that preserves the near null space of the system matrix together with a simplified form of the correction based on the so-called γ5-Hermitian symmetry of the Dirac operator. We demonstrate that the algorithm nearly eliminates critical slowing down in the chiral limit and that it has weak dependence on the lattice volume. PMID:21231217

  13. Fast multigrid solution of the advection problem with closed characteristics

    SciTech Connect

    Yavneh, I.; Venner, C.H.; Brandt, A.

    1996-12-31

    The numerical solution of the advection-diffusion problem in the inviscid limit with closed characteristics is studied as a prelude to an efficient high Reynolds-number flow solver. It is demonstrated by a heuristic analysis and numerical calculations that using upstream discretization with downstream relaxation-ordering and appropriate residual weighting in a simple multigrid V cycle produces an efficient solution process. We also derive upstream finite-difference approximations to the advection operator, whose truncation terms approximate {open_quotes}physical{close_quotes} (Laplacian) viscosity, thus avoiding spurious solutions to the homogeneous problem when the artificial diffusivity dominates the physical viscosity.

  14. Connecting Algebra and Chemistry.

    ERIC Educational Resources Information Center

    O'Connor, Sean

    2003-01-01

    Correlates high school chemistry curriculum with high school algebra curriculum and makes the case for an integrated approach to mathematics and science instruction. Focuses on process integration. (DDR)

  15. Applications: Using Algebra in an Accounting Practice.

    ERIC Educational Resources Information Center

    Eisner, Gail A.

    1994-01-01

    Presents examples of algebra from the field of accounting including proportional ownership of stock, separation of a loan payment into principal and interest portions, depreciation methods, and salary withholdings computations. (MKR)

  16. Constraint algebra in bigravity

    SciTech Connect

    Soloviev, V. O.

    2015-07-15

    The number of degrees of freedom in bigravity theory is found for a potential of general form and also for the potential proposed by de Rham, Gabadadze, and Tolley (dRGT). This aim is pursued via constructing a Hamiltonian formalismand studying the Poisson algebra of constraints. A general potential leads to a theory featuring four first-class constraints generated by general covariance. The vanishing of the respective Hessian is a crucial property of the dRGT potential, and this leads to the appearance of two additional second-class constraints and, hence, to the exclusion of a superfluous degree of freedom—that is, the Boulware—Deser ghost. The use of a method that permits avoiding an explicit expression for the dRGT potential is a distinctive feature of the present study.

  17. 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.

  18. Teaching Structure in Algebra

    ERIC Educational Resources Information Center

    Merlin, Ethan M.

    2013-01-01

    This article describes how the author has developed tasks for students that address the missed "essence of the matter" of algebraic transformations. Specifically, he has found that having students practice "perceiving" algebraic structure--by naming the "glue" in the expressions, drawing expressions using…

  19. Ready, Set, Algebra?

    ERIC Educational Resources Information Center

    Levy, Alissa Beth

    2012-01-01

    The California Department of Education (CDE) has long asserted that success Algebra I by Grade 8 is the goal for all California public school students. In fact, the state's accountability system penalizes schools that do not require all of their students to take the Algebra I end-of-course examination by Grade 8 (CDE, 2009). In this…

  20. Linear-Algebra Programs

    NASA Technical Reports Server (NTRS)

    Lawson, C. L.; Krogh, F. T.; Gold, S. S.; Kincaid, D. R.; Sullivan, J.; Williams, E.; Hanson, R. J.; Haskell, K.; Dongarra, J.; Moler, C. B.

    1982-01-01

    The Basic Linear Algebra Subprograms (BLAS) library is a collection of 38 FORTRAN-callable routines for performing basic operations of numerical linear algebra. BLAS library is portable and efficient source of basic operations for designers of programs involving linear algebriac computations. BLAS library is supplied in portable FORTRAN and Assembler code versions for IBM 370, UNIVAC 1100 and CDC 6000 series computers.

  1. Catching Up on Algebra

    ERIC Educational Resources Information Center

    Cavanagh, Sean

    2008-01-01

    A popular humorist and avowed mathphobe once declared that in real life, there's no such thing as algebra. Kathie Wilson knows better. Most of the students in her 8th grade class will be thrust into algebra, the definitive course that heralds the beginning of high school mathematics, next school year. The problem: Many of them are about three…

  2. Domain decomposition multigrid for unstructured grids

    SciTech Connect

    Shapira, Yair

    1997-01-01

    A two-level preconditioning method for the solution of elliptic boundary value problems using finite element schemes on possibly unstructured meshes is introduced. It is based on a domain decomposition and a Galerkin scheme for the coarse level vertex unknowns. For both the implementation and the analysis, it is not required that the curves of discontinuity in the coefficients of the PDE match the interfaces between subdomains. Generalizations to nonmatching or overlapping grids are made.

  3. MULTIGRID FOR THE MORTAR FINITE ELEMENT METHOD. (R825207)

    EPA Science Inventory

    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...

  4. Edge covers and independence: Algebraic approach

    NASA Astrophysics Data System (ADS)

    Kalinina, E. A.; Khitrov, G. M.; Pogozhev, S. V.

    2016-06-01

    In this paper, linear algebra methods are applied to solve some problems of graph theory. For ordinary connected graphs, edge coverings and independent sets are considered. Some results concerning minimum edge covers and maximum matchings are proved with the help of linear algebraic approach. The problem of finding a maximum matching of a graph is fundamental both practically and theoretically, and has numerous applications, e.g., in computational chemistry and mathematical chemistry.

  5. Algebraic operator approach to gas kinetic models

    NASA Astrophysics Data System (ADS)

    Il'ichov, L. V.

    1997-02-01

    Some general properties of the linear Boltzmann kinetic equation are used to present it in the form ∂ tϕ = - †Âϕ with the operators Âand† possessing some nontrivial algebraic properties. When applied to the Keilson-Storer kinetic model, this method gives an example of quantum ( q-deformed) Lie algebra. This approach provides also a natural generalization of the “kangaroo model”.

  6. Three-algebra for supermembrane and two-algebra for superstring

    NASA Astrophysics Data System (ADS)

    Lee, Kanghoon; Park, Jeong-Hyuck

    2009-04-01

    While string or Yang-Mills theories are based on Lie algebra or two-algebra structure, recent studies indicate that Script M-theory may require a one higher, three-algebra structure. Here we construct a covariant action for a supermembrane in eleven dimensions, which is invariant under global supersymmetry, local fermionic symmetry and worldvolume diffeomorphism. Our action is classically on-shell equivalent to the celebrated Bergshoeff-Sezgin-Townsend action. However, the novelty is that we spell the action genuinely in terms of Nambu three-brackets: All the derivatives appear through Nambu brackets and hence it manifests the three-algebra structure. Further the double dimensional reduction of our action gives straightforwardly to a type IIA string action featuring two-algebra. Applying the same method, we also construct a covariant action for type IIB superstring, leading directly to the IKKT matrix model.

  7. Lie algebra extensions of current algebras on S3

    NASA Astrophysics Data System (ADS)

    Kori, Tosiaki; Imai, Yuto

    2015-06-01

    An affine Kac-Moody algebra is a central extension of the Lie algebra of smooth mappings from S1 to the complexification of a Lie algebra. In this paper, we shall introduce a central extension of the Lie algebra of smooth mappings from S3 to the quaternization of a Lie algebra and investigate its root space decomposition. We think this extension of current algebra might give a mathematical tool for four-dimensional conformal field theory as Kac-Moody algebras give it for two-dimensional conformal field theory.

  8. MULTIGRID HOMOGENIZATION OF HETEROGENEOUS POROUS MEDIA

    SciTech Connect

    Dendy, J.E.; Moulton, J.D.

    2000-10-01

    This is the final report of a three-year, Laboratory-Directed Research and Development (LDRD) project at the Los Alamos National Laboratory (LANL); this report, however, reports on only two years research, since this project was terminated at the end of two years in response to the reduction in funding for the LDRD Program at LANL. The numerical simulation of flow through heterogeneous porous media has become a vital tool in forecasting reservoir performance, analyzing groundwater supply and predicting the subsurface flow of contaminants. Consequently, the computational efficiency and accuracy of these simulations is paramount. However, the parameters of the underlying mathematical models (e.g., permeability, conductivity) typically exhibit severe variations over a range of significantly different length scales. Thus the numerical treatment of these problems relies on a homogenization or upscaling procedure to define an approximate coarse-scale problem that adequately captures the influence of the fine-scale structure, with a resultant compromise between the competing objectives of computational efficiency and numerical accuracy. For homogenization in models of flow through heterogeneous porous media, We have developed new, efficient, numerical, multilevel methods, that offer a significant improvement in the compromise between accuracy and efficiency. We recently combined this approach with the work of Dvorak to compute bounded estimates of the homogenized permeability for such flows and demonstrated the effectiveness of this new algorithm with numerical examples.

  9. Leibniz algebras associated with representations of filiform Lie algebras

    NASA Astrophysics Data System (ADS)

    Ayupov, Sh. A.; Camacho, L. M.; Khudoyberdiyev, A. Kh.; Omirov, B. A.

    2015-12-01

    In this paper we investigate Leibniz algebras whose quotient Lie algebra is a naturally graded filiform Lie algebra nn,1. We introduce a Fock module for the algebra nn,1 and provide classification of Leibniz algebras L whose corresponding Lie algebra L / I is the algebra nn,1 with condition that the ideal I is a Fock nn,1-module, where I is the ideal generated by squares of elements from L. We also consider Leibniz algebras with corresponding Lie algebra nn,1 and such that the action I ×nn,1 → I gives rise to a minimal faithful representation of nn,1. The classification up to isomorphism of such Leibniz algebras is given for the case of n = 4.

  10. Computer algebra and transport theory.

    SciTech Connect

    Warsa, J. S.

    2004-01-01

    Modern symbolic algebra computer software augments and complements more traditional approaches to transport theory applications in several ways. The first area is in the development and enhancement of numerical solution methods for solving the Boltzmann transport equation. Typically, special purpose computer codes are designed and written to solve specific transport problems in particular ways. Different aspects of the code are often written from scratch and the pitfalls of developing complex computer codes are numerous and well known. Software such as MAPLE and MATLAB can be used to prototype, analyze, verify and determine the suitability of numerical solution methods before a full-scale transport application is written. Once it is written, the relevant pieces of the full-scale code can be verified using the same tools I that were developed for prototyping. Another area is in the analysis of numerical solution methods or the calculation of theoretical results that might otherwise be difficult or intractable. Algebraic manipulations are done easily and without error and the software also provides a framework for any additional numerical calculations that might be needed to complete the analysis. We will discuss several applications in which we have extensively used MAPLE and MATLAB in our work. All of them involve numerical solutions of the S{sub N} transport equation. These applications encompass both of the two main areas in which we have found computer algebra software essential.

  11. Coreflections in Algebraic Quantum Logic

    NASA Astrophysics Data System (ADS)

    Jacobs, Bart; Mandemaker, Jorik

    2012-07-01

    Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.

  12. Semigroups And Computer Algebra In Discrete Structures

    NASA Astrophysics Data System (ADS)

    Bijev, G.

    2010-10-01

    Some concepts in semigroup theory are interpreted in discrete structures such as finite lattices, binary relations, and finite semilattices. An algebraic approach to the pseudoinverse generalization problem in Boolean vector spaces is used. By analogy with the linear spaces in the linear algebra semilattice homomorphisms, isomorphisms, projections on Boolean vector spaces are defined and some properties of them are investigated in detail. Maps, corresponding to them in the linear algebra, are connected with matrices and their pseudouinverse. Important properties of these maps, which are essential for solving linear systems, remain the same in the Boolean vector spaces. Stochastic experiments using the maps defined and computer algebra methods have been made for solving linear equations Ax = b. The Hamming distance between b and the projection p(b) = Ax of b is equal or close to the least possible one, if the system has no solutions.

  13. 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.

  14. Computing methods in applied sciences and engineering, VI; Proceedings of the Sixth International Symposium, Versailles, France, December 12-16, 1983

    NASA Astrophysics Data System (ADS)

    Glowinski, R.; Lions, J.-L.

    Topics related to numerical algebra and software are discussed, taking into account the use of preconditioning over irregular regions, matrix computational processes in subspaces, iterative methods for elliptic problems on regions partitioned into substructures and the biharmonic Dirichlet problem, iterative methods for discrete elliptic equations, the solution of nearly symmetric sparse linear equations, Toeplitz matrices and their applications, and the look ahead Lanczos algorithm for large unsymmetric eigenproblems. Other subjects explored are concerned with nonlinear analysis, multigrid methods, parallel computing, asymptotic expansion and homogenization, incompressible flows, compressible flows, turbulent flows, combustion, multiphase problems in oil reservoir simulations, and semiconductors. Attention is given to a finite-element solution of the semiconductor transport equations, progress in steep front calculations for porous flow, large eddy simulation, a shock-capturing finite element method, and numerical methods for the time dependent compressible Navier-Stokes equations.

  15. Developing Algebraic Thinking.

    ERIC Educational Resources Information Center

    Alejandre, Suzanne

    2002-01-01

    Presents a teaching experience that resulted in students getting to a point of full understanding of the kinesthetic activity and the algebra behind it. Includes a lesson plan for a traffic jam activity. (KHR)

  16. Algebraic integrability: a survey.

    PubMed

    Vanhaecke, Pol

    2008-03-28

    We give a concise introduction to the notion of algebraic integrability. Our exposition is based on examples and phenomena, rather than on detailed proofs of abstract theorems. We mainly focus on algebraic integrability in the sense of Adler-van Moerbeke, where the fibres of the momentum map are affine parts of Abelian varieties; as it turns out, most examples from classical mechanics are of this form. Two criteria are given for such systems (Kowalevski-Painlevé and Lyapunov) and each is illustrated in one example. We show in the case of a relatively simple example how one proves algebraic integrability, starting from the differential equations for the integrable vector field. For Hamiltonian systems that are algebraically integrable in the generalized sense, two examples are given, which illustrate the non-compact analogues of Abelian varieties which typically appear in such systems. PMID:17588863

  17. Algebraic Semantics for Narrative

    ERIC Educational Resources Information Center

    Kahn, E.

    1974-01-01

    This paper uses discussion of Edmund Spenser's "The Faerie Queene" to present a theoretical framework for explaining the semantics of narrative discourse. The algebraic theory of finite automata is used. (CK)

  18. Aprepro - Algebraic Preprocessor

    2005-08-01

    Aprepro is an algebraic preprocessor that reads a file containing both general text and algebraic, string, or conditional expressions. It interprets the expressions and outputs them to the output file along witht the general text. Aprepro contains several mathematical functions, string functions, and flow control constructs. In addition, functions are included that, with some additional files, implement a units conversion system and a material database lookup system.

  19. Geometric Algebra for Physicists

    NASA Astrophysics Data System (ADS)

    Doran, Chris; Lasenby, Anthony

    2007-11-01

    Preface; Notation; 1. Introduction; 2. Geometric algebra in two and three dimensions; 3. Classical mechanics; 4. Foundations of geometric algebra; 5. Relativity and spacetime; 6. Geometric calculus; 7. Classical electrodynamics; 8. Quantum theory and spinors; 9. Multiparticle states and quantum entanglement; 10. Geometry; 11. Further topics in calculus and group theory; 12. Lagrangian and Hamiltonian techniques; 13. Symmetry and gauge theory; 14. Gravitation; Bibliography; Index.

  20. Covariant deformed oscillator algebras

    NASA Technical Reports Server (NTRS)

    Quesne, Christiane

    1995-01-01

    The general form and associativity conditions of deformed oscillator algebras are reviewed. It is shown how the latter can be fulfilled in terms of a solution of the Yang-Baxter equation when this solution has three distinct eigenvalues and satisfies a Birman-Wenzl-Murakami condition. As an example, an SU(sub q)(n) x SU(sub q)(m)-covariant q-bosonic algebra is discussed in some detail.