Sherlock Holmes, Master Problem Solver.
ERIC Educational Resources Information Center
Ballew, Hunter
1994-01-01
Shows the connections between Sherlock Holmes's investigative methods and mathematical problem solving, including observations, characteristics of the problem solver, importance of data, questioning the obvious, learning from experience, learning from errors, and indirect proof. (MKR)
Edmondson, Amy C
2016-06-01
Companies today increasingly rely on teams that span many industries for radical innovation, especially to solve "wicked problems." So leaders have to understand how to promote collaboration when roles are uncertain, goals are shifting, expertise and organizational cultures are varied, and participants have clashing or even antagonistic perspectives. HBS professor Amy Edmondson has studied more than a dozen cross-industry innovation projects, among them the creation of a new city, a mango supply-chain transformation, and the design and construction of leading-edge buildings. She has identified the leadership practices that make successful cross-industry teams work: fostering an adaptable vision, promoting psychological safety, enabling knowledge sharing, and encouraging collaborative innovation. Though these practices are broadly familiar, their application within cross-industry teams calls for unique leadership approaches that combine flexibility, open-mindedness, humility, and fierce resolve.
NASA Astrophysics Data System (ADS)
Hintermüller, M.
2008-06-01
An output-least-squares formulation for a class of parameter identification problems for elliptic variational inequalities is considered. Based on the concept of C-stationarity an active set type solver with feasibility restoration is introduced. It is shown that the new method relates to the so-called implicit programming techniques in the context of mathematical programs with equilibrium constraints. In the discrete setting, in order to overcome the ill-posedness of the problem, the parameter of interest is discretized on a coarser mesh than the state of the system. In addition, if the parameter corresponds to the coefficient in the bilinear form of the underlying differential operator, an interior-point treatment is employed to maintain the coercivity of the elliptic operator. Moreover, the computational domain for the coefficient depends on the measurement data. The paper ends with a report on numerical tests including an application to a simplified lubrication problem in a rolling element device.
The Scientist as Problem Solver.
1989-01-01
history. or imagined history. no magic and no mystery Each step appears to proceed. if not inexorably at least plausibly from the preceding one If the...discovery process appears quite unremarkable. The problem was found in the literatue (Goodwin S paper). and it can be represented in a quite standard way by
Problem Solvers' Conceptions about Osmosis.
ERIC Educational Resources Information Center
Zuckerman, June T.
1994-01-01
Discusses the scheme and findings of a study designed to identify the conceptual knowledge used by high school students to solve a significant problem related to osmosis. Useful tips are provided to teachers to aid students in developing constructs that maximize understanding. (ZWH)
Aleph Field Solver Challenge Problem Results Summary
Hooper, Russell; Moore, Stan Gerald
2015-01-01
Aleph models continuum electrostatic and steady and transient thermal fields using a finite-element method. Much work has gone into expanding the core solver capability to support enriched modeling consisting of multiple interacting fields, special boundary conditions and two-way interfacial coupling with particles modeled using Aleph's complementary particle-in-cell capability. This report provides quantitative evidence for correct implementation of Aleph's field solver via order- of-convergence assessments on a collection of problems of increasing complexity. It is intended to provide Aleph with a pedigree and to establish a basis for confidence in results for more challenging problems important to Sandia's mission that Aleph was specifically designed to address.
Thinking Process of Naive Problem Solvers to Solve Mathematical Problems
ERIC Educational Resources Information Center
Mairing, Jackson Pasini
2017-01-01
Solving problems is not only a goal of mathematical learning. Students acquire ways of thinking, habits of persistence and curiosity, and confidence in unfamiliar situations by learning to solve problems. In fact, there were students who had difficulty in solving problems. The students were naive problem solvers. This research aimed to describe…
Experiences with linear solvers for oil reservoir simulation problems
Joubert, W.; Janardhan, R.; Biswas, D.; Carey, G.
1996-12-31
This talk will focus on practical experiences with iterative linear solver algorithms used in conjunction with Amoco Production Company`s Falcon oil reservoir simulation code. The goal of this study is to determine the best linear solver algorithms for these types of problems. The results of numerical experiments will be presented.
Problem Solvers: Solutions--Playing Basketball
ERIC Educational Resources Information Center
Smith, Jeffrey
2014-01-01
In this article, fourth grade Upper Allen Elementary School (Mechanicsburg, Pennsylvania) teacher Jeffrey Smith describes his exploration of the Playing Basketball activity. Herein he describes how he found the problem to be an effective way to review concepts associated with the measurement of elapsed time with his students. Additionally, it…
Problem Solvers: Solutions--The Inaugural Address
ERIC Educational Resources Information Center
Dause, Emily
2014-01-01
Fourth graders in Miss Dause's and Mrs. Hicks's mathematics classes at South Mountain Elementary School in Dillsburg, Pennsylvania, worked with the data from the Inauagural Address problem that was previously published published in the February 2013 issue of "Teaching Children Mathematics". This activity allowed students to showcase…
Incremental planning to control a blackboard-based problem solver
NASA Technical Reports Server (NTRS)
Durfee, E. H.; Lesser, V. R.
1987-01-01
To control problem solving activity, a planner must resolve uncertainty about which specific long-term goals (solutions) to pursue and about which sequences of actions will best achieve those goals. A planner is described that abstracts the problem solving state to recognize possible competing and compatible solutions and to roughly predict the importance and expense of developing these solutions. With this information, the planner plans sequences of problem solving activities that most efficiently resolve its uncertainty about which of the possible solutions to work toward. The planner only details actions for the near future because the results of these actions will influence how (and whether) a plan should be pursued. As problem solving proceeds, the planner adds new details to the plan incrementally, and monitors and repairs the plan to insure it achieves its goals whenever possible. Through experiments, researchers illustrate how these new mechanisms significantly improve problem solving decisions and reduce overall computation. They briefly discuss current research directions, including how these mechanisms can improve a problem solver's real-time response and can enhance cooperation in a distributed problem solving network.
Intellectual Abilities That Discriminate Good and Poor Problem Solvers.
ERIC Educational Resources Information Center
Meyer, Ruth Ann
1981-01-01
This study compared good and poor fourth-grade problem solvers on a battery of 19 "reference" tests for verbal, induction, numerical, word fluency, memory, perceptual speed, and simple visualization abilities. Results suggest verbal, numerical, and especially induction abilities are important to successful mathematical problem solving.…
Benchmarking transport solvers for fracture flow problems
NASA Astrophysics Data System (ADS)
Olkiewicz, Piotr; Dabrowski, Marcin
2015-04-01
Fracture flow may dominate in rocks with low porosity and it can accompany both industrial and natural processes. Typical examples of such processes are natural flows in crystalline rocks and industrial flows in geothermal systems or hydraulic fracturing. Fracture flow provides an important mechanism for transporting mass and energy. For example, geothermal energy is primarily transported by the flow of the heated water or steam rather than by the thermal diffusion. The geometry of the fracture network and the distribution of the mean apertures of individual fractures are the key parameters with regard to the fracture network transmissivity. Transport in fractures can occur through the combination of advection and diffusion processes like in the case of dissolved chemical components. The local distribution of the fracture aperture may play an important role for both flow and transport processes. In this work, we benchmark various numerical solvers for flow and transport processes in a single fracture in 2D and 3D. Fracture aperture distributions are generated by a number of synthetic methods. We examine a single-phase flow of an incompressible viscous Newtonian fluid in the low Reynolds number limit. Periodic boundary conditions are used and a pressure difference is imposed in the background. The velocity field is primarly found using the Stokes equations. We systematically compare the obtained velocity field to the results obtained by solving the Reynolds equation. This allows us to examine the impact of the aperture distribution on the permeability of the medium and the local velocity distribution for two different mathematical descriptions of the fracture flow. Furthermore, we analyse the impact of aperture distribution on the front characteristics such as the standard deviation and the fractal dimension for systems in 2D and 3D.
A Comparison of Stiff ODE Solvers for Astrochemical Kinetics Problems
NASA Astrophysics Data System (ADS)
Nejad, Lida A. M.
2005-09-01
The time dependent chemical rate equations arising from astrochemical kinetics problems are described by a system of stiff ordinary differential equations (ODEs). In this paper, using three astrochemical models of varying physical and computational complexity, and hence different degrees of stiffness, we present a comprehensive performance survey of a set of well-established ODE solver packages from the ODEPACK collection, namely LSODE, LSODES, VODE and VODPK. For completeness, we include results from the GEAR package in one of the test models. The results demonstrate that significant performance improvements can be obtained over GEAR which is still being used by many astrochemists by default. We show that a simple appropriate ordering of the species set results in a substantial improvement in the performance of the tested ODE solvers. The sparsity of the associated Jacobian matrix can be exploited and results using the sparse direct solver routine LSODES show an extensive reduction in CPU time without any loss in accuracy. We compare the performance and the computed abundances of one model with a 175 species set and a reduced set of 88 species, keeping all physical and chemical parameters identical with both sets.We found that the calculated abundances using two different size models agree quite well. However, with no extra computational effort and more reliable results, it is possible for the computation to be many times faster with the larger species set than the reduced set, depending on the use of solvers, the ordering and the chosen options. It is also shown that though a particular solver with certain chosen parameters may have severe difficulty or even fail to complete a run over the required integration time, another solver can easily complete the run with a wider range of control parameters and options. As a result of the superior performance of LSODES for the solution of astrochemical kinetics systems, we have tailor-made a sparse version of the VODE
Menu-Driven Solver Of Linear-Programming Problems
NASA Technical Reports Server (NTRS)
Viterna, L. A.; Ferencz, D.
1992-01-01
Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).
Navier-Stokes Solvers and Generalizations for Reacting Flow Problems
Elman, Howard C
2013-01-27
This is an overview of our accomplishments during the final term of this grant (1 September 2008 -- 30 June 2012). These fall mainly into three categories: fast algorithms for linear eigenvalue problems; solution algorithms and modeling methods for partial differential equations with uncertain coefficients; and preconditioning methods and solvers for models of computational fluid dynamics (CFD).
Problem Solvers: Problem--How Long Can You Stand?
ERIC Educational Resources Information Center
Teaching Children Mathematics, 2010
2010-01-01
Healthy lifestyles are increasingly emphasized these days. This month the authors begin a series of mathematical problems that also address physical activity. They hope that these problems offer opportunities to investigate mathematics and also reinforce the desire to lead a healthy life. In their first problem of the academic year, students…
Optical solver of combinatorial problems: nanotechnological approach.
Cohen, Eyal; Dolev, Shlomi; Frenkel, Sergey; Kryzhanovsky, Boris; Palagushkin, Alexandr; Rosenblit, Michael; Zakharov, Victor
2013-09-01
We present an optical computing system to solve NP-hard problems. As nano-optical computing is a promising venue for the next generation of computers performing parallel computations, we investigate the application of submicron, or even subwavelength, computing device designs. The system utilizes a setup of exponential sized masks with exponential space complexity produced in polynomial time preprocessing. The masks are later used to solve the problem in polynomial time. The size of the masks is reduced to nanoscaled density. Simulations were done to choose a proper design, and actual implementations show the feasibility of such a system.
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
Xu, Jinchao
2014-11-26
In this project, we carried out many studies on adaptive and parallel multilevel methods for numerical modeling for various applications, including Magnetohydrodynamics (MHD) and complex fluids. We have made significant efforts and advances in adaptive multilevel methods of the multiphysics problems: multigrid methods, adaptive finite element methods, and applications.
The Human Mind As General Problem Solver
NASA Astrophysics Data System (ADS)
Gurr, Henry
2011-10-01
Since leaving U Cal Irvine Neutrino Research, I have been a University Physics Teacher, and an Informal Researcher Of Human Functionality. My talk will share what I discovered about the best ways to learn, many of which are regularities that are to be expected from the Neuronal Network Properties announced in the publications of physicist John Joseph Hopfield. Hopfield's Model of mammalian brain-body, provides solid instructive understanding of how best Learn, Solve Problems, Live! With it we understand many otherwise puzzling features of our intellect! Examples Why 1) Analogies and metaphors powerful in class instruction, ditto poems. 2) Best learning done in physical (Hands-On) situations with tight immediate dynamical feedback such as seen in learning to ride bike, drive car, speak language, etc. 3) Some of the best learning happens in seeming random exploration, bump around, trial and error. 4) Scientific discoveries happen, with no apparent effort, at odd moments. 5) Important discoveries DEPEND on considerable frustrating effort, then Flash of Insight AHA EURIKA.
Parallel Auxiliary Space AMG Solver for $H(div)$ Problems
Kolev, Tzanio V.; Vassilevski, Panayot S.
2012-12-18
We present a family of scalable preconditioners for matrices arising in the discretization of $H(div)$ problems using the lowest order Raviart--Thomas finite elements. Our approach belongs to the class of “auxiliary space''--based methods and requires only the finite element stiffness matrix plus some minimal additional discretization information about the topology and orientation of mesh entities. Also, we provide a detailed algebraic description of the theory, parallel implementation, and different variants of this parallel auxiliary space divergence solver (ADS) and discuss its relations to the Hiptmair--Xu (HX) auxiliary space decomposition of $H(div)$ [SIAM J. Numer. Anal., 45 (2007), pp. 2483--2509] and to the auxiliary space Maxwell solver AMS [J. Comput. Math., 27 (2009), pp. 604--623]. Finally, an extensive set of numerical experiments demonstrates the robustness and scalability of our implementation on large-scale $H(div)$ problems with large jumps in the material coefficients.
Parallel Solver for H(div) Problems Using Hybridization and AMG
Lee, Chak S.; Vassilevski, Panayot S.
2016-01-15
In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examined through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.
Mathematical Tasks without Words and Word Problems: Perceptions of Reluctant Problem Solvers
ERIC Educational Resources Information Center
Holbert, Sydney Margaret
2013-01-01
This qualitative research study used a multiple, holistic case study approach (Yin, 2009) to explore the perceptions of reluctant problem solvers related to mathematical tasks without words and word problems. Participants were given a choice of working a mathematical task without words or a word problem during four problem-solving sessions. Data…
Parallel satellite orbital situational problems solver for space missions design and control
NASA Astrophysics Data System (ADS)
Atanassov, Atanas Marinov
2016-11-01
Solving different scientific problems for space applications demands implementation of observations, measurements or realization of active experiments during time intervals in which specific geometric and physical conditions are fulfilled. The solving of situational problems for determination of these time intervals when the satellite instruments work optimally is a very important part of all activities on every stage of preparation and realization of space missions. The elaboration of universal, flexible and robust approach for situation analysis, which is easily portable toward new satellite missions, is significant for reduction of missions' preparation times and costs. Every situation problem could be based on one or more situation conditions. Simultaneously solving different kinds of situation problems based on different number and types of situational conditions, each one of them satisfied on different segments of satellite orbit requires irregular calculations. Three formal approaches are presented. First one is related to situation problems description that allows achieving flexibility in situation problem assembling and presentation in computer memory. The second formal approach is connected with developing of situation problem solver organized as processor that executes specific code for every particular situational condition. The third formal approach is related to solver parallelization utilizing threads and dynamic scheduling based on "pool of threads" abstraction and ensures a good load balance. The developed situation problems solver is intended for incorporation in the frames of multi-physics multi-satellite space mission's design and simulation tools.
Teaching problem solving: Don't forget the problem solver(s)
NASA Astrophysics Data System (ADS)
Ranade, Saidas M.; Corrales, Angela
2013-05-01
The importance of intrapersonal and interpersonal intelligences has long been known but educators have debated whether to and how to incorporate those topics in an already crowded engineering curriculum. In 2010, the authors used the classroom as a laboratory to observe the usefulness of including selected case studies and exercises from the fields of neurology, artificial intelligence, cognitive sciences and social psychology in a new problem-solving course. To further validate their initial findings, in 2012, the authors conducted an online survey of engineering students and engineers. The main conclusion is that engineering students will benefit from learning more about the impact of emotions, culture, diversity and cognitive biases when solving problems. Specifically, the work shows that an augmented problem-solving curriculum needs to include lessons on labelling emotions and cognitive biases, 'evidence-based' data on the importance of culture and diversity and additional practice on estimating conditional probability.
Problem Solvers: Problem--Jesse's Train
ERIC Educational Resources Information Center
James, Julie; Steimle, Alice
2014-01-01
Persevering in problem solving and constructing and critiquing mathematical arguments are some of the mathematical practices included in the Common Core State Standards for Mathematics (CCSSI 2010). To solve unfamiliar problems, students must make sense of the situation and apply current knowledge. Teachers can present such opportunities by…
Polyurethanes: versatile materials and sustainable problem solvers for today's challenges.
Engels, Hans-Wilhelm; Pirkl, Hans-Georg; Albers, Reinhard; Albach, Rolf W; Krause, Jens; Hoffmann, Andreas; Casselmann, Holger; Dormish, Jeff
2013-09-02
Polyurethanes are the only class of polymers that display thermoplastic, elastomeric, and thermoset behavior depending on their chemical and morphological makeup. In addition to compact polyurethanes, foamed variations in particular are very widespread, and they achieve their targeted properties at very low weights. The simple production of sandwich structures and material composites in a single processing step is a key advantage of polyurethane technology. The requirement of energy and resource efficiency increasingly demands lightweight structures. Polyurethanes can serve this requirement by acting as matrix materials or as flexible adhesives for composites. Polyurethanes are indispensable when it comes to high-quality decorative coatings or maintaining the value of numerous objects. They are extremely adaptable and sustainable problem solvers for today's challenges facing our society, all of which impose special demands on materials.
An optimal iterative solver for the Stokes problem
Wathen, A.; Silvester, D.
1994-12-31
Discretisations of the classical Stokes Problem for slow viscous incompressible flow gives rise to systems of equations in matrix form for the velocity u and the pressure p, where the coefficient matrix is symmetric but necessarily indefinite. The square submatrix A is symmetric and positive definite and represents a discrete (vector) Laplacian and the submatrix C may be the zero matrix or more generally will be symmetric positive semi-definite. For `stabilised` discretisations (C {ne} 0) and descretisations which are inherently `stable` (C = 0) and so do not admit spurious pressure components even as the mesh size, h approaches zero, the Schur compliment of the matrix has spectral condition number independent of h (given also that B is bounded). Here the authors will show how this property together with a multigrid preconditioner only for the Laplacian block A yields an optimal solver for the Stokes problem through use of the Minimum Residual iteration. That is, combining Minimum Residual iteration for the matrix equation with a block preconditioner which comprises a small number of multigrid V-cycles for the Laplacian block A together with a simple diagonal scaling block provides an iterative solution procedure for which the computational work grows only linearly with the problem size.
NASA Astrophysics Data System (ADS)
Mena, Andres; Ferrero, Jose M.; Rodriguez Matas, Jose F.
2015-11-01
Solving the electric activity of the heart possess a big challenge, not only because of the structural complexities inherent to the heart tissue, but also because of the complex electric behaviour of the cardiac cells. The multi-scale nature of the electrophysiology problem makes difficult its numerical solution, requiring temporal and spatial resolutions of 0.1 ms and 0.2 mm respectively for accurate simulations, leading to models with millions degrees of freedom that need to be solved for thousand time steps. Solution of this problem requires the use of algorithms with higher level of parallelism in multi-core platforms. In this regard the newer programmable graphic processing units (GPU) has become a valid alternative due to their tremendous computational horsepower. This paper presents results obtained with a novel electrophysiology simulation software entirely developed in Compute Unified Device Architecture (CUDA). The software implements fully explicit and semi-implicit solvers for the monodomain model, using operator splitting. Performance is compared with classical multi-core MPI based solvers operating on dedicated high-performance computer clusters. Results obtained with the GPU based solver show enormous potential for this technology with accelerations over 50 × for three-dimensional problems.
Evaluation of linear solvers for oil reservoir simulation problems. Part 2: The fully implicit case
Joubert, W.; Janardhan, R.
1997-12-01
A previous paper [Joubert/Biswas 1997] contained investigations of linear solver performance for matrices arising from Amoco`s Falcon parallel oil reservoir simulation code using the IMPES formulation (implicit pressure, explicit saturation). In this companion paper, similar issues are explored for linear solvers applied to matrices arising from more difficult fully implicit problems. The results of numerical experiments are given.
Cognitive Distance Learning Problem Solver Reduces Search Cost through Learning Processes
NASA Astrophysics Data System (ADS)
Yamakawa, Hiroshi; Miyamoto, Yuji; Baba, Takayuki; Okada, Hiroyuki
Our proposed cognitive distance learning problem solver generates sequence of actions from initial state to goal states in problem state space. This problem solver learns cognitive distance (path cost) of arbitrary combination of two states. Action generation at each state is selection of next state that has minimum cognitive distance to the goal, like Q-learning agent. In this paper, first, we show that our proposed method reduces search cost than conventional search method by analytical simulation in spherical state space. Second, we show that an average search cost is more reduced more the prior learning term is long and our problem solver is familiar to the environment, by a computer simulation in a tile world state space. Third, we showed that proposed problem solver is superior to the reinforcement learning techniques when goal is changed by a computer simulation. Forth, we found that our simulation result consist with psychological experimental results.
Fast solvers for optimal control problems from pattern formation
NASA Astrophysics Data System (ADS)
Stoll, Martin; Pearson, John W.; Maini, Philip K.
2016-01-01
The modeling of pattern formation in biological systems using various models of reaction-diffusion type has been an active research topic for many years. We here look at a parameter identification (or PDE-constrained optimization) problem where the Schnakenberg and Gierer-Meinhardt equations, two well-known pattern formation models, form the constraints to an objective function. Our main focus is on the efficient solution of the associated nonlinear programming problems via a Lagrange-Newton scheme. In particular we focus on the fast and robust solution of the resulting large linear systems, which are of saddle point form. We illustrate this by considering several two- and three-dimensional setups for both models. Additionally, we discuss an image-driven formulation that allows us to identify parameters of the model to match an observed quantity obtained from an image.
A Riemann solver based on a global existence proof for the Riemann problem
NASA Technical Reports Server (NTRS)
Dutt, P.
1986-01-01
Godunov's method and several other methods for computing solutions to the equations of gas dynamics use Riemann solvers to resolve discontinuities at the interface between cells. A new method is proposed here for solving the Riemann problem based on a global existence proof for the solution to the Riemann problem. The method is found to be very reliable and computationally efficient.
An accurate predictor-corrector HOC solver for the two dimensional Riemann problem of gas dynamics
NASA Astrophysics Data System (ADS)
Gogoi, Bidyut B.
2016-10-01
The work in the present manuscript is concerned with the simulation of twodimensional (2D) Riemann problem of gas dynamics. We extend our recently developed higher order compact (HOC) method from one-dimensional (1D) to 2D solver and simulate the problem on a square geometry with different initial conditions. The method is fourth order accurate in space and second order accurate in time. We then compare our results with the available benchmark results. The comparison shows an excellent agreement of our results with the existing ones in the literature. Being a finite difference solver, it is quite straight-forward and simple.
Black box multigrid solver for definite and indefinite problems
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.
A Comparison of the Intellectual Abilities of Good and Poor Problem Solvers: An Exploratory Study.
ERIC Educational Resources Information Center
Meyer, Ruth Ann
This study examined a selected sample of fourth-grade students who had been previously identified as good or poor problem solvers. The pupils were compared on variables considered as "reference tests" for Verbal, Induction, Numerical, Word Fluency, Memory, Spatial Visualization, and Perceptual Speed abilities. The data were compiled to…
Equity and Access: All Students Are Mathematical Problem Solvers
ERIC Educational Resources Information Center
Franz, Dana Pompkyl; Ivy, Jessica; McKissick, Bethany R.
2016-01-01
Often mathematical instruction for students with disabilities, especially those with learning disabilities, includes an overabundance of instruction on mathematical computation and does not include high-quality instruction on mathematical reasoning and problem solving. In fact, it is a common misconception that students with learning disabilities…
An Efficient Solver of Elasto-plastic Problems in Mechanics Based on TFETI Domain Decomposition
NASA Astrophysics Data System (ADS)
Čermák, M.; Kozubek, T.; Markopoulos, A.
2011-09-01
This paper illustrates how to implement efficiently solvers for elasto-plastic problems. We consider the time step problems formulated by nonlinear variational equations in terms of displacements. To treat nonlinearity and nonsmoothnes we use semismooth Newton method. In each Newton iteration we have to solve linear system of algebraic equations and for its numerical solution we use TFETI domain decomposition method. In our benchmark we demonstrate our approach on von Mises plasticity with isotropic hardening using the return mapping concept.
Schmidhuber, Jürgen
2013-01-01
Most of computer science focuses on automatically solving given computational problems. I focus on automatically inventing or discovering problems in a way inspired by the playful behavior of animals and humans, to train a more and more general problem solver from scratch in an unsupervised fashion. Consider the infinite set of all computable descriptions of tasks with possibly computable solutions. Given a general problem-solving architecture, at any given time, the novel algorithmic framework PowerPlay (Schmidhuber, 2011) searches the space of possible pairs of new tasks and modifications of the current problem solver, until it finds a more powerful problem solver that provably solves all previously learned tasks plus the new one, while the unmodified predecessor does not. Newly invented tasks may require to achieve a wow-effect by making previously learned skills more efficient such that they require less time and space. New skills may (partially) re-use previously learned skills. The greedy search of typical PowerPlay variants uses time-optimal program search to order candidate pairs of tasks and solver modifications by their conditional computational (time and space) complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. This biases the search toward pairs that can be described compactly and validated quickly. The computational costs of validating new tasks need not grow with task repertoire size. Standard problem solver architectures of personal computers or neural networks tend to generalize by solving numerous tasks outside the self-invented training set; PowerPlay’s ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Gödel’s sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing
ERIC Educational Resources Information Center
Starkman, Neal
2007-01-01
US students continue to lag behind the rest of the world in science, technology, engineering, and math--taken together, STEM. Even as the US falls further and further behind other countries in these four critical academic areas, not everyone sees it as a crisis. Fortunately, there are those who do. One organization out front on the issue is,…
NASA Technical Reports Server (NTRS)
Voigt, Kerstin
1992-01-01
We present MENDER, a knowledge based system that implements software design techniques that are specialized to automatically compile generate-and-patch problem solvers that satisfy global resource assignments problems. We provide empirical evidence of the superior performance of generate-and-patch over generate-and-test: even with constrained generation, for a global constraint in the domain of '2D-floorplanning'. For a second constraint in '2D-floorplanning' we show that even when it is possible to incorporate the constraint into a constrained generator, a generate-and-patch problem solver may satisfy the constraint more rapidly. We also briefly summarize how an extended version of our system applies to a constraint in the domain of 'multiprocessor scheduling'.
Evaluation of parallel direct sparse linear solvers in electromagnetic geophysical problems
NASA Astrophysics Data System (ADS)
Puzyrev, Vladimir; Koric, Seid; Wilkin, Scott
2016-04-01
High performance computing is absolutely necessary for large-scale geophysical simulations. In order to obtain a realistic image of a geologically complex area, industrial surveys collect vast amounts of data making the computational cost extremely high for the subsequent simulations. A major computational bottleneck of modeling and inversion algorithms is solving the large sparse systems of linear ill-conditioned equations in complex domains with multiple right hand sides. Recently, parallel direct solvers have been successfully applied to multi-source seismic and electromagnetic problems. These methods are robust and exhibit good performance, but often require large amounts of memory and have limited scalability. In this paper, we evaluate modern direct solvers on large-scale modeling examples that previously were considered unachievable with these methods. Performance and scalability tests utilizing up to 65,536 cores on the Blue Waters supercomputer clearly illustrate the robustness, efficiency and competitiveness of direct solvers compared to iterative techniques. Wide use of direct methods utilizing modern parallel architectures will allow modeling tools to accurately support multi-source surveys and 3D data acquisition geometries, thus promoting a more efficient use of the electromagnetic methods in geophysics.
Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report
Saad, Yousef
2014-01-16
The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the
Second-kind integral solvers for TE and TM problems of diffraction by open arcs
NASA Astrophysics Data System (ADS)
Bruno, Oscar P.; Lintner, StéPhane K.
2012-12-01
We present a novel approach for the numerical solution of problems of diffraction by open arcs in two dimensional space. Our methodology relies on composition of weighted versions of the classical integral operators associated with the Dirichlet and Neumann problems (TE and TM polarizations, respectively) together with a generalization to the open-arc case of the well known closed-surface Calderón formulae. When used in conjunction with spectrally accurate discretization rules and Krylov-subspace linear algebra solvers such as GMRES, the new second-kind TE and TM formulations for open arcs produce results of high accuracy in small numbers of iterations—for low and high frequencies alike.
Composing Problem Solvers for Simulation Experimentation: A Case Study on Steady State Estimation
Leye, Stefan; Ewald, Roland; Uhrmacher, Adelinde M.
2014-01-01
Simulation experiments involve various sub-tasks, e.g., parameter optimization, simulation execution, or output data analysis. Many algorithms can be applied to such tasks, but their performance depends on the given problem. Steady state estimation in systems biology is a typical example for this: several estimators have been proposed, each with its own (dis-)advantages. Experimenters, therefore, must choose from the available options, even though they may not be aware of the consequences. To support those users, we propose a general scheme to aggregate such algorithms to so-called synthetic problem solvers, which exploit algorithm differences to improve overall performance. Our approach subsumes various aggregation mechanisms, supports automatic configuration from training data (e.g., via ensemble learning or portfolio selection), and extends the plugin system of the open source modeling and simulation framework James II. We show the benefits of our approach by applying it to steady state estimation for cell-biological models. PMID:24705453
High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems.
Mahadevan, Vijay S; Merzari, Elia; Tautges, Timothy; Jain, Rajeev; Obabko, Aleksandr; Smith, Michael; Fischer, Paul
2014-08-06
An integrated multi-physics simulation capability for the design and analysis of current and future nuclear reactor models is being investigated, to tightly couple neutron transport and thermal-hydraulics physics under the SHARP framework. Over several years, high-fidelity, validated mono-physics solvers with proven scalability on petascale architectures have been developed independently. Based on a unified component-based architecture, these existing codes can be coupled with a mesh-data backplane and a flexible coupling-strategy-based driver suite to produce a viable tool for analysts. The goal of the SHARP framework is to perform fully resolved coupled physics analysis of a reactor on heterogeneous geometry, in order to reduce the overall numerical uncertainty while leveraging available computational resources. The coupling methodology and software interfaces of the framework are presented, along with verification studies on two representative fast sodium-cooled reactor demonstration problems to prove the usability of the SHARP framework.
High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems
Mahadevan, Vijay S.; Merzari, Elia; Tautges, Timothy; Jain, Rajeev; Obabko, Aleksandr; Smith, Michael; Fischer, Paul
2014-01-01
An integrated multi-physics simulation capability for the design and analysis of current and future nuclear reactor models is being investigated, to tightly couple neutron transport and thermal-hydraulics physics under the SHARP framework. Over several years, high-fidelity, validated mono-physics solvers with proven scalability on petascale architectures have been developed independently. Based on a unified component-based architecture, these existing codes can be coupled with a mesh-data backplane and a flexible coupling-strategy-based driver suite to produce a viable tool for analysts. The goal of the SHARP framework is to perform fully resolved coupled physics analysis of a reactor on heterogeneous geometry, in order to reduce the overall numerical uncertainty while leveraging available computational resources. The coupling methodology and software interfaces of the framework are presented, along with verification studies on two representative fast sodium-cooled reactor demonstration problems to prove the usability of the SHARP framework. PMID:24982250
Thevenot, Catherine; Barrouillet, Pierre; Castel, Caroline; Jimenez, Sonia
2011-11-01
This paper addresses the relationship between basic numerical processes and higher level numerical abilities in normal achieving adults. In the first experiment we inferred the elementary numerical abilities of university students from the time they needed to encode numerical information involved in complex additions and subtractions. We interpreted the shorter encoding times in good arithmetic problem solvers as revealing clearer or more accessible representations of numbers. The second experiment shows that these results cannot be due to the fact that lower skilled individuals experience more maths anxiety or put more cognitive efforts into calculations than do higher skilled individuals. Moreover, the third experiment involving non-numerical information supports the hypothesis that these interindividual differences are specific to number processing. The possible causal relationships between basic and higher level numerical abilities are discussed.
Larger groups of passerines are more efficient problem solvers in the wild.
Morand-Ferron, Julie; Quinn, John L
2011-09-20
Group living commonly helps organisms face challenging environmental conditions. Although a known phenomenon in humans, recent findings suggest that a benefit of group living in animals generally might be increased innovative problem-solving efficiency. This benefit has never been demonstrated in a natural context, however, and the mechanisms underlying improved efficiency are largely unknown. We examined the problem-solving performance of great and blue tits at automated devices and found that efficiency increased with flock size. This relationship held when restricting the analysis to naive individuals, demonstrating that larger groups increased innovation efficiency. In addition to this effect of naive flock size, the presence of at least one experienced bird increased the frequency of solving, and larger flocks were more likely to contain experienced birds. These findings provide empirical evidence for the "pool of competence" hypothesis in nonhuman animals. The probability of success also differed consistently between individuals, a necessary condition for the pool of competence hypothesis. Solvers had a higher probability of success when foraging with a larger number of companions and when using devices located near rather than further from protective tree cover, suggesting a role for reduced predation risk on problem-solving efficiency. In contrast to traditional group living theory, individuals joining larger flocks benefited from a higher seed intake, suggesting that group living facilitated exploitation of a novel food source through improved problem-solving efficiency. Together our results suggest that both ecological and social factors, through reduced predation risk and increased pool of competence, mediate innovation in natural populations.
Problem Solvers: Problem--Light It up! and Solutions--Flags by the Numbers
ERIC Educational Resources Information Center
Hall, Shaun
2009-01-01
A simple circuit is created by the continuous flow of electricity through conductors (copper wires) from a source of electrical energy (batteries). "Completing a circuit" means that electricity flows from the energy source through the circuit and, in the case described in this month's problem, causes the light bulb tolight up. The presence of…
NASA Astrophysics Data System (ADS)
Kaus, Boris; Popov, Anton; Püsök, Adina
2014-05-01
In order to solve high-resolution 3D problems in computational geodynamics it is crucial to use multigrid solvers in combination with parallel computers. A number of approaches are currently in use in the community, which can broadly be divided into coupled and decoupled approaches. In the decoupled approach, an algebraic or geometric multigrid method is used as a preconditioner for the velocity equations only while an iterative approach such as Schur complement reduction used to solve the outer velocity-pressure equations. In the coupled approach, on the other hand, a multigrid approach is applied to both the velocity and pressure equations. The coupled multigrid approaches are typically employed in combination with staggered finite difference discretizations, whereas the decoupled approach is the method of choice in many of the existing finite element codes. Yet, it is unclear whether there are differences in speed between the two approaches, and if so, how this depends on the initial guess. Here, we implemented both approaches in combination with a staggered finite difference discretization and test the robustness of the two approaches with respect to large jumps in viscosity contrast, as well as their computational efficiency as a function of the initial guess. Acknowledgements. Funding was provided by the European Research Council under the European Community's Seventh Framework Program (FP7/2007-2013) / ERC Grant agreement #258830. Numerical computations have been performed on JUQUEEN of the Jülich high-performance computing center.
NASA Astrophysics Data System (ADS)
Isakari, Hiroshi; Kondo, Toyohiro; Takahashi, Toru; Matsumoto, Toshiro
2017-03-01
This paper presents a structural optimisation method in three-dimensional acoustic-elastic coupled problems. The proposed optimisation method finds an optimal allocation of elastic materials which reduces the sound level on some fixed observation points. In the process of the optimisation, configuration of the elastic materials is expressed with a level set function, and the distribution of the level set function is iteratively updated with the help of the topological derivative. The topological derivative is associated with state and adjoint variables which are the solutions of the acoustic-elastic coupled problems. In this paper, the acoustic-elastic coupled problems are solved by a BEM-FEM coupled solver, in which the fast multipole method (FMM) and a multi-frontal solver for sparse matrices are efficiently combined. Along with the detailed formulations for the topological derivative and the BEM-FEM coupled solver, we present some numerical examples of optimal designs of elastic sound scatterer to manipulate sound waves, from which we confirm the effectiveness of the present method.
A fast parallel solver for the forward problem in electrical impedance tomography.
Jehl, Markus; Dedner, Andreas; Betcke, Timo; Aristovich, Kirill; Klöfkorn, Robert; Holder, David
2015-01-01
Electrical impedance tomography (EIT) is a noninvasive imaging modality, where imperceptible currents are applied to the skin and the resulting surface voltages are measured. It has the potential to distinguish between ischaemic and haemorrhagic stroke with a portable and inexpensive device. The image reconstruction relies on an accurate forward model of the experimental setup. Because of the relatively small signal in stroke EIT, the finite-element modeling requires meshes of more than 10 million elements. To study the requirements in the forward modeling in EIT and also to reduce the time for experimental image acquisition, it is necessary to reduce the run time of the forward computation. We show the implementation of a parallel forward solver for EIT using the Dune-Fem C++ library and demonstrate its performance on many CPU's of a computer cluster. For a typical EIT application a direct solver was significantly slower and not an alternative to iterative solvers with multigrid preconditioning. With this new solver, we can compute the forward solutions and the Jacobian matrix of a typical EIT application with 30 electrodes on a 15-million element mesh in less than 15 min. This makes it a valuable tool for simulation studies and EIT applications with high precision requirements. It is freely available for download.
NASA Astrophysics Data System (ADS)
Reimer, Ashton S.; Cheviakov, Alexei F.
2013-03-01
A Matlab-based finite-difference numerical solver for the Poisson equation for a rectangle and a disk in two dimensions, and a spherical domain in three dimensions, is presented. The solver is optimized for handling an arbitrary combination of Dirichlet and Neumann boundary conditions, and allows for full user control of mesh refinement. The solver routines utilize effective and parallelized sparse vector and matrix operations. Computations exhibit high speeds, numerical stability with respect to mesh size and mesh refinement, and acceptable error values even on desktop computers. Catalogue identifier: AENQ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENQ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License v3.0 No. of lines in distributed program, including test data, etc.: 102793 No. of bytes in distributed program, including test data, etc.: 369378 Distribution format: tar.gz Programming language: Matlab 2010a. Computer: PC, Macintosh. Operating system: Windows, OSX, Linux. RAM: 8 GB (8, 589, 934, 592 bytes) Classification: 4.3. Nature of problem: To solve the Poisson problem in a standard domain with “patchy surface”-type (strongly heterogeneous) Neumann/Dirichlet boundary conditions. Solution method: Finite difference with mesh refinement. Restrictions: Spherical domain in 3D; rectangular domain or a disk in 2D. Unusual features: Choice between mldivide/iterative solver for the solution of large system of linear algebraic equations that arise. Full user control of Neumann/Dirichlet boundary conditions and mesh refinement. Running time: Depending on the number of points taken and the geometry of the domain, the routine may take from less than a second to several hours to execute.
NASA Astrophysics Data System (ADS)
Bruno, Oscar P.; Lintner, Stéphane K.
2013-11-01
We present a novel methodology for the numerical solution of problems of diffraction by infinitely thin screens in three-dimensional space. Our approach relies on new integral formulations as well as associated high-order quadrature rules. The new integral formulations involve weighted versions of the classical integral operators related to the thin-screen Dirichlet and Neumann problems as well as a generalization to the open-surface problem of the classical Calderón formulae. The high-order quadrature rules we introduce for these operators, in turn, resolve the multiple Green function and edge singularities (which occur at arbitrarily close distances from each other, and which include weakly singular as well as hypersingular kernels) and thus give rise to super-algebraically fast convergence as the discretization sizes are increased. When used in conjunction with Krylov-subspace linear algebra solvers such as GMRES, the resulting solvers produce results of high accuracy in small numbers of iterations for low and high frequencies alike. We demonstrate our methodology with a variety of numerical results for screen and aperture problems at high frequencies-including simulation of classical experiments such as the diffraction by a circular disc (featuring in particular the famous Poisson spot), evaluation of interference fringes resulting from diffraction across two nearby circular apertures, as well as solution of problems of scattering by more complex geometries consisting of multiple scatterers and cavities.
Bruno, Oscar P. Lintner, Stéphane K.
2013-11-01
We present a novel methodology for the numerical solution of problems of diffraction by infinitely thin screens in three-dimensional space. Our approach relies on new integral formulations as well as associated high-order quadrature rules. The new integral formulations involve weighted versions of the classical integral operators related to the thin-screen Dirichlet and Neumann problems as well as a generalization to the open-surface problem of the classical Calderón formulae. The high-order quadrature rules we introduce for these operators, in turn, resolve the multiple Green function and edge singularities (which occur at arbitrarily close distances from each other, and which include weakly singular as well as hypersingular kernels) and thus give rise to super-algebraically fast convergence as the discretization sizes are increased. When used in conjunction with Krylov-subspace linear algebra solvers such as GMRES, the resulting solvers produce results of high accuracy in small numbers of iterations for low and high frequencies alike. We demonstrate our methodology with a variety of numerical results for screen and aperture problems at high frequencies—including simulation of classical experiments such as the diffraction by a circular disc (featuring in particular the famous Poisson spot), evaluation of interference fringes resulting from diffraction across two nearby circular apertures, as well as solution of problems of scattering by more complex geometries consisting of multiple scatterers and cavities.
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
An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems
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.
Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems
Zheng, Bin; Chen, Luoping; Hu, Xiaozhe; Chen, Long; Nochetto, Ricardo H.; Xu, Jinchao
2016-03-05
In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigate the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.
NASA Astrophysics Data System (ADS)
Contarino, Christian; Toro, Eleuterio F.; Montecinos, Gino I.; Borsche, Raul; Kall, Jochen
2016-06-01
In this paper we design a new implicit solver for the Junction-Generalized Riemann Problem (J-GRP), which is based on a recently proposed implicit method for solving the Generalized Riemann Problem (GRP) for systems of hyperbolic balance laws. We use the new J-GRP solver to construct an ADER scheme that is globally explicit, locally implicit and with no theoretical accuracy barrier, in both space and time. The resulting ADER scheme is able to deal with stiff source terms and can be applied to non-linear systems of hyperbolic balance laws in domains consisting on networks of one-dimensional sub-domains. In this paper we specifically apply the numerical techniques to networks of blood vessels. We report on a test problem with exact solution for a simplified network of three vessels meeting at a single junction, which is then used to carry out a systematic convergence rate study of the proposed high-order numerical methods. Schemes up to fifth order of accuracy in space and time are implemented and tested. We then show the ability of the ADER scheme to deal with stiff sources through a numerical simulation in a network of vessels. An application to a physical test problem consisting of a network of 37 compliant silicon tubes (arteries) and 21 junctions, reveals that it is imperative to use high-order methods at junctions, in order to preserve the desired high order of accuracy in the full computational domain. For example, it is demonstrated that a second-order method throughout, gives comparable results to a method that is fourth order in the interior of the domain and first order at junctions.
NASA Astrophysics Data System (ADS)
Seth, Priyanka; Krivenko, Igor; Ferrero, Michel; Parcollet, Olivier
2016-03-01
We present TRIQS/CTHYB, a state-of-the art open-source implementation of the continuous-time hybridisation expansion quantum impurity solver of the TRIQS package. This code is mainly designed to be used with the TRIQS library in order to solve the self-consistent quantum impurity problem in a multi-orbital dynamical mean field theory approach to strongly-correlated electrons, in particular in the context of realistic electronic structure calculations. It is implemented in C++ for efficiency and is provided with a high-level Python interface. The code ships with a new partitioning algorithm that divides the local Hilbert space without any user knowledge of the symmetries and quantum numbers of the Hamiltonian. Furthermore, we implement higher-order configuration moves and show that such moves are necessary to ensure ergodicity of the Monte Carlo in common Hamiltonians even without symmetry-breaking.
Bakhos, Tania; Saibaba, Arvind K.; Kitanidis, Peter K.
2015-10-15
We consider the problem of estimating parameters in large-scale weakly nonlinear inverse problems for which the underlying governing equations is a linear, time-dependent, parabolic partial differential equation. A major challenge in solving these inverse problems using Newton-type methods is the computational cost associated with solving the forward problem and with repeated construction of the Jacobian, which represents the sensitivity of the measurements to the unknown parameters. Forming the Jacobian can be prohibitively expensive because it requires repeated solutions of the forward and adjoint time-dependent parabolic partial differential equations corresponding to multiple sources and receivers. We propose an efficient method based on a Laplace transform-based exponential time integrator combined with a flexible Krylov subspace approach to solve the resulting shifted systems of equations efficiently. Our proposed solver speeds up the computation of the forward and adjoint problems, thus yielding significant speedup in total inversion time. We consider an application from Transient Hydraulic Tomography (THT), which is an imaging technique to estimate hydraulic parameters related to the subsurface from pressure measurements obtained by a series of pumping tests. The algorithms discussed are applied to a synthetic example taken from THT to demonstrate the resulting computational gains of this proposed method.
Training Tomorrow's Environmental Problem Solvers: An Integrative Approach to Graduate Education
ERIC Educational Resources Information Center
Moslemi, Jennifer M.; Capps, Krista A.; Johnson, Mark S.; Maul, Jude; McIntyre, Peter B.; Melvin, April M.; Vadas, Timothy M.; Vallano, Dena M.; Watkins, James M.; Weiss, Marissa
2009-01-01
Environmental problems are generally complex and blind to disciplinary boundaries. Efforts to devise long-term solutions require collaborative research that integrates knowledge across historically disparate fields, yet the traditional model for training new scientists emphasizes personal independence and disciplinary focus. Growing awareness of…
An FC-based spectral solver for elastodynamic problems in general three-dimensional domains
NASA Astrophysics Data System (ADS)
Amlani, Faisal; Bruno, Oscar P.
2016-02-01
This paper presents a spectral numerical algorithm for the solution of elastodynamics problems in general three-dimensional domains. Based on a recently introduced "Fourier continuation" (FC) methodology for accurate Fourier expansion of non-periodic functions, the proposed approach possesses a number of appealing properties: it yields results that are essentially free of dispersion errors, it entails mild CFL constraints, it runs at a cost that scales linearly with the discretization sizes, and it lends itself easily to efficient parallelization in distributed-memory computing clusters. The proposed algorithm is demonstrated in this paper by means of a number of applications to problems of isotropic elastodynamics that arise in the fields of materials science and seismology. These examples suggest that the new approach can yield solutions within a prescribed error tolerance by means of significantly smaller discretizations and shorter computing times than those required by other methods.
NASA Technical Reports Server (NTRS)
Keyes, David E.; Smooke, Mitchell D.
1987-01-01
A parallelized finite difference code based on the Newton method for systems of nonlinear elliptic boundary value problems in two dimensions is analyzed in terms of computational complexity and parallel efficiency. An approximate cost function depending on 15 dimensionless parameters is derived for algorithms based on stripwise and boxwise decompositions of the domain and a one-to-one assignment of the strip or box subdomains to processors. The sensitivity of the cost functions to the parameters is explored in regions of parameter space corresponding to model small-order systems with inexpensive function evaluations and also a coupled system of nineteen equations with very expensive function evaluations. The algorithm was implemented on the Intel Hypercube, and some experimental results for the model problems with stripwise decompositions are presented and compared with the theory. In the context of computational combustion problems, multiprocessors of either message-passing or shared-memory type may be employed with stripwise decompositions to realize speedup of O(n), where n is mesh resolution in one direction, for reasonable n.
Parallel Multigrid Equation Solver
Adams, Mark
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.
Boosting Stochastic Problem Solvers Through Online Self-Analysis of Performance
2003-07-21
locally optimal peek is reached and then 19 Figure 2.2: Example of a local search algorithm for a four city TSP: an initial state modified by a sequence of...will be discussed in detail later in a specific problem domain context. Since each iteration of a hill-climbing search finds a locally optimal peek in...last t steps. This wandering around while disallowing some moves is a very aggressive way of avoiding local optima . For example, consider a case
Inverse transport problem solvers based on regularized and compressive sensing techniques
Cheng, Y.; Cao, L.; Wu, H.; Zhang, H.
2012-07-01
According to the direct exposure measurements from flash radiographic image, regularized-based method and compressive sensing (CS)-based method for inverse transport equation are presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. With a large number of measurements, least-square method is utilized to complete the reconstruction. Owing to the ill-posedness of the inverse problems, regularized algorithm is employed. Tikhonov method is applied with an appropriate posterior regularization parameter to get a meaningful solution. However, it's always very costly to obtain enough measurements. With limited measurements, CS sparse reconstruction technique Orthogonal Matching Pursuit (OMP) is applied to obtain the sparse coefficients by solving an optimization problem. This paper constructs and takes the forward projection matrix rather than Gauss matrix as measurement matrix. In the CS-based algorithm, Fourier expansion and wavelet expansion are adopted to convert an underdetermined system to a well-posed system. Simulations and numerical results of regularized method with appropriate regularization parameter and that of CS-based agree well with the reference value, furthermore, both methods avoid amplifying the noise. (authors)
NASA Astrophysics Data System (ADS)
Mitchell, Lawrence; Müller, Eike Hermann
2016-12-01
The implementation of efficient multigrid preconditioners for elliptic partial differential equations (PDEs) is a challenge due to the complexity of the resulting algorithms and corresponding computer code. For sophisticated (mixed) finite element discretisations on unstructured grids an efficient implementation can be very time consuming and requires the programmer to have in-depth knowledge of the mathematical theory, parallel computing and optimisation techniques on manycore CPUs. In this paper we show how the development of bespoke multigrid preconditioners can be simplified significantly by using a framework which allows the expression of the each component of the algorithm at the correct abstraction level. Our approach (1) allows the expression of the finite element problem in a language which is close to the mathematical formulation of the problem, (2) guarantees the automatic generation and efficient execution of parallel optimised low-level computer code and (3) is flexible enough to support different abstraction levels and give the programmer control over details of the preconditioner. We use the composable abstractions of the Firedrake/PyOP2 package to demonstrate the efficiency of this approach for the solution of strongly anisotropic PDEs in atmospheric modelling. The weak formulation of the PDE is expressed in Unified Form Language (UFL) and the lower PyOP2 abstraction layer allows the manual design of computational kernels for a bespoke geometric multigrid preconditioner. We compare the performance of this preconditioner to a single-level method and hypre's BoomerAMG algorithm. The Firedrake/PyOP2 code is inherently parallel and we present a detailed performance analysis for a single node (24 cores) on the ARCHER supercomputer. Our implementation utilises a significant fraction of the available memory bandwidth and shows very good weak scaling on up to 6,144 compute cores.
Software-engineering challenges of building and deploying reusable problem solvers
O’CONNOR, MARTIN J.; NYULAS, CSONGOR; TU, SAMSON; BUCKERIDGE, DAVID L.; OKHMATOVSKAIA, ANNA; MUSEN, MARK A.
2012-01-01
Problem solving methods (PSMs) are software components that represent and encode reusable algorithms. They can be combined with representations of domain knowledge to produce intelligent application systems. A goal of research on PSMs is to provide principled methods and tools for composing and reusing algorithms in knowledge-based systems. The ultimate objective is to produce libraries of methods that can be easily adapted for use in these systems. Despite the intuitive appeal of PSMs as conceptual building blocks, in practice, these goals are largely unmet. There are no widely available tools for building applications using PSMs and no public libraries of PSMs available for reuse. This paper analyzes some of the reasons for the lack of widespread adoptions of PSM techniques and illustrate our analysis by describing our experiences developing a complex, high-throughput software system based on PSM principles. We conclude that many fundamental principles in PSM research are useful for building knowledge-based systems. In particular, the task–method decomposition process, which provides a means for structuring knowledge-based tasks, is a powerful abstraction for building systems of analytic methods. However, despite the power of PSMs in the conceptual modeling of knowledge-based systems, software engineering challenges have been seriously underestimated. The complexity of integrating control knowledge modeled by developers using PSMs with the domain knowledge that they model using ontologies creates a barrier to widespread use of PSM-based systems. Nevertheless, the surge of recent interest in ontologies has led to the production of comprehensive domain ontologies and of robust ontology-authoring tools. These developments present new opportunities to leverage the PSM approach. PMID:23565031
ERIC Educational Resources Information Center
Math Forum @ Drexel, 2009
2009-01-01
Different techniques for understanding a problem can lead to ideas for never-used-before solutions. Good problem-solvers use a problem-solving strategy and may come back to it frequently while they are working on the problem to refine their strategy, see if they can find better solutions, or find other questions. Writing is an integral part of…
ERIC Educational Resources Information Center
Wisconsin Univ. - Stout, Menomonie. Center for Vocational, Technical and Adult Education.
The teacher directed problem solving activities package contains 17 units: Future Community Design, Let's Build an Elevator, Let's Construct a Catapult, Let's Design a Recreational Game, Let's Make a Hand Fishing Reel, Let's Make a Wall Hanging, Let's Make a Yo-Yo, Marooned in the Past, Metrication, Mousetrap Vehicles, The Multi System…
NASA Astrophysics Data System (ADS)
Gutierrez A., Natalia A.
2014-06-01
A model to determinate the reproductive basic number, detonated Ro, for the case of population with heterogeneity in sexual activity and proportionate mixing is solved using computer algebra and SMT solvers. Specifically Maple and Z3 were used. The code for the solution of the model was written in Z3-Python, but it can also be played by Z3-SMT-Lib. Ro represents an algebraic synthesis of every epidemiological parameter. Numerical simulations were done to prove the effectiveness of the model and the code. The algebraic structure of Ro suggests the possible control measurements that should be implemented to avoid the propagation of the sexual transmitted diseases. The obtained results are important on the computational epidemiology field. As a future investigation, it is suggested to apply the STM solvers to analyze models for other kinds of epidemic diseases.
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.
Finite Element Interface to Linear Solvers
Williams, Alan
2005-03-18
Sparse systems of linear equations arise in many engineering applications, including finite elements, finite volumes, and others. The solution of linear systems is often the most computationally intensive portion of the application. Depending on the complexity of problems addressed by the application, there may be no single solver capable of solving all of the linear systems that arise. This motivates the desire to switch an application from one solver librwy to another, depending on the problem being solved. The interfaces provided by solver libraries differ greatly, making it difficult to switch an application code from one library to another. The amount of library-specific code in an application Can be greatly reduced by having an abstraction layer between solver libraries and the application, putting a common "face" on various solver libraries. One such abstraction layer is the Finite Element Interface to Linear Solvers (EEl), which has seen significant use by finite element applications at Sandia National Laboratories and Lawrence Livermore National Laboratory.
ERIC Educational Resources Information Center
Foley, Greg
2014-01-01
A problem that illustrates two ways of computing the break-even radius of insulation is outlined. The problem is suitable for students who are taking an introductory module in heat transfer or transport phenomena and who have some previous knowledge of the numerical solution of non- linear algebraic equations. The potential for computer algebra,…
ERIC Educational Resources Information Center
Cantor, Alida; DeLauer, Verna; Martin, Deborah; Rogan, John
2015-01-01
Management of "wicked problems", messy real-world problems that defy resolution, requires thinkers who can transcend disciplinary boundaries, work collaboratively, and handle complexity and obstacles. This paper explores how educators can train undergraduates in these skills through applied community-based research, using the example of…
Scalable solvers and applications
Ribbens, C J
2000-10-27
The purpose of this report is to summarize research activities carried out under Lawrence Livermore National Laboratory (LLNL) research subcontract B501073. This contract supported the principal investigator (P1), Dr. Calvin Ribbens, during his sabbatical visit to LLNL from August 1999 through June 2000. Results and conclusions from the work are summarized below in two major sections. The first section covers contributions to the Scalable Linear Solvers and hypre projects in the Center for Applied Scientific Computing (CASC). The second section describes results from collaboration with Patrice Turchi of LLNL's Chemistry and Materials Science Directorate (CMS). A list of publications supported by this subcontract appears at the end of the report.
Scalable Parallel Algebraic Multigrid Solvers
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.
Crooks, Noelle M; Alibali, Martha W
2013-01-01
This study investigated whether activating elements of prior knowledge can influence how problem solvers encode and solve simple mathematical equivalence problems (e.g., 3 + 4 + 5 = 3 + __). Past work has shown that such problems are difficult for elementary school students (McNeil and Alibali, 2000). One possible reason is that children's experiences in math classes may encourage them to think about equations in ways that are ultimately detrimental. Specifically, children learn a set of patterns that are potentially problematic (McNeil and Alibali, 2005a): the perceptual pattern that all equations follow an "operations = answer" format, the conceptual pattern that the equal sign means "calculate the total", and the procedural pattern that the correct way to solve an equation is to perform all of the given operations on all of the given numbers. Upon viewing an equivalence problem, knowledge of these patterns may be reactivated, leading to incorrect problem solving. We hypothesized that these patterns may negatively affect problem solving by influencing what people encode about a problem. To test this hypothesis in children would require strengthening their misconceptions, and this could be detrimental to their mathematical development. Therefore, we tested this hypothesis in undergraduate participants. Participants completed either control tasks or tasks that activated their knowledge of the three patterns, and were then asked to reconstruct and solve a set of equivalence problems. Participants in the knowledge activation condition encoded the problems less well than control participants. They also made more errors in solving the problems, and their errors resembled the errors children make when solving equivalence problems. Moreover, encoding performance mediated the effect of knowledge activation on equivalence problem solving. Thus, one way in which experience may affect equivalence problem solving is by influencing what students encode about the equations.
NASA Technical Reports Server (NTRS)
Shyy, W.; Thakur, S.; Udaykumar, H. S.
1993-01-01
A high accuracy convection scheme using a sequential solution technique has been developed and applied to simulate the longitudinal combustion instability and its active control. The scheme has been devised in the spirit of the Total Variation Diminishing (TVD) concept with special source term treatment. Due to the substantial heat release effect, a clear delineation of the key elements employed by the scheme, i.e., the adjustable damping factor and the source term treatment has been made. By comparing with the first-order upwind scheme previously utilized, the present results exhibit less damping and are free from spurious oscillations, offering improved quantitative accuracy while confirming the spectral analysis reported earlier. A simple feedback type of active control has been found to be capable of enhancing or attenuating the magnitude of the combustion instability.
ERIC Educational Resources Information Center
Furinghetti, Fulvia; Morselli, Francesca
2009-01-01
It is widely recognized that purely cognitive behavior is extremely rare in performing mathematical activity: other factors, such as the affective ones, play a crucial role. In light of this observation, we present a reflection on the presence of affective and cognitive factors in the process of proving. Proof is considered as a special case of…
NASA Astrophysics Data System (ADS)
Kordy, M.; Wannamaker, P.; Maris, V.; Cherkaev, E.; Hill, G.
2016-01-01
We have developed an algorithm, which we call HexMT, for 3-D simulation and inversion of magnetotelluric (MT) responses using deformable hexahedral finite elements that permit incorporation of topography. Direct solvers parallelized on symmetric multiprocessor (SMP), single-chassis workstations with large RAM are used throughout, including the forward solution, parameter Jacobians and model parameter update. In Part I, the forward simulator and Jacobian calculations are presented. We use first-order edge elements to represent the secondary electric field (E), yielding accuracy O(h) for E and its curl (magnetic field). For very low frequencies or small material admittivities, the E-field requires divergence correction. With the help of Hodge decomposition, the correction may be applied in one step after the forward solution is calculated. This allows accurate E-field solutions in dielectric air. The system matrix factorization and source vector solutions are computed using the MKL PARDISO library, which shows good scalability through 24 processor cores. The factorized matrix is used to calculate the forward response as well as the Jacobians of electromagnetic (EM) field and MT responses using the reciprocity theorem. Comparison with other codes demonstrates accuracy of our forward calculations. We consider a popular conductive/resistive double brick structure, several synthetic topographic models and the natural topography of Mount Erebus in Antarctica. In particular, the ability of finite elements to represent smooth topographic slopes permits accurate simulation of refraction of EM waves normal to the slopes at high frequencies. Run-time tests of the parallelized algorithm indicate that for meshes as large as 176 × 176 × 70 elements, MT forward responses and Jacobians can be calculated in ˜1.5 hr per frequency. Together with an efficient inversion parameter step described in Part II, MT inversion problems of 200-300 stations are computable with total run times
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
7 2.2 Condensed matter physics . . . . . . . . . . . . . . . . . . . . . . . 9 2.3 Spectral reordering...working precision in floating-point arithmetic due to the fact that rotational masses are omitted [1]. 2.2 Condensed matter physics In 1958, P.W...the plot more intuitive, we have chosen to refer to our updated vector as v = x+ d rather than v = x− d. 19 quantity is smallest, and the dark blue
ERIC Educational Resources Information Center
Figarella-Garcia, Frances V.; Velazquez-Rivera, Lizzette M.; Santiago-Rivera, Teresita
2004-01-01
Imagine--you must bring water to a hurricane-ravaged area. There is only one bridge and only one truck, and the bridge can only hold so much weight. Your calculations determine if the truck--and its load of water--can make it safely over the bridge. This is a typical challenge during two-week summer camps for third-through fourth-grade students…
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
graduate school. Debugging somebody else’s MPI code is an immensely frustrating experience, but he would regularly stay late at the oce to assist me...cessfully. In addition, I will describe the parallel kernels required by my code . 5 The next sections will describe my Fortran-based implementations of...Sandia’s publicly available Trace- Min code . Each of the methods has its own unique advantages and disadvantages, summarized in table 3.1. In short, I
NASA Technical Reports Server (NTRS)
Ilin, Andrew V.
2006-01-01
The Magnetic Field Solver computer program calculates the magnetic field generated by a group of collinear, cylindrical axisymmetric electromagnet coils. Given the current flowing in, and the number of turns, axial position, and axial and radial dimensions of each coil, the program calculates matrix coefficients for a finite-difference system of equations that approximates a two-dimensional partial differential equation for the magnetic potential contributed by the coil. The program iteratively solves these finite-difference equations by use of the modified incomplete Cholesky preconditioned-conjugate-gradient method. The total magnetic potential as a function of axial (z) and radial (r) position is then calculated as a sum of the magnetic potentials of the individual coils, using a high-accuracy interpolation scheme. Then the r and z components of the magnetic field as functions of r and z are calculated from the total magnetic potential by use of a high-accuracy finite-difference scheme. Notably, for the finite-difference calculations, the program generates nonuniform two-dimensional computational meshes from nonuniform one-dimensional meshes. Each mesh is generated in such a way as to minimize the numerical error for a benchmark one-dimensional magnetostatic problem.
A parallel PCG solver for MODFLOW.
Dong, Yanhui; Li, Guomin
2009-01-01
In order to simulate large-scale ground water flow problems more efficiently with MODFLOW, the OpenMP programming paradigm was used to parallelize the preconditioned conjugate-gradient (PCG) solver with in this study. Incremental parallelization, the significant advantage supported by OpenMP on a shared-memory computer, made the solver transit to a parallel program smoothly one block of code at a time. The parallel PCG solver, suitable for both MODFLOW-2000 and MODFLOW-2005, is verified using an 8-processor computer. Both the impact of compilers and different model domain sizes were considered in the numerical experiments. Based on the timing results, execution times using the parallel PCG solver are typically about 1.40 to 5.31 times faster than those using the serial one. In addition, the simulation results are the exact same as the original PCG solver, because the majority of serial codes were not changed. It is worth noting that this parallelizing approach reduces cost in terms of software maintenance because only a single source PCG solver code needs to be maintained in the MODFLOW source tree.
NASA Technical Reports Server (NTRS)
Biedron, Robert T.; Vatsa, Veer N.; Atkins, Harold L.
2005-01-01
We apply an unsteady Reynolds-averaged Navier-Stokes (URANS) solver for unstructured grids to unsteady flows on moving and stationary grids. Example problems considered are relevant to active flow control and stability and control. Computational results are presented using the Spalart-Allmaras turbulence model and are compared to experimental data. The effect of grid and time-step refinement are examined.
Code Verification of the HIGRAD Computational Fluid Dynamics Solver
Van Buren, Kendra L.; Canfield, Jesse M.; Hemez, Francois M.; Sauer, Jeremy A.
2012-05-04
The purpose of this report is to outline code and solution verification activities applied to HIGRAD, a Computational Fluid Dynamics (CFD) solver of the compressible Navier-Stokes equations developed at the Los Alamos National Laboratory, and used to simulate various phenomena such as the propagation of wildfires and atmospheric hydrodynamics. Code verification efforts, as described in this report, are an important first step to establish the credibility of numerical simulations. They provide evidence that the mathematical formulation is properly implemented without significant mistakes that would adversely impact the application of interest. Highly accurate analytical solutions are derived for four code verification test problems that exercise different aspects of the code. These test problems are referred to as: (i) the quiet start, (ii) the passive advection, (iii) the passive diffusion, and (iv) the piston-like problem. These problems are simulated using HIGRAD with different levels of mesh discretization and the numerical solutions are compared to their analytical counterparts. In addition, the rates of convergence are estimated to verify the numerical performance of the solver. The first three test problems produce numerical approximations as expected. The fourth test problem (piston-like) indicates the extent to which the code is able to simulate a 'mild' discontinuity, which is a condition that would typically be better handled by a Lagrangian formulation. The current investigation concludes that the numerical implementation of the solver performs as expected. The quality of solutions is sufficient to provide credible simulations of fluid flows around wind turbines. The main caveat associated to these findings is the low coverage provided by these four problems, and somewhat limited verification activities. A more comprehensive evaluation of HIGRAD may be beneficial for future studies.
NASA Astrophysics Data System (ADS)
Vergara, Christian; Lange, Matthias; Palamara, Simone; Lassila, Toni; Frangi, Alejandro F.; Quarteroni, Alfio
2016-03-01
We present a model for the electrophysiology in the heart to handle the electrical propagation through the Purkinje system and in the myocardium, with two-way coupling at the Purkinje-muscle junctions. In both the subproblems the monodomain model is considered, whereas at the junctions a resistor element is included that induces an orthodromic propagation delay from the Purkinje network towards the heart muscle. We prove a sufficient condition for convergence of a fixed-point iterative algorithm to the numerical solution of the coupled problem. Numerical comparison of activation patterns is made with two different combinations of models for the coupled Purkinje network/myocardium system, the eikonal/eikonal and the monodomain/monodomain models. Test cases are investigated for both physiological and pathological activation of a model left ventricle. Finally, we prove the reliability of the monodomain/monodomain coupling on a realistic scenario. Our results underlie the importance of using physiologically realistic Purkinje-trees with propagation solved using the monodomain model for simulating cardiac activation.
Equation solvers for distributed-memory computers
NASA Technical Reports Server (NTRS)
Storaasli, Olaf O.
1994-01-01
A large number of scientific and engineering problems require the rapid solution of large systems of simultaneous equations. The performance of parallel computers in this area now dwarfs traditional vector computers by nearly an order of magnitude. This talk describes the major issues involved in parallel equation solvers with particular emphasis on the Intel Paragon, IBM SP-1 and SP-2 processors.
A real-time impurity solver for DMFT
NASA Astrophysics Data System (ADS)
Kim, Hyungwon; Aron, Camille; Han, Jong E.; Kotliar, Gabriel
Dynamical mean-field theory (DMFT) offers a non-perturbative approach to problems with strongly correlated electrons. The method heavily relies on the ability to numerically solve an auxiliary Anderson-type impurity problem. While powerful Matsubara-frequency solvers have been developed over the past two decades to tackle equilibrium situations, the status of real-time impurity solvers that could compete with Matsubara-frequency solvers and be readily generalizable to non-equilibrium situations is still premature. We present a real-time solver which is based on a quantum Master equation description of the dissipative dynamics of the impurity and its exact diagonalization. As a benchmark, we illustrate the strengths of our solver in the context of the equilibrium Mott-insulator transition of the one-band Hubbard model and compare it with iterative perturbation theory (IPT) method. Finally, we discuss its direct application to a nonequilibrium situation.
NASA Technical Reports Server (NTRS)
Ferencz, Donald C.; Viterna, Larry A.
1991-01-01
ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.
Shape reanalysis and sensitivities utilizing preconditioned iterative boundary solvers
NASA Technical Reports Server (NTRS)
Guru Prasad, K.; Kane, J. H.
1992-01-01
The computational advantages associated with the utilization of preconditined iterative equation solvers are quantified for the reanalysis of perturbed shapes using continuum structural boundary element analysis (BEA). Both single- and multi-zone three-dimensional problems are examined. Significant reductions in computer time are obtained by making use of previously computed solution vectors and preconditioners in subsequent analyses. The effectiveness of this technique is demonstrated for the computation of shape response sensitivities required in shape optimization. Computer times and accuracies achieved using the preconditioned iterative solvers are compared with those obtained via direct solvers and implicit differentiation of the boundary integral equations. It is concluded that this approach employing preconditioned iterative equation solvers in reanalysis and sensitivity analysis can be competitive with if not superior to those involving direct solvers.
Comparison of open-source linear programming solvers.
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
Turovets, Sergei; Volkov, Vasily; Zherdetsky, Aleksej; Prakonina, Alena; Malony, Allen D
2014-01-01
The Electrical Impedance Tomography (EIT) and electroencephalography (EEG) forward problems in anisotropic inhomogeneous media like the human head belongs to the class of the three-dimensional boundary value problems for elliptic equations with mixed derivatives. We introduce and explore the performance of several new promising numerical techniques, which seem to be more suitable for solving these problems. The proposed numerical schemes combine the fictitious domain approach together with the finite-difference method and the optimally preconditioned Conjugate Gradient- (CG-) type iterative method for treatment of the discrete model. The numerical scheme includes the standard operations of summation and multiplication of sparse matrices and vector, as well as FFT, making it easy to implement and eligible for the effective parallel implementation. Some typical use cases for the EIT/EEG problems are considered demonstrating high efficiency of the proposed numerical technique.
BOOK REVIEW: Inverse Problems. Activities for Undergraduates
NASA Astrophysics Data System (ADS)
Yamamoto, Masahiro
2003-06-01
This book is a valuable introduction to inverse problems. In particular, from the educational point of view, the author addresses the questions of what constitutes an inverse problem and how and why we should study them. Such an approach has been eagerly awaited for a long time. Professor Groetsch, of the University of Cincinnati, is a world-renowned specialist in inverse problems, in particular the theory of regularization. Moreover, he has made a remarkable contribution to educational activities in the field of inverse problems, which was the subject of his previous book (Groetsch C W 1993 Inverse Problems in the Mathematical Sciences (Braunschweig: Vieweg)). For this reason, he is one of the most qualified to write an introductory book on inverse problems. Without question, inverse problems are important, necessary and appear in various aspects. So it is crucial to introduce students to exercises in inverse problems. However, there are not many introductory books which are directly accessible by students in the first two undergraduate years. As a consequence, students often encounter diverse concrete inverse problems before becoming aware of their general principles. The main purpose of this book is to present activities to allow first-year undergraduates to learn inverse theory. To my knowledge, this book is a rare attempt to do this and, in my opinion, a great success. The author emphasizes that it is very important to teach inverse theory in the early years. He writes; `If students consider only the direct problem, they are not looking at the problem from all sides .... The habit of always looking at problems from the direct point of view is intellectually limiting ...' (page 21). The book is very carefully organized so that teachers will be able to use it as a textbook. After an introduction in chapter 1, sucessive chapters deal with inverse problems in precalculus, calculus, differential equations and linear algebra. In order to let one gain some insight
A perspective on unstructured grid flow solvers
NASA Technical Reports Server (NTRS)
Venkatakrishnan, V.
1995-01-01
This survey paper assesses the status of compressible Euler and Navier-Stokes solvers on unstructured grids. Different spatial and temporal discretization options for steady and unsteady flows are discussed. The integration of these components into an overall framework to solve practical problems is addressed. Issues such as grid adaptation, higher order methods, hybrid discretizations and parallel computing are briefly discussed. Finally, some outstanding issues and future research directions are presented.
Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.
1994-06-01
NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation.
Koteras, J.R.
1996-01-01
The prediction of stresses and displacements around tunnels buried deep within the earth is an important class of geomechanics problems. The material behavior immediately surrounding the tunnel is typically nonlinear. The surrounding mass, even if it is nonlinear, can usually be characterized by a simple linear elastic model. The finite element method is best suited for modeling nonlinear materials of limited volume, while the boundary element method is well suited for modeling large volumes of linear elastic material. A computational scheme that couples the finite element and boundary element methods would seem particularly useful for geomechanics problems. A variety of coupling schemes have been proposed, but they rely on direct solution methods. Direct solution techniques have large storage requirements that become cumbersome for large-scale three-dimensional problems. An alternative to direct solution methods is iterative solution techniques. A scheme has been developed for coupling the finite element and boundary element methods that uses an iterative solution method. This report shows that this coupling scheme is valid for problems where nonlinear material behavior occurs in the finite element region.
Activities: Activities to Introduce Maxima-Minima Problems.
ERIC Educational Resources Information Center
Pleacher, David
1991-01-01
Presented are student activities that involve two standard problems from geometry and calculus--the volume of a box and the bank shot on a pool table. Problem solving is emphasized as a method of inquiry and application with descriptions of the results using graphical, numerical, and physical models. (JJK)
Two Solvers for Tractable Temporal Constraints with Preferences
NASA Technical Reports Server (NTRS)
Rossi, F.; Khatib,L.; Morris, P.; Morris, R.; Clancy, Daniel (Technical Monitor)
2002-01-01
A number of reasoning problems involving the manipulation of temporal information can naturally be viewed as implicitly inducing an ordering of potential local decisions involving time on the basis of preferences. Soft temporal constraints problems allow to describe in a natural way scenarios where events happen over time and preferences are associated to event distances and durations. In general, solving soft temporal problems require exponential time in the worst case, but there are interesting subclasses of problems which are polynomially solvable. We describe two solvers based on two different approaches for solving the same tractable subclass. For each solver we present the theoretical results it stands on, a description of the algorithm and some experimental results. The random generator used to build the problems on which tests are performed is also described. Finally, we compare the two solvers highlighting the tradeoff between performance and representational power.
Implicit Riemann solvers for the Pn equations.
Mehlhorn, Thomas Alan; McClarren, Ryan; Brunner, Thomas A.; Holloway, James Paul
2005-03-01
The spherical harmonics (P{sub n}) approximation to the transport equation for time dependent problems has previously been treated using Riemann solvers and explicit time integration. Here we present an implicit time integration method for the P n equations using Riemann solvers. Both first-order and high-resolution spatial discretization schemes are detailed. One facet of the high-resolution scheme is that a system of nonlinear equations must be solved at each time step. This nonlinearity is the result of slope reconstruction techniques necessary to avoid the introduction of artifical extrema in the numerical solution. Results are presented that show auspicious agreement with analytical solutions using time steps well beyond the CFL limit.
Kim, Hyo-Joong; Furukawa, Yoshihiro; Kakegawa, Takeshi; Bita, Andrei; Scorei, Romulus; Benner, Steven A
2016-12-19
RNA is currently thought to have been the first biopolymer to support Darwinian natural selection on Earth. However, the phosphate esters in RNA and its precursors, and the many sites at which phosphorylation might occur in ribonucleosides under conditions that make it possible, challenge prebiotic chemists. Moreover, free inorganic phosphate may have been scarce on early Earth owing to its sequestration by calcium in the unreactive mineral hydroxyapatite. Herein, it is shown that these problems can be mitigated by a particular geological environment that contains borate, magnesium, sulfate, calcium, and phosphate in evaporite deposits. Actual geological environments, reproduced here, show that Mg(2+) and borate sequester phosphate from calcium to form the mineral lüneburgite. Ribonucleosides stabilized by borate mobilize borate and phosphate from lüneburgite, and are then regiospecifically phosphorylated by the mineral. Thus, in addition to guiding carbohydrate pre-metabolism, borate minerals in evaporite geoorganic contexts offer a solution to the phosphate problem in the "RNA first" model for the origins of life.
Analysis, tuning and comparison of two general sparse solvers for distributed memory computers
Amestoy, P.R.; Duff, I.S.; L'Excellent, J.-Y.; Li, X.S.
2000-06-30
We describe the work performed in the context of a Franco-Berkeley funded project between NERSC-LBNL located in Berkeley (USA) and CERFACS-ENSEEIHT located in Toulouse (France). We discuss both the tuning and performance analysis of two distributed memory sparse solvers (superlu from Berkeley and mumps from Toulouse) on the 512 processor Cray T3E from NERSC (Lawrence Berkeley National Laboratory). This project gave us the opportunity to improve the algorithms and add new features to the codes. We then quite extensively analyze and compare the two approaches on a set of large problems from real applications. We further explain the main differences in the behavior of the approaches on artificial regular grid problems. As a conclusion to this activity report, we mention a set of parallel sparse solvers on which this type of study should be extended.
Parallel iterative solvers and preconditioners using approximate hierarchical methods
Grama, A.; Kumar, V.; Sameh, A.
1996-12-31
In this paper, we report results of the performance, convergence, and accuracy of a parallel GMRES solver for Boundary Element Methods. The solver uses a hierarchical approximate matrix-vector product based on a hybrid Barnes-Hut / Fast Multipole Method. We study the impact of various accuracy parameters on the convergence and show that with minimal loss in accuracy, our solver yields significant speedups. We demonstrate the excellent parallel efficiency and scalability of our solver. The combined speedups from approximation and parallelism represent an improvement of several orders in solution time. We also develop fast and paralellizable preconditioners for this problem. We report on the performance of an inner-outer scheme and a preconditioner based on truncated Green`s function. Experimental results on a 256 processor Cray T3D are presented.
1984-04-01
sd*l it (S.AX) 31 Stfm d fe VOO 2em. Twied7y. Os Md tdliM WaaIn~psla. (X y)m - 22 Y isWI .3. to solve the qpa fy-disctized two- and three-dimensional...to compute F,(JP) an each tera- tio. For larg problems, the evaluation of the Jacobian May be very ezpensiv, and, 2 A fe .. I i f4d. -eadm l 008m p et...301" Of*r 6 Set pe -,f&g voM 1-0 STW 1 UNTI couverpunce DO Solveft -Ape. dk4 - ( Fe -Ie141 l p -0 f5 14p EmD FOR 11pm 3.1.h The Pteomuditiomed Coujuget
Anton, Luis; MartI, Jose M; Ibanez, Jose M; Aloy, Miguel A.; Mimica, Petar; Miralles, Juan A.
2010-05-01
We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wave front in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numerical problems allows us to conclude that our solver is very robust. When compared with a family of simpler solvers that avoid the knowledge of the full characteristic structure of the equations in the computation of the numerical fluxes, our solver turns out to be less diffusive than HLL and HLLC, and comparable in accuracy to the HLLD solver. The amount of operations needed by the FWD solver makes it less efficient computationally than those of the HLL family in one-dimensional problems. However, its relative efficiency increases in multidimensional simulations.
NASA Astrophysics Data System (ADS)
Antón, Luis; Miralles, Juan A.; Martí, José M.; Ibáñez, José M.; Aloy, Miguel A.; Mimica, Petar
2010-05-01
We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wave front in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numerical problems allows us to conclude that our solver is very robust. When compared with a family of simpler solvers that avoid the knowledge of the full characteristic structure of the equations in the computation of the numerical fluxes, our solver turns out to be less diffusive than HLL and HLLC, and comparable in accuracy to the HLLD solver. The amount of operations needed by the FWD solver makes it less efficient computationally than those of the HLL family in one-dimensional problems. However, its relative efficiency increases in multidimensional simulations.
ALPS - A LINEAR PROGRAM SOLVER
NASA Technical Reports Server (NTRS)
Viterna, L. A.
1994-01-01
Linear programming is a widely-used engineering and management tool. Scheduling, resource allocation, and production planning are all well-known applications of linear programs (LP's). Most LP's are too large to be solved by hand, so over the decades many computer codes for solving LP's have been developed. ALPS, A Linear Program Solver, is a full-featured LP analysis program. ALPS can solve plain linear programs as well as more complicated mixed integer and pure integer programs. ALPS also contains an efficient solution technique for pure binary (0-1 integer) programs. One of the many weaknesses of LP solvers is the lack of interaction with the user. ALPS is a menu-driven program with no special commands or keywords to learn. In addition, ALPS contains a full-screen editor to enter and maintain the LP formulation. These formulations can be written to and read from plain ASCII files for portability. For those less experienced in LP formulation, ALPS contains a problem "parser" which checks the formulation for errors. ALPS creates fully formatted, readable reports that can be sent to a printer or output file. ALPS is written entirely in IBM's APL2/PC product, Version 1.01. The APL2 workspace containing all the ALPS code can be run on any APL2/PC system (AT or 386). On a 32-bit system, this configuration can take advantage of all extended memory. The user can also examine and modify the ALPS code. The APL2 workspace has also been "packed" to be run on any DOS system (without APL2) as a stand-alone "EXE" file, but has limited memory capacity on a 640K system. A numeric coprocessor (80X87) is optional but recommended. The standard distribution medium for ALPS is a 5.25 inch 360K MS-DOS format diskette. IBM, IBM PC and IBM APL2 are registered trademarks of International Business Machines Corporation. MS-DOS is a registered trademark of Microsoft Corporation.
A multigrid solver for the semiconductor equations
NASA Technical Reports Server (NTRS)
Bachmann, Bernhard
1993-01-01
We present a multigrid solver for the exponential fitting method. The solver is applied to the current continuity equations of semiconductor device simulation in two dimensions. The exponential fitting method is based on a mixed finite element discretization using the lowest-order Raviart-Thomas triangular element. This discretization method yields a good approximation of front layers and guarantees current conservation. The corresponding stiffness matrix is an M-matrix. 'Standard' multigrid solvers, however, cannot be applied to the resulting system, as this is dominated by an unsymmetric part, which is due to the presence of strong convection in part of the domain. To overcome this difficulty, we explore the connection between Raviart-Thomas mixed methods and the nonconforming Crouzeix-Raviart finite element discretization. In this way we can construct nonstandard prolongation and restriction operators using easily computable weighted L(exp 2)-projections based on suitable quadrature rules and the upwind effects of the discretization. The resulting multigrid algorithm shows very good results, even for real-world problems and for locally refined grids.
Quantitative analysis of numerical solvers for oscillatory biomolecular system models
Quo, Chang F; Wang, May D
2008-01-01
Background This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drastically different ranges from 10-15 to 1010, the ODEs can be stiff and ill-conditioned, resulting in non-unique, non-existing, or non-reproducible modeling solutions. Previous studies have not examined in depth how to best select numerical solvers for biomolecular system models, which makes it difficult to experimentally validate the modeling results. To address this problem, we have chosen one of the well-known stiff initial value problems with limit cycle behavior as a test-bed system model. Solving this model, we have illustrated that different answers may result from different numerical solvers. We use MATLAB numerical solvers because they are optimized and widely used by the modeling community. We have also conducted a systematic study of numerical solver performances by using qualitative and quantitative measures such as convergence, accuracy, and computational cost (i.e. in terms of function evaluation, partial derivative, LU decomposition, and "take-off" points). The results show that the modeling solutions can be drastically different using different numerical solvers. Thus, it is important to intelligently select numerical solvers when solving biomolecular system models. Results The classic Belousov-Zhabotinskii (BZ) reaction is described by the Oregonator model and is used as a case study. We report two guidelines in selecting optimal numerical solver(s) for stiff, complex oscillatory systems: (i) for problems with unknown parameters, ode45 is the optimal choice regardless of the relative error tolerance; (ii) for known stiff problems, both ode113 and ode15s are good choices under strict relative tolerance conditions. Conclusions For any given biomolecular model, by building a library of numerical solvers with quantitative performance assessment metric, we show that it is possible
Overset Techniques for Hypersonic Multibody Configurations with the DPLR Solver
NASA Technical Reports Server (NTRS)
Hyatt, Andrew James; Prabhu, Dinesh K.; Boger, David A.
2010-01-01
Three unit problems in shock-shock/shock-boundary layer interactions are considered in the evaluation overset techniques with the Data Parallel Line Relaxation (DPLR) computational fluid dynamics solver, a three dimensional Navier-Stokes solver . The unit problems considered are those of two stacked hemispherical cylinders (of different diameters and lengths, and at various orientations relative to each other or relative to the nozzle axis) tested in a hypersonic wind tunnel. These problems are taken as representative of a Two-Stage-To-Orbit design. The objective of the present presentation would be to discuss the techniques used to develop suitable overset grid systems and then evaluate their respective solutions by comparing to corresponding point matched grid solutions and experimental data. Both successful and unsuccessful techniques would be discussed. All solutions would be calculated using the DPLR solver and SUGGAR will be used to develop the domain connectivity information.
Cultivating Creative Problem Solvers: The PBL Style
ERIC Educational Resources Information Center
Hung, Woei
2015-01-01
After decades of research, we now know that creativity is a multidimensional construct that involves variables from the domains of personality, environment, and cognition. A construct with such level of complexity, as we know from past research, cannot be effectively learned through traditional lecture-based instruction. Rather, the formation of…
Needed: A New Generation of Problem Solvers
ERIC Educational Resources Information Center
McArthur, John W.; Sachs, Jeffrey
2009-01-01
Amid the global economic crisis dominating policy makers' recent attention, the world faces many other equal if not greater long-term challenges that will require concerted and highly skilled policy efforts in coming years. Those interwoven challenges include the mitigation of climate change, the control of emerging diseases, the reduction of…
Linear iterative solvers for implicit ODE methods
NASA Technical Reports Server (NTRS)
Saylor, Paul E.; Skeel, Robert D.
1990-01-01
The numerical solution of stiff initial value problems, which lead to the problem of solving large systems of mildly nonlinear equations are considered. For many problems derived from engineering and science, a solution is possible only with methods derived from iterative linear equation solvers. A common approach to solving the nonlinear equations is to employ an approximate solution obtained from an explicit method. The error is examined to determine how it is distributed among the stiff and non-stiff components, which bears on the choice of an iterative method. The conclusion is that error is (roughly) uniformly distributed, a fact that suggests the Chebyshev method (and the accompanying Manteuffel adaptive parameter algorithm). This method is described, also commenting on Richardson's method and its advantages for large problems. Richardson's method and the Chebyshev method with the Mantueffel algorithm are applied to the solution of the nonlinear equations by Newton's method.
T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2
Moridis, G.; Pruess, K.; Antunez, E.
1994-03-01
Most of the computational work in the numerical simulation of fluid and heat flows in permeable media arises in the solution of large systems of linear equations. The simplest technique for solving such equations is by direct methods. However, because of large storage requirements and accumulation of roundoff errors, the application of direct solution techniques is limited, depending on matrix bandwidth, to systems of a few hundred to at most a few thousand simultaneous equations. T2CG1, a package of preconditioned conjugate gradient solvers, has been added to TOUGH2 to complement its direct solver and significantly increase the size of problems tractable on PCs. T2CG1 includes three different solvers: a Bi-Conjugate Gradient (BCG) solver, a Bi-Conjugate Gradient Squared (BCGS) solver, and a Generalized Minimum Residual (GMRES) solver. Results from six test problems with up to 30,000 equations show that T2CG1 (1) is significantly (and invariably) faster and requires far less memory than the MA28 direct solver, (2) it makes possible the solution of very large three-dimensional problems on PCs, and (3) that the BCGS solver is the fastest of the three in the tested problems. Sample problems are presented related to heat and fluid flow at Yucca Mountain and WIPP, environmental remediation by the Thermal Enhanced Vapor Extraction System, and geothermal resources.
The novel high-performance 3-D MT inverse solver
NASA Astrophysics Data System (ADS)
Kruglyakov, Mikhail; Geraskin, Alexey; Kuvshinov, Alexey
2016-04-01
We present novel, robust, scalable, and fast 3-D magnetotelluric (MT) inverse solver. The solver is written in multi-language paradigm to make it as efficient, readable and maintainable as possible. Separation of concerns and single responsibility concepts go through implementation of the solver. As a forward modelling engine a modern scalable solver extrEMe, based on contracting integral equation approach, is used. Iterative gradient-type (quasi-Newton) optimization scheme is invoked to search for (regularized) inverse problem solution, and adjoint source approach is used to calculate efficiently the gradient of the misfit. The inverse solver is able to deal with highly detailed and contrasting models, allows for working (separately or jointly) with any type of MT responses, and supports massive parallelization. Moreover, different parallelization strategies implemented in the code allow optimal usage of available computational resources for a given problem statement. To parameterize an inverse domain the so-called mask parameterization is implemented, which means that one can merge any subset of forward modelling cells in order to account for (usually) irregular distribution of observation sites. We report results of 3-D numerical experiments aimed at analysing the robustness, performance and scalability of the code. In particular, our computational experiments carried out at different platforms ranging from modern laptops to HPC Piz Daint (6th supercomputer in the world) demonstrate practically linear scalability of the code up to thousands of nodes.
Optimising a parallel conjugate gradient solver
Field, M.R.
1996-12-31
This work arises from the introduction of a parallel iterative solver to a large structural analysis finite element code. The code is called FEX and it was developed at Hitachi`s Mechanical Engineering Laboratory. The FEX package can deal with a large range of structural analysis problems using a large number of finite element techniques. FEX can solve either stress or thermal analysis problems of a range of different types from plane stress to a full three-dimensional model. These problems can consist of a number of different materials which can be modelled by a range of material models. The structure being modelled can have the load applied at either a point or a surface, or by a pressure, a centrifugal force or just gravity. Alternatively a thermal load can be applied with a given initial temperature. The displacement of the structure can be constrained by having a fixed boundary or by prescribing the displacement at a boundary.
Robust and Efficient Riemann Solvers for MHD
NASA Astrophysics Data System (ADS)
Miyoshi, T.; Kusano, K.
2008-04-01
Robust and efficient approximate Riemann solvers for magnetohydrodynamics (MHD) are constructed. Particularly, a family of positively conservative Harten-Lax-van Leer (HLL)-type Riemann solvers, the so-called HLLD (`D' denotes Discontinuities), HLLR (`R' denotes Rotational), HLLC (`C' denotes Contact), and HLL solvers, is systematically considered.
Time-varying Riemann solvers for conservation laws on networks
NASA Astrophysics Data System (ADS)
Garavello, Mauro; Piccoli, Benedetto
We consider a conservation law on a network and generic Riemann solvers at nodes depending on parameters, which can be seen as control functions. Assuming that the parameters have bounded variation as functions of time, we prove existence of solutions to Cauchy problems on the whole network.
Numerical System Solver Developed for the National Cycle Program
NASA Technical Reports Server (NTRS)
Binder, Michael P.
1999-01-01
As part of the National Cycle Program (NCP), a powerful new numerical solver has been developed to support the simulation of aeropropulsion systems. This software uses a hierarchical object-oriented design. It can provide steady-state and time-dependent solutions to nonlinear and even discontinuous problems typically encountered when aircraft and spacecraft propulsion systems are simulated. It also can handle constrained solutions, in which one or more factors may limit the behavior of the engine system. Timedependent simulation capabilities include adaptive time-stepping and synchronization with digital control elements. The NCP solver is playing an important role in making the NCP a flexible, powerful, and reliable simulation package.
A robust HLLC-type Riemann solver for strong shock
NASA Astrophysics Data System (ADS)
Shen, Zhijun; Yan, Wei; Yuan, Guangwei
2016-03-01
It is well known that for the Eulerian equations the numerical schemes that can accurately capture contact discontinuity usually suffer from some disastrous carbuncle phenomenon, while some more dissipative schemes, such as the HLL scheme, are free from this kind of shock instability. Hybrid schemes to combine a dissipative flux with a less dissipative flux can cure the shock instability, but also may lead to other problems, such as certain arbitrariness of choosing switching parameters or contact interface becoming smeared. In order to overcome these drawbacks, this paper proposes a simple and robust HLLC-type Riemann solver for inviscid, compressible gas flows, which is capable of preserving sharp contact surface and is free from instability. The main work is to construct a HLL-type Riemann solver and a HLLC-type Riemann solver by modifying the shear viscosity of the original HLL and HLLC methods. Both of the two new schemes are positively conservative under some typical wavespeed estimations. Moreover, a linear matrix stability analysis for the proposed schemes is accomplished, which illustrates the HLLC-type solver with shear viscosity is stable whereas the HLL-type solver with vorticity wave is unstable. Our arguments and numerical experiments demonstrate that the inadequate dissipation associated to the shear wave may be a unique reason to cause the instability.
Land, Sander; Gurev, Viatcheslav; Arens, Sander; Augustin, Christoph M; Baron, Lukas; Blake, Robert; Bradley, Chris; Castro, Sebastian; Crozier, Andrew; Favino, Marco; Fastl, Thomas E; Fritz, Thomas; Gao, Hao; Gizzi, Alessio; Griffith, Boyce E; Hurtado, Daniel E; Krause, Rolf; Luo, Xiaoyu; Nash, Martyn P; Pezzuto, Simone; Plank, Gernot; Rossi, Simone; Ruprecht, Daniel; Seemann, Gunnar; Smith, Nicolas P; Sundnes, Joakim; Rice, J Jeremy; Trayanova, Natalia; Wang, Dafang; Jenny Wang, Zhinuo; Niederer, Steven A
2015-12-08
Models of cardiac mechanics are increasingly used to investigate cardiac physiology. These models are characterized by a high level of complexity, including the particular anisotropic material properties of biological tissue and the actively contracting material. A large number of independent simulation codes have been developed, but a consistent way of verifying the accuracy and replicability of simulations is lacking. To aid in the verification of current and future cardiac mechanics solvers, this study provides three benchmark problems for cardiac mechanics. These benchmark problems test the ability to accurately simulate pressure-type forces that depend on the deformed objects geometry, anisotropic and spatially varying material properties similar to those seen in the left ventricle and active contractile forces. The benchmark was solved by 11 different groups to generate consensus solutions, with typical differences in higher-resolution solutions at approximately 0.5%, and consistent results between linear, quadratic and cubic finite elements as well as different approaches to simulating incompressible materials. Online tools and solutions are made available to allow these tests to be effectively used in verification of future cardiac mechanics software.
Gurev, Viatcheslav; Arens, Sander; Augustin, Christoph M.; Baron, Lukas; Blake, Robert; Bradley, Chris; Castro, Sebastian; Crozier, Andrew; Favino, Marco; Fastl, Thomas E.; Fritz, Thomas; Gao, Hao; Gizzi, Alessio; Griffith, Boyce E.; Hurtado, Daniel E.; Krause, Rolf; Luo, Xiaoyu; Nash, Martyn P.; Pezzuto, Simone; Plank, Gernot; Rossi, Simone; Ruprecht, Daniel; Seemann, Gunnar; Smith, Nicolas P.; Sundnes, Joakim; Rice, J. Jeremy; Trayanova, Natalia; Wang, Dafang; Jenny Wang, Zhinuo; Niederer, Steven A.
2015-01-01
Models of cardiac mechanics are increasingly used to investigate cardiac physiology. These models are characterized by a high level of complexity, including the particular anisotropic material properties of biological tissue and the actively contracting material. A large number of independent simulation codes have been developed, but a consistent way of verifying the accuracy and replicability of simulations is lacking. To aid in the verification of current and future cardiac mechanics solvers, this study provides three benchmark problems for cardiac mechanics. These benchmark problems test the ability to accurately simulate pressure-type forces that depend on the deformed objects geometry, anisotropic and spatially varying material properties similar to those seen in the left ventricle and active contractile forces. The benchmark was solved by 11 different groups to generate consensus solutions, with typical differences in higher-resolution solutions at approximately 0.5%, and consistent results between linear, quadratic and cubic finite elements as well as different approaches to simulating incompressible materials. Online tools and solutions are made available to allow these tests to be effectively used in verification of future cardiac mechanics software. PMID:26807042
Performance Models for the Spike Banded Linear System Solver
Manguoglu, Murat; Saied, Faisal; Sameh, Ahmed; ...
2011-01-01
With availability of large-scale parallel platforms comprised of tens-of-thousands of processors and beyond, there is significant impetus for the development of scalable parallel sparse linear system solvers and preconditioners. An integral part of this design process is the development of performance models capable of predicting performance and providing accurate cost models for the solvers and preconditioners. There has been some work in the past on characterizing performance of the iterative solvers themselves. In this paper, we investigate the problem of characterizing performance and scalability of banded preconditioners. Recent work has demonstrated the superior convergence properties and robustness of banded preconditioners,more » compared to state-of-the-art ILU family of preconditioners as well as algebraic multigrid preconditioners. Furthermore, when used in conjunction with efficient banded solvers, banded preconditioners are capable of significantly faster time-to-solution. Our banded solver, the Truncated Spike algorithm is specifically designed for parallel performance and tolerance to deep memory hierarchies. Its regular structure is also highly amenable to accurate performance characterization. Using these characteristics, we derive the following results in this paper: (i) we develop parallel formulations of the Truncated Spike solver, (ii) we develop a highly accurate pseudo-analytical parallel performance model for our solver, (iii) we show excellent predication capabilities of our model – based on which we argue the high scalability of our solver. Our pseudo-analytical performance model is based on analytical performance characterization of each phase of our solver. These analytical models are then parameterized using actual runtime information on target platforms. An important consequence of our performance models is that they reveal underlying performance bottlenecks in both serial and parallel formulations. All of our results are validated
Artifacts as Sources for Problem-Posing Activities
ERIC Educational Resources Information Center
Bonotto, Cinzia
2013-01-01
The problem-posing process represents one of the forms of authentic mathematical inquiry which, if suitably implemented in classroom activities, could move well beyond the limitations of word problems, at least as they are typically utilized. The two exploratory studies presented sought to investigate the impact of "problem-posing" activities when…
High-performance equation solvers and their impact on finite element analysis
NASA Technical Reports Server (NTRS)
Poole, Eugene L.; Knight, Norman F., Jr.; Davis, D. Dale, Jr.
1990-01-01
The role of equation solvers in modern structural analysis software is described. Direct and iterative equation solvers which exploit vectorization on modern high-performance computer systems are described and compared. The direct solvers are two Cholesky factorization methods. The first method utilizes a novel variable-band data storage format to achieve very high computation rates and the second method uses a sparse data storage format designed to reduce the number of operations. The iterative solvers are preconditioned conjugate gradient methods. Two different preconditioners are included; the first uses a diagonal matrix storage scheme to achieve high computation rates and the second requires a sparse data storage scheme and converges to the solution in fewer iterations that the first. The impact of using all of the equation solvers in a common structural analysis software system is demonstrated by solving several representative structural analysis problems.
Parallel Performance of Linear Solvers and Preconditioners
2014-01-01
MUMPS libraries to identify the combination with the shortest wall clock time for large-scale linear systems. The linear system of equations in this...during initialization. Our results show that for system sizes of less than three million degrees of freedom (DOF), the MUMPS direct solver is 20...solver with various iterative solver – preconditioner combinations. Both solve time and setup time for MUMPS are included. Ideal refers to the solve
Teaching Problem Solving: Don't Forget the Problem Solver(s)
ERIC Educational Resources Information Center
Ranade, Saidas M.; Corrales, Angela
2013-01-01
The importance of intrapersonal and interpersonal intelligences has long been known but educators have debated whether to and how to incorporate those topics in an already crowded engineering curriculum. In 2010, the authors used the classroom as a laboratory to observe the usefulness of including selected case studies and exercises from the…
Migration of vectorized iterative solvers to distributed memory architectures
Pommerell, C.; Ruehl, R.
1994-12-31
Both necessity and opportunity motivate the use of high-performance computers for iterative linear solvers. Necessity results from the size of the problems being solved-smaller problems are often better handled by direct methods. Opportunity arises from the formulation of the iterative methods in terms of simple linear algebra operations, even if this {open_quote}natural{close_quotes} parallelism is not easy to exploit in irregularly structured sparse matrices and with good preconditioners. As a result, high-performance implementations of iterative solvers have attracted a lot of interest in recent years. Most efforts are geared to vectorize or parallelize the dominating operation-structured or unstructured sparse matrix-vector multiplication, or to increase locality and parallelism by reformulating the algorithm-reducing global synchronization in inner products or local data exchange in preconditioners. Target architectures for iterative solvers currently include mostly vector supercomputers and architectures with one or few optimized (e.g., super-scalar and/or super-pipelined RISC) processors and hierarchical memory systems. More recently, parallel computers with physically distributed memory and a better price/performance ratio have been offered by vendors as a very interesting alternative to vector supercomputers. However, programming comfort on such distributed memory parallel processors (DMPPs) still lags behind. Here the authors are concerned with iterative solvers and their changing computing environment. In particular, they are considering migration from traditional vector supercomputers to DMPPs. Application requirements force one to use flexible and portable libraries. They want to extend the portability of iterative solvers rather than reimplementing everything for each new machine, or even for each new architecture.
The problem of active SETI: An overview
NASA Astrophysics Data System (ADS)
Musso, Paolo
2012-09-01
In the present paper (originally presented at the First IAA Symposium on Searching for Life Signatures hold at the UNESCO on 22-26 September 2008) I try to summarize the results of all my previous studies on active SETI and its possible dangers for us, also considering some new topics, in order to provide a possibly complete overview of the whole matter. First, I try to evaluate the possible risks of an indirect contact with aliens, from the social, cultural, and religious point of view; then, the possible risks related with receiving information about alien science and technology; finally, the risk that active SETI could increase the probability of a physical contact with hostile aliens. My conclusion is that active SETI is very unlikely to be dangerous for us, but, at present, such a possibility cannot be completely excluded. Surprisingly, it turns out that a very important point to be assessed in order to improve our evaluation of active SETI is the pace of our technological progress. Some suggestions about the policy that international community should adopt towards active SETI are also included.
[Problems connected with sexual activity in patients with heart disease].
Rembek, Magdalena; Tylkowski, Michał; Piestrzeniewicz, Katarzyna; Goch, Jan Henryk
2007-08-01
The paper presents some basic data on sexual activity in patients with heart disease. The most typical problems of people with stable angina or after myocardial infarction connected with sexual intercourse have been presented. Modulation of risk of heart attack during sexual activity and main problems of sexual dysfunction after acute coronary syndromes have been described.
Constructive Metacognitive Activity Shift in Mathematical Problem Solving
ERIC Educational Resources Information Center
Hastuti, Intan Dwi; Nusantara, Toto; Subanji; Susanto, Hery
2016-01-01
This study aims to describe the constructive metacognitive activity shift of eleventh graders in solving a mathematical problem. Subjects in this study were 10 students in grade 11 of SMAN 1 Malang. They were divided into 4 groups. Three types of metacognitive activity undertaken by students when completing mathematical problem are awareness,…
Elliptic Solvers with Adaptive Mesh Refinement on Complex Geometries
Phillip, B.
2000-07-24
Adaptive Mesh Refinement (AMR) is a numerical technique for locally tailoring the resolution computational grids. Multilevel algorithms for solving elliptic problems on adaptive grids include the Fast Adaptive Composite grid method (FAC) and its parallel variants (AFAC and AFACx). Theory that confirms the independence of the convergence rates of FAC and AFAC on the number of refinement levels exists under certain ellipticity and approximation property conditions. Similar theory needs to be developed for AFACx. The effectiveness of multigrid-based elliptic solvers such as FAC, AFAC, and AFACx on adaptively refined overlapping grids is not clearly understood. Finally, a non-trivial eye model problem will be solved by combining the power of using overlapping grids for complex moving geometries, AMR, and multilevel elliptic solvers.
A chemical reaction network solver for the astrophysics code NIRVANA
NASA Astrophysics Data System (ADS)
Ziegler, U.
2016-02-01
Context. Chemistry often plays an important role in astrophysical gases. It regulates thermal properties by changing species abundances and via ionization processes. This way, time-dependent cooling mechanisms and other chemistry-related energy sources can have a profound influence on the dynamical evolution of an astrophysical system. Modeling those effects with the underlying chemical kinetics in realistic magneto-gasdynamical simulations provide the basis for a better link to observations. Aims: The present work describes the implementation of a chemical reaction network solver into the magneto-gasdynamical code NIRVANA. For this purpose a multispecies structure is installed, and a new module for evolving the rate equations of chemical kinetics is developed and coupled to the dynamical part of the code. A small chemical network for a hydrogen-helium plasma was constructed including associated thermal processes which is used in test problems. Methods: Evolving a chemical network within time-dependent simulations requires the additional solution of a set of coupled advection-reaction equations for species and gas temperature. Second-order Strang-splitting is used to separate the advection part from the reaction part. The ordinary differential equation (ODE) system representing the reaction part is solved with a fourth-order generalized Runge-Kutta method applicable for stiff systems inherent to astrochemistry. Results: A series of tests was performed in order to check the correctness of numerical and technical implementation. Tests include well-known stiff ODE problems from the mathematical literature in order to confirm accuracy properties of the solver used as well as problems combining gasdynamics and chemistry. Overall, very satisfactory results are achieved. Conclusions: The NIRVANA code is now ready to handle astrochemical processes in time-dependent simulations. An easy-to-use interface allows implementation of complex networks including thermal processes
MACSYMA's symbolic ordinary differential equation solver
NASA Technical Reports Server (NTRS)
Golden, J. P.
1977-01-01
The MACSYMA's symbolic ordinary differential equation solver ODE2 is described. The code for this routine is delineated, which is of interest because it is written in top-level MACSYMA language, and may serve as a good example of programming in that language. Other symbolic ordinary differential equation solvers are mentioned.
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
NASA Astrophysics Data System (ADS)
Tang, Yu-Hang; Kudo, Shuhei; Bian, Xin; Li, Zhen; Karniadakis, George Em
2015-09-01
Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM).
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Tang, Yu-Hang; Kudo, Shuhei; Bian, Xin; Li, Zhen; Karniadakis, George Em
2015-09-15
Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)
Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers
NASA Technical Reports Server (NTRS)
Bjorner, Nikolaj
2010-01-01
The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is a state-of-the-art SMT solver. It is developed at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays. The talk describes some of the technology behind modern SMT solvers, including the solver Z3. Z3 is currently mainly targeted at solving problems that arise in software analysis and verification. It has been applied to various contexts, such as systems for dynamic symbolic simulation (Pex, SAGE, Vigilante), for program verification and extended static checking (Spec#/Boggie, VCC, HAVOC), for software model checking (Yogi, SLAM), model-based design (FORMULA), security protocol code (F7), program run-time analysis and invariant generation (VS3). We will describe how it integrates support for a variety of theories that arise naturally in the context of the applications. There are several new promising avenues and the talk will touch on some of these and the challenges related to SMT solvers. Proceedings
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Christensen, Max La Cour; Villa, Umberto E.; Engsig-Karup, Allan P.; Vassilevski, Panayot S.
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
Students' Experiences in Problem-Based Learning: Three Blind Mice Episode or Educational Innovation?
ERIC Educational Resources Information Center
Tan, Oon Seng
2004-01-01
Problem-based learning architecture typically involves a shift in three loci of educational preoccupation, namely (1) content coverage to problem engagement; (2) role of lecturing to role of coaching; and (3) students as passive learners to that of active problem-solvers. The purpose of this paper is to examine the issues of students' experiences…
Wavelet-based Poisson solver for use in particle-in-cell simulations.
Terzić, Balsa; Pogorelov, Ilya V
2005-06-01
We report on a successful implementation of a wavelet-based Poisson solver for use in three-dimensional particle-in-cell simulations. Our method harnesses advantages afforded by the wavelet formulation, such as sparsity of operators and data sets, existence of effective preconditioners, and the ability simultaneously to remove numerical noise and additional compression of relevant data sets. We present and discuss preliminary results relating to the application of the new solver to test problems in accelerator physics and astrophysics.
Elliptic Solvers for Adaptive Mesh Refinement Grids
Quinlan, D.J.; Dendy, J.E., Jr.; Shapira, Y.
1999-06-03
We are developing multigrid methods that will efficiently solve elliptic problems with anisotropic and discontinuous coefficients on adaptive grids. The final product will be a library that provides for the simplified solution of such problems. This library will directly benefit the efforts of other Laboratory groups. The focus of this work is research on serial and parallel elliptic algorithms and the inclusion of our black-box multigrid techniques into this new setting. The approach applies the Los Alamos object-oriented class libraries that greatly simplify the development of serial and parallel adaptive mesh refinement applications. In the final year of this LDRD, we focused on putting the software together; in particular we completed the final AMR++ library, we wrote tutorials and manuals, and we built example applications. We implemented the Fast Adaptive Composite Grid method as the principal elliptic solver. We presented results at the Overset Grid Conference and other more AMR specific conferences. We worked on optimization of serial and parallel performance and published several papers on the details of this work. Performance remains an important issue and is the subject of continuing research work.
Oasis: A high-level/high-performance open source Navier-Stokes solver
NASA Astrophysics Data System (ADS)
Mortensen, Mikael; Valen-Sendstad, Kristian
2015-03-01
Oasis is a high-level/high-performance finite element Navier-Stokes solver written from scratch in Python using building blocks from the FEniCS project (fenicsproject.org). The solver is unstructured and targets large-scale applications in complex geometries on massively parallel clusters. Oasis utilizes MPI and interfaces, through FEniCS, to the linear algebra backend PETSc. Oasis advocates a high-level, programmable user interface through the creation of highly flexible Python modules for new problems. Through the high-level Python interface the user is placed in complete control of every aspect of the solver. A version of the solver, that is using piecewise linear elements for both velocity and pressure, is shown to reproduce very well the classical, spectral, turbulent channel simulations of Moser et al. (1999). The computational speed is strongly dominated by the iterative solvers provided by the linear algebra backend, which is arguably the best performance any similar implicit solver using PETSc may hope for. Higher order accuracy is also demonstrated and new solvers may be easily added within the same framework.
The impact of improved sparse linear solvers on industrial engineering applications
Heroux, M.; Baddourah, M.; Poole, E.L.; Yang, Chao Wu
1996-12-31
There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.
NASA Astrophysics Data System (ADS)
Marshall, David D.
With the renewed interest in Cartesian gridding methodologies for the ease and speed of gridding complex geometries in addition to the simplicity of the control volumes used in the computations, it has become important to investigate ways of extending the existing Cartesian grid solver functionalities. This includes developing methods of modeling the viscous effects in order to utilize Cartesian grids solvers for accurate drag predictions and addressing the issues related to the distributed memory parallelization of Cartesian solvers. This research presents advances in two areas of interest in Cartesian grid solvers, viscous effects modeling and MPI parallelization. The development of viscous effects modeling using solely Cartesian grids has been hampered by the widely varying control volume sizes associated with the mesh refinement and the cut cells associated with the solid surface. This problem is being addressed by using physically based modeling techniques to update the state vectors of the cut cells and removing them from the finite volume integration scheme. This work is performed on a new Cartesian grid solver, NASCART-GT, with modifications to its cut cell functionality. The development of MPI parallelization addresses issues associated with utilizing Cartesian solvers on distributed memory parallel environments. This work is performed on an existing Cartesian grid solver, CART3D, with modifications to its parallelization methodology.
Monitoring Affect States during Effortful Problem Solving Activities
ERIC Educational Resources Information Center
D'Mello, Sidney K.; Lehman, Blair; Person, Natalie
2010-01-01
We explored the affective states that students experienced during effortful problem solving activities. We conducted a study where 41 students solved difficult analytical reasoning problems from the Law School Admission Test. Students viewed videos of their faces and screen captures and judged their emotions from a set of 14 states (basic…
SPECIAL MOTIVATIONAL ACTIVITIES FOR PROMOTING CERTAIN PROBLEM AREAS IN READING.
ERIC Educational Resources Information Center
DAWSON, MARVIN; SPENCER, GARY D.
A CURRICULUM GUIDE PRODUCED AT AN INSERVICE TRAINING COURSE ON "PROBLEMS IN TEACHING READING" BY TEACHERS FROM CARROLL COUNTY SCHOOLS, GEORGIA, IN THE SPRING OF 1966 IS PRESENTED. IT OFFERS GENERAL MOTIVATIONAL READING ACTIVITIES WHICH PROMOTE GROWTH IN CERTAIN PROBLEM AREAS IN READING. RECOGNIZING THAT THERE CAN BE NO EFFECTIVE LEARNING…
The Intermediate Impossible: A Prewriting Activity for Creative Problem Solving.
ERIC Educational Resources Information Center
Karloff, Kenneth
1985-01-01
Adapts Edward de Bono's "Intermediate Impossible" strategy--for considering ideas that normally would be discarded as stepping-stones to new ideas--for use as a prewriting activity to enhance creative problem solving. (HTH)
Error control of iterative linear solvers for integrated groundwater models.
Dixon, Matthew F; Bai, Zhaojun; Brush, Charles F; Chung, Francis I; Dogrul, Emin C; Kadir, Tariq N
2011-01-01
An open problem that arises when using modern iterative linear solvers, such as the preconditioned conjugate gradient method or Generalized Minimum RESidual (GMRES) method, is how to choose the residual tolerance in the linear solver to be consistent with the tolerance on the solution error. This problem is especially acute for integrated groundwater models, which are implicitly coupled to another model, such as surface water models, and resolve both multiple scales of flow and temporal interaction terms, giving rise to linear systems with variable scaling. This article uses the theory of "forward error bound estimation" to explain the correspondence between the residual error in the preconditioned linear system and the solution error. Using examples of linear systems from models developed by the US Geological Survey and the California State Department of Water Resources, we observe that this error bound guides the choice of a practical measure for controlling the error in linear systems. We implemented a preconditioned GMRES algorithm and benchmarked it against the Successive Over-Relaxation (SOR) method, the most widely known iterative solver for nonsymmetric coefficient matrices. With forward error control, GMRES can easily replace the SOR method in legacy groundwater modeling packages, resulting in the overall simulation speedups as large as 7.74×. This research is expected to broadly impact groundwater modelers through the demonstration of a practical and general approach for setting the residual tolerance in line with the solution error tolerance and presentation of GMRES performance benchmarking results.
A spectral Poisson solver for kinetic plasma simulation
NASA Astrophysics Data System (ADS)
Szeremley, Daniel; Obberath, Jens; Brinkmann, Ralf
2011-10-01
Plasma resonance spectroscopy is a well established plasma diagnostic method, realized in several designs. One of these designs is the multipole resonance probe (MRP). In its idealized - geometrically simplified - version it consists of two dielectrically shielded, hemispherical electrodes to which an RF signal is applied. A numerical tool is under development which is capable of simulating the dynamics of the plasma surrounding the MRP in electrostatic approximation. In this contribution we concentrate on the specialized Poisson solver for that tool. The plasma is represented by an ensemble of point charges. By expanding both the charge density and the potential into spherical harmonics, a largely analytical solution of the Poisson problem can be employed. For a practical implementation, the expansion must be appropriately truncated. With this spectral solver we are able to efficiently solve the Poisson equation in a kinetic plasma simulation without the need of introducing a spatial discretization.
On improving linear solver performance: a block variant of GMRES
Baker, A H; Dennis, J M; Jessup, E R
2004-05-10
The increasing gap between processor performance and memory access time warrants the re-examination of data movement in iterative linear solver algorithms. For this reason, we explore and establish the feasibility of modifying a standard iterative linear solver algorithm in a manner that reduces the movement of data through memory. In particular, we present an alternative to the restarted GMRES algorithm for solving a single right-hand side linear system Ax = b based on solving the block linear system AX = B. Algorithm performance, i.e. time to solution, is improved by using the matrix A in operations on groups of vectors. Experimental results demonstrate the importance of implementation choices on data movement as well as the effectiveness of the new method on a variety of problems from different application areas.
GARDNER, P.R.
2006-04-01
Sudoku, also known as Number Place, is a logic-based placement puzzle. The aim of the puzzle is to enter a numerical digit from 1 through 9 in each cell of a 9 x 9 grid made up of 3 x 3 subgrids (called ''regions''), starting with various digits given in some cells (the ''givens''). Each row, column, and region must contain only one instance of each numeral. Completing the puzzle requires patience and logical ability. Although first published in a U.S. puzzle magazine in 1979, Sudoku initially caught on in Japan in 1986 and attained international popularity in 2005. Last fall, after noticing Sudoku puzzles in some newspapers and magazines, I attempted a few just to see how hard they were. Of course, the difficulties varied considerably. ''Obviously'' one could use Trial and Error but all the advice was to ''Use Logic''. Thinking to flex, and strengthen, those powers, I began to tackle the puzzles systematically. That is, when I discovered a new tactical rule, I would write it down, eventually generating a list of ten or so, with some having overlap. They served pretty well except for the more difficult puzzles, but even then I managed to develop an additional three rules that covered all of them until I hit the Oregonian puzzle shown. With all of my rules, I could not seem to solve that puzzle. Initially putting my failure down to rapid mental fatigue (being unable to hold a sufficient quantity of information in my mind at one time), I decided to write a program to implement my rules and see what I had failed to notice earlier. The solver, too, failed. That is, my rules were insufficient to solve that particular puzzle. I happened across a book written by a fellow who constructs such puzzles and who claimed that, sometimes, the only tactic left was trial and error. With a trial and error routine implemented, my solver successfully completed the Oregonian puzzle, and has successfully solved every puzzle submitted to it since.
SIERRA framework version 4 : solver services.
Williams, Alan B.
2005-02-01
Several SIERRA applications make use of third-party libraries to solve systems of linear and nonlinear equations, and to solve eigenproblems. The classes and interfaces in the SIERRA framework that provide linear system assembly services and access to solver libraries are collectively referred to as solver services. This paper provides an overview of SIERRA's solver services including the design goals that drove the development, and relationships and interactions among the various classes. The process of assembling and manipulating linear systems will be described, as well as access to solution methods and other operations.
NASA Astrophysics Data System (ADS)
Guda, A. A.; Guda, S. A.; Soldatov, M. A.; Lomachenko, K. A.; Bugaev, A. L.; Lamberti, C.; Gawelda, W.; Bressler, C.; Smolentsev, G.; Soldatov, A. V.; Joly, Y.
2016-05-01
Finite difference method (FDM) implemented in the FDMNES software [Phys. Rev. B, 2001, 63, 125120] was revised. Thorough analysis shows, that the calculated diagonal in the FDM matrix consists of about 96% zero elements. Thus a sparse solver would be more suitable for the problem instead of traditional Gaussian elimination for the diagonal neighbourhood. We have tried several iterative sparse solvers and the direct one MUMPS solver with METIS ordering turned out to be the best. Compared to the Gaussian solver present method is up to 40 times faster and allows XANES simulations for complex systems already on personal computers. We show applicability of the software for metal-organic [Fe(bpy)3]2+ complex both for low spin and high spin states populated after laser excitation.
A Simple Quantum Integro-Differential Solver (SQuIDS)
NASA Astrophysics Data System (ADS)
Argüelles Delgado, Carlos A.; Salvado, Jordi; Weaver, Christopher N.
2015-11-01
Simple Quantum Integro-Differential Solver (SQuIDS) is a C++ code designed to solve semi-analytically the evolution of a set of density matrices and scalar functions. This is done efficiently by expressing all operators in an SU(N) basis. SQuIDS provides a base class from which users can derive new classes to include new non-trivial terms from the right hand sides of density matrix equations. The code was designed in the context of solving neutrino oscillation problems, but can be applied to any problem that involves solving the quantum evolution of a collection of particles with Hilbert space of dimension up to six.
A Wavelet Technique For Multi-grid Solver For Large Linear Systems
NASA Astrophysics Data System (ADS)
Keller, W.
In general, large systems of linear equations cannot be solved directly. An iterative solver has to be applied instead. Unfortunately, iterative solvers have a notouriously slow convergence rate, which in the worst case can prevent convergence at all, due to the inavoidable rounding errors. Multi-grid iteration schemes are meant to guarantee a sufficiently high convergence rate, independent from the dimension of the linear system. The idea behind the multi-grid solvers is that the traditional iterative solvers eliminate only the short-wavelength error constituents in the initial guess for the solution. For the elimination of the remaining long-wavelength error constituents a much coarser grid is sufficient. On the coarse grid the dimension of the problem is much smaller so that the elimination can be done by a direct solver. The paper shows that wavelet techniques successfully can be applied for following steps of a multi-grid procedure: · Generation of an approximation of the proplem on a coarse grid from a given approximation on the fine grid. · Restriction of a signal on a fine grid to its approximation on a co grid. · Uplift of a signal from the coarse to the fine grid. The paper starts with a theoretical explanation of the links between wavelets and multi-grid solvers. Based on this investigation the class o operators, which are suitable for a multi-grid solution strategy can be characterized. The numerical efficiency of the approach will be tested for the Planar Stokes problem.
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.
Parallelizing alternating direction implicit solver on GPUs
Technology Transfer Automated Retrieval System (TEKTRAN)
We present a parallel Alternating Direction Implicit (ADI) solver on GPUs. Our implementation significantly improves existing implementations in two aspects. First, we address the scalability issue of existing Parallel Cyclic Reduction (PCR) implementations by eliminating their hardware resource con...
Improved Stiff ODE Solvers for Combustion CFD
NASA Astrophysics Data System (ADS)
Imren, A.; Haworth, D. C.
2016-11-01
Increasingly large chemical mechanisms are needed to predict autoignition, heat release and pollutant emissions in computational fluid dynamics (CFD) simulations of in-cylinder processes in compression-ignition engines and other applications. Calculation of chemical source terms usually dominates the computational effort, and several strategies have been proposed to reduce the high computational cost associated with realistic chemistry in CFD. Central to most strategies is a stiff ordinary differential equation (ODE) solver to compute the change in composition due to chemical reactions over a computational time step. Most work to date on stiff ODE solvers for computational combustion has focused on backward differential formula (BDF) methods, and has not explicitly considered the implications of how the stiff ODE solver couples with the CFD algorithm. In this work, a fresh look at stiff ODE solvers is taken that includes how the solver is integrated into a turbulent combustion CFD code, and the advantages of extrapolation-based solvers in this regard are demonstrated. Benefits in CPU time and accuracy are demonstrated for homogeneous systems and compression-ignition engines, for chemical mechanisms that range in size from fewer than 50 to more than 7,000 species.
NASA Astrophysics Data System (ADS)
Gainullin, I. K.; Sonkin, M. A.
2015-03-01
A parallelized three-dimensional (3D) time-dependent Schrodinger equation (TDSE) solver for one-electron systems is presented in this paper. The TDSE Solver is based on the finite-difference method (FDM) in Cartesian coordinates and uses a simple and explicit leap-frog numerical scheme. The simplicity of the numerical method provides very efficient parallelization and high performance of calculations using Graphics Processing Units (GPUs). For example, calculation of 106 time-steps on the 1000ṡ1000ṡ1000 numerical grid (109 points) takes only 16 hours on 16 Tesla M2090 GPUs. The TDSE Solver demonstrates scalability (parallel efficiency) close to 100% with some limitations on the problem size. The TDSE Solver is validated by calculation of energy eigenstates of the hydrogen atom (13.55 eV) and affinity level of H- ion (0.75 eV). The comparison with other TDSE solvers shows that a GPU-based TDSE Solver is 3 times faster for the problems of the same size and with the same cost of computational resources. The usage of a non-regular Cartesian grid or problem-specific non-Cartesian coordinates increases this benefit up to 10 times. The TDSE Solver was applied to the calculation of the resonant charge transfer (RCT) in nanosystems, including several related physical problems, such as electron capture during H+-H0 collision and electron tunneling between H- ion and thin metallic island film.
NITSOL: A Newton iterative solver for nonlinear systems
Pernice, M.; Walker, H.F.
1996-12-31
Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.
The Effect of New Vocabulary on Problem Solving in Novice Physics Students.
ERIC Educational Resources Information Center
Sobolewski, Stanley J.
One of the difficulties encountered by novice problem solvers in introductory physics is in the area of problem solving. It has been shown in other studies that poor problem solvers are affected by the surface aspects of the problem in contrast with more efficient problem solvers who are capable of constructing a mental model of the physical…
A robust multilevel simultaneous eigenvalue solver
NASA Technical Reports Server (NTRS)
Costiner, Sorin; Taasan, Shlomo
1993-01-01
Multilevel (ML) algorithms for eigenvalue problems are often faced with several types of difficulties such as: the mixing of approximated eigenvectors by the solution process, the approximation of incomplete clusters of eigenvectors, the poor representation of solution on coarse levels, and the existence of close or equal eigenvalues. Algorithms that do not treat appropriately these difficulties usually fail, or their performance degrades when facing them. These issues motivated the development of a robust adaptive ML algorithm which treats these difficulties, for the calculation of a few eigenvectors and their corresponding eigenvalues. The main techniques used in the new algorithm include: the adaptive completion and separation of the relevant clusters on different levels, the simultaneous treatment of solutions within each cluster, and the robustness tests which monitor the algorithm's efficiency and convergence. The eigenvectors' separation efficiency is based on a new ML projection technique generalizing the Rayleigh Ritz projection, combined with a technique, the backrotations. These separation techniques, when combined with an FMG formulation, in many cases lead to algorithms of O(qN) complexity, for q eigenvectors of size N on the finest level. Previously developed ML algorithms are less focused on the mentioned difficulties. Moreover, algorithms which employ fine level separation techniques are of O(q(sub 2)N) complexity and usually do not overcome all these difficulties. Computational examples are presented where Schrodinger type eigenvalue problems in 2-D and 3-D, having equal and closely clustered eigenvalues, are solved with the efficiency of the Poisson multigrid solver. A second order approximation is obtained in O(qN) work, where the total computational work is equivalent to only a few fine level relaxations per eigenvector.
Benchmarking ICRF Full-wave Solvers for ITER
R. V. Budny, L. Berry, R. Bilato, P. Bonoli, M. Brambilla, R. J. Dumont, A. Fukuyama, R. Harvey, E. F. Jaeger, K. Indireshkumar, E. Lerche, D. McCune, C. K. Phillips, V. Vdovin, J. Wright, and members of the ITPA-IOS
2011-01-06
Abstract Benchmarking of full-wave solvers for ICRF simulations is performed using plasma profiles and equilibria obtained from integrated self-consistent modeling predictions of four ITER plasmas. One is for a high performance baseline (5.3 T, 15 MA) DT H-mode. The others are for half-field, half-current plasmas of interest for the pre-activation phase with bulk plasma ion species being either hydrogen or He4. The predicted profiles are used by six full-wave solver groups to simulate the ICRF electromagnetic fields and heating, and by three of these groups to simulate the current-drive. Approximate agreement is achieved for the predicted heating power for the DT and He4 cases. Factor of two disagreements are found for the cases with second harmonic He3 heating in bulk H cases. Approximate agreement is achieved simulating the ICRF current drive.
EEG activity during the performance of complex mental problems.
Jausovec, N; Jausovec, K
2000-04-01
This study investigated differences in cognitive processes related to problem complexity. It was assumed that these differences would be reflected in respondents' EEG activity--spectral power and coherence. A second issue of the study was to compare differences between the lower (alpha(1) = 7.9-10.0 Hz), and upper alpha band (alpha(2) = 10.1-12.9 Hz). In the first experiment two well-defined problems with two levels of complexity were used. Only minor differences in EEG power and coherence measures related to problem complexity were observed. In the second experiment divergent production problems resembling tasks on creativity tests were compared with dialectic problems calling for creative solutions. Differences in EEG power measures were mainly related to the form of problem presentation (figural/verbal). In contrast, coherence was related to the level of creativity needed to solve a problem. Noticeable increased intra- and interhemispheric cooperation between mainly the far distant brain regions was observed in the EEG activity of respondents while solving the dialectic problems. These results are explained by the more intense involvement of the long cortico-cortical fiber system in creative thinking. Differences between the lower and upper alpha band were significant for the power and coherence measures. In Experiment 2, fewer differences were observed in power measures in the upper alpha band than in the lower alpha band. A reverse pattern was observed for the coherence measures. These results hint to a functional independence of the two alpha bands, however, they do not allow to draw firm conclusions about their functional meanings. The study showed that it is unlikely that individuals solve well- and ill-defined problems by employing similar cognitive strategies.
A five-wave Harten-Lax-van Leer Riemann solver for relativistic magnetohydrodynamics
NASA Astrophysics Data System (ADS)
Mignone, A.; Ugliano, M.; Bodo, G.
2009-03-01
We present a five-wave Riemann solver for the equations of ideal relativistic magneto-hydrodynamics. Our solver can be regarded as a relativistic extension of the five-wave HLLD Riemann solver initially developed by Miyoshi & Kusano for the equations of ideal magnetohydrodynamics. The solution to the Riemann problem is approximated by a five-wave pattern, comprising two outermost fast shocks, two rotational discontinuities and a contact surface in the middle. The proposed scheme is considerably more elaborate than in the classical case since the normal velocity is no longer constant across the rotational modes. Still, proper closure to the Rankine-Hugoniot jump conditions can be attained by solving a non-linear scalar equation in the total pressure variable which, for the chosen configuration, has to be constant over the whole Riemann fan. The accuracy of the new Riemann solver is validated against one-dimensional tests and multidimensional applications. It is shown that our new solver considerably improves over the popular Harten-Lax-van Leer solver or the recently proposed HLLC schemes.
Kastanya, Doddy Yozef Febrian; Turinsky, Paul J.
2005-05-15
A Newton-Krylov iterative solver has been developed to reduce the CPU execution time of boiling water reactor (BWR) core simulators implemented in the core simulator part of the Fuel Optimization for Reloads Multiple Objectives by Simulated Annealing for BWR (FORMOSA-B) code, which is an in-core fuel management optimization code for BWRs. This new solver utilizes Newton's method to explicitly treat strong nonlinearities in the problem, replacing the traditionally used nested iterative approach. Newton's method provides the solver with a higher-than-linear convergence rate, assuming that good initial estimates of the unknowns are provided. Within each Newton iteration, an appropriately preconditioned Krylov solver is utilized for solving the linearized system of equations. Taking advantage of the higher convergence rate provided by Newton's method and utilizing an efficient preconditioned Krylov solver, we have developed a Newton-Krylov solver to evaluate the three-dimensional, two-group neutron diffusion equations coupled with a two-phase flow model within a BWR core simulator. Numerical tests on the new solver have shown that speedups ranging from 1.6 to 2.1, with reference to the traditional approach of employing nested iterations to treat the nonlinear feedbacks, can be achieved. However, if a preconditioned Krylov solver is employed to complete the inner iterations of the traditional approach, negligible CPU time differences are noted between the Newton-Krylov and traditional (Krylov) approaches.
Student Technological Creativity Using Online Problem-Solving Activities
ERIC Educational Resources Information Center
Chang, Yu-Shan
2013-01-01
The purpose of this study was to investigate the effects of online (web-based) creative problem-solving (CPS) activities on student technological creativity and to examine the characteristics of student creativity in the context of online CPS. A pretest-posttest quasi-experiment was conducted with 107 fourth-grade students in Taiwan. The…
Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers
Pernice, M.
1994-12-31
Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.
Inductive ionospheric solver for magnetospheric MHD simulations
NASA Astrophysics Data System (ADS)
Vanhamäki, H.
2011-01-01
We present a new scheme for solving the ionospheric boundary conditions required in magnetospheric MHD simulations. In contrast to the electrostatic ionospheric solvers currently in use, the new solver takes ionospheric induction into account by solving Faraday's law simultaneously with Ohm's law and current continuity. From the viewpoint of an MHD simulation, the new inductive solver is similar to the electrostatic solvers, as the same input data is used (field-aligned current [FAC] and ionospheric conductances) and similar output is produced (ionospheric electric field). The inductive solver is tested using realistic, databased models of an omega-band and westward traveling surge. Although the tests were performed with local models and MHD simulations require a global ionospheric solution, we may nevertheless conclude that the new solution scheme is feasible also in practice. In the test cases the difference between static and electrodynamic solutions is up to ~10 V km-1 in certain locations, or up to 20-40% of the total electric field. This is in agreement with previous estimates. It should also be noted that if FAC is replaced by the ground magnetic field (or ionospheric equivalent current) in the input data set, exactly the same formalism can be used to construct an inductive version of the KRM method originally developed by Kamide et al. (1981).
NASA Technical Reports Server (NTRS)
Martin, E. D.; Lomax, H.
1977-01-01
Revised and extended versions of a fast, direct (noniterative) numerical Cauchy-Riemann solver are presented for solving finite difference approximations of first order systems of partial differential equations. Although the difference operators treated are linear and elliptic, one significant application of these extended direct Cauchy-Riemann solvers is in the fast, semidirect (iterative) solution of fluid dynamic problems governed by the nonlinear mixed elliptic-hyperbolic equations of transonic flow. Different versions of the algorithms are derived and the corresponding FORTRAN computer programs for a simple example problem are described and listed. The algorithms are demonstrated to be efficient and accurate.
Quadratic Optimization in the Problems of Active Control of Sound
NASA Technical Reports Server (NTRS)
Loncaric, J.; Tsynkov, S. V.; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulations of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources. These optimal solutions happen to be particular layers of monopoles on the perimeter of the protected region. Mathematically, minimization of acoustic source strength is equivalent to minimization in the sense of L(sub 1). By contrast. in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L(sub 2) norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L(sub 2) minimization is certainly the easiest problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we call compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L(sub 2) differ drastically from those obtained in the sense of L(sub 1).
New iterative solvers for the NAG Libraries
Salvini, S.; Shaw, G.
1996-12-31
The purpose of this paper is to introduce the work which has been carried out at NAG Ltd to update the iterative solvers for sparse systems of linear equations, both symmetric and unsymmetric, in the NAG Fortran 77 Library. Our current plans to extend this work and include it in our other numerical libraries in our range are also briefly mentioned. We have added to the Library the new Chapter F11, entirely dedicated to sparse linear algebra. At Mark 17, the F11 Chapter includes sparse iterative solvers, preconditioners, utilities and black-box routines for sparse symmetric (both positive-definite and indefinite) linear systems. Mark 18 will add solvers, preconditioners, utilities and black-boxes for sparse unsymmetric systems: the development of these has already been completed.
Using SPARK as a Solver for Modelica
Wetter, Michael; Wetter, Michael; Haves, Philip; Moshier, Michael A.; Sowell, Edward F.
2008-06-30
Modelica is an object-oriented acausal modeling language that is well positioned to become a de-facto standard for expressing models of complex physical systems. To simulate a model expressed in Modelica, it needs to be translated into executable code. For generating run-time efficient code, such a translation needs to employ algebraic formula manipulations. As the SPARK solver has been shown to be competitive for generating such code but currently cannot be used with the Modelica language, we report in this paper how SPARK's symbolic and numerical algorithms can be implemented in OpenModelica, an open-source implementation of a Modelica modeling and simulation environment. We also report benchmark results that show that for our air flow network simulation benchmark, the SPARK solver is competitive with Dymola, which is believed to provide the best solver for Modelica.
An approximate Riemann solver for hypervelocity flows
NASA Technical Reports Server (NTRS)
Jacobs, Peter A.
1991-01-01
We describe an approximate Riemann solver for the computation of hypervelocity flows in which there are strong shocks and viscous interactions. The scheme has three stages, the first of which computes the intermediate states assuming isentropic waves. A second stage, based on the strong shock relations, may then be invoked if the pressure jump across either wave is large. The third stage interpolates the interface state from the two initial states and the intermediate states. The solver is used as part of a finite-volume code and is demonstrated on two test cases. The first is a high Mach number flow over a sphere while the second is a flow over a slender cone with an adiabatic boundary layer. In both cases the solver performs well.
Application of Aeroelastic Solvers Based on Navier Stokes Equations
NASA Technical Reports Server (NTRS)
Keith, Theo G., Jr.; Srivastava, Rakesh
2001-01-01
The propulsion element of the NASA Advanced Subsonic Technology (AST) initiative is directed towards increasing the overall efficiency of current aircraft engines. This effort requires an increase in the efficiency of various components, such as fans, compressors, turbines etc. Improvement in engine efficiency can be accomplished through the use of lighter materials, larger diameter fans and/or higher-pressure ratio compressors. However, each of these has the potential to result in aeroelastic problems such as flutter or forced response. To address the aeroelastic problems, the Structural Dynamics Branch of NASA Glenn has been involved in the development of numerical capabilities for analyzing the aeroelastic stability characteristics and forced response of wide chord fans, multi-stage compressors and turbines. In order to design an engine to safely perform a set of desired tasks, accurate information of the stresses on the blade during the entire cycle of blade motion is required. This requirement in turn demands that accurate knowledge of steady and unsteady blade loading is available. To obtain the steady and unsteady aerodynamic forces for the complex flows around the engine components, for the flow regimes encountered by the rotor, an advanced compressible Navier-Stokes solver is required. A finite volume based Navier-Stokes solver has been developed at Mississippi State University (MSU) for solving the flow field around multistage rotors. The focus of the current research effort, under NASA Cooperative Agreement NCC3- 596 was on developing an aeroelastic analysis code (entitled TURBO-AE) based on the Navier-Stokes solver developed by MSU. The TURBO-AE code has been developed for flutter analysis of turbomachine components and delivered to NASA and its industry partners. The code has been verified. validated and is being applied by NASA Glenn and by aircraft engine manufacturers to analyze the aeroelastic stability characteristics of modem fans, compressors
Application of NASA General-Purpose Solver to Large-Scale Computations in Aeroacoustics
NASA Technical Reports Server (NTRS)
Watson, Willie R.; Storaasli, Olaf O.
2004-01-01
Of several iterative and direct equation solvers evaluated previously for computations in aeroacoustics, the most promising was the NASA-developed General-Purpose Solver (winner of NASA's 1999 software of the year award). This paper presents detailed, single-processor statistics of the performance of this solver, which has been tailored and optimized for large-scale aeroacoustic computations. The statistics, compiled using an SGI ORIGIN 2000 computer with 12 Gb available memory (RAM) and eight available processors, are the central processing unit time, RAM requirements, and solution error. The equation solver is capable of solving 10 thousand complex unknowns in as little as 0.01 sec using 0.02 Gb RAM, and 8.4 million complex unknowns in slightly less than 3 hours using all 12 Gb. This latter solution is the largest aeroacoustics problem solved to date with this technique. The study was unable to detect any noticeable error in the solution, since noise levels predicted from these solution vectors are in excellent agreement with the noise levels computed from the exact solution. The equation solver provides a means for obtaining numerical solutions to aeroacoustics problems in three dimensions.
A Coupled Finite Volume Solver for Incompressible Flows
NASA Astrophysics Data System (ADS)
Moukalled, F.; Darwish, M.
2008-09-01
This paper reports on a pressure-based coupled algorithm for the solution of laminar incompressible flow problems. The implicit pressure-velocity coupling is accomplished by deriving a pressure equation in a way similar to a segregated SIMPLE algorithm with the extended set of equations solved simultaneously and having diagonally dominant coefficients. The superiority of the coupled approach over the segregated approach is demonstrated by solving the lid-driven flow in a square cavity problem using both methodologies and comparing their computational costs. Results indicate that the number of iterations needed by the coupled solver is grid independent. Moreover, recorded CPU time values reveal that the coupled approach substantially reduces the computational cost with the reduction rate for the problem solved increasing as the grid size increases and reaching a value as high as 115.
Bordner, J.; Saied, F.
1996-12-31
GLab3D is an enhancement of an interactive environment (MGLab) for experimenting with iterative solvers and multigrid algorithms. It is implemented in MATLAB. The new version has built-in 3D elliptic pde`s and several iterative methods and preconditioners that were not available in the original version. A sparse direct solver option has also been included. The multigrid solvers have also been extended to 3D. The discretization and pde domains are restricted to standard finite differences on the unit square/cube. The power of this software studies in the fact that no programming is needed to solve, for example, the convection-diffusion equation in 3D with TFQMR and a customized V-cycle preconditioner, for a variety of problem sizes and mesh Reynolds, numbers. In addition to the graphical user interface, some sample drivers are included to show how experiments can be composed using the underlying suite of problems and solvers.
Physical activity problem-solving inventory for adolescents: Development and initial validation
Technology Transfer Automated Retrieval System (TEKTRAN)
Youth encounter physical activity barriers, often called problems. The purpose of problem-solving is to generate solutions to overcome the barriers. Enhancing problem-solving ability may enable youth to be more physically active. Therefore, a method for reliably assessing physical activity problem-s...
Brittle Solvers: Lessons and insights into effective solvers for visco-plasticity in geodynamics
NASA Astrophysics Data System (ADS)
Spiegelman, M. W.; May, D.; Wilson, C. R.
2014-12-01
Plasticity/Fracture and rock failure are essential ingredients in geodynamic models as terrestrial rocks do not possess an infinite yield strength. Numerous physical mechanisms have been proposed to limit the strength of rocks, including low temperature plasticity and brittle fracture. While ductile and creep behavior of rocks at depth is largely accepted, the constitutive relations associated with brittle failure, or shear localisation, are more controversial. Nevertheless, there are really only a few macroscopic constitutive laws for visco-plasticity that are regularly used in geodynamics models. Independent of derivation, all of these can be cast as simple effective viscosities which act as stress limiters with different choices for yield surfaces; the most common being a von Mises (constant yield stress) or Drucker-Prager (pressure dependent yield-stress) criterion. The choice of plasticity model, however, can have significant consequences for the degree of non-linearity in a problem and the choice and efficiency of non-linear solvers. Here we describe a series of simplified 2 and 3-D model problems to elucidate several issues associated with obtaining accurate description and solution of visco-plastic problems. We demonstrate that1) Picard/Successive substitution schemes for solution of the non-linear problems can often stall at large values of the non-linear residual, thus producing spurious solutions2) Combined Picard/Newton schemes can be effective for a range of plasticity models, however, they can produce serious convergence problems for strongly pressure dependent plasticity models such as Drucker-Prager.3) Nevertheless, full Drucker-Prager may not be the plasticity model of choice for strong materials as the dynamic pressures produced in these layers can develop pathological behavior with Drucker-Prager, leading to stress strengthening rather than stress weakening behavior.4) In general, for any incompressible Stoke's problem, it is highly advisable to
A fast nonlinear conjugate gradient based method for 3D concentrated frictional contact problems
NASA Astrophysics Data System (ADS)
Zhao, Jing; Vollebregt, Edwin A. H.; Oosterlee, Cornelis W.
2015-05-01
This paper presents a fast numerical solver for a nonlinear constrained optimization problem, arising from 3D concentrated frictional shift and rolling contact problems with dry Coulomb friction. The solver combines an active set strategy with a nonlinear conjugate gradient method. One novelty is to consider the tractions of each slip element in a polar coordinate system, using azimuth angles as variables instead of conventional traction variables. The new variables are scaled by the diagonal of the underlying Jacobian. The fast Fourier transform (FFT) technique accelerates all matrix-vector products encountered, exploiting the matrix' Toeplitz structure. Numerical tests demonstrate a significant reduction of the computational time compared to existing solvers for concentrated contact problems.
Evaluating Sparse Linear System Solvers on Scalable Parallel Architectures
2008-10-01
iterations will be necessary to assure sufficient accuracy whenever we do not use a direct method to solve (1.3) or (1.5). The overall SPIKE algorithm...boosting is activated, SPIKE is not used as a direct solver but rather as a preconditioner. In this case outer iterations via a Krylov subspace method ...robustness. Preconditioning aims to improve the robustness of iterative methods by transforming the system into M−1Ax = M−1f, or AM−1(Mx) = f. (3.2
Fast methods incorporating direct elliptic solvers for nonlinear applications in fluid dynamics
NASA Technical Reports Server (NTRS)
Martin, E. D.
1977-01-01
Semidirect methods are discussed, their present role, as well as some developments for their application in computational fluid dynamics. A semidirect method is a computational scheme that uses a fast, direct, elliptic solver as the driving algorithm for the iterative solution of finite difference equations. Specific subtopics include: (1) direct Cauchy Riemann solvers for first order elliptic equations; (2) application of the semidirect method to the mixed elliptic hyperbolic problem of steady, inviscid transonic flow; and (3) the treatment of interior conditions, such as those on an airfoil or wing, in semidirect methods.
Collaborative Problem Solving in Shared Space
ERIC Educational Resources Information Center
Lin, Lin; Mills, Leila A.; Ifenthaler, Dirk
2015-01-01
The purpose of this study was to examine collaborative problem solving in a shared virtual space. The main question asked was: How will the performance and processes differ between collaborative problem solvers and independent problem solvers over time? A total of 104 university students (63 female and 41 male) participated in an experimental…
Wavelet-based Poisson Solver for use in Particle-In-CellSimulations
Terzic, B.; Mihalcea, D.; Bohn, C.L.; Pogorelov, I.V.
2005-05-13
We report on a successful implementation of a wavelet based Poisson solver for use in 3D particle-in-cell (PIC) simulations. One new aspect of our algorithm is its ability to treat the general(inhomogeneous) Dirichlet boundary conditions (BCs). The solver harnesses advantages afforded by the wavelet formulation, such as sparsity of operators and data sets, existence of effective preconditioners, and the ability simultaneously to remove numerical noise and further compress relevant data sets. Having tested our method as a stand-alone solver on two model problems, we merged it into IMPACT-T to obtain a fully functional serial PIC code. We present and discuss preliminary results of application of the new code to the modeling of the Fermilab/NICADD and AES/JLab photoinjectors.
A fast parallel Poisson solver on irregular domains applied to beam dynamics simulations
Adelmann, A. Arbenz, P. Ineichen, Y.
2010-06-20
We discuss the scalable parallel solution of the Poisson equation within a Particle-In-Cell (PIC) code for the simulation of electron beams in particle accelerators of irregular shape. The problem is discretized by Finite Differences. Depending on the treatment of the Dirichlet boundary the resulting system of equations is symmetric or 'mildly' nonsymmetric positive definite. In all cases, the system is solved by the preconditioned conjugate gradient algorithm with smoothed aggregation (SA) based algebraic multigrid (AMG) preconditioning. We investigate variants of the implementation of SA-AMG that lead to considerable improvements in the execution times. We demonstrate good scalability of the solver on distributed memory parallel processor with up to 2048 processors. We also compare our iterative solver with an FFT-based solver that is more commonly used for applications in beam dynamics.
dugksFoam: An open source OpenFOAM solver for the Boltzmann model equation
NASA Astrophysics Data System (ADS)
Zhu, Lianhua; Chen, Songze; Guo, Zhaoli
2017-04-01
A deterministic Boltzmann model equation solver called dugksFoam has been developed in the framework of the open source CFD toolbox OpenFOAM. The solver adopts the discrete unified gas kinetic scheme (Guo et al., 2015) with the Shakhov collision model. It has been validated by simulating several test cases covering different flow regimes including the one dimensional shock tube problem, a two dimensional thermal induced flow and the three dimensional lid-driven cavity flow. The solver features a parallel computing ability based on the velocity space decomposition, which is different from the physical space decomposition based approach provided by the OpenFOAM framework. The two decomposition approaches have been compared in both two and three dimensional cases. The parallel performance improves significantly using the newly implemented approach. A speed up by two orders of magnitudes has been observed using 256 cores on a small cluster.
Plasma wave simulation based on versatile FEM solver on Alcator C-mod
Shiraiwa, S.; Meneghini, O.; Parker, R.; Wallace, G.; Wilson, J.
2009-11-26
The finite element method (FEM) has the potential of simulating plasma waves seamlessly from the core to the vacuum and antenna regions. We explored the possibility of using a versatile FEM solver package, COMSOL, for lower hybrid (LH) wave simulation. Special care was paid to boundary conditions to satisfy toroidal symmetry. The non-trivial issue of introducing hot plasma effects was addressed by an iterative algorithm. These techniques are verified both analytically and numerically. In the lower hybrid (LH) grill antenna coupling problem, the FEM solver successfully reproduced the solution that was obtained analytically. Propagation of LH waves on the Alcator C and Alcator C-MOD plasmas was compared with a ray-tracing code, showing good consistency. The approach based on the FEM is computationally less intensive compared to spectral domain solvers, and more suitable for the simulation of larger device such as ITER.
Active Physics Problem Based Learning for High Schools
NASA Astrophysics Data System (ADS)
Eisenkraft, Arthur
2006-12-01
Active Physics bridges research and practice. This NSF supported curriculum project uses a 7E instructional model and a problem based learning approach. Students learn physics on a need to know basis as they construct solutions to challenges such as developing a sport that can be played on the moon, creating an appliance package for developing countries, designing a light and sound show, or building a museum exhibit. In addition to meeting the content requirements of an introductory physics course, there is also an emphasis on engineering design principles and on essential questions. The excitement and frustration of trying to bridge research and practice will be discussed.
NASA Astrophysics Data System (ADS)
Yamasaki, Tadashi; Houseman, Gregory; Hamling, Ian; Postek, Elek
2010-05-01
We have developed a new parallelized 3-D numerical code, OREGANO_VE, for the solution of the general visco-elastic problem in a rectangular block domain. The mechanical equilibrium equation is solved using the finite element method for a (non-)linear Maxwell visco-elastic rheology. Time-dependent displacement and/or traction boundary conditions can be applied. Matrix assembly is based on a tetrahedral element defined by 4 vertex nodes and 6 nodes located at the midpoints of the edges, and within which displacement is described by a quadratic interpolation function. For evaluating viscoelastic relaxation, an explicit time-stepping algorithm (Zienkiewicz and Cormeau, Int. J. Num. Meth. Eng., 8, 821-845, 1974) is employed. We test the accurate implementation of the OREGANO_VE by comparing numerical and analytic (or semi-analytic half-space) solutions to different problems in a range of applications: (1) equilibration of stress in a constant density layer after gravity is switched on at t = 0 tests the implementation of spatially variable viscosity and non-Newtonian viscosity; (2) displacement of the welded interface between two blocks of differing viscosity tests the implementation of viscosity discontinuities, (3) displacement of the upper surface of a layer under applied normal load tests the implementation of time-dependent surface tractions (4) visco-elastic response to dyke intrusion (compared with the solution in a half-space) tests the implementation of all aspects. In each case, the accuracy of the code is validated subject to use of a sufficiently small time step, providing assurance that the OREGANO_VE code can be applied to a range of visco-elastic relaxation processes in three dimensions, including post-seismic deformation and post-glacial uplift. The OREGANO_VE code includes a capability for representation of prescribed fault slip on an internal fault. The surface displacement associated with large earthquakes can be detected by some geodetic observations
Progress in developing Poisson-Boltzmann equation solvers
Li, Chuan; Li, Lin; Petukh, Marharyta; Alexov, Emil
2013-01-01
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nano-objects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeling macromolecular electrostatics is reviewed from two different angles: as a mathematical task provided the specific definition of the system to be modeled and as a physical problem aiming to better capture the phenomena occurring in the real experiments. In addition, specific attention is paid to methods to extend the capabilities of the existing solvers to model large systems toward applications of calculations of the electrostatic potential and energies in molecular motors, mitochondria complex, photosynthetic machinery and systems involving large nano-objects. PMID:24199185
NASA Astrophysics Data System (ADS)
Gurr, Henry
2014-03-01
Princeton Physicist J. J. Hopfield's Mathematical Model of the Mammalian Brain, (Similar To Ising Glass Model of a crystal of magnetic spin particles) says our Brain-Work for Memory, Perception, Language, Thinking, etc, (Even the AHA-EUREKA-Flash Of Insight Type Problem Solving), is achieved by our massively inter-connected CNS Neurons ... working together ... MINIMIZING an analog of physical energy ... thus yielding Optimal Solutions: These ``best'' answers, correspond to highest mental coherence, for most facets organism response, beit mental (eg: perception, memory, ideas, thinking, etc) or physical-muscular-actions (eg speaking, tool using, trail following, etc). Our brain is this way, because living creature, MUST be evolved, so they will find & use the best actions, for survival!!! Our human heritage, is to instantly compute near optimal future plans, (mental & physical-muscular), and be able to accomplish plans reliably & efficiently. If you know of book or articles in these topic areas, please email to HenryG--USCA.edu How to work well, with your own ``self'', called mind-body, will follow!! Conjectures: Who is the ``I'' that appears to make decisions? Am ``I'' the master of my domain? Is there an ``I'' or am ``I'' merely an illusion of reality.
Algorithms for parallel flow solvers on message passing architectures
NASA Technical Reports Server (NTRS)
Vanderwijngaart, Rob F.
1995-01-01
The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments.
Fisicaro, G; Genovese, L; Andreussi, O; Marzari, N; Goedecker, S
2016-01-07
The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments
Fisicaro, G. Goedecker, S.; Genovese, L.; Andreussi, O.; Marzari, N.
2016-01-07
The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.
Domain Decomposition for the SPN Solver MINOS
NASA Astrophysics Data System (ADS)
Jamelot, Erell; Baudron, Anne-Marie; Lautard, Jean-Jacques
2012-12-01
In this article we present a domain decomposition method for the mixed SPN equations, discretized with Raviart-Thomas-Nédélec finite elements. This domain decomposition is based on the iterative Schwarz algorithm with Robin interface conditions to handle communications. After having described this method, we give details on how to optimize the convergence. Finally, we give some numerical results computed in a realistic 3D domain. The computations are done with the MINOS solver of the APOLLO3® code.
Domain decomposition for the SPN solver MINOS
Jamelot, Erell; Baudron, Anne-Marie; Lautard, Jean-Jacques
2012-07-01
In this article we present a domain decomposition method for the mixed SPN equations, discretized with Raviart-Thomas-Nedelec finite elements. This domain decomposition is based on the iterative Schwarz algorithm with Robin interface conditions to handle communications. After having described this method, we give details on how to optimize the convergence. Finally, we give some numerical results computed in a realistic 3D domain. The computations are done with the MINOS solver of the APOLLO3 (R) code. (authors)
Areas of Unsolved Problems in Caribbean Active Tectonics
NASA Astrophysics Data System (ADS)
Mann, P.
2015-12-01
I review some unsolved problems in Caribbean active tectonics. At the regional and plate scale: 1) confirm the existence of intraplate deformation zones of the central Caribbean plate that are within the margin of error of ongoing GPS measurements; 2) carry out field studies to evaluate block models versus models for distributed fault shear on the densely populated islands of Jamaica, Hispaniola, Puerto Rico, and the Virgin Islands; 3) carry out paleoseismological research of key plate boundary faults that may have accumulated large strains but have not been previously studied in detail; 4) determine the age of onset and far-field effects of the Cocos ridge and the Central America forearc sliver; 4) investigate the origin and earthquake-potential of obliquely-sheared rift basins along the northern coast of Venezuela; 5) determine the age of onset and regional active, tectonic effects of the Panama-South America collision including the continued activation of the Maracaibo block; and 6) validate longterm rates on active subduction zones with improving, tomographic maps of subducted slabs. At the individual fault scale: 1) determine the mode of termination of large and active strike -slip faults and application of the STEP model (Septentrional, Polochic, El Pilar, Bocono, Santa Marta-Bucaramanaga); 2) improve the understanding of the earthquake potential on the Enriquillo-Plantain Garden fault zone given "off-fault" events such as the 2010 Haiti earthquake; how widespread is this behavior?; and 3) estimate size of future tsunamis from studies of historic or prehistoric slump scars and mass transport deposits; what potential runups can be predicted from this information?; and 4) devise ways to keep rapidly growing, circum-Caribbean urban populations better informed and safer in the face of inevitable and future, large earthquakes.
Preconditioned implicit solvers for the Navier-Stokes equations on distributed-memory machines
NASA Technical Reports Server (NTRS)
Ajmani, Kumud; Liou, Meng-Sing; Dyson, Rodger W.
1994-01-01
The GMRES method is parallelized, and combined with local preconditioning to construct an implicit parallel solver to obtain steady-state solutions for the Navier-Stokes equations of fluid flow on distributed-memory machines. The new implicit parallel solver is designed to preserve the convergence rate of the equivalent 'serial' solver. A static domain-decomposition is used to partition the computational domain amongst the available processing nodes of the parallel machine. The SPMD (Single-Program Multiple-Data) programming model is combined with message-passing tools to develop the parallel code on a 32-node Intel Hypercube and a 512-node Intel Delta machine. The implicit parallel solver is validated for internal and external flow problems, and is found to compare identically with flow solutions obtained on a Cray Y-MP/8. A peak computational speed of 2300 MFlops/sec has been achieved on 512 nodes of the Intel Delta machine,k for a problem size of 1024 K equations (256 K grid points).
A Tensor-Train accelerated solver for integral equations in complex geometries
NASA Astrophysics Data System (ADS)
Corona, Eduardo; Rahimian, Abtin; Zorin, Denis
2017-04-01
We present a framework using the Quantized Tensor Train (QTT) decomposition to accurately and efficiently solve volume and boundary integral equations in three dimensions. We describe how the QTT decomposition can be used as a hierarchical compression and inversion scheme for matrices arising from the discretization of integral equations. For a broad range of problems, computational and storage costs of the inversion scheme are extremely modest O (log N) and once the inverse is computed, it can be applied in O (Nlog N) . We analyze the QTT ranks for hierarchically low rank matrices and discuss its relationship to commonly used hierarchical compression techniques such as FMM and HSS. We prove that the QTT ranks are bounded for translation-invariant systems and argue that this behavior extends to non-translation invariant volume and boundary integrals. For volume integrals, the QTT decomposition provides an efficient direct solver requiring significantly less memory compared to other fast direct solvers. We present results demonstrating the remarkable performance of the QTT-based solver when applied to both translation and non-translation invariant volume integrals in 3D. For boundary integral equations, we demonstrate that using a QTT decomposition to construct preconditioners for a Krylov subspace method leads to an efficient and robust solver with a small memory footprint. We test the QTT preconditioners in the iterative solution of an exterior elliptic boundary value problem (Laplace) formulated as a boundary integral equation in complex, multiply connected geometries.
Riemann solvers and Alfven waves in black hole magnetospheres
NASA Astrophysics Data System (ADS)
Punsly, Brian; Balsara, Dinshaw; Kim, Jinho; Garain, Sudip
2016-09-01
In the magnetosphere of a rotating black hole, an inner Alfven critical surface (IACS) must be crossed by inflowing plasma. Inside the IACS, Alfven waves are inward directed toward the black hole. The majority of the proper volume of the active region of spacetime (the ergosphere) is inside of the IACS. The charge and the totally transverse momentum flux (the momentum flux transverse to both the wave normal and the unperturbed magnetic field) are both determined exclusively by the Alfven polarization. Thus, it is important for numerical simulations of black hole magnetospheres to minimize the dissipation of Alfven waves. Elements of the dissipated wave emerge in adjacent cells regardless of the IACS, there is no mechanism to prevent Alfvenic information from crossing outward. Thus, numerical dissipation can affect how simulated magnetospheres attain the substantial Goldreich-Julian charge density associated with the rotating magnetic field. In order to help minimize dissipation of Alfven waves in relativistic numerical simulations we have formulated a one-dimensional Riemann solver, called HLLI, which incorporates the Alfven discontinuity and the contact discontinuity. We have also formulated a multidimensional Riemann solver, called MuSIC, that enables low dissipation propagation of Alfven waves in multiple dimensions. The importance of higher order schemes in lowering the numerical dissipation of Alfven waves is also catalogued.
The School Problem-Solver's Guide to Distance Education.
ERIC Educational Resources Information Center
Levinson, Cynthia Y.
Many administrators are meeting specific instructional needs of their students without always or solely relying on classroom teachers by utilizing distance education, i.e., instruction that takes place while the learner is physically distant from the instructor and/or the materials. Distance education is particularly appropriate in rural and small…
Opening up the Collaborative Problem-Solving Process to Solvers
ERIC Educational Resources Information Center
Robison, Tyler
2013-01-01
In software systems, having features of openness means that some of the internal components of the system are made available for examination by users. Researchers have looked at different effects of open systems a great deal in the area of educational technology, but also in areas outside of education. Properly used, openness has the potential to…
A fast solver for systems of reaction-diffusion equations.
Garbey, M.; Kaper, H. G.; Romanyukha, N.
2001-04-20
In this paper we present a fast algorithm for the numerical solution of systems of reaction-diffusion equations, {partial_derivative}{sub t} u + a {center_dot} {del}u = {Delta}u + f(x,t,u), and x element of {Omega} contained in R{sup 3}, t > 0. Here, u is a vector-valued function, u triple bond u(x,t) element of R{sup m} is large, and the corresponding system of ODEs, {partial_derivative}{sub t}u = F(x,t,u), is stiff. Typical examples arise in air pollution studies, where a is the given wind field and the nonlinear function F models the atmospheric chemistry. The time integration of Eq. (1) is best handled by the method of characteristics. The problem is thus reduced to designing for the reaction-diffusion part a fast solver that has good stability properties for the given time step and does not require the computation of the full Jacobi matrix. An operator-splitting technique, even a high-order one, combining a fast nonlinear ODE solver with an efficient solver for the diffusion operator is less effective when the reaction term is stiff. In fact, the classical Strang splitting method may underperform a first-order source splitting method. The algorithm we propose in this paper uses an a posteriori filtering technique to stabilize the computation of the diffusion term. The algorithm parallelizes well, because the solution of the large system of ODEs is done pointwise; however, the integration of the chemistry may lead to load-balancing problems. The Tchebycheff acceleration technique proposed in offers an alternative that complements the approach presented here. To facilitate the presentation, we limit the discussion to domains {Omega} that either admit a regular discretization grid or decompose into subdomains that admit regular discretization grids. We describe the algorithm for one-dimensional domains in Section 2 and for multidimensional domains in Section 3. Section 4 briefly outlines future work.
GPU accelerated FDTD solver and its application in MRI.
Chi, J; Liu, F; Jin, J; Mason, D G; Crozier, S
2010-01-01
The finite difference time domain (FDTD) method is a popular technique for computational electromagnetics (CEM). The large computational power often required, however, has been a limiting factor for its applications. In this paper, we will present a graphics processing unit (GPU)-based parallel FDTD solver and its successful application to the investigation of a novel B1 shimming scheme for high-field magnetic resonance imaging (MRI). The optimized shimming scheme exhibits considerably improved transmit B(1) profiles. The GPU implementation dramatically shortened the runtime of FDTD simulation of electromagnetic field compared with its CPU counterpart. The acceleration in runtime has made such investigation possible, and will pave the way for other studies of large-scale computational electromagnetic problems in modern MRI which were previously impractical.
Large-scale linear nonparallel support vector machine solver.
Tian, Yingjie; Ping, Yuan
2014-02-01
Twin support vector machines (TWSVMs), as the representative nonparallel hyperplane classifiers, have shown the effectiveness over standard SVMs from some aspects. However, they still have some serious defects restricting their further study and real applications: (1) They have to compute and store the inverse matrices before training, it is intractable for many applications where data appear with a huge number of instances as well as features; (2) TWSVMs lost the sparseness by using a quadratic loss function making the proximal hyperplane close enough to the class itself. This paper proposes a Sparse Linear Nonparallel Support Vector Machine, termed as L1-NPSVM, to deal with large-scale data based on an efficient solver-dual coordinate descent (DCD) method. Both theoretical analysis and experiments indicate that our method is not only suitable for large scale problems, but also performs as good as TWSVMs and SVMs.
AN ADAPTIVE PARTICLE-MESH GRAVITY SOLVER FOR ENZO
Passy, Jean-Claude; Bryan, Greg L.
2014-11-01
We describe and implement an adaptive particle-mesh algorithm to solve the Poisson equation for grid-based hydrodynamics codes with nested grids. The algorithm is implemented and extensively tested within the astrophysical code Enzo against the multigrid solver available by default. We find that while both algorithms show similar accuracy for smooth mass distributions, the adaptive particle-mesh algorithm is more accurate for the case of point masses, and is generally less noisy. We also demonstrate that the two-body problem can be solved accurately in a configuration with nested grids. In addition, we discuss the effect of subcycling, and demonstrate that evolving all the levels with the same timestep yields even greater precision.
Performance evaluation of a parallel sparse lattice Boltzmann solver
Axner, L. Bernsdorf, J. Zeiser, T. Lammers, P. Linxweiler, J. Hoekstra, A.G.
2008-05-01
We develop a performance prediction model for a parallelized sparse lattice Boltzmann solver and present performance results for simulations of flow in a variety of complex geometries. A special focus is on partitioning and memory/load balancing strategy for geometries with a high solid fraction and/or complex topology such as porous media, fissured rocks and geometries from medical applications. The topology of the lattice nodes representing the fluid fraction of the computational domain is mapped on a graph. Graph decomposition is performed with both multilevel recursive-bisection and multilevel k-way schemes based on modified Kernighan-Lin and Fiduccia-Mattheyses partitioning algorithms. Performance results and optimization strategies are presented for a variety of platforms, showing a parallel efficiency of almost 80% for the largest problem size. A good agreement between the performance model and experimental results is demonstrated.
NASA Astrophysics Data System (ADS)
Aricò, Costanza; Lo Re, Carlo
2016-12-01
We extend a recently proposed 2D depth-integrated Finite Volume solver for the nonlinear shallow water equations with non-hydrostatic pressure distribution. The proposed model is aimed at simulating both nonlinear and dispersive shallow water processes. We split the total pressure into its hydrostatic and dynamic components and solve a hydrostatic problem and a non-hydrostatic problem sequentially, in the framework of a fractional time step procedure. The dispersive properties are achieved by incorporating the non-hydrostatic pressure component in the governing equations. The governing equations are the depth-integrated continuity equation and the depth-integrated momentum equations along the x, y and z directions. Unlike the previous non-hydrostatic shallow water solver, in the z momentum equation, we retain both the vertical local and convective acceleration terms. In the former solver, we keep only the local vertical acceleration term. In this paper, we investigate the effects of these convective terms and the possible improvements of the computed solution when these terms are not neglected in the governing equations, especially in strongly nonlinear processes. The presence of the convective terms in the vertical momentum equation leads to a numerical solution procedure, which is quite different from the one of the previous solver, in both the hydrostatic and dynamic steps. We discretize the spatial domain using unstructured triangular meshes satisfying the Generalized Delaunay property. The numerical solver is shock capturing and easily addresses wetting/drying problems, without any additional equation to solve at wet/dry interfaces. We present several numerical applications for challenging flooding processes encountered in practical aspects over irregular topography, including a new set of experiments carried out at the Hydraulics Laboratory of the University of Palermo.
ERIC Educational Resources Information Center
Donoghue, John R.
2015-01-01
At the heart of van der Linden's approach to automated test assembly (ATA) is a linear programming/integer programming (LP/IP) problem. A variety of IP solvers are available, ranging in cost from free to hundreds of thousands of dollars. In this paper, I compare several approaches to solving the underlying IP problem. These approaches range from…
Stevens, D.E.; Bretherton, S.
1996-12-01
This paper presents a new forward-in-time advection method for nearly incompressible flow, MU, and its application to an adaptive multilevel flow solver for atmospheric flows. MU is a modification of Leonard et al.`s UTOPIA scheme. MU, like UTOPIA, is based on third-order accurate semi-Lagrangian multidimensional upwinding for constant velocity flows. for varying velocity fields, MU is a second-order conservative method. MU has greater stability and accuracy than UTOPIA and naturally decomposes into a monotone low-order method and a higher-order accurate correction for use with flux limiting. Its stability and accuracy make it a computationally efficient alternative to current finite-difference advection methods. We present a fully second-order accurate flow solver for the anelastic equations, a prototypical low Mach number flow. The flow solver is based on MU which is used for both momentum and scalar transport equations. This flow solver can also be implemented with any forward-in-time advection scheme. The multilevel flow solver conserves discrete global integrals of advected quantities and includes adaptive mesh refinements. Its second-order accuracy is verified using a nonlinear energy conservation integral for the anelastic equations. For a typical geophysical problem in which the flow is most rapidly varying in a small part of the domain, the multilevel flow solver achieves global accuracy comparable to uniform-resolution simulation for 10% of the computational cost. 36 refs., 10 figs.
AQUASOL: An efficient solver for the dipolar Poisson–Boltzmann–Langevin equation
Koehl, Patrice; Delarue, Marc
2010-01-01
The Poisson–Boltzmann (PB) formalism is among the most popular approaches to modeling the solvation of molecules. It assumes a continuum model for water, leading to a dielectric permittivity that only depends on position in space. In contrast, the dipolar Poisson–Boltzmann–Langevin (DPBL) formalism represents the solvent as a collection of orientable dipoles with nonuniform concentration; this leads to a nonlinear permittivity function that depends both on the position and on the local electric field at that position. The differences in the assumptions underlying these two models lead to significant differences in the equations they generate. The PB equation is a second order, elliptic, nonlinear partial differential equation (PDE). Its response coefficients correspond to the dielectric permittivity and are therefore constant within each subdomain of the system considered (i.e., inside and outside of the molecules considered). While the DPBL equation is also a second order, elliptic, nonlinear PDE, its response coefficients are nonlinear functions of the electrostatic potential. Many solvers have been developed for the PB equation; to our knowledge, none of these can be directly applied to the DPBL equation. The methods they use may adapt to the difference; their implementations however are PBE specific. We adapted the PBE solver originally developed by Holst and Saied [J. Comput. Chem. 16, 337 (1995)] to the problem of solving the DPBL equation. This solver uses a truncated Newton method with a multigrid preconditioner. Numerical evidences suggest that it converges for the DPBL equation and that the convergence is superlinear. It is found however to be slow and greedy in memory requirement for problems commonly encountered in computational biology and computational chemistry. To circumvent these problems, we propose two variants, a quasi-Newton solver based on a simplified, inexact Jacobian and an iterative self-consistent solver that is based directly on
NASA Astrophysics Data System (ADS)
Lochon, H.; Daude, F.; Galon, P.; Hérard, J.-M.
2016-12-01
The computation of compressible two-phase flows with the Baer-Nunziato model is addressed. Only the convective part of the model that exhibits non-conservative products is considered and the source terms of the model that represent the exchange between phases are neglected. Based on the solver proposed by Tokareva & Toro [1], a new HLLC-type Riemann solver is built. The key idea of this new solver lies in an approximation of the two-phase contact discontinuity of the model. Thus the Riemann invariants of the wave are approximated in the "subsonic" case. A major consequence of this approximation is that the resulting solver can deal with any Equation Of State. It also allows to bypass the resolution of a non-linear equation based on those Riemann invariants. We assess the solver and compare it with others on 1D Riemann problems including grid convergence and efficiency studies. The ability of the proposed solver to deal with complex Equations Of State is also investigated. Finally, the different solvers have been compared on challenging 2D test-cases due to the presence of both material interfaces and shock waves: a shock-bubble interaction and underwater explosions. When compared with others, the present solver appears to be accurate, efficient and robust.
The development of a robust, efficient solver for spectral and spectral-element time discretizations
NASA Astrophysics Data System (ADS)
Mundis, Nathan L.
This work examines alternative time discretizations for the Euler equations and methods for the robust and efficient solution of these discretizations. Specifically, the time-spectral method (TS), quasi-periodic time-spectral method (BDFTS), and spectral-element method in time (SEMT) are derived and examined in detail. For the two time-spectral based methods, focus is given to expanding these methods for more complicated problems than have been typically solved by other authors, including problems with spectral content in a large number of harmonics, gust response problems, and aeroelastic problems. To solve these more complicated problems, it was necessary to implement the flexible variant of the Generalized Minimal Residual method (FGMRES), utilizing the full second-order accurate spatial Jacobian, complete temporal coupling of the chosen time discretization, and fully-implicit coupling of the aeroelastic equations in the cases where they are needed. The FGMRES solver developed utilizes a block-colored Gauss-Seidel (BCGS) preconditioner augmented by a defect-correction process to increase its effectiveness. Exploration of more efficient preconditioners for the FGMRES solver is an anticipated topic for future work in this field. It was a logical extension to apply this already developed FGMRES solver to the spectral-element method in time, which has some advantages over the spectral methods already discussed. Unlike purely-spectral methods, SEMT allows for bothh- and p-refinement. This property could allow for element clustering around areas of sharp gradients and discontinuities, which in turn could make SEMT more efficient than TS for periodic problems that contain these sharp gradients and would require many time instances to produce a precise solution using the TS method. As such, a preliminary investigation of the SEMT method applied to the Euler equations is conducted and some areas for needed improvement in future work are identified. In this work, it is
Updates to the NEQAIR Radiation Solver
NASA Technical Reports Server (NTRS)
Cruden, Brett A.; Brandis, Aaron M.
2014-01-01
The NEQAIR code is one of the original heritage solvers for radiative heating prediction in aerothermal environments, and is still used today for mission design purposes. This paper discusses the implementation of the first major revision to the NEQAIR code in the last five years, NEQAIR v14.0. The most notable features of NEQAIR v14.0 are the parallelization of the radiation computation, reducing runtimes by about 30×, and the inclusion of mid-wave CO2 infrared radiation.
Three-Dimensional Inverse Transport Solver Based on Compressive Sensing Technique
NASA Astrophysics Data System (ADS)
Cheng, Yuxiong; Wu, Hongchun; Cao, Liangzhi; Zheng, Youqi
2013-09-01
According to the direct exposure measurements from flash radiographic image, a compressive sensing-based method for three-dimensional inverse transport problem is presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. It is always very expensive to obtain enough measurements. With limited measurements, compressive sensing sparse reconstruction technique orthogonal matching pursuit is applied to obtain the sparse coefficients by solving an optimization problem. A three-dimensional inverse transport solver is developed based on a compressive sensing-based technique. There are three features in this solver: (1) AutoCAD is employed as a geometry preprocessor due to its powerful capacity in graphic. (2) The forward projection matrix rather than Gauss matrix is constructed by the visualization tool generator. (3) Fourier transform and Daubechies wavelet transform are adopted to convert an underdetermined system to a well-posed system in the algorithm. Simulations are performed and numerical results in pseudo-sine absorption problem, two-cube problem and two-cylinder problem when using compressive sensing-based solver agree well with the reference value.
A finite different field solver for dipole modes
Nelson, E.M.
1992-08-01
A finite element field solver for dipole modes in axisymmetric structures has been written. The second-order elements used in this formulation yield accurate mode frequencies with no spurious modes. Quasi-periodic boundaries are included to allow travelling waves in periodic structures. The solver is useful in applications requiring precise frequency calculations such as detuned accelerator structures for linear colliders. Comparisons are made with measurements and with the popular but less accurate field solver URMEL.
Stress, active coping, and problem behaviors among Chinese adolescents.
Hsieh, Hsing-Fang; Zimmerman, Marc A; Xue, Yange; Bauermeister, Jose A; Caldwell, Cleopatra H; Wang, Zhenhong; Hou, Yubo
2014-07-01
Little is known about the stress and coping mechanisms on problem behaviors among Chinese adolescents, which might be quite different from their counterparts in Western cultures. We examined risk process of stress for internalizing outcomes (i.e., psychological distress, self-acceptance) and externalizing outcomes (i.e., substance use, delinquency, violent behavior) among Chinese adolescents. We also examined John Henryism Active Coping as a protective factor in a test of resilience from the negative effects of stress. A cross-sectional survey using self-reported questionnaires was conducted in 2 urban cities in China: Beijing and Xian. Participants included 1,356 students in Grades 7 to 12 (48% male, 52% female). Structural equation modeling analyses were conducted to test the conceptual model. The modifying (protective) effects of John Henryism were tested in multiple-group analysis. After controlling for demographics, we found that stress was associated with decreased self-acceptance and increased psychological distress among adolescents. Higher degree of psychological distress was then associated with increased delinquent behaviors and substance use. The results also indicated that individuals who scored higher in John Henryism reported more substance use as a result of psychological distress. Overall, our results support previous research with Western samples. Although John Henryism did not serve as a protective factor between stress and its negative outcomes, the findings underscore the relevance of addressing stress and possible coping strategies among Chinese adolescents. Further research that refines the active coping tailored for Chinese adolescents is necessary to more precisely test its protective effects.
A 3D approximate maximum likelihood localization solver
2016-09-23
A robust three-dimensional solver was needed to accurately and efficiently estimate the time sequence of locations of fish tagged with acoustic transmitters and vocalizing marine mammals to describe in sufficient detail the information needed to assess the function of dam-passage design alternatives and support Marine Renewable Energy. An approximate maximum likelihood solver was developed using measurements of time difference of arrival from all hydrophones in receiving arrays on which a transmission was detected. Field experiments demonstrated that the developed solver performed significantly better in tracking efficiency and accuracy than other solvers described in the literature.
Jia, Jingfei
2015-01-01
It is well known that radiative transfer equation (RTE) provides more accurate tomographic results than its diffusion approximation (DA). However, RTE-based tomographic reconstruction codes have limited applicability in practice due to their high computational cost. In this article, we propose a new efficient method for solving the RTE forward problem with multiple light sources in an all-at-once manner instead of solving it for each source separately. To this end, we introduce here a novel linear solver called block biconjugate gradient stabilized method (block BiCGStab) that makes full use of the shared information between different right hand sides to accelerate solution convergence. Two parallelized block BiCGStab methods are proposed for additional acceleration under limited threads situation. We evaluate the performance of this algorithm with numerical simulation studies involving the Delta-Eddington approximation to the scattering phase function. The results show that the single threading block RTE solver proposed here reduces computation time by a factor of 1.5~3 as compared to the traditional sequential solution method and the parallel block solver by a factor of 1.5 as compared to the traditional parallel sequential method. This block linear solver is, moreover, independent of discretization schemes and preconditioners used; thus further acceleration and higher accuracy can be expected when combined with other existing discretization schemes or preconditioners. PMID:26345531
Lipnikov, Konstantin; Moulton, David; Svyatskiy, Daniil
2016-04-29
We develop a new approach for solving the nonlinear Richards’ equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a Newton-Raphson-type method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioningmore » strategy that is based on a stable discretization of the continuum Jacobian. We will show with numerical experiments for challenging problems in subsurface hydrology that this new preconditioner improves convergence of the existing Jacobian-free solvers 3-20 times. Furthermore, we show that the Picard method with this preconditioner becomes a more efficient nonlinear solver than a few widely used Jacobian-free solvers.« less
NASA Astrophysics Data System (ADS)
Lipnikov, Konstantin; Moulton, David; Svyatskiy, Daniil
2016-08-01
We develop a new approach for solving the nonlinear Richards' equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a Newton-Raphson-type method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioning strategy that is based on a stable discretization of the continuum Jacobian. We will show with numerical experiments for challenging problems in subsurface hydrology that this new preconditioner improves convergence of the existing Jacobian-free solvers 3-20 times. We also show that the Picard method with this preconditioner becomes a more efficient nonlinear solver than a few widely used Jacobian-free solvers.
Lipnikov, Konstantin; Moulton, David; Svyatskiy, Daniil
2016-04-29
We develop a new approach for solving the nonlinear Richards’ equation arising in variably saturated flow modeling. The growing complexity of geometric models for simulation of subsurface flows leads to the necessity of using unstructured meshes and advanced discretization methods. Typically, a numerical solution is obtained by first discretizing PDEs and then solving the resulting system of nonlinear discrete equations with a Newton-Raphson-type method. Efficiency and robustness of the existing solvers rely on many factors, including an empiric quality control of intermediate iterates, complexity of the employed discretization method and a customized preconditioner. We propose and analyze a new preconditioning strategy that is based on a stable discretization of the continuum Jacobian. We will show with numerical experiments for challenging problems in subsurface hydrology that this new preconditioner improves convergence of the existing Jacobian-free solvers 3-20 times. Furthermore, we show that the Picard method with this preconditioner becomes a more efficient nonlinear solver than a few widely used Jacobian-free solvers.
Jia, Jingfei; Kim, Hyun K; Hielscher, Andreas H
2015-12-01
It is well known that radiative transfer equation (RTE) provides more accurate tomographic results than its diffusion approximation (DA). However, RTE-based tomographic reconstruction codes have limited applicability in practice due to their high computational cost. In this article, we propose a new efficient method for solving the RTE forward problem with multiple light sources in an all-at-once manner instead of solving it for each source separately. To this end, we introduce here a novel linear solver called block biconjugate gradient stabilized method (block BiCGStab) that makes full use of the shared information between different right hand sides to accelerate solution convergence. Two parallelized block BiCGStab methods are proposed for additional acceleration under limited threads situation. We evaluate the performance of this algorithm with numerical simulation studies involving the Delta-Eddington approximation to the scattering phase function. The results show that the single threading block RTE solver proposed here reduces computation time by a factor of 1.5~3 as compared to the traditional sequential solution method and the parallel block solver by a factor of 1.5 as compared to the traditional parallel sequential method. This block linear solver is, moreover, independent of discretization schemes and preconditioners used; thus further acceleration and higher accuracy can be expected when combined with other existing discretization schemes or preconditioners.
An unstructured-grid, parallel, projection solver for computing low-speed flows
Christon, M.A.; Carroll, D.E.
1998-08-01
This paper presents an overview of the issues associated with applying a domain-decomposition message-passing paradigm to the parallel implementation of both explicit and semi-implicit projection algorithms. The use of an element-based domain decomposition with an efficient solution strategy for the pressure field is shown to yield a scalable, parallel solution method capable of treating complex flow problems where high-resolution grids are required. In addition, the use of an SSOR or Jacobi preconditioned conjugate gradient solver with an A-conjugate projection reduces the computational time for the solution of the pressure field, and yields parallel efficiencies above 80% for computations with O(250) elements per processor. The parallel projection solver is verified using a series of 2-D and 3-D benchmarks designed to evaluate time-accurate flow solution methods. Finally, the extension of the projection algorithm to reacting flows is demonstrated for a time-dependent vortex-shedding problem.
An approximate Riemann solver for magnetohydrodynamics (that works in more than one dimension)
NASA Technical Reports Server (NTRS)
Powell, Kenneth G.
1994-01-01
An approximate Riemann solver is developed for the governing equations of ideal magnetohydrodynamics (MHD). The Riemann solver has an eight-wave structure, where seven of the waves are those used in previous work on upwind schemes for MHD, and the eighth wave is related to the divergence of the magnetic field. The structure of the eighth wave is not immediately obvious from the governing equations as they are usually written, but arises from a modification of the equations that is presented in this paper. The addition of the eighth wave allows multidimensional MHD problems to be solved without the use of staggered grids or a projection scheme, one or the other of which was necessary in previous work on upwind schemes for MHD. A test problem made up of a shock tube with rotated initial conditions is solved to show that the two-dimensional code yields answers consistent with the one-dimensional methods developed previously.
Parallel performance of a preconditioned CG solver for unstructured finite element applications
Shadid, J.N.; Hutchinson, S.A.; Moffat, H.K.
1994-12-31
A parallel unstructured finite element (FE) implementation designed for message passing MIMD machines is described. This implementation employs automated problem partitioning algorithms for load balancing unstructured grids, a distributed sparse matrix representation of the global finite element equations and a parallel conjugate gradient (CG) solver. In this paper a number of issues related to the efficient implementation of parallel unstructured mesh applications are presented. These include the differences between structured and unstructured mesh parallel applications, major communication kernels for unstructured CG solvers, automatic mesh partitioning algorithms, and the influence of mesh partitioning metrics on parallel performance. Initial results are presented for example finite element (FE) heat transfer analysis applications on a 1024 processor nCUBE 2 hypercube. Results indicate over 95% scaled efficiencies are obtained for some large problems despite the required unstructured data communication.
NASA Astrophysics Data System (ADS)
Zhang, Chenglong; Gamba, Irene M.
2016-11-01
We propose a deterministic conservative solver for the inhomogeneous Fokker-Planck-Landau equation coupled with Poisson equation. Through time-splitting scheme, a Vlasov-Poisson (collisionless) problem and a homogeneous Landau (collisional) problem are obtained. These two subproblems can be treated separately. We use operator splitting where the transport dynamics for Runge-Kutta Discontinuous Galerkin (RK-DG) method and the collisional dynamics for homogeneous conservative spectral method are adopted respectively. Since two different numerical schemes are applied separately, we have designed a new conservation correction process such that, after projecting the conservative spectral solution onto the DG mesh, there is no loss of moment consvervation. Parallelization is readily implemented. To verify our solver, numerical experiments on linear and nonlinear Landau damping are provided.
A semi-direct solver for compressible 3-dimensional rotational flow
NASA Technical Reports Server (NTRS)
Chang, S. C.; Adamczyk, J. J.
1983-01-01
An iterative procedure is presented for solving steady inviscid 3-D subsonic rotational flow problems. The procedure combines concepts from classical secondary flow theory with an extension to 3-D of a novel semi-direct Cauchy-Riemann solver. It is developed for generalized coordinates and can be exercised using standard finite difference procedures. The stability criterion of the iterative procedure is discussed along with its ability to capture the evolution of inviscid secondary flow in a turning channel.
A semi-direct solver for compressible three-dimensional rotational flow
NASA Technical Reports Server (NTRS)
Chang, S.-C.; Adamczyk, J. J.
1983-01-01
An iterative procedure is presented for solving steady inviscid 3-D subsonic rotational flow problems. The procedure combines concepts from classical secondary flow theory with an extension to 3-D of a novel semi-direct Cauchy-Riemann solver. It is developed for generalized coordinates and can be exercised using standard finite difference procedures. The stability criterion of the iterative procedure is discussed along with its ability to capture the evolution of inviscid secondary flow in a turning channel.
A Newton-Krylov Solver for Implicit Solution of Hydrodynamics in Core Collapse Supernovae
Reynolds, D R; Swesty, F D; Woodward, C S
2008-06-12
This paper describes an implicit approach and nonlinear solver for solution of radiation-hydrodynamic problems in the context of supernovae and proto-neutron star cooling. The robust approach applies Newton-Krylov methods and overcomes the difficulties of discontinuous limiters in the discretized equations and scaling of the equations over wide ranges of physical behavior. We discuss these difficulties, our approach for overcoming them, and numerical results demonstrating accuracy and efficiency of the method.
Hybrid MPI+OpenMP Programming of an Overset CFD Solver and Performance Investigations
NASA Technical Reports Server (NTRS)
Djomehri, M. Jahed; Jin, Haoqiang H.; Biegel, Bryan (Technical Monitor)
2002-01-01
This report describes a two level parallelization of a Computational Fluid Dynamic (CFD) solver with multi-zone overset structured grids. The approach is based on a hybrid MPI+OpenMP programming model suitable for shared memory and clusters of shared memory machines. The performance investigations of the hybrid application on an SGI Origin2000 (O2K) machine is reported using medium and large scale test problems.
A Radiation Transfer Solver for Athena Using Short Characteristics
NASA Astrophysics Data System (ADS)
Davis, Shane W.; Stone, James M.; Jiang, Yan-Fei
2012-03-01
We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.
A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS
Davis, Shane W.; Stone, James M.; Jiang Yanfei
2012-03-01
We describe the implementation of a module for the Athena magnetohydrodynamics (MHD) code that solves the time-independent, multi-frequency radiative transfer (RT) equation on multidimensional Cartesian simulation domains, including scattering and non-local thermodynamic equilibrium (LTE) effects. The module is based on well known and well tested algorithms developed for modeling stellar atmospheres, including the method of short characteristics to solve the RT equation, accelerated Lambda iteration to handle scattering and non-LTE effects, and parallelization via domain decomposition. The module serves several purposes: it can be used to generate spectra and images, to compute a variable Eddington tensor (VET) for full radiation MHD simulations, and to calculate the heating and cooling source terms in the MHD equations in flows where radiation pressure is small compared with gas pressure. For the latter case, the module is combined with the standard MHD integrators using operator splitting: we describe this approach in detail, including a new constraint on the time step for stability due to radiation diffusion modes. Implementation of the VET method for radiation pressure dominated flows is described in a companion paper. We present results from a suite of test problems for both the RT solver itself and for dynamical problems that include radiative heating and cooling. These tests demonstrate that the radiative transfer solution is accurate and confirm that the operator split method is stable, convergent, and efficient for problems of interest. We demonstrate there is no need to adopt ad hoc assumptions of questionable accuracy to solve RT problems in concert with MHD: the computational cost for our general-purpose module for simple (e.g., LTE gray) problems can be comparable to or less than a single time step of Athena's MHD integrators, and only few times more expensive than that for more general (non-LTE) problems.
Large-scale 3D EM modeling with a Block Low-Rank multifrontal direct solver
NASA Astrophysics Data System (ADS)
Shantsev, Daniil V.; Jaysaval, Piyoosh; de la Kethulle de Ryhove, Sébastien; Amestoy, Patrick R.; Buttari, Alfredo; L'Excellent, Jean-Yves; Mary, Theo
2017-03-01
We put forward the idea of using a Block Low-Rank (BLR) multifrontal direct solver to efficiently solve the linear systems of equations arising from a finite-difference discretization of the frequency-domain Maxwell equations for 3D electromagnetic (EM) problems. The solver uses a low-rank representation for the off-diagonal blocks of the intermediate dense matrices arising in the multifrontal method to reduce the computational load. A numerical threshold, the so called BLR threshold, controlling the accuracy of low-rank representations was optimized by balancing errors in the computed EM fields against savings in floating point operations (flops). Simulations were carried out over large-scale 3D resistivity models representing typical scenarios for marine controlled-source EM surveys, and in particular the SEG SEAM model which contains an irregular salt body. The flop count, size of factor matrices and elapsed run time for matrix factorization are reduced dramatically by using BLR representations and can go down to, respectively, 10%, 30% and 40% of their full rank values for our largest system with N = 20.6 million unknowns. The reductions are almost independent of the number of MPI tasks and threads at least up to 90 × 10 = 900 cores. The BLR savings increase for larger systems, which reduces the factorization flop complexity from O( {{N^2}} ) for the full-rank solver to O( {{N^m}} ) with m = 1.4 - 1.6 . The BLR savings are significantly larger for deep-water environments that exclude the highly resistive air layer from the computational domain. A study in a scenario where simulations are required at multiple source locations shows that the BLR solver can become competitive in comparison to iterative solvers as an engine for 3D CSEM Gauss-Newton inversion that requires forward modelling for a few thousand right-hand sides.
A comparison of SuperLU solvers on the intel MIC architecture
NASA Astrophysics Data System (ADS)
Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.
2016-10-01
In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.
General purpose nonlinear system solver based on Newton-Krylov method.
2013-12-01
KINSOL is part of a software family called SUNDIALS: SUite of Nonlinear and Differential/Algebraic equation Solvers [1]. KINSOL is a general-purpose nonlinear system solver based on Newton-Krylov and fixed-point solver technologies [2].
Robust large-scale parallel nonlinear solvers for simulations.
Bader, Brett William; Pawlowski, Roger Patrick; Kolda, Tamara Gibson
2005-11-01
This report documents research to develop robust and efficient solution techniques for solving large-scale systems of nonlinear equations. The most widely used method for solving systems of nonlinear equations is Newton's method. While much research has been devoted to augmenting Newton-based solvers (usually with globalization techniques), little has been devoted to exploring the application of different models. Our research has been directed at evaluating techniques using different models than Newton's method: a lower order model, Broyden's method, and a higher order model, the tensor method. We have developed large-scale versions of each of these models and have demonstrated their use in important applications at Sandia. Broyden's method replaces the Jacobian with an approximation, allowing codes that cannot evaluate a Jacobian or have an inaccurate Jacobian to converge to a solution. Limited-memory methods, which have been successful in optimization, allow us to extend this approach to large-scale problems. We compare the robustness and efficiency of Newton's method, modified Newton's method, Jacobian-free Newton-Krylov method, and our limited-memory Broyden method. Comparisons are carried out for large-scale applications of fluid flow simulations and electronic circuit simulations. Results show that, in cases where the Jacobian was inaccurate or could not be computed, Broyden's method converged in some cases where Newton's method failed to converge. We identify conditions where Broyden's method can be more efficient than Newton's method. We also present modifications to a large-scale tensor method, originally proposed by Bouaricha, for greater efficiency, better robustness, and wider applicability. Tensor methods are an alternative to Newton-based methods and are based on computing a step based on a local quadratic model rather than a linear model. The advantage of Bouaricha's method is that it can use any existing linear solver, which makes it simple to write
Parallelization of Unsteady Adaptive Mesh Refinement for Unstructured Navier-Stokes Solvers
NASA Technical Reports Server (NTRS)
Schwing, Alan M.; Nompelis, Ioannis; Candler, Graham V.
2014-01-01
This paper explores the implementation of the MPI parallelization in a Navier-Stokes solver using adaptive mesh re nement. Viscous and inviscid test problems are considered for the purpose of benchmarking, as are implicit and explicit time advancement methods. The main test problem for comparison includes e ects from boundary layers and other viscous features and requires a large number of grid points for accurate computation. Ex- perimental validation against double cone experiments in hypersonic ow are shown. The adaptive mesh re nement shows promise for a staple test problem in the hypersonic com- munity. Extension to more advanced techniques for more complicated ows is described.
Performance of the block-Krylov energy group solvers in Jaguar
Watson, A. M.; Kennedy, R. A.
2012-07-01
A new method of coupling the inner and outer iterations for deterministic transport problems is proposed. This method is termed the Multigroup Energy Blocking Method (MEBM) and has been implemented in the deterministic transport solver Jaguar, which is currently under development at KAPL. The method is derived for both fixed-source and eigenvalue problems. The method is then applied to a PWR pin cell model, both in fixed-source mode and eigenvalue mode. The results show that the MEBM improves the convergence of both types of problems when applied to the thermal (up-scattering) groups. (authors)
ERIC Educational Resources Information Center
Cor, Ken; Alves, Cecilia; Gierl, Mark J.
2008-01-01
This review describes and evaluates a software add-in created by Frontline Systems, Inc., that can be used with Microsoft Excel 2007 to solve large, complex test assembly problems. The combination of Microsoft Excel 2007 with the Frontline Systems Premium Solver Platform is significant because Microsoft Excel is the most commonly used spreadsheet…
NASA Astrophysics Data System (ADS)
Balsara, Dinshaw S.; Vides, Jeaniffer; Gurski, Katharine; Nkonga, Boniface; Dumbser, Michael; Garain, Sudip; Audit, Edouard
2016-01-01
Just as the quality of a one-dimensional approximate Riemann solver is improved by the inclusion of internal sub-structure, the quality of a multidimensional Riemann solver is also similarly improved. Such multidimensional Riemann problems arise when multiple states come together at the vertex of a mesh. The interaction of the resulting one-dimensional Riemann problems gives rise to a strongly-interacting state. We wish to endow this strongly-interacting state with physically-motivated sub-structure. The self-similar formulation of Balsara [16] proves especially useful for this purpose. While that work is based on a Galerkin projection, in this paper we present an analogous self-similar formulation that is based on a different interpretation. In the present formulation, we interpret the shock jumps at the boundary of the strongly-interacting state quite literally. The enforcement of the shock jump conditions is done with a least squares projection (Vides, Nkonga and Audit [67]). With that interpretation, we again show that the multidimensional Riemann solver can be endowed with sub-structure. However, we find that the most efficient implementation arises when we use a flux vector splitting and a least squares projection. An alternative formulation that is based on the full characteristic matrices is also presented. The multidimensional Riemann solvers that are demonstrated here use one-dimensional HLLC Riemann solvers as building blocks. Several stringent test problems drawn from hydrodynamics and MHD are presented to show that the method works. Results from structured and unstructured meshes demonstrate the versatility of our method. The reader is also invited to watch a video introduction to multidimensional Riemann solvers on http://www.nd.edu/ dbalsara/Numerical-PDE-Course.
Help with Solving Technological Problems in Project Activities
ERIC Educational Resources Information Center
Herold, Jean-Francois; Ginestie, Jacques
2011-01-01
In France, project activities figure predominantly in technology education. The general idea behind learning based on project activity is to allow the pupil to get involved in the activity in question, with the pupil tackling real situations rather than ones of an abstract nature. But too often, we notice that the pedagogical strategies used by…
New numerical solver for flows at various Mach numbers
NASA Astrophysics Data System (ADS)
Miczek, F.; Röpke, F. K.; Edelmann, P. V. F.
2015-04-01
Context. Many problems in stellar astrophysics feature flows at low Mach numbers. Conventional compressible hydrodynamics schemes frequently used in the field have been developed for the transonic regime and exhibit excessive numerical dissipation for these flows. Aims: While schemes were proposed that solve hydrodynamics strictly in the low Mach regime and thus restrict their applicability, we aim at developing a scheme that correctly operates in a wide range of Mach numbers. Methods: Based on an analysis of the asymptotic behavior of the Euler equations in the low Mach limit we propose a novel scheme that is able to maintain a low Mach number flow setup while retaining all effects of compressibility. This is achieved by a suitable modification of the well-known Roe solver. Results: Numerical tests demonstrate the capability of this new scheme to reproduce slow flow structures even in moderate numerical resolution. Conclusions: Our scheme provides a promising approach to a consistent multidimensional hydrodynamical treatment of astrophysical low Mach number problems such as convection, instabilities, and mixing in stellar evolution.
Age, Physical Activity, Physical Fitness, Body Composition, and Incidence of Orthopedic Problems.
ERIC Educational Resources Information Center
Research Quarterly for Exercise and Sport, 1989
1989-01-01
Effects of age, physical activity, physical fitness, and body mass index (BMI) on the occurrence of orthopedic problems were examined. For men, physical fitness, BMI, and physical activity were associated with orthopedic problems; for women, physical activity was the main predictor. Age was not a factor for either gender. (JD)
Carbon Dioxide and the Greenhouse Effect: A Problem Evaluation Activity.
ERIC Educational Resources Information Center
Brewer, Carol A.; Beiswenger, Jane M.
1993-01-01
Describes exercises to examine the global carbon cycle. Students are asked to predict consequences of increased carbon dioxide emissions into the atmosphere and to suggest ways to mitigate problems associated with these higher levels of atmospheric carbon dioxide. A comparison modeling exercise examines some of the variables related to the success…
Group Problem Solving as a Zone of Proximal Development activity
NASA Astrophysics Data System (ADS)
Brewe, Eric
2006-12-01
Vygotsky described learning as a process, intertwined with development, which is strongly influenced by social interactions with others that are at differing developmental stages.i These interactions create a Zone of Proximal Development for each member of the interaction. Vygotsky’s notion of social constructivism is not only a theory of learning, but also of development. While teaching introductory physics in an interactive format, I have found manifestations of Vygotsky’s theory in my classroom. The source of evidence is a paired problem solution. A standard mechanics problem was solved by students in two classes as a homework assignment. Students handed in the homework and then solved the same problem in small groups. The solutions to both the group and individual problem were assessed by multiple reviewers. In many cases the group score was the same as the highest individual score in the group, but in some cases, the group score was higher than any individual score. For this poster, I will analyze the individual and group scores and focus on three groups solutions and video that provide evidence of learning through membership in a Zone of Proximal Development. Endnotes i L. Vygotsky -Mind and society: The development of higher mental processes. Cambridge, MA: Harvard University Press. (1978).
Computational results for flows over 2-D ramp and 3-D obstacle with an upwind Navier-Stokes solver
NASA Technical Reports Server (NTRS)
Venkatapathy, Ethiraj
1990-01-01
An implicit, finite-difference, upwind, full Navier-Stokes solver was applied to supersonic/hypersonic flows over two-dimensional ramps and three-dimensional obstacle. Some of the computed results are presented. The numerical scheme used in the study is an implicit, spacially second order accurate, upwind, LU-ADI scheme based on Roe's approximate Reimann solver with MUSCL differencing of Van Leer. An algebraic grid generation scheme based on generalized interpolation scheme was used in generating the grids for the various 2-D and 3-D problems.
Computational results for 2-D and 3-D ramp flows with an upwind Navier-Stokes solver
NASA Technical Reports Server (NTRS)
Venkatapathy, Ethiraj
1991-01-01
An implicit, finite-difference, upwind, full Navier-Stokes solver was applied to supersonic/hypersonic flows over two-dimensional ramps and three-dimensional obstacle. Some of the computed results are presented. The numerical scheme used in the study is an implicit, spatially second order accurate, upwind, LU-ADI scheme based on Roe's approximate Reimann solver with MUSCL differencing of Van Leer. An algebraic grid generation scheme based on generalized interpolation scheme was used in generating the grids for the various 2-D and 3-D problems.
Novel fine flux integration methods for the DIABOLO simplified transport solver in COCAGNE
Couyras, D.; FeVotte, F.; Plagne, L.
2013-07-01
As part of its activity, EDF R and D is developing a new nuclear core simulation code named COCAGNE. This code relies on DIABOLO, a Simplified P{sub N} (SP{sub N}) method to compute the neutron flux inside the core for k{sub eff} eigenvalue problems. In order to complete complex simulations involving a large number of successive eigenvalue calculations within acceptable CPU times, the DIABOLO solver uses computational meshes that contain a restricted number of cells (e.g. 4x4 cells per assembly). Solutions obtained on these relatively coarse computational meshes are then spatially interpolated to obtain physical quantities such as neutron production rates on finer meshes (e.g. pin-by-pin power production). This paper describes two novel methods, named Straw-hat and Poisson, that allow the neutron flux to be integrated over fine mesh cells. Unlike the original method used in COCAGNE, these new methods compute accurate fine flux integrals trough the interpolation of the current DOFs of DIABOLO'S mixed dual RTk finite elements. Assessed on a set of 3-D PWR realistic core configurations, these methods are shown to bring about significant improvements over the original integration scheme: for smooth enough flux distribution, the Poisson method improves the pin-by-pin production rates accuracy by as much as one order of magnitude. (authors)
Multidimensional physical activity: An opportunity not a problem
Thompson, Dylan; Peacock, Oliver; Western, Max; Batterham, Alan M.
2015-01-01
Our research shows that no single metric will adequately reflect an individual’s physical activity because multiple biologically-important dimensions are independent and unrelated. We propose that there is an opportunity to exploit this multidimensional characteristic of physical activity in order to improve personalised feedback and offer physical activity options and choices that are tailored to an individual’s needs and preferences. PMID:25607280
NASA Astrophysics Data System (ADS)
Wagenhoffer, Nathan; Moored, Keith; Jaworski, Justin
2016-11-01
The design of quiet and efficient bio-inspired propulsive concepts requires a rapid, unified computational framework that integrates the coupled fluid dynamics with the noise generation. Such a framework is developed where the fluid motion is modeled with a two-dimensional unsteady boundary element method that includes a vortex-particle wake. The unsteady surface forces from the potential flow solver are then passed to an acoustic boundary element solver to predict the radiated sound in low-Mach-number flows. The use of the boundary element method for both the hydrodynamic and acoustic solvers permits dramatic computational acceleration by application of the fast multiple method. The reduced order of calculations due to the fast multipole method allows for greater spatial resolution of the vortical wake per unit of computational time. The coupled flow-acoustic solver is validated against canonical vortex-sound problems. The capability of the coupled solver is demonstrated by analyzing the performance and noise production of an isolated bio-inspired swimmer and of tandem swimmers.
Anderson, John R.; Betts, Shawn; Ferris, Jennifer L.; Fincham, Jon M.
2010-01-01
Students were taught an algorithm for solving a new class of mathematical problems. Occasionally in the sequence of problems they encountered exception problems that required that they extend the algorithm. Regular and exception problems were associated with different patterns of brain activation produced. Some regions showed a Cognitive pattern of being active only until the problem was solved and no difference between regular or exception problems. Other regions showed a Metacognitive pattern of greater activity for exception problems and activity that extended into the post-solution period, particularly when an error was made. The Cognitive regions included some of parietal and prefrontal regions associated with the triple-code theory of Dehaene et al (2003) and associated with algebra equation solving in the ACT-R theory (Anderson, 2005). Metacognitive regions included the superior prefrontal gyrus, the angular gyrus of the triple-code theory, and frontopolar regions. PMID:21264650
Development of a new 3D OpenFOAM¯ solver to model the cooling stage in profile extrusion
NASA Astrophysics Data System (ADS)
Fernandes, C.; Habla, F.; Carneiro, O. S.; Hinrichsen, O.; Nóbrega, J. M.
2016-03-01
In this work a new solver is developed in OpenFOAM® computational library, to model the cooling state in profile extrusion. The solver is able to calculate the temperature distribution in a two domain system, comprising the profile and calibrator, considering the temperature discontinuity at the interface. The derivation of the model is based on the local instantaneous energy conservation equation, in conjunction with the conditional volume averaging technique, which yields a single governing equation valid in both domains. Aiming the solution of automatic optimization/parameterization problems, the developed solver was coupled with the DAKOTA toolkit. The application of the novel calculation system is illustrated in a study of a complex geometry extruded profile cooling stage.
NASA Technical Reports Server (NTRS)
Eidson, T. M.; Erlebacher, G.
1994-01-01
While parallel computers offer significant computational performance, it is generally necessary to evaluate several programming strategies. Two programming strategies for a fairly common problem - a periodic tridiagonal solver - are developed and evaluated. Simple model calculations as well as timing results are presented to evaluate the various strategies. The particular tridiagonal solver evaluated is used in many computational fluid dynamic simulation codes. The feature that makes this algorithm unique is that these simulation codes usually require simultaneous solutions for multiple right-hand-sides (RHS) of the system of equations. Each RHS solutions is independent and thus can be computed in parallel. Thus a Gaussian elimination type algorithm can be used in a parallel computation and the more complicated approaches such as cyclic reduction are not required. The two strategies are a transpose strategy and a distributed solver strategy. For the transpose strategy, the data is moved so that a subset of all the RHS problems is solved on each of the several processors. This usually requires significant data movement between processor memories across a network. The second strategy attempts to have the algorithm allow the data across processor boundaries in a chained manner. This usually requires significantly less data movement. An approach to accomplish this second strategy in a near-perfect load-balanced manner is developed. In addition, an algorithm will be shown to directly transform a sequential Gaussian elimination type algorithm into the parallel chained, load-balanced algorithm.
AQUAgpusph, a new free 3D SPH solver accelerated with OpenCL
NASA Astrophysics Data System (ADS)
Cercos-Pita, J. L.
2015-07-01
In this paper, AQUAgpusph, a new free Smoothed Particle Hydrodynamics (SPH) software accelerated with OpenCL, is described. The main differences and progress with respect to other existing alternatives are considered. These are the use of the Open Computing Language (OpenCL) framework instead of the Compute Unified Device Architecture (CUDA), the implementation of the most popular boundary conditions, the easy customization of the code to different problems, the extensibility with regard to Python scripts, and the runtime output which allows the tracking of simulations in real time, or a higher frequency in saving some results without a significant performance lost. These modifications are shown to improve the solver speed, the results quality, and allow for a wider areas of application. AQUAgpusph has been designed trying to provide researchers and engineers with a valuable tool to test and apply the SPH method. Three practical applications are discussed in detail. The evolution of a dam break is used to quantify and compare the computational performance and modeling accuracy with the most popular SPH Graphics Processing Unit (GPU) accelerated alternatives. The dynamics of a coupled system, a Tuned Liquid Damper (TLD), is discussed in order to show the integration capabilities of the solver with external dynamics. Finally, the sloshing flow inside a nuclear reactor is simulated in order to show the capabilities of the solver to treat 3-D problems with complex geometries and of industrial interest.
Amesos2 and Belos: Direct and Iterative Solvers for Large Sparse Linear Systems
Bavier, Eric; Hoemmen, Mark; Rajamanickam, Sivasankaran; ...
2012-01-01
Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix factorization codes, and can handle any implementation of sparse matrices and vectors, via an easy-to-extend C++ traits interface. It can also factor matrices whose entries have arbitrary “Scalar” type, enabling extended-precision and mixed-precision algorithms. Belos includes many different iterative methods for solving large sparse linear systems and least-squares problems. Unlike competing iterative solver libraries, Belos completely decouples themore » algorithms from the implementations of the underlying linear algebra objects. This lets Belos exploit the latest hardware without changes to the code. Belos favors algorithms that solve higher-level problems, such as multiple simultaneous linear systems and sequences of related linear systems, faster than standard algorithms. The package also supports extended-precision and mixed-precision algorithms. Together, Amesos2 and Belos form a complete suite of sparse linear solvers.« less
NASA Astrophysics Data System (ADS)
Xiao, Cheng-Nian; Denner, Fabian; van Wachem, Berend
2015-11-01
A pressure-based Navier-Stokes solver which is applicable to fluid flow problems of a wide range of speeds is presented. The novel solver is based on collocated variable arrangement and uses a modified Rhie-Chow interpolation method to assure implicit pressure-velocity coupling. A Mach number biased modification to the continuity equation as well as coupling of flow and thermodynamic variables via an energy equation and equation of state enable the simulation of compressible flows belonging to transonic or supersonic Mach number regimes. The flow equation systems are all solved simultaneously, thus guaranteeing strong coupling between pressure and velocity at each iteration step. Shock-capturing is accomplished via nonlinear spatial discretisation schemes which adaptively apply an appropriate blending of first-order upwind and second-order central schemes depending on the local smoothness of the flow field. A selection of standard test problems will be presented to demonstrate the solver's capability of handling incompressible as well as compressible flow fields of vastly different speed regimes on structured as well as unstructured meshes. The authors are grateful for the financial support of Shell.
Simulating underwater propulsion using an immersed boundary method based open-source solver
NASA Astrophysics Data System (ADS)
Senturk, Utku; Hemmati, Arman; Smits, Alexander J.
2016-11-01
The performance of a newly developed Immersed Boundary Method (IBM) incorporated into a finite volume solver is examined using foam-extend-3.2. IBM uses a discrete forcing approach based on the weighted least squares interpolation to preserve the sharpness of the boundary, which decreases the computational complexity of the problem. Initially, four case studies with gradually increasing complexities are considered to verify the accuracy of the IBM approach. These include the flow past 2D stationary and transversely oscillating cylinders and 3D wake of stationary and pitching flat plates with aspect ratio 1.0 at Re=2000. The primary objective of this study, which is pursued by an ongoing simulation of the wake formed behind a pitching deformable 3D flat plate, is to investigate the underwater locomotion of a fish at Re=10000. The results of the IBM based solver are compared to the experimental results, which suggest that the force computations are accurate in general. Spurious oscillations in the forces are observed for problems with moving bodies which change based on spatial and temporal grid resolutions. Although it still has the full advantage of the main code features, the IBM-based solver in foam-extend-3.2 requires further development to be exploited for complex grids. The work was supported by ONR under MURI Grant N00014-14-1-0533.
Barnes, Derek N; George, John S; Ng, Kwong T
2008-09-01
Currently the resolution of the head models used in electroencephalography (EEG) studies is limited by the speed of the forward solver. Here, we present a parallel finite difference technique that can reduce the solution time of the governing Poisson equation for a head model. Multiple processors are used to work on the problem simultaneously in order to speed up the solution and provide the memory for solving large problems. The original computational domain is divided into multiple rectangular partitions. Each partition is then assigned to a processor, which is responsible for all the computations and inter-processor communication associated with the nodes in that particular partition. Since the forward solution time is mainly spent on solving the associated matrix equation, it is desirable to find the optimum matrix solver. A detailed comparison of various iterative solvers was performed for both isotropic and anisotropic realistic head models constructed from MRI images. The conjugate gradient (CG) method preconditioned with an advanced geometric multigrid technique was found to provide the best overall performance. For an anisotropic model with 256 x 128 x 256 cells, this technique provides a speedup of 508 on 32 processors over the serial CG solution, with a speedup of 20.1 and 25.3 through multigrid preconditioning and parallelization, respectively.
Problem Solving. Technology Learning Activity. Teacher Edition. Technology Education Series.
ERIC Educational Resources Information Center
Oklahoma State Dept. of Vocational and Technical Education, Stillwater. Curriculum and Instructional Materials Center.
This curriculum guide provides technology learning activities designed to prepare students in grades 6-10 to work in the world of the future. The 8-day course provides exploratory, hands-on learning activities and information that can enhance the education of students of all types in an integrated curriculum that provides practical applications of…
Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
NASA Astrophysics Data System (ADS)
Zengler, Christoph; Küchlin, Wolfgang
We extend clause learning as performed by most modern SAT Solvers by integrating the computation of Boolean Gröbner bases into the conflict learning process. Instead of learning only one clause per conflict, we compute and learn additional binary clauses from a Gröbner basis of the current conflict. We used the Gröbner basis engine of the logic package Redlog contained in the computer algebra system Reduce to extend the SAT solver MiniSAT with Gröbner basis learning. Our approach shows a significant reduction of conflicts and a reduction of restarts and computation time on many hard problems from the SAT 2009 competition.
A Massively Parallel Solver for the Mechanical Harmonic Analysis of Accelerator Cavities
O. Kononenko
2015-02-17
ACE3P is a 3D massively parallel simulation suite that developed at SLAC National Accelerator Laboratory that can perform coupled electromagnetic, thermal and mechanical study. Effectively utilizing supercomputer resources, ACE3P has become a key simulation tool for particle accelerator R and D. A new frequency domain solver to perform mechanical harmonic response analysis of accelerator components is developed within the existing parallel framework. This solver is designed to determine the frequency response of the mechanical system to external harmonic excitations for time-efficient accurate analysis of the large-scale problems. Coupled with the ACE3P electromagnetic modules, this capability complements a set of multi-physics tools for a comprehensive study of microphonics in superconducting accelerating cavities in order to understand the RF response and feedback requirements for the operational reliability of a particle accelerator. (auth)
A GPU-enabled Finite Volume solver for global magnetospheric simulations on unstructured grids
NASA Astrophysics Data System (ADS)
Lani, Andrea; Yalim, Mehmet Sarp; Poedts, Stefaan
2014-10-01
This paper describes an ideal Magnetohydrodynamics (MHD) solver for global magnetospheric simulations based on a B1 +B0 splitting approach, which has been implemented within the COOLFluiD platform and adapted to run on modern heterogeneous architectures featuring General Purpose Graphical Processing Units (GPGPUs). The code is based on a state-of-the-art Finite Volume discretization for unstructured grids and either explicit or implicit time integration, suitable for both steady and time accurate problems. Innovative object-oriented design and coding techniques mixing C++ and CUDA are discussed. Performance results of the modified code on single and multiple processors are presented and compared with those provided by the original solver.
A non-conforming 3D spherical harmonic transport solver
Van Criekingen, S.
2006-07-01
A new 3D transport solver for the time-independent Boltzmann transport equation has been developed. This solver is based on the second-order even-parity form of the transport equation. The angular discretization is performed through the expansion of the angular neutron flux in spherical harmonics (PN method). The novelty of this solver is the use of non-conforming finite elements for the spatial discretization. Such elements lead to a discontinuous flux approximation. This interface continuity requirement relaxation property is shared with mixed-dual formulations such as the ones based on Raviart-Thomas finite elements. Encouraging numerical results are presented. (authors)
GPU accelerated kinetic solvers for rarefied gas dynamics
NASA Astrophysics Data System (ADS)
Zabelok, Sergey A.; Kolobov, Vladimir I.; Arslanbekov, Robert R.
2012-11-01
GPU-acceleration is applied to the Boltzmann solver with adaptive Cartesian mesh in the Unified Flow Solver framework. NVIDIA CUDA technology is used with threads being grouped in thread blocks by points of Korobov sequences in each cell for computing the collision integral and by points in coordinate space for the free-molecular flow stage. GPU-accelerated Boltzmann solver with octree Cartesian mesh has been tested on several computer systems. Speedup of several times for GPU-based code compared to single-core CPU computations on the same machines has been observed.
libmpdata++ 0.1: a library of parallel MPDATA solvers for systems of generalised transport equations
NASA Astrophysics Data System (ADS)
Jaruga, A.; Arabas, S.; Jarecka, D.; Pawlowska, H.; Smolarkiewicz, P. K.; Waruszewski, M.
2014-11-01
This paper accompanies first release of libmpdata++, a C++ library implementing the Multidimensional Positive-Definite Advection Transport Algorithm (MPDATA). The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include: homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; shallow-water system compared with analytical solution (originally derived for a 2-D case); and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.
libmpdata++ 1.0: a library of parallel MPDATA solvers for systems of generalised transport equations
NASA Astrophysics Data System (ADS)
Jaruga, A.; Arabas, S.; Jarecka, D.; Pawlowska, H.; Smolarkiewicz, P. K.; Waruszewski, M.
2015-04-01
This paper accompanies the first release of libmpdata++, a C++ library implementing the multi-dimensional positive-definite advection transport algorithm (MPDATA) on regular structured grid. The library offers basic numerical solvers for systems of generalised transport equations. The solvers are forward-in-time, conservative and non-linearly stable. The libmpdata++ library covers the basic second-order-accurate formulation of MPDATA, its third-order variant, the infinite-gauge option for variable-sign fields and a flux-corrected transport extension to guarantee non-oscillatory solutions. The library is equipped with a non-symmetric variational elliptic solver for implicit evaluation of pressure gradient terms. All solvers offer parallelisation through domain decomposition using shared-memory parallelisation. The paper describes the library programming interface, and serves as a user guide. Supported options are illustrated with benchmarks discussed in the MPDATA literature. Benchmark descriptions include code snippets as well as quantitative representations of simulation results. Examples of applications include homogeneous transport in one, two and three dimensions in Cartesian and spherical domains; a shallow-water system compared with analytical solution (originally derived for a 2-D case); and a buoyant convection problem in an incompressible Boussinesq fluid with interfacial instability. All the examples are implemented out of the library tree. Regardless of the differences in the problem dimensionality, right-hand-side terms, boundary conditions and parallelisation approach, all the examples use the same unmodified library, which is a key goal of libmpdata++ design. The design, based on the principle of separation of concerns, prioritises the user and developer productivity. The libmpdata++ library is implemented in C++, making use of the Blitz++ multi-dimensional array containers, and is released as free/libre and open-source software.
Common Problems and Solutions for Being Physically Active
... such as walking, dancing and tennis. Do your stretching, balance and flexibility activities while you watch TV. ... a nearby health club. Print and take the Stretching and Flexibility and Strengthening sheets with you. All ...
The Geography of Wind Energy: Problem Solving Activities.
ERIC Educational Resources Information Center
Lahart, David E.; Allen, Rodney F.
1985-01-01
Today there are many attempts to use wind machines to confront the increasing costs of electricity. Described are activities to help secondary students understand wind energy, its distribution, applications, and limitations. (RM)
Bezerra, Rui M F; Fraga, Irene; Dias, Albino A
2013-01-01
Enzyme kinetic parameters are usually determined from initial rates nevertheless, laboratory instruments only measure substrate or product concentration versus reaction time (progress curves). To overcome this problem we present a methodology which uses integrated models based on Michaelis-Menten equation. The most severe practical limitation of progress curve analysis occurs when the enzyme shows a loss of activity under the chosen assay conditions. To avoid this problem it is possible to work with the same experimental points utilized for initial rates determination. This methodology is illustrated by the use of integrated kinetic equations with the well-known reaction catalyzed by alkaline phosphatase enzyme. In this work nonlinear regression was performed with the Solver supplement (Microsoft Office Excel). It is easy to work with and track graphically the convergence of SSE (sum of square errors). The diagnosis of enzyme inhibition was performed according to Akaike information criterion.
Problem Solving Skills of People Doing Sporty Recreation Activities in Karaman Province
ERIC Educational Resources Information Center
Birol, Sefa Sahan
2015-01-01
The aim of the study is to examine the problem solving skills of people who are doing sporty recreation activities in Karaman Province. A total of 143 people participated in this study (51 females and 92 males) Their age mean was 1.2168 ± 0.41350. Problem Solving Inventory, developed by Heppner and Peterson, was used to measure the problem solving…
McCormack, Abby; Shorter, Gillian W; Griffiths, Mark D
2013-03-01
Background and aims Online gambling participation is increasing rapidly, with relatively little research about the possible effects of different gambling activities on problem gambling behaviour. The aim of this exploratory study was to examine the participation in online gambling activities and the relationship with problem gambling among an international sample of online gamblers. Methods An online gambling survey was posted on 32 international gambling websites and resulted in 1,119 respondents over a four-month period. Results Poker was the most popular gambling activity online. A number of online activities were associated with problem gambling, including: roulette, poker, horse race betting, sports betting, spread betting and fruit (slot) machines. Not surprisingly, those that gambled on these activities regularly (except poker) were more likely to be a problem gambler, however, what is interesting is that the reverse is true for poker players; those that gambled regularly on poker were less likely to be a problem gambler compared to the non-regular poker players. The majority of the players also gambled offline, but there was no relationship between problem gambling and whether or not a person also gambled offline. Discussion Problem gambling is associated more with certain online gambling activities than others, and those gambling on two or more activities online were more likely to be a problem gambler. Conclusion This paper can help explain the impact different online gambling activities may have on gambling behaviour. Consideration needs to be given to the gambling activity when developing and implementing treatment programmes.
Some problems in coupling solar activity to meteorological phenomena
NASA Technical Reports Server (NTRS)
Dessler, A. J.
1975-01-01
The development of a theory of coupling of solar activity to meteorological phenomena is hindered by the difficulties of devising a mechanism that can modify the behavior of the troposphere while employing only a negligible amount of energy compared with the energy necessary to drive the normal meteorological system, and determining how such a mechanism can effectively couple some relevant magnetospheric process into the troposphere in such a way as to influence the weather. A clue to the nature of the interaction between the weather and solar activity might be provided by the fact that most solar activity undergoes a definite 11-yr cycle, and meteorological phenomena undergo either no closely correlated variation, an 11-yr variation, or a 22-yr variation.
Some problems in coupling solar activity to meteorological phenomena
NASA Technical Reports Server (NTRS)
Dessler, A. J.
1974-01-01
The development of a theory of coupling of solar activity to meteorological phenomena has to date foundered on the two difficulties of (1) devising a mechanism that can modify the behavior of the troposphere while employing only a negligible amount of energy compared with the energy necessary to drive the normal meteorological system; and (2) determining how such a mechanism can effectively couple some relevant magnetospheric process into the troposphere in such a way as to influence the weather. A clue to the nature of the interaction between the weather and solar activity might be provided by the fact that most solar activity undergoes a definite 11-year cycle, while meteorological phenomena undergo either no closely correlated variation, or an 11-year variation, or a 22-year variation.
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.
A generalized Poisson solver for first-principles device simulations
Bani-Hashemian, Mohammad Hossein; VandeVondele, Joost; Brück, Sascha; Luisier, Mathieu
2016-01-28
Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.
Algorithmic Enhancements to the VULCAN Navier-Stokes Solver
NASA Technical Reports Server (NTRS)
Litton, D. K.; Edwards, J. R.; White, J. A.
2003-01-01
VULCAN (Viscous Upwind aLgorithm for Complex flow ANalysis) is a cell centered, finite volume code used to solve high speed flows related to hypersonic vehicles. Two algorithms are presented for expanding the range of applications of the current Navier-Stokes solver implemented in VULCAN. The first addition is a highly implicit approach that uses subiterations to enhance block to block connectivity between adjacent subdomains. The addition of this scheme allows more efficient solution of viscous flows on highly-stretched meshes. The second algorithm addresses the shortcomings associated with density-based schemes by the addition of a time-derivative preconditioning strategy. High speed, compressible flows are typically solved with density based schemes, which show a high level of degradation in accuracy and convergence at low Mach numbers (M less than or equal to 0.1). With the addition of preconditioning and associated modifications to the numerical discretization scheme, the eigenvalues will scale with the local velocity, and the above problems will be eliminated. With these additions, VULCAN now has improved convergence behavior for multi-block, highly-stretched meshes and also can solve the Navier-Stokes equations for very low Mach numbers.
Shared Memory Parallelism for 3D Cartesian Discrete Ordinates Solver
NASA Astrophysics Data System (ADS)
Moustafa, Salli; Dutka-Malen, Ivan; Plagne, Laurent; Ponçot, Angélique; Ramet, Pierre
2014-06-01
This paper describes the design and the performance of DOMINO, a 3D Cartesian SN solver that implements two nested levels of parallelism (multicore+SIMD) on shared memory computation nodes. DOMINO is written in C++, a multi-paradigm programming language that enables the use of powerful and generic parallel programming tools such as Intel TBB and Eigen. These two libraries allow us to combine multi-thread parallelism with vector operations in an efficient and yet portable way. As a result, DOMINO can exploit the full power of modern multi-core processors and is able to tackle very large simulations, that usually require large HPC clusters, using a single computing node. For example, DOMINO solves a 3D full core PWR eigenvalue problem involving 26 energy groups, 288 angular directions (S16), 46 × 106 spatial cells and 1 × 1012 DoFs within 11 hours on a single 32-core SMP node. This represents a sustained performance of 235 GFlops and 40:74% of the SMP node peak performance for the DOMINO sweep implementation. The very high Flops/Watt ratio of DOMINO makes it a very interesting building block for a future many-nodes nuclear simulation tool.
Parallelizable approximate solvers for recursions arising in preconditioning
Shapira, Y.
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
Approximate Riemann solvers for the cosmic ray magnetohydrodynamical equations
NASA Astrophysics Data System (ADS)
Kudoh, Yuki; Hanawa, Tomoyuki
2016-11-01
We analyse the cosmic ray magnetohydrodynamic (CR MHD) equations to improve the numerical simulations. We propose to solve them in the fully conservation form, which is equivalent to the conventional CR MHD equations. In the fully conservation form, the CR energy equation is replaced with the CR `number' conservation, where the CR number density is defined as the three-fourths power of the CR energy density. The former contains an extra source term, while latter does not. An approximate Riemann solver is derived from the CR MHD equations in the fully conservation form. Based on the analysis, we propose a numerical scheme of which solutions satisfy the Rankine-Hugoniot relation at any shock. We demonstrate that it reproduces the Riemann solution derived by Pfrommer et al. for a 1D CR hydrodynamic shock tube problem. We compare the solution with those obtained by solving the CR energy equation. The latter solutions deviate from the Riemann solution seriously, when the CR pressure dominates over the gas pressure in the post-shocked gas. The former solutions converge to the Riemann solution and are of the second-order accuracy in space and time. Our numerical examples include an expansion of high-pressure sphere in a magnetized medium. Fast and slow shocks are sharply resolved in the example. We also discuss possible extension of the CR MHD equations to evaluate the average CR energy.
Intrusive Method for Uncertainty Quantification in a Multiphase Flow Solver
NASA Astrophysics Data System (ADS)
Turnquist, Brian; Owkes, Mark
2016-11-01
Uncertainty quantification (UQ) is a necessary, interesting, and often neglected aspect of fluid flow simulations. To determine the significance of uncertain initial and boundary conditions, a multiphase flow solver is being created which extends a single phase, intrusive, polynomial chaos scheme into multiphase flows. Reliably estimating the impact of input uncertainty on design criteria can help identify and minimize unwanted variability in critical areas, and has the potential to help advance knowledge in atomizing jets, jet engines, pharmaceuticals, and food processing. Use of an intrusive polynomial chaos method has been shown to significantly reduce computational cost over non-intrusive collocation methods such as Monte-Carlo. This method requires transforming the model equations into a weak form through substitution of stochastic (random) variables. Ultimately, the model deploys a stochastic Navier Stokes equation, a stochastic conservative level set approach including reinitialization, as well as stochastic normals and curvature. By implementing these approaches together in one framework, basic problems may be investigated which shed light on model expansion, uncertainty theory, and fluid flow in general. NSF Grant Number 1511325.
Nursing problem-based learning activity: song writing and singing.
Chan, Zenobia C Y
2014-08-01
The function of song is not only to deliver individual's messages, but also to serve as a learning approach to facilitate students' learning. To observe the effectiveness of songs in facilitating students' learning, a Problem-based Learning (PBL) class with twenty students was divided into four groups with five students per group. Each group was asked to write a song based on two given scenarios, to sing the song out loud, and to participate in a follow-up focus group interview afterwards. The four songs reflected the students' understanding of academic knowledge and their perspectives toward the protagonists in the presented scenarios. Two songs are presented in this paper to demonstrate how the approach was carried out in the nursing PBL class. This paper aims to show the implication of song writing and singing in PBL and shed some light on teaching and learning.
Performance of NASA Equation Solvers on Computational Mechanics Applications
NASA Technical Reports Server (NTRS)
Storaasli, Olaf O.
1996-01-01
This paper describes the performance of a new family of NASA-developed equation solvers used for large-scale (i.e. 551,705 equations) structural analysis. To minimize computer time and memory, the solvers are divided by application and matrix characteristics (sparse/dense, real/complex, symmetric/nonsymmetric, size: in-core/out of core) and exploit the hardware features of current and future computers. In this paper, the equation solvers, which are written in FORTRAN, and are therefore easily transportable, are shown to be faster than specialized computer library routines utilizing assembly code. Twenty NASA structural benchmark models with NASA solver timings reside on World Wide Web with a challenge to beat them.
ERIC Educational Resources Information Center
Collis, Betty
Although the importance of systematic evaluation of educational policy and practice is well established, various problems confound the intention of evaluating regional or national activity with regard to computer-related activities in education. At least two of these problems relate to a general conception of the appropriate entry points for…
Educational Activity as a Problem of Adult Education in the Context of Globalization
ERIC Educational Resources Information Center
Folvarochnyi, Ihor
2014-01-01
The article deals with the problem of adult education in the context of globalization. The analysis of scientific pedagogical literature devoted to studying of some aspects of educational activity in adult education has been conducted. The problem of public institutions development and activity has been analyzed in the broad context of…
Using Problem-Based Pre-Class Activities to Prepare Students for In-Class Learning
ERIC Educational Resources Information Center
Alayont, Feryal
2014-01-01
This article presents a problem-based approach that prepares students for future learning in the classroom. In this approach, students complete problem-based activities before coming to class to familiarize themselves with the topics to be covered. After the discussion on how the use of these activities relate to the learning and transfer…
Quantum Theory, Active Information and the Mind-Matter Problem
NASA Astrophysics Data System (ADS)
Pylkkänen, Paavo
Bohm and Hiley suggest that a certain new type of active information plays a key objective role in quantum processes. This chapter discusses the implications of this suggestion to our understanding of the relation between the mental and the physical aspects of reality.
Experiences Running a Parallel Answer Set Solver on Blue Gene
NASA Astrophysics Data System (ADS)
Schneidenbach, Lars; Schnor, Bettina; Gebser, Martin; Kaminski, Roland; Kaufmann, Benjamin; Schaub, Torsten
This paper presents the concept of parallelisation of a solver for Answer Set Programming (ASP). While there already exist some approaches to parallel ASP solving, there was a lack of a parallel version of the powerful clasp solver. We implemented a parallel version of clasp based on message-passing. Experimental results on Blue Gene P/L indicate the potential of such an approach.
Incubation Provides Relief from Artificial Fixation in Problem Solving
ERIC Educational Resources Information Center
Penaloza, Alan A.; Calvillo, Dustin P.
2012-01-01
An incubation effect occurs when taking a break from a problem helps solvers arrive at the correct solution more often than working on it continuously. The forgetting-fixation account, a popular explanation of how incubation works, posits that a break from a problem allows the solver to forget the incorrect path to the solution and finally access…
Studies of visual attention in physics problem solving
NASA Astrophysics Data System (ADS)
Madsen, Adrian M.
The work described here represents an effort to understand and influence visual attention while solving physics problems containing a diagram. Our visual system is guided by two types of processes -- top-down and bottom-up. The top-down processes are internal and determined by ones prior knowledge and goals. The bottom-up processes are external and determined by features of the visual stimuli such as color, and luminance contrast. When solving physics problems both top-down and bottom-up processes are active, but to varying degrees. The existence of two types of processes opens several interesting questions for physics education. For example, how do bottom-up processes influence problem solvers in physics? Can we leverage these processes to draw attention to relevant diagram areas and improve problem-solving? In this dissertation we discuss three studies that investigate these open questions and rely on eye movements as a primary data source. We assume that eye movements reflect a person's moment-to-moment cognitive processes, providing a window into one's thinking. In our first study, we compared the way correct and incorrect solvers viewed relevant and novice-like elements in a physics problem diagram. We found correct solvers spent more time attending to relevant areas while incorrect solvers spent more time looking at novice-like areas. In our second study, we overlaid these problems with dynamic visual cues to help students' redirect their attention. We found that in some cases these visual cues improved problem-solving performance and influenced visual attention. To determine more precisely how the perceptual salience of diagram elements influenced solvers' attention, we conducted a third study where we manipulated the perceptual salience of the diagram elements via changes in luminance contrast. These changes did not influence participants' answers or visual attention. Instead, similar to our first study, the time spent looking in various areas of the
A Comparison of Two Intermediate State HLLC Solvers for Ideal Magnetohydrodynamics
NASA Astrophysics Data System (ADS)
Gurski, K. F.
2008-04-01
This paper compares a solver based on the HLLC (Harten-Lax-van Leer-contact wave) approximate nonlinear Riemann solver for gas dynamics for ideal magnetohydrodynamics (MHD) with the HLL, Roe, Linde, and Li solvers. Simulation results are given for three one-dimensional test cases not previously shown in the original paper presenting the smooth HLLC solver for MHD.
Time-domain solver in curvilinear coordinates for outdoor sound propagation over complex terrain.
Dragna, Didier; Blanc-Benon, Philippe; Poisson, Franck
2013-06-01
The current work aims at developing a linearized Euler equations solver in curvilinear coordinates to account for the effects of topography on sound propagation. In applications for transportation noise, the propagation environment as well as the description of acoustic sources is complex, and time-domain methods have proved their capability to deal with both atmospheric and ground effects. First, equations in curvilinear coordinates are examined. Then time-domain boundary conditions initially proposed for a Cartesian coordinate system are implemented in the curvilinear solver. Two test cases dealing with acoustic scattering by an impedance cylinder in a two-dimensional geometry and by an impedance sphere in a three-dimensional geometry are considered to validate the boundary conditions. Accurate solutions are obtained for both rigid and impedance surfaces. Finally, the solver is used to examine a typical outdoor sound propagation problem. It is shown that it is well-suited to study coupled effects of topography, mixed impedance ground and meteorological conditions.
Coordinate-Space Hartree-Fock-Bogoliubov Solvers for Superfluid Fermi Systems in Large Boxes
Pei, J. C.; Fann, George I; Harrison, Robert J; Nazarewicz, W.; Hill, Judith C; Galindo, Diego A; Jia, Jun
2012-01-01
The self-consistent Hartree-Fock-Bogoliubov problem in large boxes can be solved accurately in the coordinate space with the recently developed solvers HFB-AX (2D) and MADNESS-HFB (3D). This is essential for the description of superfluid Fermi systems with complicated topologies and significant spatial extend, such as fissioning nuclei, weakly-bound nuclei, nuclear matter in the neutron star rust, and ultracold Fermi atoms in elongated traps. The HFB-AX solver based on B-spline techniques uses a hybrid MPI and OpenMP programming model for parallel computation for distributed parallel computation, within a node multi-threaded LAPACK and BLAS libraries are used to further enable parallel calculations of large eigensystems. The MADNESS-HFB solver uses a novel multi-resolution analysis based adaptive pseudo-spectral techniques to enable fully parallel 3D calculations of very large systems. In this work we present benchmark results for HFB-AX and MADNESS-HFB on ultracold trapped fermions.
NASA Astrophysics Data System (ADS)
Yu, Peicheng; Li, Fei; Dalichaouch, Thamine; Fiuza, Frederico; Decyk, Viktor; Davidson, Asher; Tableman, Adam; An, Weiming; Tsung, Frank; Fonseca, Ricardo; Lu, Wei; Vieira, Jorge; Silva, Luis; Mori, Warren
2016-10-01
we present a finite-difference-time-domain (FDTD) Maxwell solver for the particle-in-cell (PIC) algorithm, which is customized to effectively eliminate the numerical Cerenkov instability (NCI) which arises when a plasma (neutral or non-neutral) relativistically drifts on a grid when using the PIC algorithm. We control the EM dispersion curve in the direction of the plasma drift of a FDTD Maxwell solver by using a customized higher order finite difference operator for the spatial derivative along the direction of the drift (1& circ; direction). We show that this eliminates the main NCI modes with moderate | k1 | , while keeps additional main NCI modes well outside the range of physical interest with higher | k1 | . These main NCI modes can be easily filtered out along with first spatial aliasing NCI modes which are also at the edge of the fundamental Brillouin zone. The customized solver has the possible advantage of improved parallel scalability because it can be easily partitioned along 1& circ; which typically has many more cells than other directions for the problems of interest.
ERIC Educational Resources Information Center
Ricles, Shannon
The NASA SCI Files is a series of instructional programs consisting of broadcast, print, and online elements emphasizing standards-based instruction, problem-based learning, and science as inquiry. The series seeks to motivate students in grades 3-5 to become critical thinkers and active problem solvers. In this program, the tree house detectives…
A Comparative Study of Randomized Constraint Solvers for Random-Symbolic Testing
NASA Technical Reports Server (NTRS)
Takaki, Mitsuo; Cavalcanti, Diego; Gheyi, Rohit; Iyoda, Juliano; dAmorim, Marcelo; Prudencio, Ricardo
2009-01-01
The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compare the effectiveness of a symbolic solver (CVC3), a random solver, three hybrid solvers (i.e., mix of random and symbolic), and two heuristic search solvers. We evaluate the solvers on two benchmarks: one consisting of manually generated constraints and another generated with a concolic execution of 8 subjects. In addition to fully decidable constraints, the benchmarks include constraints with non-linear integer arithmetic, integer modulo and division, bitwise arithmetic, and floating-point arithmetic. As expected symbolic solving (in particular, CVC3) subsumes the other solvers for the concolic execution of subjects that only generate decidable constraints. For the remaining subjects the solvers are complementary.
Problems with extracellular recording of electrical activity in gastrointestinal muscle.
Sanders, Kenton M; Ward, Sean M; Hennig, Grant W
2016-12-01
Motility patterns of the gastrointestinal tract are important for efficient processing of nutrients and waste. Peristalsis and segmentation are based on rhythmic electrical slow waves that generate the phasic contractions fundamental to gastrointestinal motility. Slow waves are generated and propagated actively by interstitial cells of Cajal (ICC), and these events conduct to smooth muscle cells to elicit excitation-contraction coupling. Extracellular electrical recording has been utilized to characterize slow-wave generation and propagation and abnormalities that might be responsible for gastrointestinal motility disorders. Electrode array recording and digital processing are being used to generate data for models of electrical propagation in normal and pathophysiological conditions. Here, we discuss techniques of extracellular recording as applied to gastrointestinal organs and how mechanical artefacts might contaminate these recordings and confound their interpretation. Without rigorous controls for movement, current interpretations of extracellular recordings might ascribe inaccurate behaviours and electrical anomalies to ICC networks and gastrointestinal muscles, bringing into question the findings and validity of models of gastrointestinal electrophysiology developed from these recordings.
Moridis, G.; Pruess, K.
1995-04-01
This report discusses the details of modifications made to the TOUGH2 family of codes to complement its direct solver which significantly increases the size of problems solved by the TOUGH2 code. With this modification, the TOUGH2 system is being tested in multiphase, multicomponent fluid and heat flow problems related to vadose zone hydrology, nuclear waste disposal, and environmental remediation.
Euler/Navier-Stokes Solvers Applied to Ducted Fan Configurations
NASA Technical Reports Server (NTRS)
Keith, Theo G., Jr.; Srivastava, Rakesh
1997-01-01
Due to noise considerations, ultra high bypass ducted fans have become a more viable design. These ducted fans typically consist of a rotor stage containing a wide chord fan and a stator stage. One of the concerns for this design is the classical flutter that keeps occurring in various unducted fan blade designs. These flutter are catastrophic and are to be avoided in the flight envelope of the engine. Some numerical investigations by Williams, Cho and Dalton, have suggested that a duct around a propeller makes it more unstable. This needs to be further investigated. In order to design an engine to safely perform a set of desired tasks, accurate information of the stresses on the blade during the entire cycle of blade motion is required. This requirement in turn demands that accurate knowledge of steady and unsteady blade loading be available. Aerodynamic solvers based on unsteady three-dimensional analysis will provide accurate and fast solutions and are best suited for aeroelastic analysis. The Euler solvers capture significant physics of the flowfield and are reasonably fast. An aerodynamic solver Ref. based on Euler equations had been developed under a separate grant from NASA Lewis in the past. Under the current grant, this solver has been modified to calculate the aeroelastic characteristics of unducted and ducted rotors. Even though, the aeroelastic solver based on three-dimensional Euler equations is computationally efficient, it is still very expensive to investigate the effects of multiple stages on the aeroelastic characteristics. In order to investigate the effects of multiple stages, a two-dimensional multi stage aeroelastic solver was also developed under this task, in collaboration with Dr. T. S. R. Reddy of the University of Toledo. Both of these solvers were applied to several test cases and validated against experimental data, where available.
Metzger, Aaron; Dawes, Nickki; Mermelstein, Robin; Wakschlag, Lauren
2010-01-01
Longitudinal associations among different types of organized activity involvement, problem peer associations, and cigarette smoking were examined in a sample of 1,040 adolescents (mean age = 15.62 at baseline, 16.89 at 15-month assessment, 17.59 at 24 months) enriched for smoking experimentation (83% had tried smoking). A structural equation model tested longitudinal paths between three categories of involvement (team sports, school clubs and activities, and religious activities, measured at baseline and 15 months), problem peer associations (baseline and 15 months), and cigarette smoking behavior (baseline and 24 months). Multi-group analyses indicated pathways differed by type of activity and adolescent gender. Boys’ baseline team sports and religious involvement predicted lower levels of smoking at 24 months via continued activity involvement at 15 months. Girls’ involvement in school clubs and activities and religious activities indirectly predicted lower levels of smoking at 24 months via reduced exposure to problem peers at 15 months. PMID:21603061
A Robust Multilevel Simultaneous Eigenvalue Solver
1993-06-01
same efficiency is obtained for problems in 3-D as for problem in 2-D. In all examples the periodic boundary conditions Schr ~ dinger eigenvalue problem (A...coarse level work on levels 1, 2, took ap- proximately 1/6 of the computer time and on levels 1, 2, 3, approximately 1/4 of the computer time . This is a...eigenvalues. The results of the numerical tests for Schr ~ dinger eigenvalue problems, show that the algorithm achieved the same accuracy, using the same
ERIC Educational Resources Information Center
Jausovec, Norbert
1997-01-01
This study examined differences in electroencephalography (EEG) alpha activity between gifted and nongifted Slovenian student-teachers (N=17 each). Gifted students showed greater left hemisphere activation than nongifted subjects in relaxed states, but lower activation during problem solving. The same pattern was observed in overall hemispheric…
NASA Astrophysics Data System (ADS)
Niu, Yang-Yao
2016-03-01
This paper is to continue our previous work in 2008 on solving a two-fluid model for compressible liquid-gas flows. We proposed a pressure-velocity based diffusion term original derived from AUSMD scheme of Wada and Liou in 1997 to enhance its robustness. The proposed AUSMD schemes have been applied to gas and liquid fluids universally to capture fluid discontinuities, such as the fluid interfaces and shock waves, accurately for the Ransom's faucet problem, air-water shock tube problems and 2D shock-water liquid interaction problems. However, the proposed scheme failed at computing liquid-gas interfaces in problems under large ratios of pressure, density and volume of fraction. The numerical instability has been remedied by Chang and Liou in 2007 using the exact Riemann solver to enhance the accuracy and stability of numerical flux across the liquid-gas interface. Here, instead of the exact Riemann solver, we propose a simple AUSMD type primitive variable Riemann solver (PVRS) which can successfully solve 1D stiffened water-air shock tube and 2D shock-gas interaction problems under large ratios of pressure, density and volume of fraction without the expensive cost of tedious computer time. In addition, the proposed approach is shown to deliver a good resolution of the shock-front, rarefaction and cavitation inside the evolution of high-speed droplet impact on the wall.
An In-Service Teachers' Workshop on Mathematical Problem Solving through Activity-Based Learning
ERIC Educational Resources Information Center
Toh, Tin Lam
2007-01-01
This paper describes an in-service professional development course in introducing creative approaches to teach mathematics for teachers from the private-funded schools in Java, Indonesia. The course focused on introducing teachers to problem-solving processes and skills, and samples of activity-based worksheet on problem solving through secondary…
A Case Study of an Induction Year Teacher's Problem-Solving Using the LIBRE Model Activity
ERIC Educational Resources Information Center
Guerra, Norma S.; Flores, Belinda Bustos; Claeys, Lorena
2009-01-01
Background: A federally-funded program at the University of Texas at San Antonio adopted a holistic problem solving mentoring approach for novice teachers participating in an accelerated teacher certification program. Aims/focus of discussion: To investigate a novice teacher's problem-solving activity through self-expression of challenges and…
Adaptive kinetic-fluid solvers for heterogeneous computing architectures
NASA Astrophysics Data System (ADS)
Zabelok, Sergey; Arslanbekov, Robert; Kolobov, Vladimir
2015-12-01
We show feasibility and benefits of porting an adaptive multi-scale kinetic-fluid code to CPU-GPU systems. Challenges are due to the irregular data access for adaptive Cartesian mesh, vast difference of computational cost between kinetic and fluid cells, and desire to evenly load all CPUs and GPUs during grid adaptation and algorithm refinement. Our Unified Flow Solver (UFS) combines Adaptive Mesh Refinement (AMR) with automatic cell-by-cell selection of kinetic or fluid solvers based on continuum breakdown criteria. Using GPUs enables hybrid simulations of mixed rarefied-continuum flows with a million of Boltzmann cells each having a 24 × 24 × 24 velocity mesh. We describe the implementation of CUDA kernels for three modules in UFS: the direct Boltzmann solver using the discrete velocity method (DVM), the Direct Simulation Monte Carlo (DSMC) solver, and a mesoscopic solver based on the Lattice Boltzmann Method (LBM), all using adaptive Cartesian mesh. Double digit speedups on single GPU and good scaling for multi-GPUs have been demonstrated.
Description and use of LSODE, the Livermore Solver for Ordinary Differential Equations
NASA Technical Reports Server (NTRS)
Radhakrishnan, Krishnan; Hindmarsh, Alan C.
1993-01-01
LSODE, the Livermore Solver for Ordinary Differential Equations, is a package of FORTRAN subroutines designed for the numerical solution of the initial value problem for a system of ordinary differential equations. It is particularly well suited for 'stiff' differential systems, for which the backward differentiation formula method of orders 1 to 5 is provided. The code includes the Adams-Moulton method of orders 1 to 12, so it can be used for nonstiff problems as well. In addition, the user can easily switch methods to increase computational efficiency for problems that change character. For both methods a variety of corrector iteration techniques is included in the code. Also, to minimize computational work, both the step size and method order are varied dynamically. This report presents complete descriptions of the code and integration methods, including their implementation. It also provides a detailed guide to the use of the code, as well as an illustrative example problem.
Foot problems in middle-aged patients: keeping active people up to speed.
Coady, C M; Gow, N; Stanish, W
1998-05-01
Most of the common foot problems that bother active middle-aged people are self-limiting and easily treated if detected early. Reviewed here are the causes, symptoms, diagnosis, and treatment of hallux valgus and rigidus, lesser-toe deformities, corns, Morton's neuroma, metatarsal stress fractures, plantar fasciitis, posterior tibialis tenosynovitis and rupture, acquired pes planus, tarsal tunnel syndrome, and foot problems related to rheumatoid arthritis and diabetes. In most cases, conservative treatment will enable patients to return to activity relatively quickly.
On the Performance of an Algebraic MultigridSolver on Multicore Clusters
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.
A speciation solver for cement paste modeling and the semismooth Newton method
Georget, Fabien; Prévost, Jean H.; Vanderbei, Robert J.
2015-02-15
The mineral assemblage of a cement paste may vary considerably with its environment. In addition, the water content of a cement paste is relatively low and the ionic strength of the interstitial solution is often high. These conditions are extreme conditions with respect to the common assumptions made in speciation problem. Furthermore the common trial and error algorithm to find the phase assemblage does not provide any guarantee of convergence. We propose a speciation solver based on a semismooth Newton method adapted to the thermodynamic modeling of cement paste. The strong theoretical properties associated with these methods offer practical advantages. Results of numerical experiments indicate that the algorithm is reliable, robust, and efficient.
A Fourier-based elliptic solver for vortical flows with periodic and unbounded directions
NASA Astrophysics Data System (ADS)
Chatelain, Philippe; Koumoutsakos, Petros
2010-04-01
We present a computationally efficient, adaptive solver for the solution of the Poisson and Helmholtz equation used in flow simulations in domains with combinations of unbounded and periodic directions. The method relies on using FFTs on an extended domain and it is based on the method proposed by Hockney and Eastwood for plasma simulations. The method is well-suited to problems with dynamically growing domains and in particular flow simulations using vortex particle methods. The efficiency of the method is demonstrated in simulations of trailing vortices.
Multilevel solvers of first-order system least-squares for Stokes equations
Lai, Chen-Yao G.
1996-12-31
Recently, The use of first-order system least squares principle for the approximate solution of Stokes problems has been extensively studied by Cai, Manteuffel, and McCormick. In this paper, we study multilevel solvers of first-order system least-squares method for the generalized Stokes equations based on the velocity-vorticity-pressure formulation in three dimensions. The least-squares functionals is defined to be the sum of the L{sup 2}-norms of the residuals, which is weighted appropriately by the Reynolds number. We develop convergence analysis for additive and multiplicative multilevel methods applied to the resulting discrete equations.
Application of a Scalable, Parallel, Unstructured-Grid-Based Navier-Stokes Solver
NASA Technical Reports Server (NTRS)
Parikh, Paresh
2001-01-01
A parallel version of an unstructured-grid based Navier-Stokes solver, USM3Dns, previously developed for efficient operation on a variety of parallel computers, has been enhanced to incorporate upgrades made to the serial version. The resultant parallel code has been extensively tested on a variety of problems of aerospace interest and on two sets of parallel computers to understand and document its characteristics. An innovative grid renumbering construct and use of non-blocking communication are shown to produce superlinear computing performance. Preliminary results from parallelization of a recently introduced "porous surface" boundary condition are also presented.
WHAT IS A SATISFACTORY QUADRATIC EQUATION SOLVER?
The report discusses precise requirements for a satisfactory computer program to solve a quadratic equation with floating - point coefficients. The principal practical problem is coping with overflow and underflow.
NASA Astrophysics Data System (ADS)
Orgogozo, L.; Renon, N.; Soulaine, C.; Hénon, F.; Tomer, S. K.; Labat, D.; Pokrovsky, O. S.; Sekhar, M.; Ababou, R.; Quintard, M.
2014-12-01
In this paper we present a massively parallel open source solver for Richards equation, named the RichardsFOAM solver. This solver has been developed in the framework of the open source generalist computational fluid dynamics tool box OpenFOAM® and is capable to deal with large scale problems in both space and time. The source code for RichardsFOAM may be downloaded from the CPC program library website. It exhibits good parallel performances (up to ˜90% parallel efficiency with 1024 processors both in strong and weak scaling), and the conditions required for obtaining such performances are analysed and discussed. These performances enable the mechanistic modelling of water fluxes at the scale of experimental watersheds (up to few square kilometres of surface area), and on time scales of decades to a century. Such a solver can be useful in various applications, such as environmental engineering for long term transport of pollutants in soils, water engineering for assessing the impact of land settlement on water resources, or in the study of weathering processes on the watersheds.
When Shoes Become Hammers: Goal-Derived Categorization Training Enhances Problem-Solving Performance
ERIC Educational Resources Information Center
Chrysikou, Evangelia G.
2006-01-01
Problem-solving theories have not examined how solvers navigate their knowledge to interpret problem situations or to plan strategies toward goals. In this article, the author argues that success in problem solving depends on the solver's ability to construct goal-derived categories, namely categories that are formed ad hoc to serve goals during…
TemperSAT: A new efficient fair-sampling random k-SAT solver
NASA Astrophysics Data System (ADS)
Fang, Chao; Zhu, Zheng; Katzgraber, Helmut G.
The set membership problem is of great importance to many applications and, in particular, database searches for target groups. Recently, an approach to speed up set membership searches based on the NP-hard constraint-satisfaction problem (random k-SAT) has been developed. However, the bottleneck of the approach lies in finding the solution to a large SAT formula efficiently and, in particular, a large number of independent solutions is needed to reduce the probability of false positives. Unfortunately, traditional random k-SAT solvers such as WalkSAT are biased when seeking solutions to the Boolean formulas. By porting parallel tempering Monte Carlo to the sampling of binary optimization problems, we introduce a new algorithm (TemperSAT) whose performance is comparable to current state-of-the-art SAT solvers for large k with the added benefit that theoretically it can find many independent solutions quickly. We illustrate our results by comparing to the currently fastest implementation of WalkSAT, WalkSATlm.
Anderson, John R; Betts, Shawn; Ferris, Jennifer L; Fincham, Jon M
2011-03-01
Students were taught an algorithm for solving a new class of mathematical problems. Occasionally in the sequence of problems, they encountered exception problems that required that they extend the algorithm. Regular and exception problems were associated with different patterns of brain activation. Some regions showed a Cognitive pattern of being active only until the problem was solved and no difference between regular or exception problems. Other regions showed a Metacognitive pattern of greater activity for exception problems and activity that extended into the post-solution period, particularly when an error was made. The Cognitive regions included some of parietal and prefrontal regions associated with the triple-code theory of (Dehaene, S., Piazza, M., Pinel, P., & Cohen, L. (2003). Three parietal circuits for number processing. Cognitive Neuropsychology, 20, 487-506) and associated with algebra equation solving in the ACT-R theory (Anderson, J. R. (2005). Human symbol manipulation within an 911 integrated cognitive architecture. Cognitive science, 29, 313-342. Metacognitive regions included the superior prefrontal gyrus, the angular gyrus of the triple-code theory, and frontopolar regions.
Convergence acceleration of an aeroelastic Navier-Stokes solver
NASA Technical Reports Server (NTRS)
Obayashi, S.; Guruswamy, G.
1994-01-01
New capabilities have been added to a Navier-Stokes solver to perform steady-state simulations more efficiently. The flow solver for solving the Navier-Stokes equations is completely rewritten with a combination of the LU-SGS (Lower-Upper factored Symmetric Gauss-Seidel) implicit method and the modified HLLE (Harten-Lax-van Leer-Einfeldt) upwind scheme. A pseudo-time marching method is used for the directly coupled structural equations to improve overall convergence rates for static aeroelastic analysis. Results are demonstrated for transonic flows over rigid and flexible wings.
NASA Astrophysics Data System (ADS)
Tezaur, I. K.; Perego, M.; Salinger, A. G.; Tuminaro, R. S.; Price, S. F.
2015-04-01
This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX, is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, along with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.
Tezaur, I. K.; Perego, M.; Salinger, A. G.; Tuminaro, R. S.; Price, S. F.
2015-04-27
This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX, is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, along with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.
Tezaur, I. K.; Perego, M.; Salinger, A. G.; ...
2015-04-27
This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX, is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, alongmore » with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.« less
ERIC Educational Resources Information Center
Liaw, S. Y.; Chen, F. G.; Klainin, P.; Brammer, J.; O'Brien, A.; Samarasekera, D. D.
2010-01-01
This study aimed to evaluate the integration of a simulation based learning activity on nursing students' clinical crisis management performance in a problem-based learning (PBL) curriculum. It was hypothesized that the clinical performance of first year nursing students who participated in a simulated learning activity during the PBL session…
Education Technologies in Addressing the Problem of Forming the Socially Active Individual
ERIC Educational Resources Information Center
Popova, Irina N.
2016-01-01
The article is devoted to the analysis of technological support of the educational process in solving the problem of forming the socially active individual. The authors studied the value of the category "social activity" and analyzed educational technologies that have an impact on its formation. The obtained results gave the possibility…
Examination of Pre-Service Science Teachers' Activities Using Problem Based Learning Method
ERIC Educational Resources Information Center
Ekici, Didem Inel
2016-01-01
In this study, both the activities prepared by pre-service science teachers regarding the Problem Based Learning method and the pre-service science teachers' views regarding the method were examined before and after applying their activities in a real class environment. 69 pre-service science teachers studying in the 4th grade of the science…
Problem Solving & Comprehension. Fourth Edition.
ERIC Educational Resources Information Center
Whimbey, Arthur; Lochhead, Jack
This book shows how to increase one's power to analyze and comprehend problems. First, it outlines and illustrates the methods that good problem solvers use in attacking complex ideas. Then it gives some practice in applying these methods to a variety of questions in comprehension and reasoning. Chapters include: (1) "Test Your Mind--See How…
Schofield, Hannah-Lise T.; Heinrichs, Brenda; Nix, Robert L.
2009-01-01
Youth who initiate sexual intercourse in early adolescence (age 11–14) experience multiple risks, including concurrent adjustment problems and unsafe sexual practices, The current study tested two models describing the links between childhood precursors, early adolescent risk factors, and adolescent sexual activity: a cumulative model and a meditational model, A longitudinal sample of 694 boys and girls from four geographical locations was utilized, with data collected from kindergarten through high school. Structural equation models revealed that, irrespective of gender or race, high rates of aggressive disruptive behaviors and attention problems at school entry increased risk for a constellation of problem behaviors in middle school (school maladjustment, antisocial activity, and substance use) which, in turn, promoted the early initiation of sexual activity. Implications are discussed for developmental models of early sexual activity and for prevention programming. PMID:18607716
The Prisoner Problem--A Generalization.
ERIC Educational Resources Information Center
Gannon, Gerald E.; Martelli, Mario U.
2000-01-01
Presents a generalization to the classic prisoner problem, which is inherently interesting and has a solution within the reach of most high school mathematics students. Suggests the problem as a way to emphasize to students the final step in a problem-solver's tool kit, considering possible generalizations when a particular problem has been…
Coordinate Projection-based Solver for ODE with Invariants
Serban, Radu
2008-04-08
CPODES is a general purpose (serial and parallel) solver for systems of ordinary differential equation (ODE) with invariants. It implements a coordinate projection approach using different types of projection (orthogonal or oblique) and one of several methods for the decompositon of the Jacobian of the invariant equations.
Hypersonic simulations using open-source CFD and DSMC solvers
NASA Astrophysics Data System (ADS)
Casseau, V.; Scanlon, T. J.; John, B.; Emerson, D. R.; Brown, R. E.
2016-11-01
Hypersonic hybrid hydrodynamic-molecular gas flow solvers are required to satisfy the two essential requirements of any high-speed reacting code, these being physical accuracy and computational efficiency. The James Weir Fluids Laboratory at the University of Strathclyde is currently developing an open-source hybrid code which will eventually reconcile the direct simulation Monte-Carlo method, making use of the OpenFOAM application called dsmcFoam, and the newly coded open-source two-temperature computational fluid dynamics solver named hy2Foam. In conjunction with employing the CVDV chemistry-vibration model in hy2Foam, novel use is made of the QK rates in a CFD solver. In this paper, further testing is performed, in particular with the CFD solver, to ensure its efficacy before considering more advanced test cases. The hy2Foam and dsmcFoam codes have shown to compare reasonably well, thus providing a useful basis for other codes to compare against.
PSH3D fast Poisson solver for petascale DNS
NASA Astrophysics Data System (ADS)
Adams, Darren; Dodd, Michael; Ferrante, Antonino
2016-11-01
Direct numerical simulation (DNS) of high Reynolds number, Re >= O (105) , turbulent flows requires computational meshes >= O (1012) grid points, and, thus, the use of petascale supercomputers. DNS often requires the solution of a Helmholtz (or Poisson) equation for pressure, which constitutes the bottleneck of the solver. We have developed a parallel solver of the Helmholtz equation in 3D, PSH3D. The numerical method underlying PSH3D combines a parallel 2D Fast Fourier transform in two spatial directions, and a parallel linear solver in the third direction. For computational meshes up to 81923 grid points, our numerical results show that PSH3D scales up to at least 262k cores of Cray XT5 (Blue Waters). PSH3D has a peak performance 6 × faster than 3D FFT-based methods when used with the 'partial-global' optimization, and for a 81923 mesh solves the Poisson equation in 1 sec using 128k cores. Also, we have verified that the use of PSH3D with the 'partial-global' optimization in our DNS solver does not reduce the accuracy of the numerical solution of the incompressible Navier-Stokes equations.
Assessment of Linear Finite-Difference Poisson-Boltzmann Solvers
Wang, Jun; Luo, Ray
2009-01-01
CPU time and memory usage are two vital issues that any numerical solvers for the Poisson-Boltzmann equation have to face in biomolecular applications. In this study we systematically analyzed the CPU time and memory usage of five commonly used finite-difference solvers with a large and diversified set of biomolecular structures. Our comparative analysis shows that modified incomplete Cholesky conjugate gradient and geometric multigrid are the most efficient in the diversified test set. For the two efficient solvers, our test shows that their CPU times increase approximately linearly with the numbers of grids. Their CPU times also increase almost linearly with the negative logarithm of the convergence criterion at very similar rate. Our comparison further shows that geometric multigrid performs better in the large set of tested biomolecules. However, modified incomplete Cholesky conjugate gradient is superior to geometric multigrid in molecular dynamics simulations of tested molecules. We also investigated other significant components in numerical solutions of the Poisson-Boltzmann equation. It turns out that the time-limiting step is the free boundary condition setup for the linear systems for the selected proteins if the electrostatic focusing is not used. Thus, development of future numerical solvers for the Poisson-Boltzmann equation should balance all aspects of the numerical procedures in realistic biomolecular applications. PMID:20063271
Development of multiphase CFD flow solver in OpenFOAM
NASA Astrophysics Data System (ADS)
Rollins, Chad; Luo, Hong; Dinh, Nam
2016-11-01
We are developing a pressure-based multiphase (Eulerian) CFD solver using OpenFOAM with Reynolds-averaged turbulence stress modeling. Our goal is the evaluation and improvement of the current OpenFOAM two-fluid (Eulerian) solver in boiling channels with a motivation to produce a more consistent modeling and numerics treatment. The difficulty lies in the prescense of the many forces and models that are tightly non-linearly coupled in the solver. Therefore, the solver platform will allow not only the modeling, but the tracking as well, of the effects of the individual components (various interfacial forces/heat transfer models) and their interactions. This is essential for the development of a robust and efficient solution method. There has be a lot of work already performed in related areas that generally indicates a lack of robustness of the solution methods. The objective here is therefore to identify and develop remedies for numerical/modeling issues through a systematic approach to verification and validation, taking advantage of the open source nature of OpenFOAM. The presentation will discuss major findings, and suggest strategies for robust and consistent modeling (probably, a more consistent treatment of heat transfer models with two-fluid models in the near-wall cells).
LORENE: Spectral methods differential equations solver
NASA Astrophysics Data System (ADS)
Gourgoulhon, Eric; Grandclément, Philippe; Marck, Jean-Alain; Novak, Jérôme; Taniguchi, Keisuke
2016-08-01
LORENE (Langage Objet pour la RElativité NumériquE) solves various problems arising in numerical relativity, and more generally in computational astrophysics. It is a set of C++ classes and provides tools to solve partial differential equations by means of multi-domain spectral methods. LORENE classes implement basic structures such as arrays and matrices, but also abstract mathematical objects, such as tensors, and astrophysical objects, such as stars and black holes.
A Navier-Stokes boundary element solver
NASA Technical Reports Server (NTRS)
Reddy, D. R.; Lafe, O.; Cheng, A. H-D.
1995-01-01
Using global interpolation functions (GIF's) boundary element solutions are obtained for two-dimensional laminar flows. Two schemes are proposed for handling the convective terms. The first treats convection as a forcing function, and converts the flow equations to pseudo-Poisson equations. In the second scheme, some convective effect is incorporated into the fundamental solution used in constructing the pertinent integral equations. The lid-driven cavity flow is selected as the benchmark problem.
An Extension of the Time-Spectral Method to Overset Solvers
NASA Technical Reports Server (NTRS)
Leffell, Joshua Isaac; Murman, Scott M.; Pulliam, Thomas
2013-01-01
Relative motion in the Cartesian or overset framework causes certain spatial nodes to move in and out of the physical domain as they are dynamically blanked by moving solid bodies. This poses a problem for the conventional Time-Spectral approach, which expands the solution at every spatial node into a Fourier series spanning the period of motion. The proposed extension to the Time-Spectral method treats unblanked nodes in the conventional manner but expands the solution at dynamically blanked nodes in a basis of barycentric rational polynomials spanning partitions of contiguously defined temporal intervals. Rational polynomials avoid Runge's phenomenon on the equidistant time samples of these sub-periodic intervals. Fourier- and rational polynomial-based differentiation operators are used in tandem to provide a consistent hybrid Time-Spectral overset scheme capable of handling relative motion. The hybrid scheme is tested with a linear model problem and implemented within NASA's OVERFLOW Reynolds-averaged Navier- Stokes (RANS) solver. The hybrid Time-Spectral solver is then applied to inviscid and turbulent RANS cases of plunging and pitching airfoils and compared to time-accurate and experimental data. A limiter was applied in the turbulent case to avoid undershoots in the undamped turbulent eddy viscosity while maintaining accuracy. The hybrid scheme matches the performance of the conventional Time-Spectral method and converges to the time-accurate results with increased temporal resolution.
Development of a New and Fast Linear Solver for Multi-component Reactive Transport Simulation
NASA Astrophysics Data System (ADS)
Qiao, C.; Li, L.; Bao, C.; Hu, X.; Johns, R.; Xu, J.
2013-12-01
Reactive transport models (RTM) have been extensively used to understand the coupling between solute transport and (bio) geochemical reactions in complex earth systems. RTM typically involves a large number of primary and secondary species with a complex reaction network in large domains. The computational expenses increase significantly with the number of grid blocks and the number of chemical species. Within both the operator splitting approach (OS) and the global implicit approach (GI) that are commonly used, the steps that involve Newton-Raphson method are typically one of the most time-consuming parts (up to 80% to 90% of CPU times). Under such circumstances, accelerating reactive transport simulation is very essential. In this research, we present a physics-based linear system solution strategy for general reactive transport models with many species. We observed up to five times speed up for the linear solver portion of the simulations in our test cases. Our new linear solver takes advantage of the sparsity of the Jacobian matrix arising from the reaction network. The Jacobian matrix for the speciation problem is typically considered as a dense matrix and solved with a direct method such as Gaussian elimination. For the reactive transport problem, the graph of the local Jacobian matrix has a one-to-one correspondence to the reaction network graph. The Jacobian matrix is commonly sparse and has the same sparsity structure for the same reaction network. We developed a strategy that performs a minimum degree of reordering and symbolic factorization to determine the non-zero pattern at the beginning of the OS and GI simulation. During the speciation calculation in OS, we calculate the L and U factors and solve the triangular matrices according to the non-zero pattern. For GI, our strategy can be applied to inverse the diagonal blocks in the block-Jacobi preconditioner and smoothers of the multigrid preconditioners in iterative solvers. Our strategy is naturally
Performance of algebraic multi-grid solvers based on unsmoothed and smoothed aggregation schemes
NASA Astrophysics Data System (ADS)
Webster, R.
2001-08-01
A comparison is made of the performance of two algebraic multi-grid (AMG0 and AMG1) solvers for the solution of discrete, coupled, elliptic field problems. In AMG0, the basis functions for each coarse grid/level approximation (CGA) are obtained directly by unsmoothed aggregation, an appropriate scaling being applied to each CGA to improve consistency. In AMG1 they are assembled using a smoothed aggregation with a constrained energy optimization method providing the smoothing. Although more costly, smoothed basis functions provide a better (more consistent) CGA. Thus, AMG1 might be viewed as a benchmark for the assessment of the simpler AMG0. Selected test problems for D'Arcy flow in pipe networks, Fick diffusion, plane strain elasticity and Navier-Stokes flow (in a Stokes approximation) are used in making the comparison. They are discretized on the basis of both structured and unstructured finite element meshes. The range of discrete equation sets covers both symmetric positive definite systems and systems that may be non-symmetric and/or indefinite. Both global and local mesh refinements to at least one order of resolving power are examined. Some of these include anisotropic refinements involving elements of large aspect ratio; in some hydrodynamics cases, the anisotropy is extreme, with aspect ratios exceeding two orders. As expected, AMG1 delivers typical multi-grid convergence rates, which for all practical purposes are independent of mesh bandwidth. AMG0 rates are slower. They may also be more discernibly mesh-dependent. However, for the range of mesh bandwidths examined, the overall cost effectiveness of the two solvers is remarkably similar when a full convergence to machine accuracy is demanded. Thus, the shorter solution times for AMG1 do not necessarily compensate for the extra time required for its costly grid generation. This depends on the severity of the problem and the demanded level of convergence. For problems requiring few iterations, where grid
Open Collaboration: A Problem Solving Strategy That Is Redefining NASA's Innovative Spirit
NASA Technical Reports Server (NTRS)
Rando, Cynthia M.; Fogarty, Jennifer A.; Richard, Elizabeth E.; Davis, Jeffrey R.
2011-01-01
In 2010, NASA?s Space Life Sciences Directorate announced the successful results from pilot experiments with open innovation methodologies. Specifically, utilization of internet based external crowd sourcing platforms to solve challenging problems in human health and performance related to the future of spaceflight. The follow-up to this success was an internal crowd sourcing pilot program entitled NASA@work, which was supported by the InnoCentive@work software platform. The objective of the NASA@work pilot was to connect the collective knowledge of individuals from all areas within the NASA organization via a private web based environment. The platform provided a venue for NASA Challenge Owners, those looking for solutions or new ideas, to pose challenges to internal solvers, those within NASA with the skill and desire to create solutions. The pilot was launched in 57 days, a record for InnoCentive and NASA, and ran for three months with a total of 20 challenges posted Agency wide. The NASA@work pilot attracted over 6000 participants throughout NASA with a total of 183 contributing solvers for the 20 challenges posted. At the time of the pilot?s closure, solvers provided viable solutions and ideas for 17 of the 20 posted challenges. The solver community provided feedback on the pilot describing it as a barrier breaking activity, conveying that there was a satisfaction associated with helping co-workers, that it was "fun" to think about problems outside normal work boundaries, and it was nice to learn what challenges others were facing across the agency. The results and the feedback from the solver community have demonstrated the power and utility of an internal collaboration tool, such as NASA@work.
Open Collaboration: A Problem Solving Strategy That is Redefining NASA's Innovative Spirit
NASA Technical Reports Server (NTRS)
Rando, Cynthia M.; Fogarty, Jennifer A.; Richard, E. E.; Davis, Jeffrey R.
2011-01-01
In 2010, NASA's Space Life Sciences Directorate announced the successful results from pilot experiments with open innovation methodologies. Specifically, utilization of internet based external crowdsourcing platforms to solve challenging problems in human health and performance related to the future of spaceflight. The follow-up to this success was an internal crowdsourcing pilot program entitled NASA@work, which was supported by the InnoCentive@work software platform. The objective of the NASA@work pilot was to connect the collective knowledge of individuals from all areas within the NASA organization via a private web based environment. The platform provided a venue for NASA Challenge Owners, those looking for solutions or new ideas, to pose challenges to internal solvers, those within NASA with the skill and desire to create solutions. The pilot was launched in 57 days, a record for InnoCentive and NASA, and ran for three months with a total of 20 challenges posted Agency wide. The NASA@work pilot attracted over 6,000 participants throughout NASA with a total of 183 contributing solvers for the 20 challenges posted. At the time of the pilot's closure, solvers provided viable solutions and ideas for 17 of the 20 posted challenges. The solver community provided feedback on the pilot describing it as a barrier breaking activity, conveying that there was a satisfaction associated with helping co-workers, that it was fun to think about problems outside normal work boundaries, and it was nice to learn what challenges others were facing across the agency. The results and the feedback from the solver community have demonstrated the power and utility of an internal collaboration tool, such as NASA@work.
Gerris Flow Solver: Implementation and Application
2013-05-12
2010), as well as tsunamis (Popinet 2011; 2012). The OMEGA model ( Bacon et al., 2000; Boybeyi et al., 2001) took a different approach to adaptivity...application of the model system to problems of interest. Cited References D. P. Bacon , N. N. Ahmad, et al. (2000), A dynamically adapting weather...Geophysical Union, Washington, DC, 1–16. Z. Boybeyi, N. N. Ahmad, D. P. Bacon , T. J. Dunn, M. S. Hall, P. C. S. Lee, R. A. Sarma, and T. R. Wait (2001
A Localized Tau Method PDE Solver
NASA Technical Reports Server (NTRS)
Cottam, Russell
2002-01-01
In this paper we present a new form of the collocation method that allows one to find very accurate solutions to time marching problems without the unwelcome appearance of Gibb's phenomenon oscillations. The basic method is applicable to any partial differential equation whose solution is a continuous, albeit possibly rapidly varying function. Discontinuous functions are dealt with by replacing the function in a small neighborhood of the discontinuity with a spline that smoothly connects the function segments on either side of the discontinuity. This will be demonstrated when the solution to the inviscid Burgers equation is discussed.
How number line estimation skills relate to neural activations in single digit subtraction problems.
Berteletti, I; Man, G; Booth, J R
2015-02-15
The Number Line (NL) task requires judging the relative numerical magnitude of a number and estimating its value spatially on a continuous line. Children's skill on this task has been shown to correlate with and predict future mathematical competence. Neurofunctionally, this task has been shown to rely on brain regions involved in numerical processing. However, there is no direct evidence that performance on the NL task is related to brain areas recruited during arithmetical processing and that these areas are domain-specific to numerical processing. In this study, we test whether 8- to 14-year-old's behavioral performance on the NL task is related to fMRI activation during small and large single-digit subtraction problems. Domain-specific areas for numerical processing were independently localized through a numerosity judgment task. Results show a direct relation between NL estimation performance and the amount of the activation in key areas for arithmetical processing. Better NL estimators showed a larger problem size effect than poorer NL estimators in numerical magnitude (i.e., intraparietal sulcus) and visuospatial areas (i.e., posterior superior parietal lobules), marked by less activation for small problems. In addition, the direction of the activation with problem size within the IPS was associated with differences in accuracies for small subtraction problems. This study is the first to show that performance in the NL task, i.e. estimating the spatial position of a number on an interval, correlates with brain activity observed during single-digit subtraction problem in regions thought to be involved in numerical magnitude and spatial processes.
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
Efficient Parallel Kernel Solvers for Computational Fluid Dynamics Applications
NASA Technical Reports Server (NTRS)
Sun, Xian-He
1997-01-01
Distributed-memory parallel computers dominate today's parallel computing arena. These machines, such as Intel Paragon, IBM SP2, and Cray Origin2OO, have successfully delivered high performance computing power for solving some of the so-called "grand-challenge" problems. Despite initial success, parallel machines have not been widely accepted in production engineering environments due to the complexity of parallel programming. On a parallel computing system, a task has to be partitioned and distributed appropriately among processors to reduce communication cost and to attain load balance. More importantly, even with careful partitioning and mapping, the performance of an algorithm may still be unsatisfactory, since conventional sequential algorithms may be serial in nature and may not be implemented efficiently on parallel machines. In many cases, new algorithms have to be introduced to increase parallel performance. In order to achieve optimal performance, in addition to partitioning and mapping, a careful performance study should be conducted for a given application to find a good algorithm-machine combination. This process, however, is usually painful and elusive. The goal of this project is to design and develop efficient parallel algorithms for highly accurate Computational Fluid Dynamics (CFD) simulations and other engineering applications. The work plan is 1) developing highly accurate parallel numerical algorithms, 2) conduct preliminary testing to verify the effectiveness and potential of these algorithms, 3) incorporate newly developed algorithms into actual simulation packages. The work plan has well achieved. Two highly accurate, efficient Poisson solvers have been developed and tested based on two different approaches: (1) Adopting a mathematical geometry which has a better capacity to describe the fluid, (2) Using compact scheme to gain high order accuracy in numerical discretization. The previously developed Parallel Diagonal Dominant (PDD) algorithm
Riva, Giuseppe; Graffigna, Guendalina; Baitieri, Maddalena; Amato, Alessandra; Bonanomi, Maria Grazia; Valentini, Paolo; Castelli, Guido
2014-01-01
The quest for an active and healthy ageing can be considered a "wicked problem." It is a social and cultural problem, which is difficult to solve because of incomplete, changing, and contradictory requirements. These problems are tough to manage because of their social complexity. They are a group of linked problems embedded in the structure of the communities in which they occur. First, they require the knowledge of the social and cultural context in which they occur. They can be solved only by understanding of what people do and why they do it. Second, they require a multidisciplinary approach. Wicked problems can have different solutions, so it is critical to capture the full range of possibilities and interpretations. Thus, we suggest that Università Cattolica del Sacro Cuore (UCSC) is well suited for accepting and managing this challenge because of its applied research orientation, multidisciplinary approach, and integrated vision. After presenting the research activity of UCSC, we describe a possible "systems thinking" strategy to consider the complexity and interdependence of active ageing and healthy living.
Problem solving stages in the five square problem.
Fedor, Anna; Szathmáry, Eörs; Öllinger, Michael
2015-01-01
According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight, and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviorally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. Our participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and some of them also had the possibility of reporting impasse while working on the task. We found that the majority of participants did not follow the classic four-stage model of insight, but had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model is not sufficient to describe variability on the individual level. We revised the classic model and we provide a new model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviorally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behavior to verify insight theory.
Problem solving stages in the five square problem
Fedor, Anna; Szathmáry, Eörs; Öllinger, Michael
2015-01-01
According to the restructuring hypothesis, insight problem solving typically progresses through consecutive stages of search, impasse, insight, and search again for someone, who solves the task. The order of these stages was determined through self-reports of problem solvers and has never been verified behaviorally. We asked whether individual analysis of problem solving attempts of participants revealed the same order of problem solving stages as defined by the theory and whether their subjective feelings corresponded to the problem solving stages they were in. Our participants tried to solve the Five-Square problem in an online task, while we recorded the time and trajectory of their stick movements. After the task they were asked about their feelings related to insight and some of them also had the possibility of reporting impasse while working on the task. We found that the majority of participants did not follow the classic four-stage model of insight, but had more complex sequences of problem solving stages, with search and impasse recurring several times. This means that the classic four-stage model is not sufficient to describe variability on the individual level. We revised the classic model and we provide a new model that can generate all sequences found. Solvers reported insight more often than non-solvers and non-solvers reported impasse more often than solvers, as expected; but participants did not report impasse more often during behaviorally defined impasse stages than during other stages. This shows that impasse reports might be unreliable indicators of impasse. Our study highlights the importance of individual analysis of problem solving behavior to verify insight theory. PMID:26300794
Sampogna, Francesca; Tabolli, Stefano; Abeni, Damiano
2012-05-01
Psychosocial problems are frequent among patients with psoriasis. The aim of this study was to analyse the prevalence of some specific psychosocial issues. These were evaluated in 936 patients using the emotions and functioning scales of the Skindex-29 questionnaire. The problems most frequently experienced were: shame, anger, worry, difficulties in daily activities and social life. All problems were associated with the severity of psoriasis and with depression or anxiety. Shame, worry and annoyance were more frequent in women than in men, and shame and anger were associated with a low level of education. Impairment in work/hobbies was significantly higher in patients with palmoplantar psoriasis and those with arthro-pathic psoriasis. In conclusion, clinicians could gain important insights about their patients by looking at the single items of a quality of life instrument, to identify patients with high levels of emotional and social problems, in order to improve quality of care.
A pseudo-compressible variational multiscale solver for turbulent incompressible flows
NASA Astrophysics Data System (ADS)
Yang, Liang; Badia, Santiago; Codina, Ramon
2016-12-01
In this work, we design an explicit time-stepping solver for the simulation of the incompressible turbulent flow through the combination of VMS methods and artificial compressibility. We evaluate the effect of the artificial compressibility on the accuracy of the explicit formulation for under-resolved LES simulations. A set of benchmarks have been solved, e.g., the 3D Taylor-Green vortex problem in turbulent regimes. The resulting method is proven to be an effective alternative to implicit methods in some application ranges (in terms of problem size and computational resources), providing comparable results with very low memory requirements. As an example, with the explicit approach, we are able to solve accurately the Taylor-Green vortex benchmark in a fine mesh with 512^3 cells on a 12 cores 64 GB ram machine.
Gust Acoustics Computation with a Space-Time CE/SE Parallel 3D Solver
NASA Technical Reports Server (NTRS)
Wang, X. Y.; Himansu, A.; Chang, S. C.; Jorgenson, P. C. E.; Reddy, D. R. (Technical Monitor)
2002-01-01
The benchmark Problem 2 in Category 3 of the Third Computational Aero-Acoustics (CAA) Workshop is solved using the space-time conservation element and solution element (CE/SE) method. This problem concerns the unsteady response of an isolated finite-span swept flat-plate airfoil bounded by two parallel walls to an incident gust. The acoustic field generated by the interaction of the gust with the flat-plate airfoil is computed by solving the 3D (three-dimensional) Euler equations in the time domain using a parallel version of a 3D CE/SE solver. The effect of the gust orientation on the far-field directivity is studied. Numerical solutions are presented and compared with analytical solutions, showing a reasonable agreement.
Recent Enhancements to USM3D Unstructured Flow Solver for Unsteady Flows
NASA Technical Reports Server (NTRS)
Pandya, Mohagna J.; Frink, Neal T.; Abdol-Hamid, Khaled S.; Chung, James J.
2004-01-01
The NASA USM3D unstructured flow solver is undergoing extensions to address dynamic flow problems in support of NASA and NAVAIR efforts to study the applicability of Computational Fluid Dynamics tools for the prediction of aircraft stability and control characteristics. The initial extensions reported herein include two second-order time stepping schemes, Detached-Eddy Simulation, and grid motion. This paper reports the initial code verification and validation assessment of the dynamic flow capabilities of USM3D. The cases considered are the classic inviscid shock-tube problem, low Reynolds number wake shedding from a NACA 0012 airfoil, high Reynolds number DES-based wake shedding from a 4-to-1 length-to-diameter cylinder, and forced pitch oscillation of a NACA 0012 airfoil with inviscid and turbulent flow.
Implementation of Implicit Adaptive Mesh Refinement in an Unstructured Finite-Volume Flow Solver
NASA Technical Reports Server (NTRS)
Schwing, Alan M.; Nompelis, Ioannis; Candler, Graham V.
2013-01-01
This paper explores the implementation of adaptive mesh refinement in an unstructured, finite-volume solver. Unsteady and steady problems are considered. The effect on the recovery of high-order numerics is explored and the results are favorable. Important to this work is the ability to provide a path for efficient, implicit time advancement. A method using a simple refinement sensor based on undivided differences is discussed and applied to a practical problem: a shock-shock interaction on a hypersonic, inviscid double-wedge. Cases are compared to uniform grids without the use of adapted meshes in order to assess error and computational expense. Discussion of difficulties, advances, and future work prepare this method for additional research. The potential for this method in more complicated flows is described.
NASA Technical Reports Server (NTRS)
Sun, Xian-He; Moitra, Stuti
1996-01-01
Various tridiagonal solvers have been proposed in recent years for different parallel platforms. In this paper, the performance of three tridiagonal solvers, namely, the parallel partition LU algorithm, the parallel diagonal dominant algorithm, and the reduced diagonal dominant algorithm, is studied. These algorithms are designed for distributed-memory machines and are tested on an Intel Paragon and an IBM SP2 machines. Measured results are reported in terms of execution time and speedup. Analytical study are conducted for different communication topologies and for different tridiagonal systems. The measured results match the analytical results closely. In addition to address implementation issues, performance considerations such as problem sizes and models of speedup are also discussed.
NASA Astrophysics Data System (ADS)
Lu, Benzhuo; Cheng, Xiaolin; Huang, Jingfang; McCammon, J. Andrew
2010-06-01
://www.fastmultipole.org/). Nature of problem: Numerical solution of the linearized Poisson-Boltzmann equation that describes electrostatic interactions of molecular systems in ionic solutions. Solution method: A novel node-patch scheme is used to discretize the well-conditioned boundary integral equation formulation of the linearized Poisson-Boltzmann equation. Various Krylov subspace solvers can be subsequently applied to solve the resulting linear system, with a bounded number of iterations independent of the number of discretized unknowns. The matrix-vector multiplication at each iteration is accelerated by the adaptive new versions of fast multipole methods. The AFMPB solver requires other stand-alone pre-processing tools for boundary mesh generation, post-processing tools for data analysis and visualization, and can be conveniently coupled with different time stepping methods for dynamics simulation. Restrictions: Only three or six significant digits options are provided in this version. Unusual features: Most of the codes are in Fortran77 style. Memory allocation functions from Fortran90 and above are used in a few subroutines. Additional comments: The current version of the codes is designed and written for single core/processor desktop machines. Check http://lsec.cc.ac.cn/~lubz/afmpb.html and http://mccammon.ucsd.edu/ for updates and changes. Running time: The running time varies with the number of discretized elements ( N) in the system and their distributions. In most cases, it scales linearly as a function of N.
ERIC Educational Resources Information Center
Gojkošek, Mihael; Sliško, Josip; Planinšic, Gorazd
2013-01-01
The transfer of knowledge is considered to be a fundamental goal of education; therefore, knowing and understanding the conditions that influence the efficiency of the transfer from learning activity to problem solving play a decisive role in the improvement of science education. In this article, the results of a study of 196 high school students'…
Teacher and Student Problem-Solving Activities in Education Supervisory Sessions.
ERIC Educational Resources Information Center
Basso, Robert V. J.
1987-01-01
Educational supervision sessions between a field teacher and three students were content analyzed for information on how time was allocated for the students' direct practice, problem-solving activities. The findings indicate areas where further conceptualization and research in educational supervision are needed. (Author/MH)
Can Mood-Inducing Videos Affect Problem-Solving Activities in a Web-Based Environment?
ERIC Educational Resources Information Center
Verleur, Ria; Verhagen, Plon W.; Heuvelman, Ard
2007-01-01
The purpose of this study was to examine whether a video-induced positive and negative mood has a differential effect on subsequent problem-solving activities in a web-based environment. The study also examined whether task conditions (task demands) moderated the mood effect. As in traditional experimental mood-effect studies, the affective video…
The Use of a Real Life Simulated Problem Based Learning Activity in a Corporate Environment
ERIC Educational Resources Information Center
Laurent, Mark A.
2013-01-01
This narrative study examines using a real life simulated problem base learning activity during education of clinical staff, which is expected to design and develop clinically correct electronic charting systems. Expertise in healthcare does not readily transcend to the realm of manipulating software to collect patient data that is pertinent to…
ERIC Educational Resources Information Center
Ioannou, Andri; Vasiliou, Christina; Zaphiris, Panayiotis; Arh, Tanja; Klobucar, Tomaž; Pipan, Matija
2015-01-01
This exploratory case study aims to examine how students benefit from a multimodal learning environment while they engage in collaborative problem-based activity in a Human Computer Interaction (HCI) university course. For 12 weeks, 30 students, in groups of 5-7 each, participated in weekly face-to-face meetings and online interactions.…
Changing Channels: Activities Promoting Media Smarts and Creative Problem Solving for Kids.
ERIC Educational Resources Information Center
Hoffman, Eric
When children have healthy ways to process the news and information they see on television, they are better prepared to approach conflict peacefully and solve problems in their everyday lives. This guide presents activities for children to help them learn to think critically about what they see on television, to resolve conflicts productively, and…
"Sustainability on Earth" Webquests: Do They Qualify as Problem-Based Learning Activities?
ERIC Educational Resources Information Center
Leite, Laurinda; Dourado, Luís; Morgado, Sofia
2015-01-01
Information and communication technologies (ICT), namely the Internet, can play a valuable educational role in several school subjects, including science education. The same applies to problem-based learning (PBL), that is, a student-centered active learning methodology that can prepare students for lifelong learning. WebQuests (WQs) combine PBL…
ERIC Educational Resources Information Center
Roy MacArthur, Amy H.; Copper, Christine L.
2009-01-01
As petroleum reserves are being depleted worldwide and energy costs are increasing, the use of alternative fuels is being more widely considered as a solution to the impending energy crisis. In this classroom activity students are presented with a real-world problem in which they must evaluate the properties and environmental impacts of a variety…
ERIC Educational Resources Information Center
Karaçam, Aydin; Pulur, Atilla
2016-01-01
This study aims to determine the relation between basketball classification referees' problem solving ability and empathetic tendencies. Research model of the study is relational screening model. Sampling of the study is constituted by 124 male and 18 female basketball classification referees who made active refereeing within Turkish Basketball…
ERIC Educational Resources Information Center
Metzger, Aaron; Dawes, Nickki; Mermelstein, Robin; Wakschlag, Lauren
2011-01-01
Longitudinal associations among different types of organized activity involvement, problem peer associations, and cigarette smoking were examined in a sample of 1040 adolescents (mean age = 15.62 at baseline, 16.89 at 15-month assessment, 17.59 at 24 months) enriched for smoking experimentation (83% had tried smoking). A structural equation model…
Feedback during Active Learning: Elementary School Teachers' Beliefs and Perceived Problems
ERIC Educational Resources Information Center
van den Bergh, Linda; Ros, Anje; Beijaard, Douwe
2013-01-01
Giving feedback during active learning is an important, though difficult, task for teachers. In the present study, the problems elementary school teachers perceive and the beliefs they hold regarding this task were investigated. It appeared that teachers believe conditional teacher skills, especially time management, hinder them most from giving…
ERIC Educational Resources Information Center
Figueira, Angela C. M.; Rocha, Joao B. T.
2014-01-01
This article presents a problem-based learning (PBL) approach to teaching elementary biochemistry to undergraduate students. The activity was based on "the foods we eat." It was used to engage students' curiosity and to initiate learning about a subject that could be used by the future teachers in the high school. The experimental…
ABO/Rh Blood-Typing Model: A Problem-Solving Activity
ERIC Educational Resources Information Center
Wake, Carol
2005-01-01
An ARO/Rh Blood-Typing kit useful for students to visualize blood-typing activities and practice problem-solving skills with transfusion reactions is presented. The model also enables students to identify relationships between A, B, and Rh antigens and antibodies in blood and to understand molecular mechanisms involved in transfusion agglutination…
ERIC Educational Resources Information Center
Çakiroglu, Ünal; Öztürk, Mücahit
2017-01-01
This study intended to explore the development of self-regulation in a flipped classroom setting. Problem based learning activities were carried out in flipped classrooms to promote self-regulation. A total of 30 undergraduate students from Mechatronic department participated in the study. Self-regulation skills were discussed through students'…
ERIC Educational Resources Information Center
Denault, Anne-Sophie; Déry, Michèle
2015-01-01
The goal of this study was to test a mediation model in which social skills mediate the relationship between participation in organized activities and conduct problems among elementary school children. Two moderators of these associations were also examined, namely, gender and reception of special education services. A total of 563 children (45%…
ERIC Educational Resources Information Center
Schofield, Hannah-Lise T.; Bierman, Karen L.; Heinrichs, Brenda; Nix, Robert L.
2008-01-01
Youth who initiate sexual intercourse in early adolescence (age 11-14) experience multiple risks, including concurrent adjustment problems and unsafe sexual practices. The current study tested two models describing the links between childhood precursors, early adolescent risk factors, and adolescent sexual activity: a cumulative model and a…
ERIC Educational Resources Information Center
Bar, Mustafa; Yaman, Menzure Sibel; Hergüner, Gülten
2016-01-01
The study aimed to determine problems encountered by Religious Vocational Secondary School and other Secondary School students in physical education and sports activities and to compare these problems according to school type and gender. A questionnaire named "Problems encountered in attending to physical education and sports activities"…
Plasma wave simulation based on a versatile FEM solver on Alcator C-Mod
NASA Astrophysics Data System (ADS)
Shiraiwa, Syun'ichi
2009-11-01
A new efficient full wave simulation code of the lower hybrid (LH) wave was developed using the finite element method (FEM). A dielectric tensor consisting of the cold plasma contribution and the electron Landau damping (ELD) was used. The non-trivial problem of introducing non-local hot plasma effects into an FEM solver was addressed by iteratively solving the coupled problem of the Maxwell's equations with the convolution integral. With this approach, the EM problem is numerically sparse, and the computational requirements are reduced significantly compared to spectral domain solvers [1]. The simulation of an Alcator C-Mod scale plasma has been done on a desktop computer, suggesting the possibility of an ITER scale plasma simulation. The algorithm was implemented using a general purpose FEM software, COMSOL Multiphysics, and the simulation results of a Maxwellian tokamak plasma showed good agreement with ray tracing calculations in the strong single pass absorption regime. Integration of a Fokker-Planck calculation for a more realistic non-Maxwellian plasma is underway and initial results show reasonable shift of the power absorption towards the plasma edge [2]. Importantly, the FEM approach allows seamless handling of the core, SOL, and antenna regions. This flexibility has been exploited to address issues of antenna-plasma coupling in the LH and ICRF frequency ranges. Techniques to use the FEM package for this purpose were validated by solving the LH grill antenna coupling problem whose analytic solution is known. The code has been applied to a new Alcator C-Mod ICRF antenna to assess the antenna near field pattern [3]. [4pt] [1] J. C. Wright, et. al., Comput. Phys. 4, 545 (2008) [0pt] [2] O. Meneghini, et. al., this conference [0pt] [3] M. Garrett, et. al., this conference
Towards Verification of Unstructured-Grid Solvers
NASA Technical Reports Server (NTRS)
Thomas, James L.; Diskin, Boris; Rumsey, Christopher L.
2008-01-01
New methodology for verification of finite-volume computational methods using unstructured grids is presented. The discretization order properties are studied in computational windows, easily constructed within a collection of grids or a single grid. Tests are performed within each window and address a combination of problem-, solution-, and discretization/grid-related features affecting discretization error convergence. The windows can be adjusted to isolate particular elements of the computational scheme, such as the interior discretization, the boundary discretization, or singularities. Studies can use traditional grid-refinement computations within a fixed window or downscaling, a recently-introduced technique in which computations are made within windows contracting toward a focal point of interest. Grids within the windows are constrained to be consistently refined, allowing a meaningful assessment of asymptotic error convergence on unstructured grids. Demonstrations of the method are shown, including a comparative accuracy assessment of commonly-used schemes on general mixed grids and the identification of local accuracy deterioration at boundary intersections. Recommendations to enable attainment of design-order discretization errors for large-scale computational simulations are given.
A point implicit unstructured grid solver for the Euler and Navier-Stokes equations
NASA Technical Reports Server (NTRS)
Thareja, Rajiv R.; Stewart, James R.; Hassan, Obey; Morgan, Ken; Peraire, Jaime
1988-01-01
An upwind finite element technique that uses cell centered quantities and implicit and/or explicit time marching has been developed for computing hypersonic laminar viscous flows using adaptive unstructured triangular grids. A structured grid of quadrilaterals is laid out near the body surface. For inviscid flows the method is stable at Courant numbers of over 100,000. A first order basic scheme and a higher order flux corrected transport (FCT) scheme have been implemented. This technique has been applied to the problem of predicting type III and IV shock wave interactions on a cylinder, with a view of simulating the pressure and heating rate augmentation caused by an impinging shock on the leading edge of a cowl lip of an engine inlet. The predictions of wall pressure and heating rates compare very well with experimental data. The flow features are very distinctly captured with a sequence of adaptively generated grids. The adaptive mesh generator and the upwind Navier-Stokes solver are combined in a set of programs called LARCNESS, an acronym for Langley Adaptive Remeshing Code and Navier-Stokes Solver.
Solvers for $\\mathcal{O} (N)$ Electronic Structure in the Strong Scaling Limit
Bock, Nicolas; Challacombe, William M.; Kale, Laxmikant
2016-01-26
Here we present a hybrid OpenMP/Charm\\tt++ framework for solving the $\\mathcal{O} (N)$ self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, $P\\gg{N}$, where $P$ is the number of cores, and $N$ is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized $N$-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Lastly, employing classic technologies associated with generalized $N$-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H${}_2$O]${}_N$, $N \\in \\{ 30, 90, 150 \\}$, $P/N \\approx \\{ 819, 273, 164 \\}$) and find support for an increasingly strong scalability with increasing system size $N$.
Solvers for $$\\mathcal{O} (N)$$ Electronic Structure in the Strong Scaling Limit
Bock, Nicolas; Challacombe, William M.; Kale, Laxmikant
2016-01-26
Here we present a hybrid OpenMP/Charm\\tt++ framework for solving themore » $$\\mathcal{O} (N)$$ self-consistent-field eigenvalue problem with parallelism in the strong scaling regime, $$P\\gg{N}$$, where $P$ is the number of cores, and $N$ is a measure of system size, i.e., the number of matrix rows/columns, basis functions, atoms, molecules, etc. This result is achieved with a nested approach to spectral projection and the sparse approximate matrix multiply [Bock and Challacombe, SIAM J. Sci. Comput., 35 (2013), pp. C72--C98], and involves a recursive, task-parallel algorithm, often employed by generalized $N$-Body solvers, to occlusion and culling of negligible products in the case of matrices with decay. Lastly, employing classic technologies associated with generalized $N$-Body solvers, including overdecomposition, recursive task parallelism, orderings that preserve locality, and persistence-based load balancing, we obtain scaling beyond hundreds of cores per molecule for small water clusters ([H$${}_2$$O]$${}_N$$, $$N \\in \\{ 30, 90, 150 \\}$$, $$P/N \\approx \\{ 819, 273, 164 \\}$$) and find support for an increasingly strong scalability with increasing system size $N$.« less
Simulation of three-component fluid flows using the multiphase lattice Boltzmann flux solver
NASA Astrophysics Data System (ADS)
Shi, Y.; Tang, G. H.; Wang, Y.
2016-06-01
In this work, we extend the multiphase lattice Boltzmann flux solver, which was proposed in [1] for simulating incompressible flows of binary fluids based on two-component Cahn-Hilliard model, to three-component fluid flows. In the present method, the multiphase lattice Boltzmann flux solver is applied to solve for the flow field and the three-component Cahn-Hilliard model is used to predict the evolution of the interfaces. The proposed method is first validated through the classical problem of simulation of partial spreading of a liquid lens between the other two components. Numerical results of interface shapes and contact angles agree well with theoretical solutions. After that, to further demonstrate the capability of the present method, several numerical examples of three-component fluid flows are presented, including a bubble rising across a fluid-fluid interface, single droplet falling through a fluid-fluid interface, the collision-coalescence of two droplets, and the non-contact collision of two droplets. It is shown that the present method can successfully handle complex interactions among three components.
Approximate Harten-Lax-van Leer Riemann solvers for relativistic magnetohydrodynamics
NASA Astrophysics Data System (ADS)
Mignone, Andrea; Bodo, G.; Ugliano, M.
2012-11-01
We review a particular class of approximate Riemann solvers in the context of the equations of ideal relativistic magnetohydrodynamics. Commonly prefixed as Harten-Lax-van Leer (HLL), this family of solvers approaches the solution of the Riemann problem by providing suitable guesses to the outermots characteristic speeds, without any prior knowledge of the solution. By requiring consistency with the integral form of the conservation law, a simplified set of jump conditions with a reduced number of characteristic waves may be obtained. The degree of approximation crucially depends on the wave pattern used in prepresnting the Riemann fan arising from the initial discontinuity breakup. In the original HLL scheme, the solution is approximated by collapsing the full characteristic structure into a single average state enclosed by two outermost fast mangnetosonic speeds. On the other hand, HLLC and HLLD improves the accuracy of the solution by restoring the tangential and Alfvén modes therefore leading to a representation of the Riemann fan in terms of 3 and 5 waves, respectively.
Jouvet, Guillaume
2015-04-15
In this paper, a multilayer generalisation of the Shallow Shelf Approximation (SSA) is considered. In this recent hybrid ice flow model, the ice thickness is divided into thin layers, which can spread out, contract and slide over each other in such a way that the velocity profile is layer-wise constant. Like the SSA (1-layer model), the multilayer model can be reformulated as a minimisation problem. However, unlike the SSA, the functional to be minimised involves a new penalisation term for the interlayer jumps of the velocity, which represents the vertical shear stresses induced by interlayer sliding. Taking advantage of this reformulation, numerical solvers developed for the SSA can be naturally extended layer-wise or column-wise. Numerical results show that the column-wise extension of a Newton multigrid solver proves to be robust in the sense that its convergence is barely influenced by the number of layers and the type of ice flow. In addition, the multilayer formulation appears to be naturally better conditioned than the one of the first-order approximation to face the anisotropic conditions of the sliding-dominant ice flow of ISMIP-HOM experiments.
NASA Astrophysics Data System (ADS)
Jouvet, Guillaume
2015-04-01
In this paper, a multilayer generalisation of the Shallow Shelf Approximation (SSA) is considered. In this recent hybrid ice flow model, the ice thickness is divided into thin layers, which can spread out, contract and slide over each other in such a way that the velocity profile is layer-wise constant. Like the SSA (1-layer model), the multilayer model can be reformulated as a minimisation problem. However, unlike the SSA, the functional to be minimised involves a new penalisation term for the interlayer jumps of the velocity, which represents the vertical shear stresses induced by interlayer sliding. Taking advantage of this reformulation, numerical solvers developed for the SSA can be naturally extended layer-wise or column-wise. Numerical results show that the column-wise extension of a Newton multigrid solver proves to be robust in the sense that its convergence is barely influenced by the number of layers and the type of ice flow. In addition, the multilayer formulation appears to be naturally better conditioned than the one of the first-order approximation to face the anisotropic conditions of the sliding-dominant ice flow of ISMIP-HOM experiments.
Extending fullwave core ICRF simulation to SOL and antenna regions using FEM solver
NASA Astrophysics Data System (ADS)
Shiraiwa, S.; Wright, J. C.
2016-10-01
A full wave simulation approach to solve a driven RF waves problem including hot core, SOL plasmas and possibly antenna is presented. This approach allows for exploiting advantages of two different way of representing wave field, namely treating spatially dispersive hot conductivity in a spectral solver and handling complicated geometry in SOL/antenna region using an unstructured mesh. Here, we compute a mode set in each region with the RF electric field excitation on the connecting boundary between core and edge regions. A mode corresponding to antenna excitation is also computed. By requiring the continuity of tangential RF electric and magnetic fields, the solution is obtained as unique superposition of these modes. In this work, TORIC core spectral solver is modified to allow for mode excitation, and the edge region of diverted Alcator C-Mod plasma is modeled using COMSOL FEM package. The reconstructed RF field is similar in the core region to TORIC stand-alone simulation. However, it contains higher poloidal modes near the edge and captures a wave bounced and propagating in the poloidal direction near the vacuum-plasma boundary. These features could play an important role when the single power pass absorption is modest. This new capability will enable antenna coupling calculations with a realistic load plasma, including collisional damping in realistic SOL plasma and other loss mechanisms such as RF sheath rectification. USDoE Awards DE-FC02-99ER54512, DE-FC02-01ER54648.
Accelerating the Gauss-Seidel Power Flow Solver on a High Performance Reconfigurable Computer
Byun, Jong-Ho; Ravindran, Arun; Mukherjee, Arindam; Joshi, Bharat; Chassin, David P.
2009-09-01
The computationally intensive power flow problem determines the voltage magnitude and phase angle at each bus in a power system for hundreds of thousands of buses under balanced three-phase steady-state conditions. We report an FPGA acceleration of the Gauss-Seidel based power flow solver employed in the transmission module of the GridLAB-D power distribution simulator and analysis tool. The prototype hardware is implemented on an SGI Altix-RASC system equipped with a Xilinx Virtex II 6000 FPGA. Due to capacity limitations of the FPGA, only the bus voltage calculations of the power network are implemented on hardware while the branch current calculations are implemented in software. For a 200,000 bus system, the bus voltage calculation on the FPGA achieves a 48x speed-up with PQ buses and a 62 times for PV over an equivalent sequential software implementation. The average overall speed up of the FPGA-CPU implementation with 100 iterations of the Gauss-Seidel power solver is 2.6x over a software implementation, with the branch calculations on the CPU accounting for 85% of the total execution time. The FPGA-CPU implementation also shows linear scaling with increase in the size of the input power network.
CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. II. GRAY RADIATION HYDRODYNAMICS
Zhang, W.; Almgren, A.; Bell, J.; Howell, L.; Burrows, A.
2011-10-01
We describe the development of a flux-limited gray radiation solver for the compressible astrophysics code, CASTRO. CASTRO uses an Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. The gray radiation solver is based on a mixed-frame formulation of radiation hydrodynamics. In our approach, the system is split into two parts, one part that couples the radiation and fluid in a hyperbolic subsystem, and another parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem is solved explicitly with a high-order Godunov scheme, whereas the parabolic part is solved implicitly with a first-order backward Euler method.
Scalable Out-of-Core Solvers on Xeon Phi Cluster
D'Azevedo, Ed F; Chan, Ki Shing; Su, Shiquan; Wong, Kwai
2015-01-01
This paper documents the implementation of a distributive out-of-core (OOC) solver for performing LU and Cholesky factorizations of a large dense matrix on clusters of many-core programmable co-processors. The out-of- core algorithm combines both the left-looking and right-looking schemes aimed to minimize the movement of data between the CPU host and the co-processor, optimizing data locality as well as computing throughput. The OOC solver is built to align with the format of the ScaLAPACK software library, making it readily portable to any existing codes using ScaLAPACK. A runtime analysis conducted on Beacon (an Intel Xeon plus Intel Xeon Phi cluster which composed of 48 nodes of multi-core CPU and MIC) at the Na- tional Institute for Computational Sciences is presented. Comparison of the performance on the Intel Xeon Phi and GPU clusters are also provided.
A 3-D upwind Euler solver for unstructured meshes
NASA Technical Reports Server (NTRS)
Barth, Timothy J.
1991-01-01
A three-dimensional finite-volume upwind Euler solver is developed for unstructured meshes. The finite-volume scheme solves for solution variables at vertices of the mesh and satisfies the integral conservation law on nonoverlapping polyhedral control volumes surrounding vertices of the mesh. The schene achieves improved solution accuracy by assuming a piecewise linear variation of the solution in each control volume. This improved spatial accuracy hinges heavily upon the calculation of the solution gradient in each control volume given pointwise values of the solution at vertices of the mesh. Several algorithms are discussed for obtaining these gradients. Details concerning implementation procedures and data structures are discussed. Sample calculations for inviscid Euler flow about isolated aircraft wings at subsonic and transonic speeds are compared with established Euler solvers as well as experiment.
Verification and Validation Studies for the LAVA CFD Solver
NASA Technical Reports Server (NTRS)
Moini-Yekta, Shayan; Barad, Michael F; Sozer, Emre; Brehm, Christoph; Housman, Jeffrey A.; Kiris, Cetin C.
2013-01-01
The verification and validation of the Launch Ascent and Vehicle Aerodynamics (LAVA) computational fluid dynamics (CFD) solver is presented. A modern strategy for verification and validation is described incorporating verification tests, validation benchmarks, continuous integration and version control methods for automated testing in a collaborative development environment. The purpose of the approach is to integrate the verification and validation process into the development of the solver and improve productivity. This paper uses the Method of Manufactured Solutions (MMS) for the verification of 2D Euler equations, 3D Navier-Stokes equations as well as turbulence models. A method for systematic refinement of unstructured grids is also presented. Verification using inviscid vortex propagation and flow over a flat plate is highlighted. Simulation results using laminar and turbulent flow past a NACA 0012 airfoil and ONERA M6 wing are validated against experimental and numerical data.
A Nonlinear Modal Aeroelastic Solver for FUN3D
NASA Technical Reports Server (NTRS)
Goldman, Benjamin D.; Bartels, Robert E.; Biedron, Robert T.; Scott, Robert C.
2016-01-01
A nonlinear structural solver has been implemented internally within the NASA FUN3D computational fluid dynamics code, allowing for some new aeroelastic capabilities. Using a modal representation of the structure, a set of differential or differential-algebraic equations are derived for general thin structures with geometric nonlinearities. ODEPACK and LAPACK routines are linked with FUN3D, and the nonlinear equations are solved at each CFD time step. The existing predictor-corrector method is retained, whereby the structural solution is updated after mesh deformation. The nonlinear solver is validated using a test case for a flexible aeroshell at transonic, supersonic, and hypersonic flow conditions. Agreement with linear theory is seen for the static aeroelastic solutions at relatively low dynamic pressures, but structural nonlinearities limit deformation amplitudes at high dynamic pressures. No flutter was found at any of the tested trajectory points, though LCO may be possible in the transonic regime.
An Upwind Solver for the National Combustion Code
NASA Technical Reports Server (NTRS)
Sockol, Peter M.
2011-01-01
An upwind solver is presented for the unstructured grid National Combustion Code (NCC). The compressible Navier-Stokes equations with time-derivative preconditioning and preconditioned flux-difference splitting of the inviscid terms are used. First order derivatives are computed on cell faces and used to evaluate the shear stresses and heat fluxes. A new flux limiter uses these same first order derivatives in the evaluation of left and right states used in the flux-difference splitting. The k-epsilon turbulence equations are solved with the same second-order method. The new solver has been installed in a recent version of NCC and the resulting code has been tested successfully in 2D on two laminar cases with known solutions and one turbulent case with experimental data.
The backup is active in Alzheimer's disease: a hypothesis from problem theory.
Burnand, Gordon
2015-03-01
Problem theory distinguishes between six general problems of everyday life, which people work through in turn during childhood, learning to switch between them. One of them requires the protection of a cut-out and an override. People who develop Alzheimer's disease (AD), and apolipoprotein allele epsilon 4 carriers, are preoccupied with this problem, or readily switch back to it. It is the freedom problem, of raising hope or confidence of freedom or power to control. Here people try to raise hope of success with any task on which attention happens to rest. This indiscriminateness means that there is no basis for giving up on a task, or for avoiding dangerous environments. Thus the cut-out is needed when someone becomes stuck on a mental task and the override is needed so as to help in avoiding danger. Activity relevant to the freedom problem is confined to the left hemisphere and the right hemisphere operates the cut-out and override. In providing these two forms of protection the right hemisphere can be said to act as a backup. Accordingly EEG, metabolism, and atrophy findings indicate that both cut-out and override are active in mild clinical impairment, especially among patients who later develop AD. The pattern of atrophy of AD matches what would be expected from disuse caused by an overactive cut-out followed by an overactive override. A parallel loss of testosterone might contribute to the weakening of resistance to infections leading to autoimmune effects.
Quadratic partial eigenvalue assignment problem with time delay for active vibration control
NASA Astrophysics Data System (ADS)
Pratt, J. M.; Singh, K. V.; Datta, B. N.
2009-08-01
Partial pole assignment in active vibration control refers to reassigning a small set of unwanted eigenvalues of the quadratic eigenvalue problem (QEP) associated with the second order system of a vibrating structure, by using feedback control force, to suitably chosen location without altering the remaining large number of eigenvalues and eigenvectors. There are several challenges of solving this quadratic partial eigenvalue assignment problem (QPEVAP) in a computational setting which the traditional pole-placement problems for first-order control systems do not have to deal with. In order to these challenges, there has been some work in recent years to solve QPEVAP in a computationally viable way. However, these works do not take into account of the practical phenomenon of the time-delay effect in the system. In this paper, a new "direct and partial modal" approach of the quadratic partial eigenvalue assignment problem with time-delay is proposed. The approach works directly in the quadratic system without requiring transformation to a standard state-space system and requires the knowledge of only a small number of eigenvalues and eigenvectors that can be computed or measured in practice. Two illustrative examples are presented in the context of active vibration control with constant time-delay to illustrate the success of our proposed approach. Future work includes generalization of this approach to a more practical complex time-delay system and extension of this work to the multi-input problem.
Adolescent anabolic steroid use, gender, physical activity, and other problem behaviors*.
Miller, Kathleen E; Hoffman, Joseph H; Barnes, Grace M; Sabo, Don; Melnick, Merrill J; Farrell, Michael P
2005-01-01
To test the comparative value of strain theory and problem behavior theory as explanations of adolescent anabolic steroid use, this study examined gender-specific relationships among steroid use, physical activity, and other problem behaviors. Based on the United States Centers for Disease Control and Prevention's 1997 Youth Risk Behavior Survey, a nationally representative sample of over 16,000 U.S. public and private high school students, binge drinking, cocaine use, fighting, and sexual risk-taking were associated with higher odds of lifetime steroid use. In gender-specific analyses, steroid use was strongly associated with female fighting and smokeless tobacco use as well as male sexual risk. Neither athletic participation nor strength conditioning predicted odds of steroid use after controlling for problem behaviors, nor did steroid-using athletes report more frequent use than steroid-using nonathletes. The study's limitations and policy implications were noted. These data suggest that other problem behaviors such as substance use, fighting, and sexual risk are better predictors of adolescent steroid use than physical activity. Interventions to prevent steroid use should not be limited to male participants in organized sports programs, but should also target adolescents identified as at risk for other problem behaviors.
Performance of Basic Geodynamic Solvers on BG/p and on Modern Mid-sized CPU Clusters
NASA Astrophysics Data System (ADS)
Omlin, S.; Keller, V.; Podladchikov, Y.
2012-04-01
Nowadays, most researchers have access to computer clusters. For the community developing numerical applications in geodynamics, this constitutes a very important potential: besides that current applications can be speeded up, much bigger problems can be solved. This is particularly relevant in 3D applications. However, current practical experiments in geodynamic high-performance applications normally end with the successful demonstration of the potential by exploring the performance of the simplest example (typically the Poisson solver); more advanced practical examples are rare. For this reason, we optimize algorithms for 3D scalar problems and 3D mechanics and design concise, educational Fortran 90 templates that allow other researchers to easily plug in their own geodynamic computations: in these templates, the geodynamic computations are entirely separated from the technical programming needed for the parallelized running on a computer cluster; additionally, we develop our code with minimal syntactical differences from the MATLAB language, such that prototypes of the desired geodynamic computations can be programmed in MATLAB and then copied into the template with only minimal syntactical changes. High-performance programming requires to a big extent taking into account the specificities of the available hardware. The hardware of the world's largest CPU clusters is very different from the one of a modern mid-sized CPU cluster. In this context, we investigate the performance of basic memory-bounded geodynamic solvers on the large-sized BlueGene/P cluster, having 13 Gb/s peak memory bandwidth, and compare it with the performance of a typical modern mid-sized CPU cluster, having 100 Gb/s peak memory bandwidth. A memory-bounded solver's performance depends only on the amount of data required for its computations and on the speed this data can be read from memory (or from the CPUs' cache). In consequence, we speed up the solvers by optimizing memory access and CPU
Boltzmann Solver with Adaptive Mesh in Velocity Space
Kolobov, Vladimir I.; Arslanbekov, Robert R.; Frolova, Anna A.
2011-05-20
We describe the implementation of direct Boltzmann solver with Adaptive Mesh in Velocity Space (AMVS) using quad/octree data structure. The benefits of the AMVS technique are demonstrated for the charged particle transport in weakly ionized plasmas where the collision integral is linear. We also describe the implementation of AMVS for the nonlinear Boltzmann collision integral. Test computations demonstrate both advantages and deficiencies of the current method for calculations of narrow-kernel distributions.
A contribution to the great Riemann solver debate
NASA Technical Reports Server (NTRS)
Quirk, James J.
1992-01-01
The aims of this paper are threefold: to increase the level of awareness within the shock capturing community to the fact that many Godunov-type methods contain subtle flaws that can cause spurious solutions to be computed; to identify one mechanism that might thwart attempts to produce very high resolution simulations; and to proffer a simple strategy for overcoming the specific failings of individual Riemann solvers.
Scaling Algebraic Multigrid Solvers: On the Road to Exascale
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.
A Survey of Solver-Related Geometry and Meshing Issues
NASA Technical Reports Server (NTRS)
Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris
2016-01-01
There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.
QED multi-dimensional vacuum polarization finite-difference solver
NASA Astrophysics Data System (ADS)
Carneiro, Pedro; Grismayer, Thomas; Silva, Luís; Fonseca, Ricardo
2015-11-01
The Extreme Light Infrastructure (ELI) is expected to deliver peak intensities of 1023 - 1024 W/cm2 allowing to probe nonlinear Quantum Electrodynamics (QED) phenomena in an unprecedented regime. Within the framework of QED, the second order process of photon-photon scattering leads to a set of extended Maxwell's equations [W. Heisenberg and H. Euler, Z. Physik 98, 714] effectively creating nonlinear polarization and magnetization terms that account for the nonlinear response of the vacuum. To model this in a self-consistent way, we present a multi dimensional generalized Maxwell equation finite difference solver with significantly enhanced dispersive properties, which was implemented in the OSIRIS particle-in-cell code [R.A. Fonseca et al. LNCS 2331, pp. 342-351, 2002]. We present a detailed numerical analysis of this electromagnetic solver. As an illustration of the properties of the solver, we explore several examples in extreme conditions. We confirm the theoretical prediction of vacuum birefringence of a pulse propagating in the presence of an intense static background field [arXiv:1301.4918 [quant-ph
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.
Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion
NASA Technical Reports Server (NTRS)
Leffell, Joshua Isaac; Murman, Scott M.; Pulliam, Thomas H.
2012-01-01
Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have
Adaptive multi-resolution 3D Hartree-Fock-Bogoliubov solver for nuclear structure
NASA Astrophysics Data System (ADS)
Pei, J. C.; Fann, G. I.; Harrison, R. J.; Nazarewicz, W.; Shi, Yue; Thornton, S.
2014-08-01
Background: Complex many-body systems, such as triaxial and reflection-asymmetric nuclei, weakly bound halo states, cluster configurations, nuclear fragments produced in heavy-ion fusion reactions, cold Fermi gases, and pasta phases in neutron star crust, are all characterized by large sizes and complex topologies in which many geometrical symmetries characteristic of ground-state configurations are broken. A tool of choice to study such complex forms of matter is an adaptive multi-resolution wavelet analysis. This method has generated much excitement since it provides a common framework linking many diversified methodologies across different fields, including signal processing, data compression, harmonic analysis and operator theory, fractals, and quantum field theory. Purpose: To describe complex superfluid many-fermion systems, we introduce an adaptive pseudospectral method for solving self-consistent equations of nuclear density functional theory in three dimensions, without symmetry restrictions. Methods: The numerical method is based on the multi-resolution and computational harmonic analysis techniques with a multi-wavelet basis. The application of state-of-the-art parallel programming techniques include sophisticated object-oriented templates which parse the high-level code into distributed parallel tasks with a multi-thread task queue scheduler for each multi-core node. The internode communications are asynchronous. The algorithm is variational and is capable of solving coupled complex-geometric systems of equations adaptively, with functional and boundary constraints, in a finite spatial domain of very large size, limited by existing parallel computer memory. For smooth functions, user-defined finite precision is guaranteed. Results: The new adaptive multi-resolution Hartree-Fock-Bogoliubov (HFB) solver madness-hfb is benchmarked against a two-dimensional coordinate-space solver hfb-ax that is based on the B-spline technique and a three-dimensional solver
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.
A Hybrid, Parallel Krylov Solver for MODFLOW using Schwarz Domain Decomposition
NASA Astrophysics Data System (ADS)
Sutanudjaja, E.; Verkaik, J.; Hughes, J. D.
2015-12-01
In order to support decision makers in solving hydrological problems, detailed high-resolution models are often needed. These models typically consist of a large number of computational cells and have large memory requirements and long run times. An efficient technique for obtaining realistic run times and memory requirements is parallel computing, where the problem is divided over multiple processor cores. The new Parallel Krylov Solver (PKS) for MODFLOW-USG is presented. It combines both distributed memory parallelization by the Message Passing Interface (MPI) and shared memory parallelization by Open Multi-Processing (OpenMP). PKS includes conjugate gradient and biconjugate gradient stabilized linear accelerators that are both preconditioned by an overlapping additive Schwarz preconditioner in a way that: a) subdomains are partitioned using the METIS library; b) each subdomain uses local memory only and communicates with other subdomains by MPI within the linear accelerator; c) is fully integrated in the MODFLOW-USG code. PKS is based on the unstructured PCGU-solver, and supports OpenMP. Depending on the available hardware, PKS can run exclusively with MPI, exclusively with OpenMP, or with a hybrid MPI/OpenMP approach. Benchmarks were performed on the Cartesius Dutch supercomputer (https://userinfo.surfsara.nl/systems/cartesius) using up to 144 cores, for a synthetic test (~112 million cells) and the Indonesia groundwater model (~4 million 1km cells). The latter, which includes all islands in the Indonesian archipelago, was built using publically available global datasets, and is an ideal test bed for evaluating the applicability of PKS parallelization techniques to a global groundwater model consisting of multiple continents and islands. Results show that run time reductions can be greatest with the hybrid parallelization approach for the problems tested.
Fisher, A. C.; Bailey, D. S.; Kaiser, T. B.; Eder, D. C.; Gunney, B. T. N.; Masters, N. D.; Koniges, A. E.; Anderson, R. W.
2015-02-01
Here, we present a novel method for the solution of the diffusion equation on a composite AMR mesh. This approach is suitable for including diffusion based physics modules to hydrocodes that support ALE and AMR capabilities. To illustrate, we proffer our implementations of diffusion based radiation transport and heat conduction in a hydrocode called ALE-AMR. Numerical experiments conducted with the diffusion solver and associated physics packages yield 2nd order convergence in the L_{2} norm.
Least-Squares Spectral Element Solutions to the CAA Workshop Benchmark Problems
NASA Technical Reports Server (NTRS)
Lin, Wen H.; Chan, Daniel C.
1997-01-01
This paper presents computed results for some of the CAA benchmark problems via the acoustic solver developed at Rocketdyne CFD Technology Center under the corporate agreement between Boeing North American, Inc. and NASA for the Aerospace Industry Technology Program. The calculations are considered as benchmark testing of the functionality, accuracy, and performance of the solver. Results of these computations demonstrate that the solver is capable of solving the propagation of aeroacoustic signals. Testing of sound generation and on more realistic problems is now pursued for the industrial applications of this solver. Numerical calculations were performed for the second problem of Category 1 of the current workshop problems for an acoustic pulse scattered from a rigid circular cylinder, and for two of the first CAA workshop problems, i. e., the first problem of Category 1 for the propagation of a linear wave and the first problem of Category 4 for an acoustic pulse reflected from a rigid wall in a uniform flow of Mach 0.5. The aim for including the last two problems in this workshop is to test the effectiveness of some boundary conditions set up in the solver. Numerical results of the last two benchmark problems have been compared with their corresponding exact solutions and the comparisons are excellent. This demonstrates the high fidelity of the solver in handling wave propagation problems. This feature lends the method quite attractive in developing a computational acoustic solver for calculating the aero/hydrodynamic noise in a violent flow environment.
Cooper, Christopher D; Bardhan, Jaydeep P; Barba, L A
2014-03-01
The continuum theory applied to biomolecular electrostatics leads to an implicit-solvent model governed by the Poisson-Boltzmann equation. Solvers relying on a boundary integral representation typically do not consider features like solvent-filled cavities or ion-exclusion (Stern) layers, due to the added difficulty of treating multiple boundary surfaces. This has hindered meaningful comparisons with volume-based methods, and the effects on accuracy of including these features has remained unknown. This work presents a solver called PyGBe that uses a boundary-element formulation and can handle multiple interacting surfaces. It was used to study the effects of solvent-filled cavities and Stern layers on the accuracy of calculating solvation energy and binding energy of proteins, using the well-known apbs finite-difference code for comparison. The results suggest that if required accuracy for an application allows errors larger than about 2% in solvation energy, then the simpler, single-surface model can be used. When calculating binding energies, the need for a multi-surface model is problem-dependent, becoming more critical when ligand and receptor are of comparable size. Comparing with the apbs solver, the boundary-element solver is faster when the accuracy requirements are higher. The cross-over point for the PyGBe code is in the order of 1-2% error, when running on one gpu card (nvidia Tesla C2075), compared with apbs running on six Intel Xeon cpu cores. PyGBe achieves algorithmic acceleration of the boundary element method using a treecode, and hardware acceleration using gpus via PyCuda from a user-visible code that is all Python. The code is open-source under MIT license.
Selected topics on the active control of helicopter aeromechanical and vibration problems
NASA Technical Reports Server (NTRS)
Friedmann, Peretz P.
1994-01-01
This paper describes in a concise manner three selected topics on the active control of helicopter aeromechanical and vibration problems. The three topics are as follows: (1) the active control of helicopter air-resonance using an LQG/LTR approach; (2) simulation of higher harmonic control (HHC) applied to a four bladed hingeless helicopter rotor in forward flight; and (3) vibration suppression in forward flight on a hingeless helicopter rotor using an actively controlled, partial span, trailing edge flap, which is mounted on the blade. Only a few selected illustrative results are presented. The results obtained clearly indicate that the partial span, actively controlled flap has considerable potential for vibration reduction in helicopter rotors.
Recent Enhancements To The FUN3D Flow Solver For Moving-Mesh Applications
NASA Technical Reports Server (NTRS)
Biedron, Robert T,; Thomas, James L.
2009-01-01
An unsteady Reynolds-averaged Navier-Stokes solver for unstructured grids has been extended to handle general mesh movement involving rigid, deforming, and overset meshes. Mesh deformation is achieved through analogy to elastic media by solving the linear elasticity equations. A general method for specifying the motion of moving bodies within the mesh has been implemented that allows for inherited motion through parent-child relationships, enabling simulations involving multiple moving bodies. Several example calculations are shown to illustrate the range of potential applications. For problems in which an isolated body is rotating with a fixed rate, a noninertial reference-frame formulation is available. An example calculation for a tilt-wing rotor is used to demonstrate that the time-dependent moving grid and noninertial formulations produce the same results in the limit of zero time-step size.
Sequentially Optimized Meshfree Approximation as a New Computational Fluid Dynamics Solver
NASA Astrophysics Data System (ADS)
Wilkinson, Matthew
This thesis presents the Sequentially Optimized Meshfree Approximation (SOMA) method, a new and powerful Computational Fluid Dynamics (CFD) solver. While standard computational methods can be faster and cheaper that physical experimentation, both in cost and work time, these methods do have some time and user interaction overhead which SOMA eliminates. As a meshfree method which could use adaptive domain refinement methods, SOMA avoids the need for user generated and/or analyzed grids, volumes, and meshes. Incremental building of a feed-forward artificial neural network through machine learning to solve the flow problem significantly reduces user interaction and reduces computational cost. This is done by avoiding the creation and inversion of possibly dense block diagonal matrices and by focusing computational work on regions where the flow changes and ignoring regions where no changes occur.
NASA Technical Reports Server (NTRS)
Lake, George; Quinn, Thomas; Richardson, Derek C.; Stadel, Joachim
1999-01-01
"The orbit of any one planet depends on the combined motion of all the planets, not to mention the actions of all these on each other. To consider simultaneously all these causes of motion and to define these motions by exact laws allowing of convenient calculation exceeds, unless I am mistaken, the forces of the entire human intellect" -Isaac Newton 1687. Epochal surveys are throwing down the gauntlet for cosmological simulation. We describe three keys to meeting the challenge of N-body simulation: adaptive potential solvers, adaptive integrators and volume renormalization. With these techniques and a dedicated Teraflop facility, simulation can stay even with observation of the Universe. We also describe some problems in the formation and stability of planetary systems. Here, the challenge is to perform accurate integrations that retain Hamiltonian properties for 10(exp 13) timesteps.
A parallel implementation of an EBE solver for the finite element method
Silva, R.P.; Las Casas, E.B.; Carvalho, M.L.B.
1994-12-31
A parallel implementation using PVM on a cluster of workstations of an Element By Element (EBE) solver using the Preconditioned Conjugate Gradient (PCG) method is described, along with an application in the solution of the linear systems generated from finite element analysis of a problem in three dimensional linear elasticity. The PVM (Parallel Virtual Machine) system, developed at the Oak Ridge Laboratory, allows the construction of a parallel MIMD machine by connecting heterogeneous computers linked through a network. In this implementation, version 3.1 of PVM is used, and 11 SLC Sun workstations and a Sun SPARC-2 model are connected through Ethernet. The finite element program is based on SDP, System for Finite Element Based Software Development, developed at the Brazilian National Laboratory for Scientific Computation (LNCC). SDP provides the basic routines for a finite element application program, as well as a standard for programming and documentation, intended to allow exchanges between research groups in different centers.
NASA Astrophysics Data System (ADS)
Vencels, Juris; Delzanno, Gian Luca; Manzini, Gianmarco; Markidis, Stefano; Peng, Ivy Bo; Roytershteyn, Vadim
2016-05-01
We present the design and implementation of a spectral code, called SpectralPlasmaSolver (SPS), for the solution of the multi-dimensional Vlasov-Maxwell equations. The method is based on a Hermite-Fourier decomposition of the particle distribution function. The code is written in Fortran and uses the PETSc library for solving the non-linear equations and preconditioning and the FFTW library for the convolutions. SPS is parallelized for shared- memory machines using OpenMP. As a verification example, we discuss simulations of the two-dimensional Orszag-Tang vortex problem and successfully compare them against a fully kinetic Particle-In-Cell simulation. An assessment of the performance of the code is presented, showing a significant improvement in the code running-time achieved by preconditioning, while strong scaling tests show a factor of 10 speed-up using 16 threads.
ERIC Educational Resources Information Center
Karatas, Ilhan; Baki, Adnan
2013-01-01
Problem solving is recognized as an important life skill involving a range of processes including analyzing, interpreting, reasoning, predicting, evaluating and reflecting. For that reason educating students as efficient problem solvers is an important role of mathematics education. Problem solving skill is the centre of mathematics curriculum.…
Cheng, Leo K; Bodley, John M; Pullan, Andrew J
2003-01-01
Two predominant source formulations for the inverse problem of electrocardiology currently exist. They involve the reconstruction of epicardial potentials or myocardial activation times from noninvasively recorded torso surface potentials. Each of these formulations have their advantages, however, they have not been systematically compared against each other. We present results from a simulation study which compared a number of epicardial potential (Tikhonov, Truncated singular value decomposition (TSVD), Greensite-Tikhonov and Greensite-TSVD), and a myocardial activation time formulation for the inverse problem of electrocardiology. A number of different methods were also used to determine the appropriate level of regularization (optimal, L-curve, zero-crossing, and composite residual and smoothing operator) to apply to each formulation. The simulation study was conducted using an anatomically based boundary element porcine model with a variety of cardiac sources. Varying levels of geometric error were introduced to the system and solutions were computed using each of the inverse algorithms. Results show that under pure Gaussian noise potential-based methods performed best at low noise levels while the activation-based method was less effected by higher noise levels. In the presence of correlated geometric error, the activation-based method out performed the potential methods, with the Greensite-Tikhonov method being the most favored potential-based method when using the L-curve or zero-crossing method to determine the regularization parameter.
ERIC Educational Resources Information Center
van Til, Cita T.; And Others
Problem-based learning (PBL) as a new instructional method is becoming increasingly popular. PBL is hypothesized to have a number of advantages for learning because it applies insights from cognitive learning theory and it fosters a lifelong learning strategy. As in all learning programs there are individual differences between students. This…
ERIC Educational Resources Information Center
Zuckerman, June T.
Expert/novice studies of conceptually rich problem solving have demonstrated a relationship between the correctness of a solution and the extent and organization of the solver's conceptual knowledge. This study examines meaningful problem solving and the relationship between the correctness of a solution and the extent of the solver's scientific…
A New Robust Solver for Saturated-Unsaturated Richards' Equation
NASA Astrophysics Data System (ADS)
Barajas-Solano, D. A.; Tartakovsky, D. M.
2012-12-01
We present a novel approach for the numerical integration of the saturated-unsaturated Richards' equation, a degenerate parabolic partial differential equation that models flow in porous media. The method is based on the mixed (pore pressure-water content) form of RE, written as a set of differential algebraic equations (DAEs) of index-1 for the fully saturated case and index-2 for the partially saturated case. A DAE-based approach allows us to overcome the numerical challenges posed by the degenerate nature of the Richards' equation. The resulting set of DAEs is solved using the stiffly-accurate, single-step, 3-stage implicit Runge-Kutta method Radau IIA, chosen for its favorable accuracy and stability properties, and its ease of implementation. For each time step a nonlinear system of equations on the intermediate Runge-Kutta states of the pore pressure is solved, written so to ensure that the next step pore pressure and water content correspond to one another correctly. The implementation of our approach compares favorably to state-of-the-art DAE-based solvers in both one- and two-dimensional simulations. These solvers use multi-step backward difference formulas together with a pressure-based form of Richards' equation. To the best of our knowledge, our method is the first instance of a successful DAE-based solver that uses the mixed form of Richards' equation. We consider this a promising line of research, with future work to be done on the use of globally convergent methods for the solution of the occurring nonlinear systems of equations.
A Robust Compressible Flow Solver for Studies on Solar Fuel Production in Microwave Plasma
NASA Astrophysics Data System (ADS)
Tadayon Mousavi, Samaneh; Koelman, Peter; Groen, Pieter Willem; van Dijk, Jan; Epg/ Applied Physics/ Eindhoven University Of Technology Team; Dutch InstituteFundamental Energy Research (Differ) Team
2016-09-01
n order to simulate the dissociation of CO2 with H2O admixture by microwave plasma for the production of solar fuels, we need a multicomponent solver that is able to capture the complex nature of the plasma by combining the chemistry, flow, and electromagnetic field. To achieve this goal, first we developed a robust finite volume compressible flow solver in C++. The solver is implemented in the framework of the PLASIMO software and will be used in complete plasma simulations later on. Due to the compressible nature of the solver, it can be used for simulation of dissociation of CO2 with H2O admixture by supersonic expansion in microwave plasmas. A spatially second order version of this solver is able to reveal the vortex flow structure of the plasmas. Capabilities of this solver are presented by benchmarking against well-established analytical and numerical test cases.
Some fast elliptic solvers on parallel architectures and their complexities
NASA Technical Reports Server (NTRS)
Gallopoulos, E.; Saad, Youcef
1989-01-01
The discretization of separable elliptic partial differential equations leads to linear systems with special block triangular matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconsistant coefficients. A method was recently proposed to parallelize and vectorize BCR. Here, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches, including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational complexity lower than that of parallel BCR.
Some fast elliptic solvers on parallel architectures and their complexities
NASA Technical Reports Server (NTRS)
Gallopoulos, E.; Saad, Y.
1989-01-01
The discretization of separable elliptic partial differential equations leads to linear systems with special block tridiagonal matrices. Several methods are known to solve these systems, the most general of which is the Block Cyclic Reduction (BCR) algorithm which handles equations with nonconstant coefficients. A method was recently proposed to parallelize and vectorize BCR. In this paper, the mapping of BCR on distributed memory architectures is discussed, and its complexity is compared with that of other approaches including the Alternating-Direction method. A fast parallel solver is also described, based on an explicit formula for the solution, which has parallel computational compelxity lower than that of parallel BCR.
High Energy Boundary Conditions for a Cartesian Mesh Euler Solver
NASA Technical Reports Server (NTRS)
Pandya, Shishir A.; Murman, Scott M.; Aftosmis, Michael J.
2004-01-01
Inlets and exhaust nozzles are often omitted or fared over in aerodynamic simulations of aircraft due to the complexities involving in the modeling of engine details such as complex geometry and flow physics. However, the assumption is often improper as inlet or plume flows have a substantial effect on vehicle aerodynamics. A tool for specifying inlet and exhaust plume conditions through the use of high-energy boundary conditions in an established inviscid flow solver is presented. The effects of the plume on the flow fields near the inlet and plume are discussed.
Preconditioned CG-solvers and finite element grids
Bauer, R.; Selberherr, S.
1994-12-31
To extract parasitic capacitances in wiring structures of integrated circuits the authors developed the two- and three-dimensional finite element program SCAP (Smart Capacitance Analysis Program). The program computes the task of the electrostatic field from a solution of Poisson`s equation via finite elements and calculates the energies from which the capacitance matrix is extracted. The unknown potential vector, which has for three-dimensional applications 5000-50000 unknowns, is computed by a ICCG solver. Currently three- and six-node triangular, four- and ten-node tetrahedronal elements are supported.
Hierarchically Parallelized Constrained Nonlinear Solvers with Automated Substructuring
NASA Technical Reports Server (NTRS)
Padovan, Joe; Kwang, Abel
1994-01-01
This paper develops a parallelizable multilevel multiple constrained nonlinear equation solver. The substructuring process is automated to yield appropriately balanced partitioning of each succeeding level. Due to the generality of the procedure,_sequential, as well as partially and fully parallel environments can be handled. This includes both single and multiprocessor assignment per individual partition. Several benchmark examples are presented. These illustrate the robustness of the procedure as well as its capability to yield significant reductions in memory utilization and calculational effort due both to updating and inversion.
Reformulation of the Fourier-Bessel steady state mode solver
NASA Astrophysics Data System (ADS)
Gauthier, Robert C.
2016-09-01
The Fourier-Bessel resonator state mode solver is reformulated using Maxwell's field coupled curl equations. The matrix generating expressions are greatly simplified as well as a reduction in the number of pre-computed tables making the technique simpler to implement on a desktop computer. The reformulation maintains the theoretical equivalence of the permittivity and permeability and as such structures containing both electric and magnetic properties can be examined. Computation examples are presented for a surface nanoscale axial photonic resonator and hybrid { ε , μ } quasi-crystal resonator.
Computer Problem-Solving Coaches
NASA Astrophysics Data System (ADS)
Hsu, Leon; Heller, Kenneth
2005-09-01
Computers might be able to play an important role in physics instruction by coaching students to develop good problem-solving skills. Building on previous research on student problem solving and on designing computer programs to teach cognitive skills, we are developing a prototype computer coach to provide students with guided practice in solving problems. In addition to helping students become better problem solvers, such programs can be useful in studying how students learn to solve problems and how and if problem-solving skills can be transferred from a computer to a pencil-and-paper environment.
Li, Jun-qing; Pan, Quan-ke; Mao, Kun
2014-01-01
A hybrid algorithm which combines particle swarm optimization (PSO) and iterated local search (ILS) is proposed for solving the hybrid flowshop scheduling (HFS) problem with preventive maintenance (PM) activities. In the proposed algorithm, different crossover operators and mutation operators are investigated. In addition, an efficient multiple insert mutation operator is developed for enhancing the searching ability of the algorithm. Furthermore, an ILS-based local search procedure is embedded in the algorithm to improve the exploitation ability of the proposed algorithm. The detailed experimental parameter for the canonical PSO is tuning. The proposed algorithm is tested on the variation of 77 Carlier and Néron's benchmark problems. Detailed comparisons with the present efficient algorithms, including hGA, ILS, PSO, and IG, verify the efficiency and effectiveness of the proposed algorithm. PMID:24883414
Uniformity and nonuniformity of neural activities correlated to different insight problem solving.
Zhao, Q; Li, Y; Shang, X; Zhou, Z; Han, L
2014-06-13
Previous studies on the neural basis of insight reflected weak consistency except for the anterior cingulate cortex. The present work adopted the semantic and homophonic punny riddle to explore the uniformity and nonuniformity of neural activities correlated to different insight problem solving. Results showed that in the early period of insight solving, the semantic and homophonic punny riddles induced a common N350-500 over the central scalp. However, during -400 to 0 ms before the riddles were solved, the semantic punny riddles induced a positive event-related potential (ERP) deflection over the temporal cortex for retrieving the extensive semantic information, while the homophonic punny riddles induced a positive ERP deflection over the temporal cortex and a negative one in the left frontal cortex which might reflect the semantic and phonological information processing respectively. Our study indicated that different insight problem solving should have the same cognitive process of detecting cognitive conflicts, but have different ways to solve the conflicts.
Pelanti, Marica; Bouchut, Francois; Mangeney, Anne
2011-02-01
We present a Riemann solver derived by a relaxation technique for classical single-phase shallow flow equations and for a two-phase shallow flow model describing a mixture of solid granular material and fluid. Our primary interest is the numerical approximation of this two-phase solid/fluid model, whose complexity poses numerical difficulties that cannot be efficiently addressed by existing solvers. In particular, we are concerned with ensuring a robust treatment of dry bed states. The relaxation system used by the proposed solver is formulated by introducing auxiliary variables that replace the momenta in the spatial gradients of the original model systems. The resulting relaxation solver is related to Roe solver in that its Riemann solution for the flow height and relaxation variables is formally computed as Roe's Riemann solution. The relaxation solver has the advantage of a certain degree of freedom in the specification of the wave structure through the choice of the relaxation parameters. This flexibility can be exploited to handle robustly vacuum states, which is a well known difficulty of standard Roe's method, while maintaining Roe's low diffusivity. For the single-phase model positivity of flow height is rigorously preserved. For the two-phase model positivity of volume fractions in general is not ensured, and a suitable restriction on the CFL number might be needed. Nonetheless, numerical experiments suggest that the proposed two-phase flow solver efficiently models wet/dry fronts and vacuum formation for a large range of flow conditions. As a corollary of our study, we show that for single-phase shallow flow equations the relaxation solver is formally equivalent to the VFRoe solver with conservative variables of Gallouet and Masella [T. Gallouet, J.-M. Masella, Un schema de Godunov approche C.R. Acad. Sci. Paris, Serie I, 323 (1996) 77-84]. The relaxation interpretation allows establishing positivity conditions for this VFRoe method.
Using Bibliotherapy To Teach Problem Solving.
ERIC Educational Resources Information Center
Forgan, James W.
2002-01-01
This article discusses how students with high-incidence disabilities can benefit from using bibliotherapy by learning to become proactive problem solvers. A sample lesson plan is presented based on a teaching framework for bibliotherapy and problem solving that contains the elements of prereading, guided reading, post-reading discussion, and a…
Problem Solving and Comprehension. Third Edition.
ERIC Educational Resources Information Center
Whimbey, Arthur; Lochhead, Jack
This book is directed toward increasing students' ability to analyze problems and comprehend what they read and hear. It outlines and illustrates the methods that good problem solvers use in attacking complex ideas, and provides practice in applying these methods to a variety of questions involving comprehension and reasoning. Chapter I includes a…
Scientific Problem Solving by Expert Systems.
ERIC Educational Resources Information Center
Good, Ron
1984-01-01
Human expert problem-solving in science is defined and used to account for scientific discovery. These ideas are used to describe BACON.5, a machine expert problem solver that discovers scientific laws using data-driver heuristics and "expectations" such as symmetry. Implications of BACON.5 type research for traditional science education…
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.
NASA Astrophysics Data System (ADS)
Wolf, Eric M.; Causley, Matthew; Christlieb, Andrew; Bettencourt, Matthew
2016-12-01
We propose a new particle-in-cell (PIC) method for the simulation of plasmas based on a recently developed, unconditionally stable solver for the wave equation. This method is not subject to a CFL restriction, limiting the ratio of the time step size to the spatial step size, typical of explicit methods, while maintaining computational cost and code complexity comparable to such explicit schemes. We describe the implementation in one and two dimensions for both electrostatic and electromagnetic cases, and present the results of several standard test problems, showing good agreement with theory with time step sizes much larger than allowed by typical CFL restrictions.
NASA Technical Reports Server (NTRS)
Mullenmeister, Paul
1988-01-01
The quasi-geostrophic omega-equation in flux form is developed as an example of a Poisson problem over a spherical shell. Solutions of this equation are obtained by applying a two-parameter Chebyshev solver in vector layout for CDC 200 series computers. The performance of this vectorized algorithm greatly exceeds the performance of its scalar analog. The algorithm generates solutions of the omega-equation which are compared with the omega fields calculated with the aid of the mass continuity equation.
Wolf, Eric M.; Causley, Matthew; Christlieb, Andrew; Bettencourt, Matthew
2016-08-09
Here, we propose a new particle-in-cell (PIC) method for the simulation of plasmas based on a recently developed, unconditionally stable solver for the wave equation. This method is not subject to a CFL restriction, limiting the ratio of the time step size to the spatial step size, typical of explicit methods, while maintaining computational cost and code complexity comparable to such explicit schemes. We describe the implementation in one and two dimensions for both electrostatic and electromagnetic cases, and present the results of several standard test problems, showing good agreement with theory with time step sizes much larger than allowed by typical CFL restrictions.
Multi-GPU three dimensional Stokes solver for simulating glacier flow
NASA Astrophysics Data System (ADS)
Licul, Aleksandar; Herman, Frédéric; Podladchikov, Yuri; Räss, Ludovic; Omlin, Samuel
2016-04-01
Here we present how we have recently developed a three-dimensional Stokes solver on the GPUs and apply it to a glacier flow. We numerically solve the Stokes momentum balance equations together with the incompressibility equation, while also taking into account strong nonlinearities for ice rheology. We have developed a fully three-dimensional numerical MATLAB application based on an iterative finite difference scheme with preconditioning of residuals. Differential equations are discretized on a regular staggered grid. We have ported it to C-CUDA to run it on GPU's in parallel, using MPI. We demonstrate the accuracy and efficiency of our developed model by manufactured analytical solution test for three-dimensional Stokes ice sheet models (Leng et al.,2013) and by comparison with other well-established ice sheet models on diagnostic ISMIP-HOM benchmark experiments (Pattyn et al., 2008). The results show that our developed model is capable to accurately and efficiently solve Stokes system of equations in a variety of different test scenarios, while preserving good parallel efficiency on up to 80 GPU's. For example, in 3D test scenarios with 250000 grid points our solver converges in around 3 minutes for single precision computations and around 10 minutes for double precision computations. We have also optimized the developed code to efficiently run on our newly acquired state-of-the-art GPU cluster octopus. This allows us to solve our problem on more than 20 million grid points, by just increasing the number of GPU used, while keeping the computation time the same. In future work we will apply our solver to real world applications and implement the free surface evolution capabilities. REFERENCES Leng,W.,Ju,L.,Gunzburger,M. & Price,S., 2013. Manufactured solutions and the verification of three-dimensional stokes ice-sheet models. Cryosphere 7,19-29. Pattyn, F., Perichon, L., Aschwanden, A., Breuer, B., de Smedt, B., Gagliardini, O., Gudmundsson,G.H., Hindmarsh, R
CASTRO: A NEW COMPRESSIBLE ASTROPHYSICAL SOLVER. III. MULTIGROUP RADIATION HYDRODYNAMICS
Zhang, W.; Almgren, A.; Bell, J.; Howell, L.; Burrows, A.; Dolence, J.
2013-01-15
We present a formulation for multigroup radiation hydrodynamics that is correct to order O(v/c) using the comoving-frame approach and the flux-limited diffusion approximation. We describe a numerical algorithm for solving the system, implemented in the compressible astrophysics code, CASTRO. CASTRO uses a Eulerian grid with block-structured adaptive mesh refinement based on a nested hierarchy of logically rectangular variable-sized grids with simultaneous refinement in both space and time. In our multigroup radiation solver, the system is split into three parts: one part that couples the radiation and fluid in a hyperbolic subsystem, another part that advects the radiation in frequency space, and a parabolic part that evolves radiation diffusion and source-sink terms. The hyperbolic subsystem and the frequency space advection are solved explicitly with high-order Godunov schemes, whereas the parabolic part is solved implicitly with a first-order backward Euler method. Our multigroup radiation solver works for both neutrino and photon radiation.
A massively parallel fractional step solver for incompressible flows
Houzeaux, G. Vazquez, M. Aubry, R. Cela, J.M.
2009-09-20
This paper presents a parallel implementation of fractional solvers for the incompressible Navier-Stokes equations using an algebraic approach. Under this framework, predictor-corrector and incremental projection schemes are seen as sub-classes of the same class, making apparent its differences and similarities. An additional advantage of this approach is to set a common basis for a parallelization strategy, which can be extended to other split techniques or to compressible flows. The predictor-corrector scheme consists in solving the momentum equation and a modified 'continuity' equation (namely a simple iteration for the pressure Schur complement) consecutively in order to converge to the monolithic solution, thus avoiding fractional errors. On the other hand, the incremental projection scheme solves only one iteration of the predictor-corrector per time step and adds a correction equation to fulfill the mass conservation. As shown in the paper, these two schemes are very well suited for massively parallel implementation. In fact, when compared with monolithic schemes, simpler solvers and preconditioners can be used to solve the non-symmetric momentum equations (GMRES, Bi-CGSTAB) and to solve the symmetric continuity equation (CG, Deflated CG). This gives good speedup properties of the algorithm. The implementation of the mesh partitioning technique is presented, as well as the parallel performances and speedups for thousands of processors.
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.
Application of Semi Active Control Techniques to the Damping Suppression Problem of Solar Sail Booms
NASA Technical Reports Server (NTRS)
Adetona, O.; Keel, L. H.; Whorton, M. S.
2007-01-01
Solar sails provide a propellant free form for space propulsion. These are large flat surfaces that generate thrust when they are impacted by light. When attached to a space vehicle, the thrust generated can propel the space vehicle to great distances at significant speeds. For optimal performance the sail must be kept from excessive vibration. Active control techniques can provide the best performance. However, they require an external power-source that may create significant parasitic mass to the solar sail. However, solar sails require low mass for optimal performance. Secondly, active control techniques typically require a good system model to ensure stability and performance. However, the accuracy of solar sail models validated on earth for a space environment is questionable. An alternative approach is passive vibration techniques. These do not require an external power supply, and do not destabilize the system. A third alternative is referred to as semi-active control. This approach tries to get the best of both active and passive control, while avoiding their pitfalls. In semi-active control, an active control law is designed for the system, and passive control techniques are used to implement it. As a result, no external power supply is needed so the system is not destabilize-able. Though it typically underperforms active control techniques, it has been shown to out-perform passive control approaches and can be unobtrusively installed on a solar sail boom. Motivated by this, the objective of this research is to study the suitability of a Piezoelectric (PZT) patch actuator/sensor based semi-active control system for the vibration suppression problem of solar sail booms. Accordingly, we develop a suitable mathematical and computer model for such studies and demonstrate the capabilities of the proposed approach with computer simulations.
Numerical Solution of the k-Eigenvalue Problem
NASA Astrophysics Data System (ADS)
Hamilton, Steven Paul
2011-12-01
Obtaining solutions to the k-eigenvalue form of the radiation transport equation is an important topic in the design and analysis of nuclear reactors. Although this has been an area of active interest in the nuclear engineering community for several decades, to date no truly satisfactory solution strategies exist. In general, existing techniques are either slow to converge for difficult problems or suffer from stability and robustness issues that can cause solvers to diverge for some problems. This work provides a comparison between a variety of methods and introduces a new strategy based on the Davidson method that has been used in other fields for many years but never for this problem. The Davidson method offers an alternative to the nested iteration structure inherent to standard approaches and allows expensive linear solvers to be replaced by a potentially cheap preconditioner. To fill the role of this preconditioner, a strategy based on a multigrid treatment of the energy variable is developed. Numerical experiments using the 2-D NEWT transport package are presented, demonstrating the effectiveness of the proposed strategy.
On the relationship between ODE solvers and iterative solvers for linear equations
Lorber, A.; Joubert, W.; Carey, G.F.
1994-12-31
The connection between the solution of linear systems of equations by both iterative methods and explicit time stepping techniques is investigated. Based on the similarities, a suite of Runge-Kutta time integration schemes with extended stability domains are developed using Chebyshev iteration polynomials. These Runge-Kutta schemes are applied to linear and non-linear systems arising from the numerical solution of PDE`s containing either physical or artificial transient terms. Specifically, the solutions of model linear convection and convection-diffusion equations are presented, as well as the solution of a representative non-linear Navier-Stokes fluid flow problem. Included are results of parallel computations.
The role of physical activity to control obesity problem in Malaysia
NASA Astrophysics Data System (ADS)
Abidin, Norhaslinda Zainal; Zaibidi, Nerda Zura; Zulkepli, Jafri Hj
2014-07-01
Obesity is defined as a condition in which an individual has an excess of body fat and it is accumulated to the extent that it can lead to numerous health problems and decreases the quality and length of life. Overall, the contributing factor to obesity varies. Lack of physical activity and increased sedentary behaviour has been identified as the causes of weight gain and various health implications including obesity. Rapid development in industrialization and urbanization has brought Malaysia to be the next millennium country in the world, and this causes changes in the country's socioeconomic, especially the lifestyles of Malaysians. In conjunction with this, the aim of this paper is to simulate the changes in physical activities and to highlight its implication on body weight and prevalence of overweight and obesity in a Malaysian adult population. This study combines different strands of knowledge consisting of nutrition, physical activity and body metabolism, and these elements have been synthesised into a system dynamics model called SIMULObese. The development of this model has considered the interrelations between those various strands in one multifaceted human weight regulation system. Findings from this study revealed that Malaysian adults perform less physical activity and this has resulted in weight gain and increase in prevalence of overweight and obesity. Therefore, findings from this study bring the important message to various parties such as practitioners, researchers, educators and publics about the importance of focusing on combinations of intensity, frequency and duration of moderate-vigorous activity for adult obesity control in Malaysia.
An Extended Membrane System with Active Membranes to Solve Automatic Fuzzy Clustering Problems.
Peng, Hong; Wang, Jun; Shi, Peng; Pérez-Jiménez, Mario J; Riscos-Núñez, Agustín
2016-05-01
This paper focuses on automatic fuzzy clustering problem and proposes a novel automatic fuzzy clustering method that employs an extended membrane system with active membranes that has been designed as its computing framework. The extended membrane system has a dynamic membrane structure; since membranes can evolve, it is particularly suitable for processing the automatic fuzzy clustering problem. A modification of a differential evolution (DE) mechanism was developed as evolution rules for objects according to membrane structure and object communication mechanisms. Under the control of both the object's evolution-communication mechanism and the membrane evolution mechanism, the extended membrane system can effectively determine the most appropriate number of clusters as well as the corresponding optimal cluster centers. The proposed method was evaluated over 13 benchmark problems and was compared with four state-of-the-art automatic clustering methods, two recently developed clustering methods and six classification techniques. The comparison results demonstrate the superiority of the proposed method in terms of effectiveness and robustness.
An Implicit Energy-Conservative 2D Fokker-Planck Algorithm. II. Jacobian-Free Newton-Krylov Solver
NASA Astrophysics Data System (ADS)
Chacón, L.; Barnes, D. C.; Knoll, D. A.; Miley, G. H.
2000-01-01
Energy-conservative implicit integration schemes for the Fokker-Planck transport equation in multidimensional geometries require inverting a dense, non-symmetric matrix (Jacobian), which is very expensive to store and solve using standard solvers. However, these limitations can be overcome with Newton-Krylov iterative techniques, since they can be implemented Jacobian-free (the Jacobian matrix from Newton's algorithm is never formed nor stored to proceed with the iteration), and their convergence can be accelerated by preconditioning the original problem. In this document, the efficient numerical implementation of an implicit energy-conservative scheme for multidimensional Fokker-Planck problems using multigrid-preconditioned Krylov methods is discussed. Results show that multigrid preconditioning is very effective in speeding convergence and decreasing CPU requirements, particularly in fine meshes. The solver is demonstrated on grids up to 128×128 points in a 2D cylindrical velocity space (vr, vp) with implicit time steps of the order of the collisional time scale of the problem, τ. The method preserves particles exactly, and energy conservation is improved over alternative approaches, particularly in coarse meshes. Typical errors in the total energy over a time period of 10τ remain below a percent.
Novikov, A I; Gudinova, Zh V
2015-01-01
The article summarizes innovative activity in Omsk State Medical University (OSMU) and contains the review of innovative developments of staff of dental faculty of OSMU (a line of gels for caries prevetion, the DENTEST diagnostic unit, technology of tooth shape modular restoration, personified therapy.of patients with periodontal disease, caries diagnosis and periodontontal disease prognosis software, a set of the training materials on esthetic modeling of teeth, personification of clinical approaches in oral bioaesthetic rehabilitation, etc.). The analysis of the factors stimulating and complicating innovative detail in medical school, problems of introduction of medical innovations, lack of system of an assessment of medical technologies in Russia, regulations of the organization of innovative activity in medical schools is carried out, the prospects of their solution connected with decision-making at the state level are formulated.
Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes. Parts 1 and 2
NASA Technical Reports Server (NTRS)
Barth, Timothy J.; Kwak, Dochan (Technical Monitor)
1995-01-01
The Advisory Group for Aerospace Research and Development (AGARD) has requested my participation in the lecture series entitled Parallel Computing in Computational Fluid Dynamics to be held at the von Karman Institute in Brussels, Belgium on May 15-19, 1995. In addition, a request has been made from the US Coordinator for AGARD at the Pentagon for NASA Ames to hold a repetition of the lecture series on October 16-20, 1995. I have been asked to be a local coordinator for the Ames event. All AGARD lecture series events have attendance limited to NATO allied countries. A brief of the lecture series is provided in the attached enclosure. Specifically, I have been asked to give two lectures of approximately 75 minutes each on the subject of parallel solution techniques for the fluid flow equations on unstructured meshes. The title of my lectures is "Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes" (Parts I-II). The contents of these lectures will be largely review in nature and will draw upon previously published work in this area. Topics of my lectures will include: (1) Mesh partitioning algorithms. Recursive techniques based on coordinate bisection, Cuthill-McKee level structures, and spectral bisection. (2) Newton's method for large scale CFD problems. Size and complexity estimates for Newton's method, modifications for insuring global convergence. (3) Techniques for constructing the Jacobian matrix. Analytic and numerical techniques for Jacobian matrix-vector products, constructing the transposed matrix, extensions to optimization and homotopy theories. (4) Iterative solution algorithms. Practical experience with GIVIRES and BICG-STAB matrix solvers. (5) Parallel matrix preconditioning. Incomplete Lower-Upper (ILU) factorization, domain-decomposed ILU, approximate Schur complement strategies.
Local Attitudes towards Bear Management after Illegal Feeding and Problem Bear Activity
Dubois, Sara; Fraser, David
2013-01-01
Simple Summary The “pot bears” received international media attention in 2010 after police discovered the intentional feeding of black bears during the investigation of an alleged marijuana-growing operation in Christina Lake, British Columbia. Residents of this small community were surveyed by phone twice over the following year, before and after government actions. This study aimed to understand local attitudes on how these bears should be managed and whether they differed from existing bear management policy. Results indicate a significant problem with the public view of wildlife feeding and a gap between public and expert opinion on relocation and killing of food-conditioned wildlife. Abstract The “pot bears” received international media attention in 2010 after police discovered the intentional feeding of over 20 black bears during the investigation of an alleged marijuana-growing operation in Christina Lake, British Columbia, Canada. A two-phase random digit dialing survey of the community was conducted in 2011 to understand local perspectives on bear policy and management, before and after a summer of problem bear activity and government interventions. Of the 159 households surveyed in February 2011, most had neutral or positive attitudes towards bears in general, and supported the initial decision to feed the food-conditioned bears until the autumn hibernation. In contrast to wildlife experts however, most participants supported relocating the problem bears, or allowing them to remain in the area, ahead of killing; in part this arose from notions of fairness despite the acknowledged problems of relocation. Most locals were aware of the years of feeding but did not report it, evidently failing to see it as a serious form of harm, even after many bears had been killed. This underscores the importance of preventive action on wildlife feeding and the need to narrow the gap between public and expert opinion on the likely effects of relocation versus
NASA Technical Reports Server (NTRS)
Kiris, Cetin C.; Kwak, Dochan; Rogers, Stuart E.
2002-01-01
This paper reviews recent progress made in incompressible Navier-Stokes simulation procedures and their application to problems of engineering interest. Discussions are focused on the methods designed for complex geometry applications in three dimensions, and thus are limited to primitive variable formulation. A summary of efforts in flow solver development is given followed by numerical studies of a few example problems of current interest. Both steady and unsteady solution algorithms and their salient features are discussed. Solvers discussed here are based on a structured-grid approach using either a finite -difference or a finite-volume frame work. As a grand-challenge application of these solvers, an unsteady turbopump flow simulation procedure has been developed which utilizes high performance computing platforms. In the paper, the progress toward the complete simulation capability of the turbo-pump for a liquid rocket engine is reported. The Space Shuttle Main Engine (SSME) turbo-pump is used as a test case for evaluation of two parallel computing algorithms that have been implemented in the INS3D code. The relative motion of the grid systems for the rotorstator interaction was obtained using overact grid techniques. Unsteady computations for the SSME turbo-pump, which contains 114 zones with 34.5 million grid points, are carried out on SCSI Origin 3000 systems at NASA Ames Research Center. The same procedure has been extended to the development of NASA-DeBakey Ventricular Assist Device (VAD) that is based on an axial blood pump. Computational, and clinical analysis of this device are presented.
NASA Astrophysics Data System (ADS)
Kabakian, Adour Vahe
1998-12-01
Most time-domain solvers of Maxwell's equations that are applied to electromagnetic wave scattering problems are based on second- or third-order finite-difference and finite-volume schemes. Since linear wave propagation phenomena tend to be very susceptible to numerical dissipation and dispersion errors, they place high accuracy demands on the numerical methods employed. Starting with the premise that the required accuracy can be achieved more efficiently with high-order methods, a new numerical scheme based on spectral collocation is developed for solving Maxwell's equations in the time domain. The three-dimensional method is formulated over generalized curvilinear coordinates. It employs Fourier and Chebyshev spectral collocation for the spatial derivatives, while time advancement is achieved by the explicit third-order Adams-Moulton-Bashforth scheme. A domain decomposition method supplementing the spectral solver is also developed, extending its range of applications to geometries more complex than those traditionally associated with spectral methods. Reflective and absorbing boundary conditions are developed specifically for the spectral scheme. Finally, a grid stretching function is incorporated into the solver, which can be used, when needed, to relieve the stability restriction associated with the Chebyshev spacing of the collocation points, at the expense of only moderate loss in accuracy. The numerical method is applied to solve electromagnetic wave scattering problems from perfectly conducting solid targets, using both single and multi-domain grids. The geometries considered are the circular cylinder, the square cylinder, and the sphere. Solutions are evaluated and validated by the accuracy of the radar cross-section and, in some instances, the surface currents. Compared to commonly used finite-difference and finite-volume solvers, the spectral scheme produces results that are one to two orders of magnitude more accurate, using grids that are an order of
NASA Astrophysics Data System (ADS)
Bauer, Petr; Klement, Vladimír; Oberhuber, Tomáš; Žabka, Vítězslav
2016-03-01
We present a complete GPU implementation of a geometric multigrid solver for the numerical solution of the Navier-Stokes equations for incompressible flow. The approximate solution is constructed on a two-dimensional unstructured triangular mesh. The problem is discretized by means of the mixed finite element method with semi-implicit timestepping. The linear saddle-point problem arising from the scheme is solved by the geometric multigrid method with a Vanka-type smoother. The parallel solver is based on the red-black coloring of the mesh triangles. We achieved a speed-up of 11 compared to a parallel (4 threads) code based on OpenMP and 19 compared to a sequential code.
Robust HLLC Riemann solver with weighted average flux scheme for strong shock
NASA Astrophysics Data System (ADS)
Kim, Sung Don; Lee, Bok Jik; Lee, Hyoung Jin; Jeung, In-Seuck
2009-11-01
Many researchers have reported failures of the approximate Riemann solvers in the presence of strong shock. This is believed to be due to perturbation transfer in the transverse direction of shock waves. We propose a simple and clear method to prevent such problems for the Harten-Lax-van Leer contact (HLLC) scheme. By defining a sensing function in the transverse direction of strong shock, the HLLC flux is switched to the Harten-Lax-van Leer (HLL) flux in that direction locally, and the magnitude of the additional dissipation is automatically determined using the HLL scheme. We combine the HLLC and HLL schemes in a single framework using a switching function. High-order accuracy is achieved using a weighted average flux (WAF) scheme, and a method for v-shear treatment is presented. The modified HLLC scheme is named HLLC-HLL. It is tested against a steady normal shock instability problem and Quirk's test problems, and spurious solutions in the strong shock regions are successfully controlled.
Description and use of LSODE, the Livemore Solver for Ordinary Differential Equations
Radhakrishnan, K; Hindmarsh, A C
1993-12-01
This document provides a comprehensive description of LSODE, a solver for initial value problems in ordinary differential equation systems. It is intended to bring together numerous materials documenting various aspects of LSODE, including technical reports on the methods used, published papers on LSODE, usage documentation contained within the LSODE source, and unpublished notes on algorithmic details. The three central chapters-n methods, code description, and code usage-are largely independent. Thus, for example, we intend that readers who are familiar with the solution methods and interested in how they are implemented in LSODE can read the Introduction and then chapter 3, Description of Code, without reading chapter 2, Description and Implementation of Methods. Similarly, those interested solely in how to use the code need read only the Introduction and then chapter 4, Description of Code Usage. In this case chapter 5, Example Problem, which illustrates code usage by means of a simple, stiff chemical kinetics problem, supplements chapter 4 and may be of further assistance. Although this document is intended mainly for users of LSODE, it can be used as supplementary reading material for graduate and advanced undergraduate courses on numerical methods. Engineers and scientists who use numerical solution methods for ordinary differential equations may also benefit from this document.
Miller, Gregory H.
2003-08-06
In this paper we present a general iterative method for the solution of the Riemann problem for hyperbolic systems of PDEs. The method is based on the multiple shooting method for free boundary value problems. We demonstrate the method by solving one-dimensional Riemann problems for hyperelastic solid mechanics. Even for conditions representative of routine laboratory conditions and military ballistics, dramatic differences are seen between the exact and approximate Riemann solution. The greatest discrepancy arises from misallocation of energy between compressional and thermal modes by the approximate solver, resulting in nonphysical entropy and temperature estimates. Several pathological conditions arise in common practice, and modifications to the method to handle these are discussed. These include points where genuine nonlinearity is lost, degeneracies, and eigenvector deficiencies that occur upon melting.
Blade design and analysis using a modified Euler solver
NASA Technical Reports Server (NTRS)
Leonard, O.; Vandenbraembussche, R. A.
1991-01-01
An iterative method for blade design based on Euler solver and described in an earlier paper is used to design compressor and turbine blades providing shock free transonic flows. The method shows a rapid convergence, and indicates how much the flow is sensitive to small modifications of the blade geometry, that the classical iterative use of analysis methods might not be able to define. The relationship between the required Mach number distribution and the resulting geometry is discussed. Examples show how geometrical constraints imposed upon the blade shape can be respected by using free geometrical parameters or by relaxing the required Mach number distribution. The same code is used both for the design of the required geometry and for the off-design calculations. Examples illustrate the difficulty of designing blade shapes with optimal performance also outside of the design point.
Workload Characterization of CFD Applications Using Partial Differential Equation Solvers
NASA Technical Reports Server (NTRS)
Waheed, Abdul; Yan, Jerry; Saini, Subhash (Technical Monitor)
1998-01-01
Workload characterization is used for modeling and evaluating of computing systems at different levels of detail. We present workload characterization for a class of Computational Fluid Dynamics (CFD) applications that solve Partial Differential Equations (PDEs). This workload characterization focuses on three high performance computing platforms: SGI Origin2000, EBM SP-2, a cluster of Intel Pentium Pro bases PCs. We execute extensive measurement-based experiments on these platforms to gather statistics of system resource usage, which results in workload characterization. Our workload characterization approach yields a coarse-grain resource utilization behavior that is being applied for performance modeling and evaluation of distributed high performance metacomputing systems. In addition, this study enhances our understanding of interactions between PDE solver workloads and high performance computing platforms and is useful for tuning these applications.
Extending the QUDA Library with the eigCG Solver
Strelchenko, Alexei; Stathopoulos, Andreas
2014-12-12
While the incremental eigCG algorithm [ 1 ] is included in many LQCD software packages, its realization on GPU micro-architectures was still missing. In this session we report our experi- ence of the eigCG implementation in the QUDA library. In particular, we will focus on how to employ the mixed precision technique to accelerate solutions of large sparse linear systems with multiple right-hand sides on GPUs. Although application of mixed precision techniques is a well-known optimization approach for linear solvers, its utilization for the eigenvector com- puting within eigCG requires special consideration. We will discuss implementation aspects of the mixed precision deflation and illustrate its numerical behavior on the example of the Wilson twisted mass fermion matrix inversions
Accurate derivative evaluation for any Grad–Shafranov solver
Ricketson, L.F.; Cerfon, A.J.; Rachh, M.; Freidberg, J.P.
2016-01-15
We present a numerical scheme that can be combined with any fixed boundary finite element based Poisson or Grad–Shafranov solver to compute the first and second partial derivatives of the solution to these equations with the same order of convergence as the solution itself. At the heart of our scheme is an efficient and accurate computation of the Dirichlet to Neumann map through the evaluation of a singular volume integral and the solution to a Fredholm integral equation of the second kind. Our numerical method is particularly useful for magnetic confinement fusion simulations, since it allows the evaluation of quantities such as the magnetic field, the parallel current density and the magnetic curvature with much higher accuracy than has been previously feasible on the affordable coarse grids that are usually implemented.
ERIC Educational Resources Information Center
Czabanowska, Katarzyna; Moust, Jos H. C.; Meijer, Andre W. M.; Schroder-Back, Peter; Roebertsen, Herma
2012-01-01
Despite several years of successfully applying problem-based learning at Maastricht University, the Faculty of Medicine observed a slow erosion of problem-based practices and "PBL fatigue" among themselves and students. In response to this fatigue and new research into the development of the young adult brain, Active Self-Directed…
ERIC Educational Resources Information Center
Van Aalsvoort, Joke
2004-01-01
In a previous article, the problem of chemistry's lack of relevance in secondary chemical education was analysed using logical positivism as a tool. This article starts with the hypothesis that the problem can be addressed by means of activity theory, one of the important theories within the sociocultural school. The reason for this expectation is…
A Newton-Krylov solver for fast spin-up of online ocean tracers
NASA Astrophysics Data System (ADS)
Lindsay, Keith
2017-01-01
We present a Newton-Krylov based solver to efficiently spin up tracers in an online ocean model. We demonstrate that the solver converges, that tracer simulations initialized with the solution from the solver have small drift, and that the solver takes orders of magnitude less computational time than the brute force spin-up approach. To demonstrate the application of the solver, we use it to efficiently spin up the tracer ideal age with respect to the circulation from different time intervals in a long physics run. We then evaluate how the spun-up ideal age tracer depends on the duration of the physics run, i.e., on how equilibrated the circulation is.
A High-Order Direct Solver for Helmholtz Equations with Neumann Boundary Conditions
NASA Technical Reports Server (NTRS)
Sun, Xian-He; Zhuang, Yu
1997-01-01
In this study, a compact finite-difference discretization is first developed for Helmholtz equations on rectangular domains. Special treatments are then introduced for Neumann and Neumann-Dirichlet boundary conditions to achieve accuracy and separability. Finally, a Fast Fourier Transform (FFT) based technique is used to yield a fast direct solver. Analytical and experimental results show this newly proposed solver is comparable to the conventional second-order elliptic solver when accuracy is not a primary concern, and is significantly faster than that of the conventional solver if a highly accurate solution is required. In addition, this newly proposed fourth order Helmholtz solver is parallel in nature. It is readily available for parallel and distributed computers. The compact scheme introduced in this study is likely extendible for sixth-order accurate algorithms and for more general elliptic equations.
A three-dimensional fast solver for arbitrary vorton distributions
Strickland, J.H.; Baty, R.S.
1994-05-01
A method which is capable of an efficient calculation of the three-dimensional flow field produced by a large system of vortons (discretized regions of vorticity) is presented in this report. The system of vortons can, in turn, be used to model body surfaces, container boundaries, free-surfaces, plumes, jets, and wakes in unsteady three-dimensional flow fields. This method takes advantage of multipole and local series expansions which enables one to make calculations for interactions between groups of vortons which are in well-separated spatial domains rather than having to consider interactions between every pair of vortons. In this work, series expansions for the vector potential of the vorton system are obtained. From such expansions, the three components of velocity can be obtained explicitly. A Fortran computer code FAST3D has been written to calculate the vector potential and the velocity components at selected points in the flow field. In this code, the evaluation points do not have to coincide with the location of the vortons themselves. Test cases have been run to benchmark the truncation errors and CPU time savings associated with the method. Non-dimensional truncation errors for the magnitudes of the vector potential and velocity fields are on the order of 10{sup {minus}4}and 10{sup {minus}3} respectively. Single precision accuracy produces errors in these quantities of up to 10{sup {minus}5}. For less than 1,000 to 2,000 vortons in the field, there is virtually no CPU time savings with the fast solver. For 100,000 vortons in the flow, the fast solver obtains solutions in 1 % to 10% of the time required for the direct solution technique depending upon the configuration.
High Energy Boundary Conditions for a Cartesian Mesh Euler Solver
NASA Technical Reports Server (NTRS)
Pandya, Shishir; Murman, Scott; Aftosmis, Michael
2003-01-01
Inlets and exhaust nozzles are common place in the world of flight. Yet, many aerodynamic simulation packages do not provide a method of modelling such high energy boundaries in the flow field. For the purposes of aerodynamic simulation, inlets and exhausts are often fared over and it is assumed that the flow differences resulting from this assumption are minimal. While this is an adequate assumption for the prediction of lift, the lack of a plume behind the aircraft creates an evacuated base region thus effecting both drag and pitching moment values. In addition, the flow in the base region is often mis-predicted resulting in incorrect base drag. In order to accurately predict these quantities, a method for specifying inlet and exhaust conditions needs to be available in aerodynamic simulation packages. A method for a first approximation of a plume without accounting for chemical reactions is added to the Cartesian mesh based aerodynamic simulation package CART3D. The method consists of 3 steps. In the first step, a components approach where each triangle is assigned a component number is used. Here, a method for marking the inlet or exhaust plane triangles as separate components is discussed. In step two, the flow solver is modified to accept a reference state for the components marked inlet or exhaust. In the third step, the flow solver uses these separated components and the reference state to compute the correct flow condition at that triangle. The present method is implemented in the CART3D package which consists of a set of tools for generating a Cartesian volume mesh from a set of component triangulations. The Euler equations are solved on the resulting unstructured Cartesian mesh. The present methods is implemented in this package and its usefulness is demonstrated with two validation cases. A generic missile body is also presented to show the usefulness of the method on a real world geometry.
Figueira, Angela C M; Rocha, Joao B T
2014-01-01
This article presents a problem-based learning (PBL) approach to teaching elementary biochemistry to undergraduate students. The activity was based on "the foods we eat." It was used to engage students' curiosity and to initiate learning about a subject that could be used by the future teachers in the high school. The experimental activities (8-12 hours) were related to the questions: (i) what does the Benedict's Reagent detect? and (ii) What is determined by glucose oxidase (GOD)? We also ask the students to compare the results with those obtained with the Lugol reagent, which detects starch. Usually, students inferred that the Benedict reagent detects reducing sugars, while GOD could be used to detect glucose. However, in GOD assay, an open question was left, because the results could be due to contamination of the sugars (particularly galactose) with glucose. Though not stressed, GOD does not oxidize the carbohydrates tested and all the positive results are due to contamination. The activities presented here can be easily done in the high school, because they are simple and non-expensive. Furthermore, in the case of Benedict reaction, it is possible to follow the reduction of Cu (II) "macroscopically" by following the formation of the brick-orange precipitate. The concrete observation of a chemical reaction can motivate and facilitate students understanding about chemistry of life.
Advanced Nodal P_{3}/SP_{3} Axial Transport Solvers for the MPACT 2D/1D Scheme
Stimpson, Shane G; Collins, Benjamin S
2015-01-01
As part of its initiative to provide multiphysics simulations of nuclear reactor cores, the Consortium for Advanced Simulation of Light Water Reactors (CASL) is developing the Virtual Environment for Reactor Applications Core Simulator (VERA-CS). The MPACT code, which is the primary neutron transport solver of VERA-CS, employs the two-dimensional/one-dimensional (2D/1D) method to solve 3-dimensional neutron transport problems and provide sub-pin-level resolution of the power distribution. While 2D method of characteristics is used to solve for the transport effects within each plane, 1D-nodal methods are used axially. There have been extensive studies of the 2D/1D method with a variety nodal methods, and the P_{3}/SP_{3} solver has proved to be an effective method of providing higher-fidelity solutions while maintaining a low computational burden.The current implementation in MPACT wraps a one-node nodal expansion method (NEM) kernel for each moment, iterating between them and performing multiple sweeps to resolve flux distributions. However, it has been observed that this approach is more sensitive to convergence problems. This paper documents the theory and application two new nodal P_{3}/SP_{3} approaches to be used within the 2D/1D method in MPACT. These two approaches aim to provide enhanced stability compared with the pre-existing one-node approach. Results from the HY-NEM-SP_{3} solver show that the accuracy is consistent with the one-node formulations and provides improved convergence for some problems; but the solver has issues with cases in thin planes. Although the 2N-SENM-SP_{3} solver is still under development, it is intended to resolve the issues with HY-NEM-SP_{3} but it will incur some additional computational burden by necessitating an additional 1D-CMFD-P_{3} solver to generate the second moment cell-averaged scalar flux.
A Process Analysis of Engineering Problem Solving and Assessment of Problem Solving Skills
ERIC Educational Resources Information Center
Grigg, Sarah J.
2012-01-01
In the engineering profession, one of the most critical skills to possess is accurate and efficient problem solving. Thus, engineering educators should strive to help students develop skills needed to become competent problem solvers. In order to measure the development of skills, it is necessary to assess student performance, identify any…
Inverse eigenvalue problems in vibration absorption: Passive modification and active control
NASA Astrophysics Data System (ADS)
Mottershead, John E.; Ram, Yitshak M.
2006-01-01
The abiding problem of vibration absorption has occupied engineering scientists for over a century and there remain abundant examples of the need for vibration suppression in many industries. For example, in the automotive industry the resolution of noise, vibration and harshness (NVH) problems is of extreme importance to customer satisfaction. In rotorcraft it is vital to avoid resonance close to the blade passing speed and its harmonics. An objective of the greatest importance, and extremely difficult to achieve, is the isolation of the pilot's seat in a helicopter. It is presently impossible to achieve the objectives of vibration absorption in these industries at the design stage because of limitations inherent in finite element models. Therefore, it is necessary to develop techniques whereby the dynamic of the system (possibly a car or a helicopter) can be adjusted after it has been built. There are two main approaches: structural modification by passive elements and active control. The state of art of the mathematical theory of vibration absorption is presented and illustrated for the benefit of the reader with numerous simple examples.
NASA Astrophysics Data System (ADS)
Wei, Jian-Gong; Peng, Zhen; Lee, Jin-Fa
2012-10-01
The implementation details of a fast direct solver is described herein for solving dense matrix equations from the application of surface integral equation methods for electromagnetic field scatterings from non-penetrable targets. The proposed algorithm exploits the smoothness of the far field and computes a low rank decomposition of the off-diagonal coupling blocks of the matrices through a set of skeletonization processes. Moreover, an artificial surface (the Huygens' surface) is introduced for each clustering group to efficiently account for the couplings between well-separated groups. Furthermore, a recursive multilevel version of the algorithm is presented. Although asymptotically the algorithm would not alter the bleak outlook of the complexity of the worst case scenario,O(N3) for required CPU time where N denotes the number of unknowns, for electrically large electromagnetic (EM) problems; through numerical examples, we found that the proposed multilevel direct solver can scale as good as O(N1.3) in memory consumption and O(N1.8) in CPU time for moderate-sized EM problems. Note that our conclusions are drawn based on a few sample examples that we have conducted and should not be taken as a true complexity analysis for general electrodynamic applications. However, for the fixed frequency (h-refinement) scenario, where the discretization size decreases, the computational complexities observed agree well with the theoretical predictions. Namely, the algorithm exhibits O(N) and O(N1.5) complexities for memory consumption and CPU time, respectively.
"Sustainability On Earth" WebQuests: Do They Qualify as Problem-Based Learning Activities?
NASA Astrophysics Data System (ADS)
Leite, Laurinda; Dourado, Luís; Morgado, Sofia
2015-02-01
Information and communication technologies (ICT), namely the Internet, can play a valuable educational role in several school subjects, including science education. The same applies to problem-based learning (PBL), that is, a student-centered active learning methodology that can prepare students for lifelong learning. WebQuests (WQs) combine PBL and Internet use, and they can reduce the probability of having students surfing the Internet without any clear purpose. The objective of this paper is to investigate to what extent WQs available from Portuguese schools' and universities' websites, focusing on the "Sustainability on Earth" eighth-grade school science theme, are consistent with a PBL perspective. Results from content analysis of 92 WQs indicate that the WQs selected for this paper are rarely consistent with PBL requirements. Teachers should be both aware of this issue and ready to improve the WQs available before using them in their science classes so that greater educational advantage can be generated from this powerful tool.
Russian space agency activities on the problem of technogenic space debris
NASA Astrophysics Data System (ADS)
Blagun, V. P.; Kulik, S. V.; Lukyashchenko, V. I.
1999-01-01
In this paper the main directions and the major results of the activities on the problem of technogenic near-earth space (NES) orbital debris are discussed. With regard to monitoring the NES debris environment, the following issues are considered: the catalogue of space objects which includes objects in the geostationary ring, orbital debris models, and ground- and space-based observations. For the protection of spacecraft and Space Station from debris particles multilayer and other shields are used, as well as avoidance manoeuvres. Important issues are the determination of the location of impacts and restoration of the station wall tightness. The BUFFER program has been developed for the risk assessment of impacts of orbital debris particles with the Space Station. Measures are taken to reduce technogenic pollution of NES which include those to prevent launch vehicles and spacecraft explosions. Special attention is placed on the safe utilization of the geostationary orbit. From the results of these studies regulatory documents are issued.
MARS-KS code validation activity through the atlas domestic standard problem
Choi, K. Y.; Kim, Y. S.; Kang, K. H.; Park, H. S.; Cho, S.
2012-07-01
The 2 nd Domestic Standard Problem (DSP-02) exercise using the ATLAS integral effect test data was executed to transfer the integral effect test data to domestic nuclear industries and to contribute to improving the safety analysis methodology for PWRs. A small break loss of coolant accident of a 6-inch break at the cold leg was determined as a target scenario by considering its technical importance and by incorporating interests from participants. Ten calculation results using MARS-KS code were collected, major prediction results were described qualitatively and code prediction accuracy was assessed quantitatively using the FFTBM. In addition, special code assessment activities were carried out to find out the area where the model improvement is required in the MARS-KS code. The lessons from this DSP-02 and recommendations to code developers are described in this paper. (authors)
ERIC Educational Resources Information Center
Cheung, K. C.; And Others
This collection of four papers deals with problem solving and the measurement of problem solving. "Climbing Up the Competence Ladder: Some Thoughts on Meaningful Assessment of Problem-Solving Tasks in the Classroom" by K. C. Cheung uses the metaphor of a competence ladder to represent the problem-solving continuum with progressive…
Gorpas, Dimitris; Andersson-Engels, Stefan
2012-12-01
The solution of the forward problem in fluorescence molecular imaging strongly influences the successful convergence of the fluorophore reconstruction. The most common approach to meeting this problem has been to apply the diffusion approximation. However, this model is a first-order angular approximation of the radiative transfer equation, and thus is subject to some well-known limitations. This manuscript proposes a methodology that confronts these limitations by applying the radiative transfer equation in spatial regions in which the diffusion approximation gives decreased accuracy. The explicit integro differential equations that formulate this model were solved by applying the Galerkin finite element approximation. The required spatial discretization of the investigated domain was implemented through the Delaunay triangulation, while the azimuthal discretization scheme was used for the angular space. This model has been evaluated on two simulation geometries and the results were compared with results from an independent Monte Carlo method and the radiative transfer equation by calculating the absolute values of the relative errors between these models. The results show that the proposed forward solver can approximate the radiative transfer equation and the Monte Carlo method with better than 95% accuracy, while the accuracy of the diffusion approximation is approximately 10% lower.
Scalable Nonlinear Solvers for Fully Implicit Coupled Nuclear Fuel Modeling. Final Report
Cai, Xiao-Chuan; Keyes, David; Yang, Chao; Zheng, Xiang; Pernice, Michael
2014-09-29
The focus of the project is on the development and customization of some highly scalable domain decomposition based preconditioning techniques for the numerical solution of nonlinear, coupled systems of partial differential equations (PDEs) arising from nuclear fuel simulations. These high-order PDEs represent multiple interacting physical fields (for example, heat conduction, oxygen transport, solid deformation), each is modeled by a certain type of Cahn-Hilliard and/or Allen-Cahn equations. Most existing approaches involve a careful splitting of the fields and the use of field-by-field iterations to obtain a solution of the coupled problem. Such approaches have many advantages such as ease of implementation since only single field solvers are needed, but also exhibit disadvantages. For example, certain nonlinear interactions between the fields may not be fully captured, and for unsteady problems, stable time integration schemes are difficult to design. In addition, when implemented on large scale parallel computers, the sequential nature of the field-by-field iterations substantially reduces the parallel efficiency. To overcome the disadvantages, fully coupled approaches have been investigated in order to obtain full physics simulations.
An efficient direct solver for rarefied gas flows with arbitrary statistics
NASA Astrophysics Data System (ADS)
Diaz, Manuel A.; Yang, Jaw-Yen
2016-01-01
A new numerical methodology associated with a unified treatment is presented to solve the Boltzmann-BGK equation of gas dynamics for the classical and quantum gases described by the Bose-Einstein and Fermi-Dirac statistics. Utilizing a class of globally-stiffly-accurate implicit-explicit Runge-Kutta scheme for the temporal evolution, associated with the discrete ordinate method for the quadratures in the momentum space and the weighted essentially non-oscillatory method for the spatial discretization, the proposed scheme is asymptotic-preserving and imposes no non-linear solver or requires the knowledge of fugacity and temperature to capture the flow structures in the hydrodynamic (Euler) limit. The proposed treatment overcomes the limitations found in the work by Yang and Muljadi (2011) [33] due to the non-linear nature of quantum relations, and can be applied in studying the dynamics of a gas with internal degrees of freedom with correct values of the ratio of specific heat for the flow regimes for all Knudsen numbers and energy wave lengths. The present methodology is numerically validated with the unified treatment by the one-dimensional shock tube problem and the two-dimensional Riemann problems for gases of arbitrary statistics. Descriptions of ideal quantum gases including rotational degrees of freedom have been successfully achieved under the proposed methodology.
An efficient direct solver for rarefied gas flows with arbitrary statistics
Diaz, Manuel A.; Yang, Jaw-Yen
2016-01-15
A new numerical methodology associated with a unified treatment is presented to solve the Boltzmann–BGK equation of gas dynamics for the classical and quantum gases described by the Bose–Einstein and Fermi–Dirac statistics. Utilizing a class of globally-stiffly-accurate implicit–explicit Runge–Kutta scheme for the temporal evolution, associated with the discrete ordinate method for the quadratures in the momentum space and the weighted essentially non-oscillatory method for the spatial discretization, the proposed scheme is asymptotic-preserving and imposes no non-linear solver or requires the knowledge of fugacity and temperature to capture the flow structures in the hydrodynamic (Euler) limit. The proposed treatment overcomes the limitations found in the work by Yang and Muljadi (2011) [33] due to the non-linear nature of quantum relations, and can be applied in studying the dynamics of a gas with internal degrees of freedom with correct values of the ratio of specific heat for the flow regimes for all Knudsen numbers and energy wave lengths. The present methodology is numerically validated with the unified treatment by the one-dimensional shock tube problem and the two-dimensional Riemann problems for gases of arbitrary statistics. Descriptions of ideal quantum gases including rotational degrees of freedom have been successfully achieved under the proposed methodology.
Little, Max A.; Jones, Nick S.
2011-01-01
Removing noise from piecewise constant (PWC) signals is a challenging signal processing problem arising in many practical contexts. For example, in exploration geosciences, noisy drill hole records need to be separated into stratigraphic zones, and in biophysics, jumps between molecular dwell states have to be extracted from noisy fluorescence microscopy signals. Many PWC denoising methods exist, including total variation regularization, mean shift clustering, stepwise jump placement, running medians, convex clustering shrinkage and bilateral filtering; conventional linear signal processing methods are fundamentally unsuited. This paper (part I, the first of two) shows that most of these methods are associated with a special case of a generalized functional, minimized to achieve PWC denoising. The minimizer can be obtained by diverse solver algorithms, including stepwise jump placement, convex programming, finite differences, iterated running medians, least angle regression, regularization path following and coordinate descent. In the second paper, part II, we introduce novel PWC denoising methods, and comparisons between these methods performed on synthetic and real signals, showing that the new understanding of the problem gained in part I leads to new methods that have a useful role to play. PMID:22003312
Little, Max A; Jones, Nick S
2011-11-08
Removing noise from piecewise constant (PWC) signals is a challenging signal processing problem arising in many practical contexts. For example, in exploration geosciences, noisy drill hole records need to be separated into stratigraphic zones, and in biophysics, jumps between molecular dwell states have to be extracted from noisy fluorescence microscopy signals. Many PWC denoising methods exist, including total variation regularization, mean shift clustering, stepwise jump placement, running medians, convex clustering shrinkage and bilateral filtering; conventional linear signal processing methods are fundamentally unsuited. This paper (part I, the first of two) shows that most of these methods are associated with a special case of a generalized functional, minimized to achieve PWC denoising. The minimizer can be obtained by diverse solver algorithms, including stepwise jump placement, convex programming, finite differences, iterated running medians, least angle regression, regularization path following and coordinate descent. In the second paper, part II, we introduce novel PWC denoising methods, and comparisons between these methods performed on synthetic and real signals, showing that the new understanding of the problem gained in part I leads to new methods that have a useful role to play.
A Fast Poisson Solver with Periodic Boundary Conditions for GPU Clusters in Various Configurations
NASA Astrophysics Data System (ADS)
Rattermann, Dale Nicholas
Fast Poisson solvers using the Fast Fourier Transform on uniform grids are especially suited for parallel implementation, making them appropriate for portability on graphical processing unit (GPU) devices. The goal of the following work was to implement, test, and evaluate a fast Poisson solver for periodic boundary conditions for use on a variety of GPU configurations. The solver used in this research was FLASH, an immersed-boundary-based method, which is well suited for complex, time-dependent geometries, has robust adaptive mesh refinement/de-refinement capabilities to capture evolving flow structures, and has been successfully implemented on conventional, parallel supercomputers. However, these solvers are still computationally costly to employ, and the total solver time is dominated by the solution of the pressure Poisson equation using state-of-the-art multigrid methods. FLASH improves the performance of its multigrid solvers by integrating a parallel FFT solver on a uniform grid during a coarse level. This hybrid solver could then be theoretically improved by replacing the highly-parallelizable FFT solver with one that utilizes GPUs, and, thus, was the motivation for my research. In the present work, the CPU-utilizing parallel FFT solver (PFFT) used in the base version of FLASH for solving the Poisson equation on uniform grids has been modified to enable parallel execution on CUDA-enabled GPU devices. New algorithms have been implemented to replace the Poisson solver that decompose the computational domain and send each new block to a GPU for parallel computation. One-dimensional (1-D) decomposition of the computational domain minimizes the amount of network traffic involved in this bandwidth-intensive computation by limiting the amount of all-to-all communication required between processes. Advanced techniques have been incorporated and implemented in a GPU-centric code design, while allowing end users the flexibility of parameter control at runtime in
A Computer Based Problem Solving Environment in Chemistry
ERIC Educational Resources Information Center
Bilgin, Ibrahim; Karakirik, Erol
2005-01-01
The purpose of this study was to introduce the Mole Solver, a computer based system that facilitates monitors and improves the students' problems solving skills on mole concept. The system has three distinct modes that: i) finds step by step solutions to the word problems on the mole concept ii) enable students' to solve word problems on their own…
A Computer Based Problem Solving Environment in Chemistry
ERIC Educational Resources Information Center
Bilgin, Ibrahim; Karakirik, Erol
2005-01-01
The purpose of this study was to introduce the Mole Solver, a computer based system that facilitates monitors and improves students' problem solving skills on mole concept. The system has three distinct modes that: (1) find step by step solutions to the word problems on the mole concept; (2) enable students to solve word problems on their own by…
Productive and Re-Productive Thinking in Solving Insight Problems
ERIC Educational Resources Information Center
Cunningham, J. Barton; MacGregor, James N.
2014-01-01
Many innovations in organizations result when people discover insightful solutions to problems. Insightful problem-solving was considered by Gestalt psychologists to be associated with productive, as opposed to re-productive, thinking. Productive thinking is characterized by shifts in perspective which allow the problem solver to consider new,…
NASA Astrophysics Data System (ADS)
Balsara, Dinshaw S.; Kim, Jinho
2016-05-01
The relativistic magnetohydrodynamics (RMHD) set of equations has recently seen an increased use in astrophysical computations. Even so, RMHD codes remain fragile. The reconstruction can sometimes yield superluminal velocities in certain parts of the mesh. The current generation of RMHD codes does not have any particularly good strategy for avoiding such an unphysical situation. In this paper we present a reconstruction strategy that overcomes this problem by making a single conservative to primitive transformation per cell followed by higher order WENO reconstruction on a carefully chosen set of primitives that guarantee subluminal reconstruction of the flow variables. For temporal evolution via a predictor step we also present second, third and fourth order accurate ADER methods that keep the velocity subluminal during the predictor step. The methods presented here are very general and should apply to other PDE systems where physical realizability is most easily asserted in the primitive variables. The RMHD system also requires the magnetic field to be evolved in a divergence-free fashion. In the treatment of classical numerical MHD the analogous issue has seen much recent progress with the advent of multidimensional Riemann solvers. By developing multidimensional Riemann solvers for RMHD, we show that similar advances extend to RMHD. As a result, the face-centered magnetic fields can be evolved much more accurately using the edge-centered electric fields in the corrector step. Those edge-centered electric fields come from a multidimensional Riemann solver for RMHD which we present in this paper. The overall update results in a one-step, fully conservative scheme that is suited for AMR. In this paper we also develop several new test problems for RMHD. We show that RMHD vortices can be designed that propagate on the computational mesh as self-preserving structures. These RMHD vortex test problems provide a means to do truly multidimensional accuracy testing for
GORRAM: Introducing accurate operational-speed radiative transfer Monte Carlo solvers
NASA Astrophysics Data System (ADS)
Buras-Schnell, Robert; Schnell, Franziska; Buras, Allan
2016-06-01
We present a new approach for solving the radiative transfer equation in horizontally homogeneous atmospheres. The motivation was to develop a fast yet accurate radiative transfer solver to be used in operational retrieval algorithms for next generation meteorological satellites. The core component is the program GORRAM (Generator Of Really Rapid Accurate Monte-Carlo) which generates solvers individually optimized for the intended task. These solvers consist of a Monte Carlo model capable of path recycling and a representative set of photon paths. Latter is generated using the simulated annealing technique. GORRAM automatically takes advantage of limitations on the variability of the atmosphere. Due to this optimization the number of photon paths necessary for accurate results can be reduced by several orders of magnitude. For the shown example of a forward model intended for an aerosol satellite retrieval, comparison with an exact yet slow solver shows that a precision of better than 1% can be achieved with only 36 photons. The computational time is at least an order of magnitude faster than any other type of radiative transfer solver. Merely the lookup table approach often used in satellite retrieval is faster, but on the other hand suffers from limited accuracy. This makes GORRAM-generated solvers an eligible candidate as forward model in operational-speed retrieval algorithms and data assimilation applications. GORRAM also has the potential to create fast solvers of other integrable equations.
Acceleration of FDTD mode solver by high-performance computing techniques.
Han, Lin; Xi, Yanping; Huang, Wei-Ping
2010-06-21
A two-dimensional (2D) compact finite-difference time-domain (FDTD) mode solver is developed based on wave equation formalism in combination with the matrix pencil method (MPM). The method is validated for calculation of both real guided and complex leaky modes of typical optical waveguides against the bench-mark finite-difference (FD) eigen mode solver. By taking advantage of the inherent parallel nature of the FDTD algorithm, the mode solver is implemented on graphics processing units (GPUs) using the compute unified device architecture (CUDA). It is demonstrated that the high-performance computing technique leads to significant acceleration of the FDTD mode solver with more than 30 times improvement in computational efficiency in comparison with the conventional FDTD mode solver running on CPU of a standard desktop computer. The computational efficiency of the accelerated FDTD method is in the same order of magnitude of the standard finite-difference eigen mode solver and yet require much less memory (e.g., less than 10%). Therefore, the new method may serve as an efficient, accurate and robust tool for mode calculation of optical waveguides even when the conventional eigen value mode solvers are no longer applicable due to memory limitation.
A parallel 3D poisson solver for space charge simulation in cylindrical coordinates.
Xu, J.; Ostroumov, P. N.; Nolen, J.; Physics
2008-02-01
This paper presents the development of a parallel three-dimensional Poisson solver in cylindrical coordinate system for the electrostatic potential of a charged particle beam in a circular tube. The Poisson solver uses Fourier expansions in the longitudinal and azimuthal directions, and Spectral Element discretization in the radial direction. A Dirichlet boundary condition is used on the cylinder wall, a natural boundary condition is used on the cylinder axis and a Dirichlet or periodic boundary condition is used in the longitudinal direction. A parallel 2D domain decomposition was implemented in the (r,{theta}) plane. This solver was incorporated into the parallel code PTRACK for beam dynamics simulations. Detailed benchmark results for the parallel solver and a beam dynamics simulation in a high-intensity proton LINAC are presented. When the transverse beam size is small relative to the aperture of the accelerator line, using the Poisson solver in a Cartesian coordinate system and a Cylindrical coordinate system produced similar results. When the transverse beam size is large or beam center located off-axis, the result from Poisson solver in Cartesian coordinate system is not accurate because different boundary condition used. While using the new solver, we can apply circular boundary condition easily and accurately for beam dynamic simulations in accelerator devices.
ERIC Educational Resources Information Center
Schwartz, Catherine Stein
2012-01-01
This study describes implementation of the same problem-solving activity in both online and face-to-face environments. The activity, done in the first class period or first module of a K-2 mathematics methods course, was initially used in a face-to-face class and then adapted later for use in an online class. While the task was originally designed…
ERIC Educational Resources Information Center
Metzger, Aaron; Crean, Hugh F.; Forbes-Jones, Emma L.
2009-01-01
This study examines patterns of organized activity and their concurrent association with academic achievement, problem behavior, and perceived adult support in a sample of urban, early adolescent, middle school students (mean age = 13.01; N = 2,495). Cluster analyses yielded six activity profiles: an uninvolved group (n = 775, 31.1%), a multiply…
Cwik, T.; Jamnejad, V.; Zuffada, C.
1994-12-31
The usefulness of finite element modeling follows from the ability to accurately simulate the geometry and three-dimensional fields on the scale of a fraction of a wavelength. To make this modeling practical for engineering design, it is necessary to integrate the stages of geometry modeling and mesh generation, numerical solution of the fields-a stage heavily dependent on the efficient use of a sparse matrix equation solver, and display of field information. The stages of geometry modeling, mesh generation, and field display are commonly completed using commercially available software packages. Algorithms for the numerical solution of the fields need to be written for the specific class of problems considered. Interior problems, i.e. simulating fields in waveguides and cavities, have been successfully solved using finite element methods. Exterior problems, i.e. simulating fields scattered or radiated from structures, are more difficult to model because of the need to numerically truncate the finite element mesh. To practically compute a solution to exterior problems, the domain must be truncated at some finite surface where the Sommerfeld radiation condition is enforced, either approximately or exactly. Approximate methods attempt to truncate the mesh using only local field information at each grid point, whereas exact methods are global, needing information from the entire mesh boundary. In this work, a method that couples three-dimensional finite element (FE) solutions interior to the bounding surface, with an efficient integral equation (IE) solution that exactly enforces the Sommerfeld radiation condition is developed. The bounding surface is taken to be a surface of revolution (SOR) to greatly reduce computational expense in the IE portion of the modeling.
NASA Astrophysics Data System (ADS)
S, Kyriacou; E, Kontoleontos; S, Weissenberger; L, Mangani; E, Casartelli; I, Skouteropoulou; M, Gattringer; A, Gehrer; M, Buchmayr
2014-03-01
An efficient hydraulic optimization procedure, suitable for industrial use, requires an advanced optimization tool (EASY software), a fast solver (block coupled CFD) and a flexible geometry generation tool. EASY optimization software is a PCA-driven metamodel-assisted Evolutionary Algorithm (MAEA (PCA)) that can be used in both single- (SOO) and multiobjective optimization (MOO) problems. In MAEAs, low cost surrogate evaluation models are used to screen out non-promising individuals during the evolution and exclude them from the expensive, problem specific evaluation, here the solution of Navier-Stokes equations. For additional reduction of the optimization CPU cost, the PCA technique is used to identify dependences among the design variables and to exploit them in order to efficiently drive the application of the evolution operators. To further enhance the hydraulic optimization procedure, a very robust and fast Navier-Stokes solver has been developed. This incompressible CFD solver employs a pressure-based block-coupled approach, solving the governing equations simultaneously. This method, apart from being robust and fast, also provides a big gain in terms of computational cost. In order to optimize the geometry of hydraulic machines, an automatic geometry and mesh generation tool is necessary. The geometry generation tool used in this work is entirely based on b-spline curves and surfaces. In what follows, the components of the tool chain are outlined in some detail and the optimization results of hydraulic machine components are shown in order to demonstrate the performance of the presented optimization procedure.
Dumbser, Michael; Balsara, Dinshaw S.
2016-01-01
In this paper a new, simple and universal formulation of the HLLEM Riemann solver (RS) is proposed that works for general conservative and non-conservative systems of hyperbolic equations. For non-conservative PDE, a path-conservative formulation of the HLLEM RS is presented for the first time in this paper. The HLLEM Riemann solver is built on top of a novel and very robust path-conservative HLL method. It thus naturally inherits the positivity properties and the entropy enforcement of the underlying HLL scheme. However, with just the slight additional cost of evaluating eigenvectors and eigenvalues of intermediate characteristic fields, we can represent linearly degenerate intermediate waves with a minimum of smearing. For conservative systems, our paper provides the easiest and most seamless path for taking a pre-existing HLL RS and quickly and effortlessly converting it to a RS that provides improved results, comparable with those of an HLLC, HLLD, Osher or Roe-type RS. This is done with minimal additional computational complexity, making our variant of the HLLEM RS also a very fast RS that can accurately represent linearly degenerate discontinuities. Our present HLLEM RS also transparently extends these advantages to non-conservative systems. For shallow water-type systems, the resulting method is proven to be well-balanced. Several test problems are presented for shallow water-type equations and two-phase flow models, as well as for gas dynamics with real equation of state, magnetohydrodynamics (MHD & RMHD), and nonlinear elasticity. Since our new formulation accommodates multiple intermediate waves and has a broader applicability than the original HLLEM method, it could alternatively be called the HLLI Riemann solver, where the “I” stands for the intermediate characteristic fields that can be accounted for. -- Highlights: •New simple and general path-conservative formulation of the HLLEM Riemann solver. •Application to general conservative and non
A new set of direct and iterative solvers for the TOUGH2 family of codes
Moridis, G.J.
1995-04-01
Two new solvers are discussed. LUBAND, the first routine is a direct solver for banded systems and is based on a LU decomposition with partial pivoting and row interchange. BCGSTB, the second routine, is a Preconditioned Conjugate Gradient (PCG) solver with improved speed and convergence characteristics. Bandwidth minimization and gridblock ordering schemes are also introduced into TOUGH2 to improve speed and accuracy. TOUGH2 simulates fluid and heat flows in permeable media and is used for the evaluation of WIPP and TEVES (Thermal Enhanced Vapor Extraction System) that will be used to extract solvents from the Chemical Waste Landfill at Sandia National Laboratories.
Application of an unstructured grid flow solver to planes, trains and automobiles
NASA Technical Reports Server (NTRS)
Spragle, Gregory S.; Smith, Wayne A.; Yadlin, Yoram
1993-01-01
Rampant, an unstructured flow solver developed at Fluent Inc., is used to compute three-dimensional, viscous, turbulent, compressible flow fields within complex solution domains. Rampant is an explicit, finite-volume flow solver capable of computing flow fields using either triangular (2d) or tetrahedral (3d) unstructured grids. Local time stepping, implicit residual smoothing, and multigrid techniques are used to accelerate the convergence of the explicit scheme. The paper describes the Rampant flow solver and presents flow field solutions about a plane, train, and automobile.
Irrelevance in Problem Solving
NASA Technical Reports Server (NTRS)
Levy, Alon Y.
1992-01-01
The notion of irrelevance underlies many different works in AI, such as detecting redundant facts, creating abstraction hierarchies and reformulation and modeling physical devices. However, in order to design problem solvers that exploit the notion of irrelevance, either by automatically detecting irrelevance or by being given knowledge about irrelevance, a formal treatment of the notion is required. In this paper we present a general framework for analyzing irrelevance. We discuss several properties of irrelevance and show how they vary in a space of definitions outlined by the framework. We show how irrelevance claims can be used to justify the creation of abstractions thereby suggesting a new view on the work on abstraction.