Science.gov

Sample records for general problem solver

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

  2. Using parallel banded linear system solvers in generalized eigenvalue problems

    NASA Technical Reports Server (NTRS)

    Zhang, Hong; Moss, William F.

    1993-01-01

    Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speed-up is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

  3. Navier-Stokes Solvers and Generalizations for Reacting Flow Problems

    SciTech Connect

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

  4. PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem

    PubMed Central

    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

  5. PowerPlay: Training an Increasingly General Problem Solver by Continually Searching for the Simplest Still Unsolvable Problem.

    PubMed

    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

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

  7. Junction-Generalized Riemann Problem for stiff hyperbolic balance laws in networks: An implicit solver and ADER schemes

    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.

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

  9. Wicked Problem Solvers.

    PubMed

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

  10. General complex polynomial root solver

    NASA Astrophysics Data System (ADS)

    Skowron, J.; Gould, A.

    2012-12-01

    This general complex polynomial root solver, implemented in Fortran and further optimized for binary microlenses, uses a new algorithm to solve polynomial equations and is 1.6-3 times faster than the ZROOTS subroutine that is commercially available from Numerical Recipes, depending on application. The largest improvement, when compared to naive solvers, comes from a fail-safe procedure that permits skipping the majority of the calculations in the great majority of cases, without risking catastrophic failure in the few cases that these are actually required.

  11. A generalized gyrokinetic Poisson solver

    SciTech Connect

    Lin, Z.; Lee, W.W.

    1995-03-01

    A generalized gyrokinetic Poisson solver has been developed, which employs local operations in the configuration space to compute the polarization density response. The new technique is based on the actual physical process of gyrophase-averaging. It is useful for nonlocal simulations using general geometry equilibrium. Since it utilizes local operations rather than the global ones such as FFT, the new method is most amenable to massively parallel algorithms.

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

  13. Aleph Field Solver Challenge Problem Results Summary.

    SciTech Connect

    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 mod- eling 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 challeng- ing problems important to Sandia's mission that Aleph was specifically designed to address.

  14. DPS--a computerised diagnostic problem solver.

    PubMed

    Bartos, P; Gyárfas, F; Popper, M

    1982-01-01

    The paper contains a short description of the DPS system which is a computerized diagnostic problem solver. The system is under development of the Research Institute of Medical Bionics in Bratislava, Czechoslovakia. Its underlying philosophy yields from viewing the diagnostic process as process of cognitive problem solving. The implementation of the system is based on the methods of Artificial Intelligence and utilisation of production systems and frame theory should be noted in this context. Finally a list of program modules and their characterisation is presented. PMID:6811229

  15. Scalable Adaptive Multilevel Solvers for Multiphysics Problems

    SciTech Connect

    Xu, Jinchao

    2014-12-01

    In this project, we investigated adaptive, parallel, and multilevel methods for numerical modeling of various real-world applications, including Magnetohydrodynamics (MHD), complex fluids, Electromagnetism, Navier-Stokes equations, and reservoir simulation. First, we have designed improved mathematical models and numerical discretizaitons for viscoelastic fluids and MHD. Second, we have derived new a posteriori error estimators and extended the applicability of adaptivity to various problems. Third, we have developed multilevel solvers for solving scalar partial differential equations (PDEs) as well as coupled systems of PDEs, especially on unstructured grids. Moreover, we have integrated the study between adaptive method and multilevel methods, and made significant efforts and advances in adaptive multilevel methods of the multi-physics problems.

  16. Experiences with linear solvers for oil reservoir simulation problems

    SciTech Connect

    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.

  17. 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. (MP)

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

  19. General purpose nonlinear system solver based on Newton-Krylov method.

    Energy Science and Technology Software Center (ESTSC)

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

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

  1. An optimal iterative solver for the Stokes problem

    SciTech Connect

    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.

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

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

  4. General Equation Set Solver for Compressible and Incompressible Turbomachinery Flows

    NASA Technical Reports Server (NTRS)

    Sondak, Douglas L.; Dorney, Daniel J.

    2002-01-01

    Turbomachines for propulsion applications operate with many different working fluids and flow conditions. The flow may be incompressible, such as in the liquid hydrogen pump in a rocket engine, or supersonic, such as in the turbine which may drive the hydrogen pump. Separate codes have traditionally been used for incompressible and compressible flow solvers. The General Equation Set (GES) method can be used to solve both incompressible and compressible flows, and it is not restricted to perfect gases, as are many compressible-flow turbomachinery solvers. An unsteady GES turbomachinery flow solver has been developed and applied to both air and water flows through turbines. It has been shown to be an excellent alternative to maintaining two separate codes.

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

  6. A generalized Poisson solver for first-principles device simulations

    NASA Astrophysics Data System (ADS)

    Bani-Hashemian, Mohammad Hossein; Brück, Sascha; Luisier, Mathieu; VandeVondele, Joost

    2016-01-01

    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.

  7. A generalized Poisson solver for first-principles device simulations.

    PubMed

    Bani-Hashemian, Mohammad Hossein; Brück, Sascha; Luisier, Mathieu; VandeVondele, Joost

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

  8. Parallel Auxiliary Space AMG Solver for $H(div)$ Problems

    SciTech Connect

    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.

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

  10. A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments.

    PubMed

    Fisicaro, G; Genovese, L; Andreussi, O; Marzari, N; Goedecker, S

    2016-01-01

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

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

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

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

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

  15. Problem Solvers: Problem--Area beyond the Formula

    ERIC Educational Resources Information Center

    Dean, Chrystal

    2014-01-01

    In this article, associate professor Chrystal Dean describes how teachers can challenge their upper elementary students' understanding of area beyond a memorized formula. Herein she describes an activity that will show students the "why" behind using A = l × w to solve rectangular area problems. The activity will help deepen…

  16. Organization of Classical Genetics Problems by Faculty Problem Solvers.

    ERIC Educational Resources Information Center

    Smith, Mike U.

    This paper is a progress report of the first phase of a project which essentially seeks to replicate previous studies using the successful/unsuccessful design in an attempt to: (1) corroborate the surface/deep structure conclusion which has become an essential component of an understanding of problem-solving; (2) examine more closely the nature of…

  17. Polyurethanes: versatile materials and sustainable problem solvers for today's challenges.

    PubMed

    Engels, Hans-Wilhelm; Pirkl, Hans-Georg; Albers, Reinhard; Albach, Rolf W; Krause, Jens; Hoffmann, Andreas; Casselmann, Holger; Dormish, Jeff

    2013-09-01

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

  18. Multiply scaled constrained nonlinear equation solvers. [for nonlinear heat conduction problems

    NASA Technical Reports Server (NTRS)

    Padovan, Joe; Krishna, Lala

    1986-01-01

    To improve the numerical stability of nonlinear equation solvers, a partitioned multiply scaled constraint scheme is developed. This scheme enables hierarchical levels of control for nonlinear equation solvers. To complement the procedure, partitioned convergence checks are established along with self-adaptive partitioning schemes. Overall, such procedures greatly enhance the numerical stability of the original solvers. To demonstrate and motivate the development of the scheme, the problem of nonlinear heat conduction is considered. In this context the main emphasis is given to successive substitution-type schemes. To verify the improved numerical characteristics associated with partitioned multiply scaled solvers, results are presented for several benchmark examples.

  19. Generalized methods and solvers for noise removal from piecewise constant signals. II. New methods

    PubMed Central

    Little, Max A.; Jones, Nick S.

    2011-01-01

    Removing noise from signals which are piecewise constant (PWC) is a challenging signal processing problem that arises in many practical scientific and engineering contexts. In the first paper (part I) of this series of two, we presented background theory building on results from the image processing community to show that the majority of these algorithms, and more proposed in the wider literature, are each associated with a special case of a generalized functional, that, when minimized, solves the PWC denoising problem. It shows how the minimizer can be obtained by a range of computational solver algorithms. In this second paper (part II), using this understanding developed in part I, we introduce several novel PWC denoising methods, which, for example, combine the global behaviour of mean shift clustering with the local smoothing of total variation diffusion, and show example solver algorithms for these new methods. Comparisons between these methods are performed on synthetic and real signals, revealing that our new methods have a useful role to play. Finally, overlaps between the generalized methods of these two papers and others such as wavelet shrinkage, hidden Markov models, and piecewise smooth filtering are touched on. PMID:22003313

  20. PDRK: A General Kinetic Dispersion Relation Solver for Magnetized Plasma

    NASA Astrophysics Data System (ADS)

    Xie, Huasheng; Xiao, Yong

    2016-02-01

    A general, fast, and effective approach is developed for numerical calculation of kinetic plasma linear dispersion relations. The plasma dispersion function is approximated by J-pole expansion. Subsequently, the dispersion relation is transformed to a standard matrix eigenvalue problem of an equivalent linear system. Numerical solutions for the least damped or fastest growing modes using an 8-pole expansion are generally accurate; more strongly damped modes are less accurate, but are less likely to be of physical interest. In contrast to conventional approaches, such as Newton's iterative method, this approach can give either all the solutions in the system or a few solutions around the initial guess. It is also free from convergence problems. The approach is demonstrated for electrostatic dispersion equations with one-dimensional and two-dimensional wavevectors, and for electromagnetic kinetic magnetized plasma dispersion relation for bi-Maxwellian distribution with relative parallel velocity flows between species. supported by the National Magnetic Confinement Fusion Science Program of China (Nos. 2015GB110003, 2011GB105001, 2013GB111000), National Natural Science Foundation of China (No. 91130031), the Recruitment Program of Global Youth Experts

  1. Black box multigrid solver for definite and indefinite problems

    SciTech Connect

    Shapira, Yair

    1997-02-01

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

  2. Fast solver for large scale eddy current non-destructive evaluation problems

    NASA Astrophysics Data System (ADS)

    Lei, Naiguang

    Eddy current testing plays a very important role in non-destructive evaluations of conducting test samples. Based on Faraday's law, an alternating magnetic field source generates induced currents, called eddy currents, in an electrically conducting test specimen. The eddy currents generate induced magnetic fields that oppose the direction of the inducing magnetic field in accordance with Lenz's law. In the presence of discontinuities in material property or defects in the test specimen, the induced eddy current paths are perturbed and the associated magnetic fields can be detected by coils or magnetic field sensors, such as Hall elements or magneto-resistance sensors. Due to the complexity of the test specimen and the inspection environments, the availability of theoretical simulation models is extremely valuable for studying the basic field/flaw interactions in order to obtain a fuller understanding of non-destructive testing phenomena. Theoretical models of the forward problem are also useful for training and validation of automated defect detection systems. Theoretical models generate defect signatures that are expensive to replicate experimentally. In general, modelling methods can be classified into two categories: analytical and numerical. Although analytical approaches offer closed form solution, it is generally not possible to obtain largely due to the complex sample and defect geometries, especially in three-dimensional space. Numerical modelling has become popular with advances in computer technology and computational methods. However, due to the huge time consumption in the case of large scale problems, accelerations/fast solvers are needed to enhance numerical models. This dissertation describes a numerical simulation model for eddy current problems using finite element analysis. Validation of the accuracy of this model is demonstrated via comparison with experimental measurements of steam generator tube wall defects. These simulations generating two

  3. Efficient Solvers for Linear Elasticity Problems Based on the Discrete Fourier Transform and TFETI Decomposition

    NASA Astrophysics Data System (ADS)

    Mocek, Lukas; Kozubek, Tomas

    2011-09-01

    The paper deals with the numerical solution of elliptic boundary value problems for 2D linear elasticity using the fictitious domain method in combination with the discrete Fourier transform and the FETI domain decomposition. We briefly mention the theoretical background of these methods, introduce resulting solvers, and demonstrate their efficiency on model benchmarks.

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

  5. Generalized emissivity inverse problem.

    PubMed

    Ming, DengMing; Wen, Tao; Dai, XianXi; Dai, JiXin; Evenson, William E

    2002-04-01

    Inverse problems have recently drawn considerable attention from the physics community due to of potential widespread applications [K. Chadan and P. C. Sabatier, Inverse Problems in Quantum Scattering Theory, 2nd ed. (Springer Verlag, Berlin, 1989)]. An inverse emissivity problem that determines the emissivity g(nu) from measurements of only the total radiated power J(T) has recently been studied [Tao Wen, DengMing Ming, Xianxi Dai, Jixin Dai, and William E. Evenson, Phys. Rev. E 63, 045601(R) (2001)]. In this paper, a new type of generalized emissivity and transmissivity inverse (GETI) problem is proposed. The present problem differs from our previous work on inverse problems by allowing the unknown (emissivity) function g(nu) to be temperature dependent as well as frequency dependent. Based on published experimental information, we have developed an exact solution formula for this GETI problem. A universal function set suggested for numerical calculation is shown to be robust, making this inversion method practical and convenient for realistic calculations. PMID:12005916

  6. Implicit solvers for large-scale nonlinear problems

    SciTech Connect

    Keyes, D E; Reynolds, D; Woodward, C S

    2006-07-13

    Computational scientists are grappling with increasingly complex, multi-rate applications that couple such physical phenomena as fluid dynamics, electromagnetics, radiation transport, chemical and nuclear reactions, and wave and material propagation in inhomogeneous media. Parallel computers with large storage capacities are paving the way for high-resolution simulations of coupled problems; however, hardware improvements alone will not prove enough to enable simulations based on brute-force algorithmic approaches. To accurately capture nonlinear couplings between dynamically relevant phenomena, often while stepping over rapid adjustments to quasi-equilibria, simulation scientists are increasingly turning to implicit formulations that require a discrete nonlinear system to be solved for each time step or steady state solution. Recent advances in iterative methods have made fully implicit formulations a viable option for solution of these large-scale problems. In this paper, we overview one of the most effective iterative methods, Newton-Krylov, for nonlinear systems and point to software packages with its implementation. We illustrate the method with an example from magnetically confined plasma fusion and briefly survey other areas in which implicit methods have bestowed important advantages, such as allowing high-order temporal integration and providing a pathway to sensitivity analyses and optimization. Lastly, we overview algorithm extensions under development motivated by current SciDAC applications.

  7. Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory

    PubMed Central

    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

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

    NASA Astrophysics Data System (ADS)

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

    2009-06-01

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

  9. Stability analysis of a general toeplitz systems solver

    NASA Astrophysics Data System (ADS)

    Bojanczyk, Adam; Brent, Richard; Hoog, Frank

    1995-09-01

    We show that a fast algorithm for theQR factorization of a Toeplitz or Hankel matrixA is weakly stable in the sense thatRTR is close toATA. Thus, when the algorithm is used to solve the semi-normal equationsRTRxDATb, we obtain a weakly stable method for the solution of a nonsingular Toeplitz or Hankel linear systemAxDb. The algorithm also applies to the solution of the full-rank Toeplitz or Hankel least squares problem min ||Ax-b||2.

  10. OREGANO_VE: a new parallelised 3D solver for the general (non-)linear Maxwell visco-elastic problem: validation and application to the calculation of surface deformation in the earthquake cycle

    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

  11. Larger groups of passerines are more efficient problem solvers in the wild.

    PubMed

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

  12. A high-order integral solver for scalar problems of diffraction by screens and apertures in three-dimensional space

    SciTech Connect

    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.

  13. Problem Solvers

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

  14. Knowledge-based design of generate-and-patch problem solvers that solve global resource assignment problems

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

  15. GPU accelerated solver for nonlinear reaction-diffusion systems. Application to the electrophysiology problem

    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.

  16. Analysis, tuning and comparison of two general sparse solvers for distributed memory computers

    SciTech Connect

    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.

  17. IDSOLVER: A general purpose solver for nth-order integro-differential equations

    NASA Astrophysics Data System (ADS)

    Gelmi, Claudio A.; Jorquera, Héctor

    2014-01-01

    Many mathematical models of complex processes may be posed as integro-differential equations (IDE). Many numerical methods have been proposed for solving those equations, but most of them are ad hoc thus new equations have to be solved from scratch for translating the IDE into the framework of the specific method chosen. Furthermore, there is a paucity of general-purpose numerical solvers that free the user from additional tasks.

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

  19. The Human Mind As General Problem Solver, Is Observed To Find ``Best'' Solutions, That Correspond To Highest Mental Coherence: Will Discuss ``sing Glass Type Theory'' of Princeton Physicist J J Hopfield, Points To How Best Use Our Own Human Mind!!

    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.

  20. General Solution of the Kenamond HE Problem 3

    SciTech Connect

    Kaul, Ann

    2015-12-15

    A general solution for programmed burn calculations of the light times produced by a singlepoint initiation of a single HE region surrounding an inert region has been developed. In contrast to the original solutions proposed in References 1 and 2, the detonator is no longer restricted to a location on a Cartesian axis and can be located at any point inside the HE region. This general solution has been implemented in the ExactPack suite of exact solvers for verification problems.

  1. Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report

    SciTech Connect

    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

  2. A new efficient formulation of the HLLEM Riemann solver for general conservative and non-conservative hyperbolic systems

    NASA Astrophysics Data System (ADS)

    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.

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

  4. Nursing Students as Change Agents and Problem Solvers in the Community: Community-based Nursing Education in Practice.

    ERIC Educational Resources Information Center

    Kiehl, Ermalynn M.; Wink, Diane M.

    2000-01-01

    A nursing school operates nine community nursing centers in which students practice community-based learning and act as problem solvers and change agents. Examples include effecting systemwide change in school health services, coordinating multiple agencies to meet a health need, and solving a patient's complex problems involving multiple…

  5. High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems

    PubMed Central

    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

  6. High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems.

    PubMed

    Mahadevan, Vijay S; Merzari, Elia; Tautges, Timothy; Jain, Rajeev; Obabko, Aleksandr; Smith, Michael; Fischer, Paul

    2014-08-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

  7. dftatom: A robust and general Schrödinger and Dirac solver for atomic structure calculations

    NASA Astrophysics Data System (ADS)

    Čertík, Ondřej; Pask, John E.; Vackář, Jiří

    2013-07-01

    A robust and general solver for the radial Schrödinger, Dirac, and Kohn-Sham equations is presented. The formulation admits general potentials and meshes: uniform, exponential, or other defined by nodal distribution and derivative functions. For a given mesh type, convergence can be controlled systematically by increasing the number of grid points. Radial integrations are carried out using a combination of asymptotic forms, Runge-Kutta, and implicit Adams methods. Eigenfunctions are determined by a combination of bisection and perturbation methods for robustness and speed. An outward Poisson integration is employed to increase accuracy in the core region, allowing absolute accuracies of 10-8 Hartree to be attained for total energies of heavy atoms such as uranium. Detailed convergence studies are presented and computational parameters are provided to achieve accuracies commonly required in practice. Comparisons to analytic and current-benchmark density-functional results for atomic number Z=1-92 are presented, verifying and providing a refinement to current benchmarks. An efficient, modular Fortran 95 implementation, dftatom, is provided as open source, including examples, tests, and wrappers for interface to other languages; wherein particular emphasis is placed on the independence (no global variables), reusability, and generality of the individual routines. Program summaryProgram title:dftatom Catalogue identifier: AEPA_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEPA_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: MIT license No. of lines in distributed program, including test data, etc.: 14122 No. of bytes in distributed program, including test data, etc.: 157453 Distribution format: tar.gz Programming language: Fortran 95 with interfaces to Python and C. Computer: Any computer with a Fortran 95 compiler. Operating system: Any OS with a Fortran 95 compiler. RAM: 500 MB

  8. Problem Solving with General Semantics.

    ERIC Educational Resources Information Center

    Hewson, David

    1996-01-01

    Discusses how to use general semantics formulations to improve problem solving at home or at work--methods come from the areas of artificial intelligence/computer science, engineering, operations research, and psychology. (PA)

  9. The General-Use Nodal Network Solver (GUNNS) Modeling Package for Space Vehicle Flow System Simulation

    NASA Technical Reports Server (NTRS)

    Harvey, Jason; Moore, Michael

    2013-01-01

    The General-Use Nodal Network Solver (GUNNS) is a modeling software package that combines nodal analysis and the hydraulic-electric analogy to simulate fluid, electrical, and thermal flow systems. GUNNS is developed by L-3 Communications under the TS21 (Training Systems for the 21st Century) project for NASA Johnson Space Center (JSC), primarily for use in space vehicle training simulators at JSC. It has sufficient compactness and fidelity to model the fluid, electrical, and thermal aspects of space vehicles in real-time simulations running on commodity workstations, for vehicle crew and flight controller training. It has a reusable and flexible component and system design, and a Graphical User Interface (GUI), providing capability for rapid GUI-based simulator development, ease of maintenance, and associated cost savings. GUNNS is optimized for NASA's Trick simulation environment, but can be run independently of Trick.

  10. General aviation IFR operational problems

    NASA Technical Reports Server (NTRS)

    Bolz, E. H.; Eisele, J. E.

    1979-01-01

    Operational problems of general aviation IFR operators (particularly single pilot operators) were studied. Several statistical bases were assembled and utilized to identify the more serious problems and to demonstrate their magnitude. These bases include official activity projections, historical accident data and delay data, among others. The GA operating environment and cockpit environment were analyzed in detail. Solutions proposed for each of the problem areas identified are based on direct consideration of currently planned enhancements to the ATC system, and on a realistic assessment of the present and future limitations of general aviation avionics. A coordinated set of research program is suggested which would provide the developments necessary to implement the proposed solutions.

  11. Making Sense of Math: How to Help Every Student become a Mathematical Thinker and Problem Solver (ASCD Arias)

    ERIC Educational Resources Information Center

    Seeley, Cathy L.

    2016-01-01

    In "Making Sense of Math," Cathy L. Seeley, former president of the National Council of Teachers of Mathematics, shares her insight into how to turn your students into flexible mathematical thinkers and problem solvers. This practical volume concentrates on the following areas: (1) Making sense of math by fostering habits of mind that…

  12. Application of the program package TURBO problem solver for some fluid dynamics problems

    NASA Astrophysics Data System (ADS)

    Belotserkovskaya, M. S.; Pronina, A. P.; Fortova, S. V.; Shepelev, V. V.

    2016-06-01

    A technology for building parallel applications for numerical simulation based on hyperbolic partial differential equations is described. A formalization of problems and methods that makes it possible to describe new problems and methods for their solution by configuring the universal technology for specific cases is proposed. Results of numerical simulation of spatial flows in shear layers of a compressible inviscid perfect medium and of the Rayleigh-Taylor instability are presented.

  13. Methods for Solving Gas Damping Problems in Perforated Microstructures Using a 2D Finite-Element Solver

    PubMed Central

    Veijola, Timo; Råback, Peter

    2007-01-01

    We present a straightforward method to solve gas damping problems for perforated structures in two dimensions (2D) utilising a Perforation Profile Reynolds (PPR) solver. The PPR equation is an extended Reynolds equation that includes additional terms modelling the leakage flow through the perforations, and variable diffusivity and compressibility profiles. The solution method consists of two phases: 1) determination of the specific admittance profile and relative diffusivity (and relative compressibility) profiles due to the perforation, and 2) solution of the PPR equation with a FEM solver in 2D. Rarefied gas corrections in the slip-flow region are also included. Analytic profiles for circular and square holes with slip conditions are presented in the paper. To verify the method, square perforated dampers with 16–64 holes were simulated with a three-dimensional (3D) Navier-Stokes solver, a homogenised extended Reynolds solver, and a 2D PPR solver. Cases for both translational (in normal to the surfaces) and torsional motion were simulated. The presented method extends the region of accurate simulation of perforated structures to cases where the homogenisation method is inaccurate and the full 3D Navier-Stokes simulation is too time-consuming.

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

    NASA Astrophysics Data System (ADS)

    Debreu, Laurent; Neveu, Emilie; Simon, Ehouarn; Le Dimet, Francois Xavier; Vidard, Arthur

    2014-05-01

    In order to lower the computational cost of the variational data assimilation process, we investigate the use of multigrid methods to solve the associated optimal control system. On a linear advection equation, we study the impact of the regularization term on the optimal control and the impact of discretization errors on the efficiency of the coarse grid correction step. We show that even if the optimal control problem leads to the solution of an elliptic system, numerical errors introduced by the discretization can alter the success of the multigrid methods. The view of the multigrid iteration as a preconditioner for a Krylov optimization method leads to a more robust algorithm. A scale dependent weighting of the multigrid preconditioner and the usual background error covariance matrix based preconditioner is proposed and brings significant improvements. [1] Laurent Debreu, Emilie Neveu, Ehouarn Simon, François-Xavier Le Dimet and Arthur Vidard, 2014: Multigrid solvers and multigrid preconditioners for the solution of variational data assimilation problems, submitted to QJRMS, http://hal.inria.fr/hal-00874643 [2] Emilie Neveu, Laurent Debreu and François-Xavier Le Dimet, 2011: Multigrid methods and data assimilation - Convergence study and first experiments on non-linear equations, ARIMA, 14, 63-80, http://intranet.inria.fr/international/arima/014/014005.html

  15. North Dakota's Centennial Quilt and Problem Solvers: Solutions: The Library Problem

    ERIC Educational Resources Information Center

    Small, Marian

    2010-01-01

    Quilt investigations, such as the Barn quilt problem in the December 2008/January 2009 issue of "Teaching Children Mathematics" and its solutions in last month's issue, can spark interdisciplinary pursuits for teachers and exciting connections for the full range of elementary school students. This month, North Dakota's centennial quilt problem…

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

  17. Training tomorrow's environmental problem-solvers: an integrative approach to graduate education

    Technology Transfer Automated Retrieval System (TEKTRAN)

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

  18. A scalable 2-D parallel sparse solver

    SciTech Connect

    Kothari, S.C.; Mitra, S.

    1995-12-01

    Scalability beyond a small number of processors, typically 32 or less, is known to be a problem for existing parallel general sparse (PGS) direct solvers. This paper presents a parallel general sparse PGS direct solver for general sparse linear systems on distributed memory machines. The algorithm is based on the well-known sequential sparse algorithm Y12M. To achieve efficient parallelization, a 2-D scattered decomposition of the sparse matrix is used. The proposed algorithm is more scalable than existing parallel sparse direct solvers. Its scalability is evaluated on a 256 processor nCUBE2s machine using Boeing/Harwell benchmark matrices.

  19. MILAMIN: MATLAB-based finite element method solver for large problems

    NASA Astrophysics Data System (ADS)

    Dabrowski, M.; Krotkiewski, M.; Schmid, D. W.

    2008-04-01

    The finite element method (FEM) combined with unstructured meshes forms an elegant and versatile approach capable of dealing with the complexities of problems in Earth science. Practical applications often require high-resolution models that necessitate advanced computational strategies. We therefore developed "Million a Minute" (MILAMIN), an efficient MATLAB implementation of FEM that is capable of setting up, solving, and postprocessing two-dimensional problems with one million unknowns in one minute on a modern desktop computer. MILAMIN allows the user to achieve numerical resolutions that are necessary to resolve the heterogeneous nature of geological materials. In this paper we provide the technical knowledge required to develop such models without the need to buy a commercial FEM package, programming compiler-language code, or hiring a computer specialist. It has been our special aim that all the components of MILAMIN perform efficiently, individually and as a package. While some of the components rely on readily available routines, we develop others from scratch and make sure that all of them work together efficiently. One of the main technical focuses of this paper is the optimization of the global matrix computations. The performance bottlenecks of the standard FEM algorithm are analyzed. An alternative approach is developed that sustains high performance for any system size. Applied optimizations eliminate Basic Linear Algebra Subprograms (BLAS) drawbacks when multiplying small matrices, reduce operation count and memory requirements when dealing with symmetric matrices, and increase data transfer efficiency by maximizing cache reuse. Applying loop interchange allows us to use BLAS on large matrices. In order to avoid unnecessary data transfers between RAM and CPU cache we introduce loop blocking. The optimization techniques are useful in many areas as demonstrated with our MILAMIN applications for thermal and incompressible flow (Stokes) problems. We use

  20. A fast parallel solver for the forward problem in electrical impedance tomography.

    PubMed

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

  1. A HLL-Rankine-Hugoniot Riemann solver for complex non-linear hyperbolic problems

    NASA Astrophysics Data System (ADS)

    Guy, Capdeville

    2013-10-01

    We present a new HLL-type approximate Riemann solver that aims at capturing any isolated discontinuity without necessitating extensive characteristic analysis of governing partial differential equations. This property is especially attractive for complex hyperbolic systems with more than two equations. Following Linde's (2002) approach [6], we introduce a generic middle wave into the classical two-state HLL solver. The property of this third wave is typified by the way of a "strength indicator" that is derived from polynomial considerations. The polynomial that constitutes the basis of the procedure is made non-oscillatory by an adapted fourth-order WENO algorithm (CWENO4). This algorithm makes it possible to derive an expression for the strength indicator. According to the size of this latter parameter, the resulting solver (HLL-RH), either computes the multi-dimensional Rankine-Hugoniot equations if an isolated discontinuity appears in the Riemann fan, or asymptotically tends towards the two-state HLL solver if the solution is locally smooth. The asymptotic version of the HLL-RH solver is demonstrated to be positively conservative and entropy satisfying in its first-order multi-dimensional form provided that a relevant and not too restrictive CFL condition is considered; specific limitations of the conservative increments of the numerical solution and a suited entropy condition enable to maintain these properties in its high-order version. With a monotonicity-preserving algorithm for the time integration, the numerical method so generated, is third order in time and fourth-order accurate in space for the smooth part of the solution; moreover, the scheme is stable and accurate when capturing a shock wave, whatever the complexity of the underlying differential system. Extensive numerical tests for the one- and two-dimensional Euler equation of gas dynamics and comparisons with classical Godunov-type methods help to point out the potentialities and insufficiencies

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

  3. Approximate Riemann solvers for the Godunov SPH (GSPH)

    NASA Astrophysics Data System (ADS)

    Puri, Kunal; Ramachandran, Prabhu

    2014-08-01

    The Godunov Smoothed Particle Hydrodynamics (GSPH) method is coupled with non-iterative, approximate Riemann solvers for solutions to the compressible Euler equations. The use of approximate solvers avoids the expensive solution of the non-linear Riemann problem for every interacting particle pair, as required by GSPH. In addition, we establish an equivalence between the dissipative terms of GSPH and the signal based SPH artificial viscosity, under the restriction of a class of approximate Riemann solvers. This equivalence is used to explain the anomalous “wall heating” experienced by GSPH and we provide some suggestions to overcome it. Numerical tests in one and two dimensions are used to validate the proposed Riemann solvers. A general SPH pairing instability is observed for two-dimensional problems when using unequal mass particles. In general, Ducowicz Roe's and HLLC approximate Riemann solvers are found to be suitable replacements for the iterative Riemann solver in the original GSPH scheme.

  4. A new solver for the elastic normal contact problem using conjugate gradients, deflation, and an FFT-based preconditioner

    NASA Astrophysics Data System (ADS)

    Vollebregt, E. A. H.

    2014-01-01

    This paper presents our new solver BCCG+FAI for solving elastic normal contact problems. This is a comprehensible approach that is based on the Conjugate Gradients (CG) algorithm and that uses FFTs. A first novel aspect is the definition of the “FFT-based Approximate Inverse” preconditioner. The underlying idea is that the inverse matrix can be approximated well using a Toeplitz or block-Toeplitz form, which can be computed using the FFT of the original matrix elements. This preconditioner makes the total number of CG iterations effectively constant in 2D and very slowly increasing in 3D problems. A second novelty is how we deal with a prescribed total force. This uses a deflation technique in such a way that CGs convergence and finite termination properties are maintained. Numerical results show that this solver is more effective than existing CG-based strategies, such that it can compete with Multi-Grid strategies over a much larger problem range. In our opinion it could be the new method of choice because of its simple structure and elegant theory, and because robust performance is achieved independently of any problem specific parameters.

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

    NASA Astrophysics Data System (ADS)

    Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María

    2014-06-01

    We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the

  6. A More General Solution of the Kenamond HE Problem 2

    SciTech Connect

    Kaul, Ann

    2015-12-15

    A more general solution for programmed burn calculations of the light times produced by an unobstructed line-of-sight, multi-point initiation of a composite HE region has been developed. The equations describing the interfaces between detonation fronts have also been included. In contrast to the original solutions proposed in References 1 and 2, four of the detonators are no longer restricted to specific locations on a Cartesian axis and can be located at any point inside the HE region. For the proposed solution, one detonator must be located at the origin. The more general solution for any locations on the 2D y-axis or 3D z-axis has been implemented in the ExactPack suite of exact solvers for verification problems. It could easily be changed to the most general case outlined above.

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

    NASA Astrophysics Data System (ADS)

    Li, Gang; Zhang, Lili; Hao, Tianyao

    2016-02-01

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

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

    SciTech Connect

    Oosterlee, C.W.; Washio, T.

    1996-12-31

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

  9. A fast algorithm for parabolic PDE-based inverse problems based on Laplace transforms and flexible Krylov solvers

    SciTech Connect

    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.

  10. TRIQS/CTHYB: A continuous-time quantum Monte Carlo hybridisation expansion solver for quantum impurity problems

    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.

  11. Coaching Family Caregivers to Become Better Problem Solvers When Caring for Persons with Advanced Cancer.

    PubMed

    Dionne-Odom, J Nicholas; Lyons, Kathleen D; Akyar, Imatullah; Bakitas, Marie A

    2016-01-01

    Family caregivers of persons with advanced cancer often take on responsibilities that present daunting and complex problems. Serious problems that go unresolved may be burdensome and result in negative outcomes for caregivers' psychological and physical health and affect the quality of care delivered to the care recipients with cancer, especially at the end of life. Formal problem-solving training approaches have been developed over the past several decades to assist individuals with managing problems faced in daily life. Several of these problem-solving principles and techniques were incorporated into ENABLE (Educate, Nurture, Advise, Before Life End), an "early" palliative care telehealth intervention for individuals diagnosed with advanced cancer and their family caregivers. A hypothetical case resembling the situations of actual caregiver participants in ENABLE that exemplifies the complex problems that caregivers face is presented, followed by presentation of an overview of ENABLE's problem-solving key principles, techniques, and steps in problem-solving support. Though more research is needed to formally test the use of problem-solving support in social work practice, social workers can easily incorporate these techniques into everyday practice. PMID:27143574

  12. Applied Mathematics: Targets for Learning. Strategies for Preparing Successful Problem Solvers in the Workplace.

    ERIC Educational Resources Information Center

    Ohio State Univ., Columbus. Vocational Instructional Materials Lab.

    This curriculum guide provides resources that teachers and trainers can use to help learners improve their ability to apply mathematical problem-solving skills in the workplace. The instructional strategies and practice problems in the guide are patterned after those of the American College Testing (ACT) Work Keys System. Gains in skill levels can…

  13. Applied Technology: Targets for Learning. Preparing Successful Problem Solvers in the Workplace.

    ERIC Educational Resources Information Center

    Ohio State Univ., Columbus. Vocational Instructional Materials Lab.

    This curriculum guide provides resources that teachers and trainers can use to help learners improve their ability to apply technology problem-solving skills in the workplace. The instructional strategies and practice problems in the guide are patterned after those of the American College Testing (ACT) Work Keys System. Gains in skill levels can…

  14. Composite solvers for linear saddle point problems arising from the incompressible Stokes equations with highly heterogeneous viscosity structure

    NASA Astrophysics Data System (ADS)

    Sanan, P.; Schnepp, S. M.; May, D.; Schenk, O.

    2014-12-01

    Geophysical applications require efficient forward models for non-linear Stokes flow on high resolution spatio-temporal domains. The bottleneck in applying the forward model is solving the linearized, discretized Stokes problem which takes the form of a large, indefinite (saddle point) linear system. Due to the heterogeniety of the effective viscosity in the elliptic operator, devising effective preconditioners for saddle point problems has proven challenging and highly problem-dependent. Nevertheless, at least three approaches show promise for preconditioning these difficult systems in an algorithmically scalable way using multigrid and/or domain decomposition techniques. The first is to work with a hierarchy of coarser or smaller saddle point problems. The second is to use the Schur complement method to decouple and sequentially solve for the pressure and velocity. The third is to use the Schur decomposition to devise preconditioners for the full operator. These involve sub-solves resembling inexact versions of the sequential solve. The choice of approach and sub-methods depends crucially on the motivating physics, the discretization, and available computational resources. Here we examine the performance trade-offs for preconditioning strategies applied to idealized models of mantle convection and lithospheric dynamics, characterized by large viscosity gradients. Due to the arbitrary topological structure of the viscosity field in geodynamical simulations, we utilize low order, inf-sup stable mixed finite element spatial discretizations which are suitable when sharp viscosity variations occur in element interiors. Particular attention is paid to possibilities within the decoupled and approximate Schur complement factorization-based monolithic approaches to leverage recently-developed flexible, communication-avoiding, and communication-hiding Krylov subspace methods in combination with `heavy' smoothers, which require solutions of large per-node sub-problems, well

  15. Bridging the Problem-Solver Communication Gap: Toward an Art of Professional Case Design.

    ERIC Educational Resources Information Center

    Johnson, Robert; Simpson, Mark

    1990-01-01

    Evaluates well-designed cases involving students in situations which simulate those outside the classroom environment. Offers additional features based on problem solving and rhetorical theory to help make cases more adaptable to the field of professional communications. Describes examples of two types of cases which put the theory into practice.…

  16. Motivation in Adult Education: A Problem Solver or a Euphemism for Direction and Control?

    ERIC Educational Resources Information Center

    Ahl, Helene

    2006-01-01

    Adults' motivation to participate in continued education is of immediate interest, as lifelong learning is now considered as the solution to the pressing problems of increased levels of unemployment, not least among unskilled workers. Many theories concerning motivation and adult education maintain that individuals are innately motivated to learn,…

  17. A fast nested dissection solver for Cartesian 3D elliptic problems using hierarchical matrices

    NASA Astrophysics Data System (ADS)

    Schmitz, Phillip G.; Ying, Lexing

    2014-02-01

    We present a fast algorithm for solutions to linear systems arising from three dimensional elliptic problems on a regular Cartesian mesh. We follow the approach of Schmitz and Ying (2012) on combining the nested dissection matrix factorization method with hierarchical matrices in two dimensions and extend it to the three dimensional case. A theoretical linear time complexity is derived and a more practical variant with slightly worse scaling is demonstrated.

  18. Analysis of a parallelized nonlinear elliptic boundary value problem solver with application to reacting flows

    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.

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

    PubMed

    Chentanez, Nuttapong; Müller-Fischer, Matthias

    2012-08-01

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

  20. Software-engineering challenges of building and deploying reusable problem solvers.

    PubMed

    O'Connor, Martin J; Nyulas, Csongor; Tu, Samson; Buckeridge, David L; Okhmatovskaia, Anna; Musen, Mark A

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

  1. Software-engineering challenges of building and deploying reusable problem solvers

    PubMed Central

    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

  2. Parallel Multigrid Equation Solver

    Energy Science and Technology Software Center (ESTSC)

    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.

  3. Generalized spectral decomposition for stochastic nonlinear problems

    SciTech Connect

    Nouy, Anthony Le Maitre, Olivier P.

    2009-01-10

    We present an extension of the generalized spectral decomposition method for the resolution of nonlinear stochastic problems. The method consists in the construction of a reduced basis approximation of the Galerkin solution and is independent of the stochastic discretization selected (polynomial chaos, stochastic multi-element or multi-wavelets). Two algorithms are proposed for the sequential construction of the successive generalized spectral modes. They involve decoupled resolutions of a series of deterministic and low-dimensional stochastic problems. Compared to the classical Galerkin method, the algorithms allow for significant computational savings and require minor adaptations of the deterministic codes. The methodology is detailed and tested on two model problems, the one-dimensional steady viscous Burgers equation and a two-dimensional nonlinear diffusion problem. These examples demonstrate the effectiveness of the proposed algorithms which exhibit convergence rates with the number of modes essentially dependent on the spectrum of the stochastic solution but independent of the dimension of the stochastic approximation space.

  4. Predicting mental health problems in general practitioners.

    PubMed

    Chambers, R; Belcher, J

    1994-09-01

    A total of 704 general practitioners completed questionnaires enquiring about mental health problems (response rate = 82.0%). Excessive anxiety was reported by 31.1%, troublesome depression by 13.4%, exhaustion or stress (on three or more weekdays) by 60.7%, and sleep difficulties by 47.6%. General practitioners aged 40-49 years old were most likely to report anxiety, exhaustion or stress, sexual and sleep difficulties. Retired doctors reported mental health problems markedly less often. Predictive factors for anxiety were depression, one or more nights on-call per week, and exhaustion or stress; predictive factors for depression were anxiety, and exhaustion or stress; predictive factors for exhaustion or stress were anxiety, depression, no hobbies, paperwork on three or more evenings per week, and sleep difficulties. Gender, country of origin, being single-handed, excessive alcohol consumption, and having no coping methods were not predictive factors for mental health problems. PMID:7949065

  5. A general heuristic for genome rearrangement problems.

    PubMed

    Dias, Ulisses; Galvão, Gustavo Rodrigues; Lintzmayer, Carla Négri; Dias, Zanoni

    2014-06-01

    In this paper, we present a general heuristic for several problems in the genome rearrangement field. Our heuristic does not solve any problem directly, it is rather used to improve the solutions provided by any non-optimal algorithm that solve them. Therefore, we have implemented several algorithms described in the literature and several algorithms developed by ourselves. As a whole, we implemented 23 algorithms for 9 well known problems in the genome rearrangement field. A total of 13 algorithms were implemented for problems that use the notions of prefix and suffix operations. In addition, we worked on 5 algorithms for the classic problem of sorting by transposition and we conclude the experiments by presenting results for 3 approximation algorithms for the sorting by reversals and transpositions problem and 2 approximation algorithms for the sorting by reversals problem. Another algorithm with better approximation ratio can be found for the last genome rearrangement problem, but it is purely theoretical with no practical implementation. The algorithms we implemented in addition to our heuristic lead to the best practical results in each case. In particular, we were able to improve results on the sorting by transpositions problem, which is a very special case because many efforts have been made to generate algorithms with good results in practice and some of these algorithms provide results that equal the optimum solutions in many cases. Our source codes and benchmarks are freely available upon request from the authors so that it will be easier to compare new approaches against our results. PMID:24969750

  6. Lobb's Generalization of Catalan's Parenthesization Problem

    ERIC Educational Resources Information Center

    Koshy, Thomas

    2009-01-01

    A. Lobb discovered an interesting generalization of Catalan's parenthesization problem, namely: Find the number L(n, m) of arrangements of n + m positive ones and n - m negative ones such that every partial sum is nonnegative, where 0 = m = n. This article uses Lobb's formula, L(n, m) = (2m + 1)/(n + m + 1) C(2n, n + m), where C is the usual…

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

  8. T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2

    SciTech Connect

    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.

  9. A new parallel solver suited for arbitrary semilinear parabolic partial differential equations based on generalized random trees

    NASA Astrophysics Data System (ADS)

    Acebrón, Juan A.; Rodríguez-Rozas, Ángel

    2011-09-01

    A probabilistic representation for initial value semilinear parabolic problems based on generalized random trees has been derived. Two different strategies have been proposed, both requiring generating suitable random trees combined with a Pade approximant for approximating accurately a given divergent series. Such series are obtained by summing the partial contribution to the solution coming from trees with arbitrary number of branches. The new representation greatly expands the class of problems amenable to be solved probabilistically, and was used successfully to develop a generalized probabilistic domain decomposition method. Such a method has been shown to be suited for massively parallel computers, enjoying full scalability and fault tolerance. Finally, a few numerical examples are given to illustrate the remarkable performance of the algorithm, comparing the results with those obtained with a classical method.

  10. Pliris Solver Package

    SciTech Connect

    Kotulski, Joseph D.; Womble, David E.; Greenberg, David; Driessen, Brian

    2004-03-01

    PLIRIS is an object-oriented solver built on top of a previous matrix solver used in a number of application codes. Puns solves a linear system directly via LU factorization with partial pivoting. The user provides the linear system in terms of Epetra Objects including a matrix and right-hand-sides. The user can then factor the matrix and perform the forward and back solve at a later time or solve for multiple right-hand-sides at once. This package is used when dense matrices are obtained in the problem formulation. These dense matrices occur whenever boundary element techniques are chosen for the solution procedure. This has been used in electromagnetics for both static and frequency domain problems.

  11. Pliris Solver Package

    Energy Science and Technology Software Center (ESTSC)

    2004-03-01

    PLIRIS is an object-oriented solver built on top of a previous matrix solver used in a number of application codes. Puns solves a linear system directly via LU factorization with partial pivoting. The user provides the linear system in terms of Epetra Objects including a matrix and right-hand-sides. The user can then factor the matrix and perform the forward and back solve at a later time or solve for multiple right-hand-sides at once. This packagemore » is used when dense matrices are obtained in the problem formulation. These dense matrices occur whenever boundary element techniques are chosen for the solution procedure. This has been used in electromagnetics for both static and frequency domain problems.« less

  12. Cinema, Fermi problems and general education

    NASA Astrophysics Data System (ADS)

    Efthimiou, C. J.; Llewellyn, R. A.

    2007-05-01

    During the past few years the authors have developed a new approach to the teaching of physical science, a general education course typically found in the curricula of nearly every college and university. This approach, called Physics in Films (Efthimiou and Llewellyn 2006 Phys. Teach. 44 28-33), uses scenes from popular films to illustrate physical principles and has excited student interest and improved student performance. A similar approach at the senior/high-school level, nicknamed Hollywood Physics, has been developed by Chandler (2006 Phys. Teach. 44 290-2 2002 Phys. Teach. 40 420-4). The two approaches may be considered complementary as they target different student groups. The analyses of many of the scenes in Physics in Films are a direct application of Fermi calculations—estimates and approximations designed to make solutions of complex and seemingly intractable problems understandable to the student non-specialist. The intent of this paper is to provide instructors with examples they can use to develop skill in recognizing Fermi problems and making Fermi calculations in their own courses.

  13. Fast computation of general forward gravitation problems

    NASA Astrophysics Data System (ADS)

    Casenave, Fabien; Métivier, Laurent; Pajot-Métivier, Gwendoline; Panet, Isabelle

    2016-07-01

    We consider the well-known problem of the forward computation of the gradient of the gravitational potential generated by a mass density distribution of general 3D geometry. Many methods have been developed for given geometries, and the computation time often appears as a limiting practical issue for considering large or complex problems. In this work, we develop a fast method to carry out this computation, where a tetrahedral mesh is used to model the mass density distribution. Depending on the close- or long-range nature of the involved interactions, the algorithm automatically switches between analytic integration formulae and numerical quadratic formulae, and relies on the Fast Multipole Method to drastically increase the computation speed of the long-range interactions. The parameters of the algorithm are empirically chosen for the computations to be the fastest possible while guarantying a given relative accuracy of the result. Computations that would load many-core clusters for days can now be carried out on a desk computer in minutes. The computation of the contribution of topographical masses to the Earth's gravitational field at the altitude of the GOCE satellite and over France are proposed as numerical illustrations of the method.

  14. Fast computation of general forward gravitation problems

    NASA Astrophysics Data System (ADS)

    Casenave, Fabien; Métivier, Laurent; Pajot-Métivier, Gwendoline; Panet, Isabelle

    2016-04-01

    We consider the well-known problem of the forward computation of the gradient of the gravitational potential generated by a mass density distribution of general 3D geometry. Many methods have been developed for given geometries, and the computation time often appears as a limiting practical issue for considering large or complex problems. In this work, we develop a fast method to carry out this computation, where a tetrahedral mesh is used to model the mass density distribution. Depending on the close- or long-range nature of the involved interactions, the algorithm automatically switches between analytic integration formulae and numerical quadratic formulae, and relies on the Fast Multipole Method to drastically increase the computation speed of the long-range interactions. The parameters of the algorithm are empirically chosen for the computations to be the fastest possible while guarantying a given relative accuracy of the result. Computations that would load many-core clusters for days can now be carried out on a desk computer in minutes. The computation of the contribution of topographical masses to the Earth's gravitational field at the altitude of the GOCE satellite and over France are proposed as numerical illustrations of the method.

  15. Impact of the implementation of MPI point-to-point communications on the performance of two general sparse solvers

    SciTech Connect

    Amestoy, Patrick R.; Duff, Iain S.; L'Excellent, Jean-Yves; Li, Xiaoye S.

    2001-10-10

    We examine the mechanics of the send and receive mechanism of MPI and in particular how we can implement message passing in a robust way so that our performance is not significantly affected by changes to the MPI system. This leads us to using the Isend/Irecv protocol which will entail sometimes significant algorithmic changes. We discuss this within the context of two different algorithms for sparse Gaussian elimination that we have parallelized. One is a multifrontal solver called MUMPS, the other is a supernodal solver called SuperLU. Both algorithms are difficult to parallelize on distributed memory machines. Our initial strategies were based on simple MPI point-to-point communication primitives. With such approaches, the parallel performance of both codes are very sensitive to the MPI implementation, the way MPI internal buffers are used in particular. We then modified our codes to use more sophisticated nonblocking versions of MPI communication. This significantly improved the performance robustness (independent of the MPI buffering mechanism) and scalability, but at the cost of increased code complexity.

  16. A quasi-optimal coarse problem and an augmented Krylov solver for the variational theory of complex rays

    NASA Astrophysics Data System (ADS)

    Kovalevsky, Louis; Gosselet, Pierre

    2016-09-01

    The Variational Theory of Complex Rays (VTCR) is an indirect Trefftz method designed to study systems governed by Helmholtz-like equations. It uses wave functions to represent the solution inside elements, which reduces the dispersion error compared to classical polynomial approaches but the resulting system is prone to be ill conditioned. This paper gives a simple and original presentation of the VTCR using the discontinuous Galerkin framework and it traces back the ill-conditioning to the accumulation of eigenvalues near zero for the formulation written in terms of wave amplitude. The core of this paper presents an efficient solving strategy that overcomes this issue. The key element is the construction of a search subspace where the condition number is controlled at the cost of a limited decrease of attainable precision. An augmented LSQR solver is then proposed to solve efficiently and accurately the complete system. The approach is successfully applied to different examples.

  17. A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer

    PubMed Central

    Hwang, Seong Jae; Collins, Maxwell D.; Ravi, Sathya N.; Ithapu, Vamsi K.; Adluru, Nagesh; Johnson, Sterling C.; Singh, Vikas

    2016-01-01

    Eigenvalue problems are ubiquitous in computer vision, covering a very broad spectrum of applications ranging from estimation problems in multi-view geometry to image segmentation. Few other linear algebra problems have a more mature set of numerical routines available and many computer vision libraries leverage such tools extensively. However, the ability to call the underlying solver only as a “black box” can often become restrictive. Many ‘human in the loop’ settings in vision frequently exploit supervision from an expert, to the extent that the user can be considered a subroutine in the overall system. In other cases, there is additional domain knowledge, side or even partial information that one may want to incorporate within the formulation. In general, regularizing a (generalized) eigenvalue problem with such side information remains difficult. Motivated by these needs, this paper presents an optimization scheme to solve generalized eigenvalue problems (GEP) involving a (nonsmooth) regularizer. We start from an alternative formulation of GEP where the feasibility set of the model involves the Stiefel manifold. The core of this paper presents an end to end stochastic optimization scheme for the resultant problem. We show how this general algorithm enables improved statistical analysis of brain imaging data where the regularizer is derived from other ‘views’ of the disease pathology, involving clinical measurements and other image-derived representations. PMID:27081374

  18. ALPS: A Linear Program Solver

    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.

  19. Problem Solving in the General Mathematics Classroom

    ERIC Educational Resources Information Center

    Troutman, Andria Price; Lichtenberg, Betty Plunkett

    1974-01-01

    Five steps common to different problem solving models are listed. Next, seven specific abilities related to solving problems are discussed and examples given. Sample activities, appropriate to help in developing these specific abilities, are suggested. (LS)

  20. General Description of Human Problem Solving.

    ERIC Educational Resources Information Center

    Klein, Gary A.; Weitzenfeld, Julian

    A theoretical model relating problem identification to problem solving is presented. The main purpose of the study is to increase understanding of decision making among Air Force educators. The problem-solving process is defined as the generation and evaluation of alternatives that will accomplish what is needed and the reidentification of what is…

  1. The generalized pole assignment problem. [dynamic output feedback problems

    NASA Technical Reports Server (NTRS)

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

    1979-01-01

    Two dynamic output feedback problems for a linear, strictly proper system are considered, along with their interrelationships. The problems are formulated in the frequency domain and investigated in terms of linear equations over rings of polynomials. Necessary and sufficient conditions are expressed using genericity.

  2. Finite Element Interface to Linear Solvers

    SciTech Connect

    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.

  3. Generalized Kepler problems. I. Without magnetic charges

    SciTech Connect

    Meng, Guowu

    2013-01-15

    For each simple euclidean Jordan algebra V of rank {rho} and degree {delta}, we introduce a family of classical dynamic problems. These dynamical problems all share the characteristic features of the Kepler problem for planetary motions, such as the existence of Laplace-Runge-Lenz vector and hidden symmetry. After suitable quantizations, a family of quantum dynamic problems, parametrized by the nontrivial Wallach parameter {nu}, is obtained. Here, {nu} Element-Of W(V):={l_brace}k({delta}/2) Double-Vertical-Line k=1,...,({rho}-1){r_brace} Union (({rho}-1)({delta}/2),{infinity}) and was introduced by N. Wallach to parametrize the set of nontrivial scalar-type unitary lowest weight representations of the conformal group of V. For the quantum dynamic problem labelled by {nu}, the bound state spectra is -(1/2/(I+{nu}({rho}/2)){sup 2}), I= 0, 1, Horizontal-Ellipsis and its Hilbert space of bound states gives a new realization for the afore-mentioned representation labelled by {nu}. A few results in the literature about these representations become more explicit and more refined. The Lagrangian for a classical Kepler-type dynamic problem introduced here is still of the simple form: (1/2) parallel x parallel {sup 2}+(1/r). Here, x is the velocity of a unit-mass particle moving on the space consisting of V's semi-positive elements of a fixed rank, and r is the inner product of x with the identity element of V.

  4. Generalized Kepler problems. I. Without magnetic charges

    NASA Astrophysics Data System (ADS)

    Meng, Guowu

    2013-01-01

    For each simple euclidean Jordan algebra V of rank ρ and degree δ, we introduce a family of classical dynamic problems. These dynamical problems all share the characteristic features of the Kepler problem for planetary motions, such as the existence of Laplace-Runge-Lenz vector and hidden symmetry. After suitable quantizations, a family of quantum dynamic problems, parametrized by the nontrivial Wallach parameter ν, is obtained. Here, ν in {W}(V):=[ k δ/2mid k=1, ldots, (ρ -1)] \\cup ((ρ -1)δ / 2, infty ) and was introduced by N. Wallach to parametrize the set of nontrivial scalar-type unitary lowest weight representations of the conformal group of V. For the quantum dynamic problem labelled by ν, the bound state spectra is -1/2/ (I+ν frac{ρ { 2})^2}, I = 0, 1, … and its Hilbert space of bound states gives a new realization for the afore-mentioned representation labelled by ν. A few results in the literature about these representations become more explicit and more refined. The Lagrangian for a classical Kepler-type dynamic problem introduced here is still of the simple form: 1/ 2 Vert dot{x}Vert ^2+1/ r. Here, dot{x} is the velocity of a unit-mass particle moving on the space consisting of V's semi-positive elements of a fixed rank, and r is the inner product of x with the identity element of V.

  5. PSPIKE: A Parallel Hybrid Sparse Linear System Solver

    NASA Astrophysics Data System (ADS)

    Manguoglu, Murat; Sameh, Ahmed H.; Schenk, Olaf

    The availability of large-scale computing platforms comprised of tens of thousands of multicore processors motivates the need for the next generation of highly scalable sparse linear system solvers. These solvers must optimize parallel performance, processor (serial) performance, as well as memory requirements, while being robust across broad classes of applications and systems. In this paper, we present a new parallel solver that combines the desirable characteristics of direct methods (robustness) and effective iterative solvers (low computational cost), while alleviating their drawbacks (memory requirements, lack of robustness). Our proposed hybrid solver is based on the general sparse solver PARDISO, and the “Spike” family of hybrid solvers. The resulting algorithm, called PSPIKE, is as robust as direct solvers, more reliable than classical preconditioned Krylov subspace methods, and much more scalable than direct sparse solvers. We support our performance and parallel scalability claims using detailed experimental studies and comparison with direct solvers, as well as classical preconditioned Krylov methods.

  6. Self-correcting Multigrid Solver

    SciTech Connect

    Jerome L.V. Lewandowski

    2004-06-29

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

  7. Training Interdisciplinary "Wicked Problem" Solvers: Applying Lessons from HERO in Community-Based Research Experiences for Undergraduates

    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…

  8. Class and Homework Problems: The Break-Even Radius of Insulation Computed Using Excel Solver and WolframAlpha

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

  9. Cinema, Fermi Problems and General Education

    ERIC Educational Resources Information Center

    Efthimiou, C. J.; Llewellyn, R. A.

    2007-01-01

    During the past few years the authors have developed a new approach to the teaching of physical science, a general education course typically found in the curricula of nearly every college and university. This approach, called "Physics in Films" (Efthimiou and Llewellyn 2006 Phys. Teach. 44 28-33), uses scenes from popular films to illustrate…

  10. Using a general problem-solving strategy to promote transfer.

    PubMed

    Youssef-Shalala, Amina; Ayres, Paul; Schubert, Carina; Sweller, John

    2014-09-01

    Cognitive load theory was used to hypothesize that a general problem-solving strategy based on a make-as-many-moves-as-possible heuristic could facilitate problem solutions for transfer problems. In four experiments, school students were required to learn about a topic through practice with a general problem-solving strategy, through a conventional problem solving strategy or by studying worked examples. In Experiments 1 and 2 using junior high school students learning geometry, low knowledge students in the general problem-solving group scored significantly higher on near or far transfer tests than the conventional problem-solving group. In Experiment 3, an advantage for a general problem-solving group over a group presented worked examples was obtained on far transfer tests using the same curriculum materials, again presented to junior high school students. No differences between conditions were found in Experiments 1, 2, or 3 using test problems similar to the acquisition problems. Experiment 4 used senior high school students studying economics and found the general problem-solving group scored significantly higher than the conventional problem-solving group on both similar and transfer tests. It was concluded that the general problem-solving strategy was helpful for novices, but not for students that had access to domain-specific knowledge. PMID:25000309

  11. Algorithmic enhancements and experience with a large scale SQP code for general nonlinear programming problems

    SciTech Connect

    Boggs, P.; Tolle, J.; Kearsley, A.

    1994-12-31

    We have developed a large scale sequential quadratic programming (SQP) code based on an interior-point method for solving general (convex or nonconvex) quadratic programs (QP). We often halt this QP solver prematurely by employing a trust-region strategy. This procedure typically reduces the overall cost of the code. In this talk we briefly review the algorithm and some of its theoretical justification and then discuss recent enhancements including automatic procedures for both increasing and decreasing the parameter in the merit function, a regularization procedure for dealing with linearly dependent active constraint gradients, and a method for modifying the linearized equality constraints. Some numerical results on a significant set of {open_quotes}real-world{close_quotes} problems will be presented.

  12. Mental Subtraction in High- and Lower Skilled Arithmetic Problem Solvers: Verbal Report versus Operand-Recognition Paradigms

    ERIC Educational Resources Information Center

    Thevenot, Catherine; Castel, Caroline; Fanget, Muriel; Fayol, Michel

    2010-01-01

    The authors used the operand-recognition paradigm (C. Thevenot, M. Fanget, & M. Fayol, 2007) in order to study the strategies used by adults to solve subtraction problems. This paradigm capitalizes on the fact that algorithmic procedures degrade the memory traces of the operands. Therefore, greater difficulty in recognizing them is expected when…

  13. Generalized ruin problems and asynchronous random walks

    NASA Astrophysics Data System (ADS)

    Abad, E.

    2005-07-01

    We consider a gambling game with two different kinds of trials and compute the duration of the game (averaged over all possible initial capitals of the players) by a mapping of the problem to a 1D lattice walk of two particles reacting upon encounter. The relative frequency of the trials is governed by the synchronicity parameter p of the random walk. The duration of the game is given by the mean time to reaction, which turns out to display a different behavior for even and odd lattices, i.e. this quantity is monotonic in p for odd lattices and non-monotonic for even lattices. In the game picture, this implies that the players minimize the duration of the game by restricting themselves to one type of trial if their joint capital is odd, otherwise a non-symmetric mixture of both trials is needed.

  14. Scalable Parallel Algebraic Multigrid Solvers

    SciTech Connect

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

    2005-03-23

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

  15. Amesos Solver Package

    SciTech Connect

    Stanley, Vendall S.; Heroux, Michael A.; Hoekstra, Robert J.; Sala, Marzio

    2004-03-01

    Amesos is the Direct Sparse Solver Package in Trilinos. The goal of Amesos is to make AX=S as easy as it sounds, at least for direct methods. Amesos provides interfaces to a number of third party sparse direct solvers, including SuperLU, SuperLU MPI, DSCPACK, UMFPACK and KLU. Amesos provides a common object oriented interface to the best sparse direct solvers in the world. A sparse direct solver solves for x in Ax = b. where A is a matrix and x and b are vectors (or multi-vectors). A sparse direct solver flrst factors A into trinagular matrices L and U such that A = LU via gaussian elimination and then solves LU x = b. Switching amongst solvers in Amesos roquires a change to a single parameter. Yet, no solver needs to be linked it, unless it is used. All conversions between the matrices provided by the user and the format required by the underlying solver is performed by Amesos. As new sparse direct solvers are created, they will be incorporated into Amesos, allowing the user to simpty link with the new solver, change a single parameter in the calling sequence, and use the new solver. Amesos allows users to specify whether the matrix has changed. Amesos can be used anywhere that any sparse direct solver is needed.

  16. Amesos Solver Package

    Energy Science and Technology Software Center (ESTSC)

    2004-03-01

    Amesos is the Direct Sparse Solver Package in Trilinos. The goal of Amesos is to make AX=S as easy as it sounds, at least for direct methods. Amesos provides interfaces to a number of third party sparse direct solvers, including SuperLU, SuperLU MPI, DSCPACK, UMFPACK and KLU. Amesos provides a common object oriented interface to the best sparse direct solvers in the world. A sparse direct solver solves for x in Ax = b. wheremore » A is a matrix and x and b are vectors (or multi-vectors). A sparse direct solver flrst factors A into trinagular matrices L and U such that A = LU via gaussian elimination and then solves LU x = b. Switching amongst solvers in Amesos roquires a change to a single parameter. Yet, no solver needs to be linked it, unless it is used. All conversions between the matrices provided by the user and the format required by the underlying solver is performed by Amesos. As new sparse direct solvers are created, they will be incorporated into Amesos, allowing the user to simpty link with the new solver, change a single parameter in the calling sequence, and use the new solver. Amesos allows users to specify whether the matrix has changed. Amesos can be used anywhere that any sparse direct solver is needed.« less

  17. Application of the general problem of moments to some optimization problems in elasticity theory

    NASA Astrophysics Data System (ADS)

    Grigoliuk, E. I.; Fil'Shtinskii, V. A.; Fil'Shtinskii, L. A.

    1992-04-01

    Several optimization problems in elasticity theory are formulated which are relevant to geomechanics. Methods are then presented for reducing these problems to general moment problems in continuous-function space. By using polynomial approximations of nonstandard moment functions, the general moment problems are reduced to the classical power-law moment problem. This allows an a priori evaluation of the optimal control structure. Theoretical and computational examples are presented.

  18. A STUDY OF PROBLEM DRINKERS IN A GENERAL HOSPITAL

    PubMed Central

    Babu, R. Sateesh; Sengupta, S.N.

    1997-01-01

    349 new admissions in the wards of Medicine, General Surgery & Orthopedics in a general hospital were screened with MAST & AUDIT for problem use of alcohol. Problem drinking was present in 14.6% of the inpatients. The severity and the need for additional treatment were measured with Addiction Severity Index (ASI). Majority of the patients had problems in more than one ar?a. Nevertheless, only one fourth of the patients were referred for psychiatric treatment. The findings indicate the need to develop services towards the recognition and referrals of the problem drinkers in general hospitals PMID:21584037

  19. A General Problem Describer for Computer Assisted Instruction.

    ERIC Educational Resources Information Center

    Wools, Ronald Joe

    Currently in computer-assisted instruction (CAI) systems a number of problems are presented to each student during a session, with each individual problem being specified by the author of the session. A better approach might be to provide the author with a language in which he can describe to the computer the general type of problem he wants his…

  20. SediFoam: A general-purpose, open-source CFD-DEM solver for particle-laden flow with emphasis on sediment transport

    NASA Astrophysics Data System (ADS)

    Sun, Rui; Xiao, Heng

    2016-04-01

    With the growth of available computational resource, CFD-DEM (computational fluid dynamics-discrete element method) becomes an increasingly promising and feasible approach for the study of sediment transport. Several existing CFD-DEM solvers are applied in chemical engineering and mining industry. However, a robust CFD-DEM solver for the simulation of sediment transport is still desirable. In this work, the development of a three-dimensional, massively parallel, and open-source CFD-DEM solver SediFoam is detailed. This solver is built based on open-source solvers OpenFOAM and LAMMPS. OpenFOAM is a CFD toolbox that can perform three-dimensional fluid flow simulations on unstructured meshes; LAMMPS is a massively parallel DEM solver for molecular dynamics. Several validation tests of SediFoam are performed using cases of a wide range of complexities. The results obtained in the present simulations are consistent with those in the literature, which demonstrates the capability of SediFoam for sediment transport applications. In addition to the validation test, the parallel efficiency of SediFoam is studied to test the performance of the code for large-scale and complex simulations. The parallel efficiency tests show that the scalability of SediFoam is satisfactory in the simulations using up to O(107) particles.

  1. A two-dimensional HLLC Riemann solver for conservation laws: Application to Euler and magnetohydrodynamic flows

    NASA Astrophysics Data System (ADS)

    Balsara, Dinshaw S.

    2012-09-01

    In this paper we present a genuinely two-dimensional HLLC Riemann solver. On logically rectangular meshes, it accepts four input states that come together at an edge and outputs the multi-dimensionally upwinded fluxes in both directions. This work builds on, and improves, our prior work on two-dimensional HLL Riemann solvers. The HLL Riemann solver presented here achieves its stabilization by introducing a constant state in the region of strong interaction, where four one-dimensional Riemann problems interact vigorously with one another. A robust version of the HLL Riemann solver is presented here along with a strategy for introducing sub-structure in the strongly-interacting state. Introducing sub-structure turns the two-dimensional HLL Riemann solver into a two-dimensional HLLC Riemann solver. The sub-structure that we introduce represents a contact discontinuity which can be oriented in any direction relative to the mesh. The Riemann solver presented here is general and can work with any system of conservation laws. We also present a second order accurate Godunov scheme that works in three dimensions and is entirely based on the present multidimensional HLLC Riemann solver technology. The methods presented are cost-competitive with traditional higher order Godunov schemes. The two-dimensional HLLC Riemann solver is shown to work robustly for Euler and Magnetohydrodynamic (MHD) flows. Several stringent test problems are presented to show that the inclusion of genuinely multidimensional effects into higher order Godunov schemes indeed produces some very compelling advantages. For two dimensional problems, we were routinely able to run simulations with CFL numbers of ˜0.7, with some two-dimensional simulations capable of reaching higher CFL numbers. For three dimensional problems, CFL numbers as high as ˜0.6 were found to be stable. We show that on resolution-starved meshes, the scheme presented here outperforms unsplit second order Godunov schemes that are based

  2. New generalizations of the integrable problems in rigid body dynamics

    NASA Astrophysics Data System (ADS)

    Yehia, H. M.

    1997-10-01

    We consider the general problem of motion of a rigid body about a fixed point under the action of an axisymmetric combination of potential and gyroscopic forces. We introduce six cases of this problem which are completely integrable for arbitrary initial conditions. The new cases generalize by several parameters all, but one, of the known results in the subject of rigid body dynamics. Namely, we generalize all the results due to Euler, Lagrange, Clebsch, Kovalevskaya, Brun and Lyapunov and also their subsequent generalizations by Rubanovsky and the present author.

  3. 3-D magnetotelluric inversion including topography using deformed hexahedral edge finite elements and direct solvers parallelized on SMP computers - Part I: forward problem and parameter Jacobians

    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

  4. Problem Solvers to the Rescue

    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…

  5. A Heuristic Framework to Solve a General Delivery Problem

    NASA Astrophysics Data System (ADS)

    Lian, Lian; Castelain, Emmanuel

    2010-06-01

    This paper presents a new distribution and route planning problem, General Delivery Problem (GDP) which is more general than the well-known Vehicle Routing Problem. To solve a GDP, a three-phase framework heuristic approach based on decomposition techniques is introduced. The decomposition techniques are employed to divide an original problem into a set of sub-problems, which can reduce the problem size. A kind of decomposition technique, Capacity Clustering Algorithm (CCA), is embedded into the framework with Simulated Annealing (SA) to solve a special GDP. The proposed three-phase framework with the above two algorithms is compared with five other decomposition methods in a distribution instance of the Regional Fire and Emergency Center in the north of France.

  6. Fast Poisson, Fast Helmholtz and fast linear elastostatic solvers on rectangular parallelepipeds

    SciTech Connect

    Wiegmann, A.

    1999-06-01

    FFT-based fast Poisson and fast Helmholtz solvers on rectangular parallelepipeds for periodic boundary conditions in one-, two and three space dimensions can also be used to solve Dirichlet and Neumann boundary value problems. For non-zero boundary conditions, this is the special, grid-aligned case of jump corrections used in the Explicit Jump Immersed Interface method. Fast elastostatic solvers for periodic boundary conditions in two and three dimensions can also be based on the FFT. From the periodic solvers we derive fast solvers for the new 'normal' boundary conditions and essential boundary conditions on rectangular parallelepipeds. The periodic case allows a simple proof of existence and uniqueness of the solutions to the discretization of normal boundary conditions. Numerical examples demonstrate the efficiency of the fast elastostatic solvers for non-periodic boundary conditions. More importantly, the fast solvers on rectangular parallelepipeds can be used together with the Immersed Interface Method to solve problems on non-rectangular domains with general boundary conditions. Details of this are reported in the preprint The Explicit Jump Immersed Interface Method for 2D Linear Elastostatics by the author.

  7. Local Conjecturing Process in the Solving of Pattern Generalization Problem

    ERIC Educational Resources Information Center

    Sutarto; Nusantara, Toto; Subanji; Sisworo

    2016-01-01

    This aim of this study is to describe the process of local conjecturing in generalizing patterns based on Action, Process, Object, Schema (APOS) theory. The subjects were 16 grade 8 students from a junior high school. Data collection used Pattern Generalization Problem (PGP) and interviews. In the first stage, students completed PGP; in the second…

  8. Stable Generalized Finite Element Method and associated iterative schemes; application to interface problems

    NASA Astrophysics Data System (ADS)

    Kergrene, Kenan; Babuška, Ivo; Banerjee, Uday

    2016-06-01

    The Generalized Finite Element Method (GFEM) is an extension of the Finite Element Method (FEM), where the standard finite element space is augmented with a space of non-polynomial functions, called the enrichment space. The functions in the enrichment space mimic the local behavior of the unknown solution of the underlying variational problem. GFEM has been successfully applied to a wide range of problems. However, it often suffers from bad conditioning, i.e., its conditioning may not be robust with respect to the mesh and in fact, the conditioning could be much worse than that of the standard FEM. In this paper, we present a numerical study that shows that if the "angle" between the finite element space and the enrichment space is bounded away from 0, uniformly with respect to the mesh, then the GFEM is stable, i.e., the conditioning of GFEM is not worse than that of the standard FEM. A GFEM with this property is called a Stable GFEM (SGFEM). The last part of the paper is devoted to the derivation of a robust iterative solver exploiting this angle condition. It is shown that the required "wall-clock" time is greatly reduced compared to popular GFEMs used in the literature.

  9. LSENS: A General Chemical Kinetics and Sensitivity Analysis Code for homogeneous gas-phase reactions. Part 3: Illustrative test problems

    NASA Technical Reports Server (NTRS)

    Bittker, David A.; Radhakrishnan, Krishnan

    1994-01-01

    LSENS, the Lewis General Chemical Kinetics and Sensitivity Analysis Code, has been developed for solving complex, homogeneous, gas-phase chemical kinetics problems and contains sensitivity analysis for a variety of problems, including nonisothermal situations. This report is part 3 of a series of three reference publications that describe LSENS, provide a detailed guide to its usage, and present many example problems. Part 3 explains the kinetics and kinetics-plus-sensitivity analysis problems supplied with LSENS and presents sample results. These problems illustrate the various capabilities of, and reaction models that can be solved by, the code and may provide a convenient starting point for the user to construct the problem data file required to execute LSENS. LSENS is a flexible, convenient, accurate, and efficient solver for chemical reaction problems such as static system; steady, one-dimensional, inviscid flow; reaction behind incident shock wave, including boundary layer correction; and perfectly stirred (highly backmixed) reactor. In addition, the chemical equilibrium state can be computed for the following assigned states: temperature and pressure, enthalpy and pressure, temperature and volume, and internal energy and volume. For static problems the code computes the sensitivity coefficients of the dependent variables and their temporal derivatives with respect to the initial values of the dependent variables and/or the three rate coefficient parameters of the chemical reactions.

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

  11. The trace minimization method for the symmetric generalized eigenvalue problem

    NASA Astrophysics Data System (ADS)

    Sameh, Ahmed; Tong, Zhanye

    2000-11-01

    In this paper, the trace minimization method for the generalized symmetric eigenvalue problems proposed by Sameh and Wisniewski [35] is reviewed. Convergence of an inexact trace minimization algorithm is established and a variant of the algorithm that uses expanding subspaces is introduced and compared with the block Jacobi-Davidson algorithm.

  12. Finite Element Interface to Linear Solvers

    Energy Science and Technology Software Center (ESTSC)

    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 themore » 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.« less

  13. Magnetic Field Solver

    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.

  14. The little hierarchy problem in a generalized NMSSM

    SciTech Connect

    Kolda, Christopher

    2013-05-23

    In this talk, I review recent work on using a generalization of the Next-to-Minimal Supersymmetric Standard Model (NMSSM), called the Singlet-extended Minimal Supersymmetric Standard Model (SMSSM), to raise the mass of the Standard Model-like Higgs boson without requiring extremely heavy top squarks or large stop mixing. In so doing, this model solves the little hierarchy problem of the minimal model (MSSM), at the expense of leaving the {mu}-problem of the MSSM unresolved. This talk is based on work published in Refs. [1, 2, 3].

  15. A parallel PCG solver for MODFLOW.

    PubMed

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

  16. Local search for the generalized tree alignment problem

    PubMed Central

    2013-01-01

    Background A phylogeny postulates shared ancestry relationships among organisms in the form of a binary tree. Phylogenies attempt to answer an important question posed in biology: what are the ancestor-descendent relationships between organisms? At the core of every biological problem lies a phylogenetic component. The patterns that can be observed in nature are the product of complex interactions, constrained by the template that our ancestors provide. The problem of simultaneous tree and alignment estimation under Maximum Parsimony is known in combinatorial optimization as the Generalized Tree Alignment Problem (GTAP). The GTAP is the Steiner Tree Problem for the sequence edit distance. Like many biologically interesting problems, the GTAP is NP-Hard. Typically the Steiner Tree is presented under the Manhattan or the Hamming distances. Results Experimentally, the accuracy of the GTAP has been subjected to evaluation. Results show that phylogenies selected using the GTAP from unaligned sequences are competitive with the best methods and algorithms available. Here, we implement and explore experimentally existing and new local search heuristics for the GTAP using simulated and real data. Conclusions The methods presented here improve by more than three orders of magnitude in execution time the best local search heuristics existing to date when applied to real data. PMID:23441880

  17. A Generalized Cauchy Distribution Framework for Problems Requiring Robust Behavior

    NASA Astrophysics Data System (ADS)

    Carrillo, Rafael E.; Aysal, Tuncer C.; Barner, Kenneth E.

    2010-12-01

    Statistical modeling is at the heart of many engineering problems. The importance of statistical modeling emanates not only from the desire to accurately characterize stochastic events, but also from the fact that distributions are the central models utilized to derive sample processing theories and methods. The generalized Cauchy distribution (GCD) family has a closed-form pdf expression across the whole family as well as algebraic tails, which makes it suitable for modeling many real-life impulsive processes. This paper develops a GCD theory-based approach that allows challenging problems to be formulated in a robust fashion. Notably, the proposed framework subsumes generalized Gaussian distribution (GGD) family-based developments, thereby guaranteeing performance improvements over traditional GCD-based problem formulation techniques. This robust framework can be adapted to a variety of applications in signal processing. As examples, we formulate four practical applications under this framework: (1) filtering for power line communications, (2) estimation in sensor networks with noisy channels, (3) reconstruction methods for compressed sensing, and (4) fuzzy clustering.

  18. Sensitivity analysis and approximation methods for general eigenvalue problems

    NASA Technical Reports Server (NTRS)

    Murthy, D. V.; Haftka, R. T.

    1986-01-01

    Optimization of dynamic systems involving complex non-hermitian matrices is often computationally expensive. Major contributors to the computational expense are the sensitivity analysis and reanalysis of a modified design. The present work seeks to alleviate this computational burden by identifying efficient sensitivity analysis and approximate reanalysis methods. For the algebraic eigenvalue problem involving non-hermitian matrices, algorithms for sensitivity analysis and approximate reanalysis are classified, compared and evaluated for efficiency and accuracy. Proper eigenvector normalization is discussed. An improved method for calculating derivatives of eigenvectors is proposed based on a more rational normalization condition and taking advantage of matrix sparsity. Important numerical aspects of this method are also discussed. To alleviate the problem of reanalysis, various approximation methods for eigenvalues are proposed and evaluated. Linear and quadratic approximations are based directly on the Taylor series. Several approximation methods are developed based on the generalized Rayleigh quotient for the eigenvalue problem. Approximation methods based on trace theorem give high accuracy without needing any derivatives. Operation counts for the computation of the approximations are given. General recommendations are made for the selection of appropriate approximation technique as a function of the matrix size, number of design variables, number of eigenvalues of interest and the number of design points at which approximation is sought.

  19. Generalized Approaches to the Maxbet Problem and the Maxdiff Problem, with Applications to Canonical Correlations.

    ERIC Educational Resources Information Center

    ten Berge, Jos M. F.

    1988-01-01

    A summary and a unified treatment of fully general computational solutions for two criteria for transforming two or more matrices to maximal agreement are provided. The two criteria--Maxdiff and Maxbet--have applications in the rotation of factor loading or configuration matrices to maximal agreement and the canonical correlation problem. (SLD)

  20. Wavelet-based Poisson Solver for use in Particle-In-CellSimulations

    SciTech Connect

    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.

  1. A Monte Carlo study of the generalized Coulomb Milne problem

    NASA Astrophysics Data System (ADS)

    Barghouthi, I.; Barakat, A.

    2003-04-01

    Because of its relevance to the solar wind and terrestrial polar wind, we investigated the problem where a swarm of minor ions escaped through a background of non-uniform major ions. The Fokker-Planck expression was used to represent the Coulomb collisions between the minor and major ions. A change of variables was utilized in order to transform the problem into a simpler form where the background medium was uniform. This transformed problem described minor ions diffusing through a background of ions of a constant density in the semi-infinite region (z>0), and vacuum in the region (z<0), which resembles the standard Milne problem. A Monte Carlo model was used to investigate this "generalized Coulomb Milne" problem for three different minor-to-major ion mass ratios, namely; R = m/M = 1/16, 1 and 16, where m and M are the minor and major ion masses, respectively. The minor ions' velocity distribution function and velocity moments (i.e. density, drift velocity, parallel and perpendicular temperatures, and parallel and perpendicular heat fluxes) were computed. The following conclusions can be drawn: (1) In general, the minor ion species for the cases of (R=1,16) show very similar characteristics, while the third case (R=1/16) shows very different characteristics. (2) In the collision-dominated region (z>>1), the gradient of the normalized density profile approaches a constant value. This asymptotic value of the gradient increases when R decreases. (3) As the minor ion species drifts from the collision-dominated region (z>>) to the collisionless region (z<<1), its velocity distribution starts as Maxwellian, then it develops a tail in the (-z) direction, and finally reaches a form close to bi-Maxwellian. The case of (R=1/16) develops a relatively more pronounced tail, and displays a double-hump form, which is absent for the other two cases. (4) The heat flux profile for the case of (R=1/6) in the collision-dominated region exceeds the corresponding values from the other

  2. The Energy-Momentum Problem in General Relativity

    NASA Astrophysics Data System (ADS)

    Xulu, S. S.

    2003-08-01

    Energy-momentum is an important conserved quantity whose definition has been a focus of many investigations in general relativity. Unfortunately, there is still no generally accepted definition of energy and momentum in general relativity. Attempts aimed at finding a quantity for describing distribution of energy-momentum due to matter, non-gravitational and gravitational fields resulted in various energy-momentum complexes whose physical meaning have been questioned. The problems associated with energy-momentum complexes resulted in some researchers even abandoning the concept of energy-momentum localization in favour of the alternative concept of quasi-localization. However, quasi-local masses have their inadequacies, while the remarkable work of Virbhadra and some others, and recent results of Cooperstock and Chang et al. have revived an interest in various energy-momentum complexes. Hence in this work we use energy-momentum complexes to obtain the energy distributions in various space-times. We elaborate on the problem of energy localization in general relativity and use energy-momentum prescriptions of Einstein, Landau and Lifshitz, Papapetrou, Weinberg, and Møller to investigate energy distributions in various space-times. It is shown that several of these energy-momentum complexes give the same and acceptable results for a given space-time. This shows the importance of these energy-momentum complexes. Our results agree with Virbhadra's conclusion that the Einstein's energy-momentum complex is still the best tool for obtaining energy distribution in a given space-time. The Cooperstock hypothesis for energy localization in GR is also supported.

  3. Origins and development of the Cauchy problem in general relativity

    NASA Astrophysics Data System (ADS)

    Ringström, Hans

    2015-06-01

    The seminal work of Yvonne Choquet-Bruhat published in 1952 demonstrates that it is possible to formulate Einstein's equations as an initial value problem. The purpose of this article is to describe the background to and impact of this achievement, as well as the result itself. In some respects, the idea of viewing the field equations of general relativity as a system of evolution equations goes back to Einstein himself; in an argument justifying that gravitational waves propagate at the speed of light, Einstein used a special choice of coordinates to derive a system of wave equations for the linear perturbations on a Minkowski background. Over the following decades, Hilbert, de Donder, Lanczos, Darmois and many others worked to put Einstein's ideas on a more solid footing. In fact, the issue of local uniqueness (giving a rigorous justification for the statement that the speed of propagation of the gravitational field is bounded by that of light) was already settled in the 1930s by the work of Stellmacher. However, the first person to demonstrate both local existence and uniqueness in a setting in which the notion of finite speed of propagation makes sense was Yvonne Choquet-Bruhat. In this sense, her work lays the foundation for the formulation of Einstein's equations as an initial value problem. Following a description of the results of Choquet-Bruhat, we discuss the development of three research topics that have their origin in her work. The first one is local existence. One reason for addressing it is that it is at the heart of the original paper. Moreover, it is still an active and important research field, connected to the problem of characterizing the asymptotic behaviour of solutions that blow up in finite time. As a second topic, we turn to the questions of global uniqueness and strong cosmic censorship. These questions are of fundamental importance to anyone interested in justifying that the Cauchy problem makes sense globally. They are also closely

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

  5. Extending substructure based iterative solvers to multiple load and repeated analyses

    NASA Technical Reports Server (NTRS)

    Farhat, Charbel

    1993-01-01

    Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel

  6. General solutions of optimum problems in nonstationary flight

    NASA Technical Reports Server (NTRS)

    Miele, Angelo

    1955-01-01

    A general method concerning optimum problems in nonstationary flight is developed and discussed. Best flight techniques are determined for the following conditions: climb with minimum time, climb with minimum fuel consumption, steepest climb, descending and gliding flight with maximum time or with maximum distance. Optimum distributions of speed with altitude are derived assuming constant airplane weight and neglecting curvatures and squares of path inclination in the projection of the equation of motion on the normal to the flight path. The results of this paper differ from the well-known results obtained by neglecting accelerations with one exception, namely the case of gliding with maximum range. The paper is concluded with criticisms and remarks concerning the physical nature of the solutions and their usefulness for practical applications.

  7. A Monte Carlo study of the generalized Coulomb Milne problem

    NASA Astrophysics Data System (ADS)

    Barghouthi, I. A.; Barakat, A. R.

    2005-11-01

    Because of its relevance to space plasma problems (such as the terrestrial polar wind), we investigated the diffusion of a minor ion species through a non-uniform background major ion species. A Fokker Planck expression was used to represent the Coulomb collisions between the minor and the background ions. A change of variables was implemented in order to transform the problem into a simpler form where the background medium is uniform. This transformed problem described minor ions diffusing through a background of ions with constant density in the semi-infinite region z˜⩾0 and zero density in the region z˜<0. This problem was termed the generalized Coulomb Milne problem and was addressed by a Monte Carlo simulation. Three different minor-to-background mass ratios (γ) were considered, namely γ=16, 1, and 116, which were relevant to H and O ions, the two most dominant ions in the terrestrial ionosphere. The minor ion velocity distribution (f) and the velocity moments (density (n); drift velocity (u), parallel (T) and perpendicular (T) temperatures; and parallel (q˜s∥) and perpendicular (q˜s⊥) heat fluxes) were computed. For the cases when the minor species mass was comparable to, or larger than the background species mass (γ=16,1), the distribution was close to Maxwellian at low altitudes due to Coulomb collisions, gradually formed a weak upward tail in the transition region, and eventually assumed a half-Maxwellian shape at the collisionless region. This was reflected in the enhancement of the flow and random energies, and the energy fluxes for these cases. Deep into the collision-dominated region, n was found to be linearly dependent on the normalized distance z˜ with a gradient (m=dn˜/dz˜). As γ decreased from 16 to 1 to 116, m decreased from 2.0 to 1.7 to 0.75, respectively. For the case of a lighter minor ion species drifting through a heavier background ion species (e.g. γ=116), the ion outflow exhibited some interesting qualitatively

  8. Management of general surgical problems after cardiac transplantation.

    PubMed

    Jones, M T; Menkis, A H; Kostuk, W J; McKenzie, F N

    1988-07-01

    Over a 6-year period at the University Hospital in London, Ont., 101 patients underwent heart transplantation and 5 heart-lung transplantation. The authors review the general surgical problems identified from the charts of 13 of these patients. In the early postoperative period (within 30 days), laparotomy was required for pancreatitis (one), perforated peptic ulcer (two), cholecystectomy (one), pancreatic cyst (one) and appendicitis (one). In addition, a spontaneous colocutaneous fistula and spontaneous pneumoperitoneum occurred; both were managed conservatively. Later, three patients required cholecystectomy; one underwent a below-knee and a Symes amputation for dry gangrene and one surgical correction of a lymphocele. The incidence of surgical problems (13%) indicates an increased susceptibility in this group of patients. Four of the 13 patients died. Pancreatitis is a well-recognized complication of cardiac surgery; it is frequently associated with a normal or only slightly elevated serum amylase level, making a definitive diagnosis without laparotomy almost impossible. Persistence of abdominal signs should signal the need for exploratory surgery. During the early postoperative period and in the absence of multiorgan failure, immediate operation for an acute abdomen is usually successful. Despite the additional risk, cardiac transplantation does not preclude later surgery, but immunosuppression must be continued and carefully monitored. PMID:3292032

  9. An efficient iterative method for the generalized Stokes problem

    SciTech Connect

    Sameh, A.; Sarin, V.

    1996-12-31

    This paper presents an efficient iterative scheme for the generalized Stokes problem, which arises frequently in the simulation of time-dependent Navier-Stokes equations for incompressible fluid flow. The general form of the linear system is where A = {alpha}M + vT is an n x n symmetric positive definite matrix, in which M is the mass matrix, T is the discrete Laplace operator, {alpha} and {nu} are positive constants proportional to the inverses of the time-step {Delta}t and the Reynolds number Re respectively, and B is the discrete gradient operator of size n x k (k < n). Even though the matrix A is symmetric and positive definite, the system is indefinite due to the incompressibility constraint (B{sup T}u = 0). This causes difficulties both for iterative methods and commonly used preconditioners. Moreover, depending on the ratio {alpha}/{nu}, A behaves like the mass matrix M at one extreme and the Laplace operator T at the other, thus complicating the issue of preconditioning.

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

  11. General heuristics algorithms for solving capacitated arc routing problem

    NASA Astrophysics Data System (ADS)

    Fadzli, Mohammad; Najwa, Nurul; Masran, Hafiz

    2015-05-01

    In this paper, we try to determine the near-optimum solution for the capacitated arc routing problem (CARP). In general, NP-hard CARP is a special graph theory specifically arises from street services such as residential waste collection and road maintenance. By purpose, the design of the CARP model and its solution techniques is to find optimum (or near-optimum) routing cost for a fleet of vehicles involved in operation. In other words, finding minimum-cost routing is compulsory in order to reduce overall operation cost that related with vehicles. In this article, we provide a combination of various heuristics algorithm to solve a real case of CARP in waste collection and benchmark instances. These heuristics work as a central engine in finding initial solutions or near-optimum in search space without violating the pre-setting constraints. The results clearly show that these heuristics algorithms could provide good initial solutions in both real-life and benchmark instances.

  12. Belos Block Linear Solvers Package

    Energy Science and Technology Software Center (ESTSC)

    2004-03-01

    Belos is an extensible and interoperable framework for large-scale, iterative methods for solving systems of linear equations with multiple right-hand sides. The motivation for this framework is to provide a generic interface to a collection of algorithms for solving large-scale linear systems. Belos is interoperable because both the matrix and vectors are considered to be opaque objects--only knowledge of the matrix and vectors via elementary operations is necessary. An implementation of Balos is accomplished viamore » the use of interfaces. One of the goals of Belos is to allow the user flexibility in specifying the data representation for the matrix and vectors and so leverage any existing software investment. The algorithms that will be included in package are Krylov-based linear solvers, like Block GMRES (Generalized Minimal RESidual) and Block CG (Conjugate-Gradient).« less

  13. A 3D Finite-Difference BiCG Iterative Solver with the Fourier-Jacobi Preconditioner for the Anisotropic EIT/EEG Forward Problem

    PubMed Central

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

  14. A 3D finite-difference BiCG iterative solver with the Fourier-Jacobi preconditioner for the anisotropic EIT/EEG forward problem.

    PubMed

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

  15. HPCCG Solver Package

    Energy Science and Technology Software Center (ESTSC)

    2007-03-01

    HPCCG is a simple PDE application and preconditioned conjugate gradient solver that solves a linear system on a beam-shaped domain. Although it does not address many performance issues present in real engineering applications, such as load imbalance and preconditioner scalability, it can serve as a first "sanity test" of new processor design choices, inter-connect network design choices and the scalability of a new computer system. Because it is self-contained, easy to compile and easily scaledmore » to 100s or 1000s of porcessors, it can be an attractive study code for computer system designers.« less

  16. Problems in Communications with Patients in General Surgery Outpatient Practice

    PubMed Central

    Yilmaz, Tonguc Utku; Gumus, Enes; Salman, Bulent

    2015-01-01

    Objective: Communication between the patient and physician is central to medical care. However communication skills in Turkey haven’t been gained so much concern. This situation effect the national quality of health care. Here, we tried to perform some basic communication skills and to find the problems with the possible solution suggestions. Materials and Methods: The study was conducted for a month in general surgery outpatient department located in the slum part of Ankara with low socio-economic population. Basic communication skills were performed. The age, sex, education levels of the patients were obtained. Total symptom expression and interview time were recorded. Previous medical histories were asked. Interruptions including telephone, door knocking were noted. The questions of the patients at the end of the interview classified as hospital setting, nutrition and treatment. Results: Total 410 interviews were analysed. Mean symptom expression and interview times were 22.9 sec and 7.05 min, respectively. Educated patients, males and young patients expressed symptoms longer than the others (p<0.05). There were 174 interruptions in which total interview time signifantly increased than the non interrupted ones (p<0.05). Final questions about hospital setting were signifantly higher in illiterate patients than the educated ones (p<0.05). Awareness of medical history is higher in educated and young patients. Conclusion: Basic communications skills can be performed whether in rural regions. Much more concern should be given to the education of communication skills. The obstacles in communication in medicine are low education levels, and unorganised health system. PMID:26644767

  17. Adaptive Multilevel Second-Generation Wavelet Collocation Elliptic Solver: A Cure for High Viscosity Contrasts

    NASA Astrophysics Data System (ADS)

    Kevlahan, N. N.; Vasilyev, O. V.; Yuen, D. A.

    2003-12-01

    An adaptive multilevel wavelet collocation method for solving multi-dimensional elliptic problems with localized structures is developed. The method is based on the general class of multi-dimensional second generation wavelets and is an extension of the dynamically adaptive second generation wavelet collocation method for evolution problems. Wavelet decomposition is used for grid adaptation and interpolation, while O(N) hierarchical finite difference scheme, which takes advantage of wavelet multilevel decomposition, is used for derivative calculations. The multilevel structure of the wavelet approximation provides a natural way to obtain the solution on a near optimal grid. In order to accelerate the convergence of the iterative solver, an iterative procedure analogous to the multigrid algorithm is developed. For the problems with slowly varying viscosity simple diagonal preconditioning works. For problems with large laterally varying viscosity contrasts either direct solver on shared-memory machines or multilevel iterative solver with incomplete LU preconditioner may be used. The method is demonstrated for the solution of a number of two-dimensional elliptic test problems with both constant and spatially varying viscosity with multiscale character.

  18. Towards general information theoretical representations of database problems

    SciTech Connect

    Joslyn, C.

    1997-06-01

    General database systems are described from the General Systems Theoretical (GST) framework. In this context traditional information theoretical (statistical) and general information theoretical (fuzzy measure and set theoretical, possibilistic, and random set theoretical) representations are derived. A preliminary formal framework is introduced.

  19. Comparison of open-source linear programming solvers.

    SciTech Connect

    Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin D.; 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.

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

  1. A Nonlinear Multigrid Solver for an Atmospheric General Circulation Model Based on Semi-Implicit Semi-Lagrangian Advection of Potential Vorticity

    NASA Technical Reports Server (NTRS)

    McCormick, S.; Ruge, John W.

    1998-01-01

    This work represents a part of a project to develop an atmospheric general circulation model based on the semi-Lagrangian advection of potential vorticity (PC) with divergence as the companion prognostic variable.

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

  3. Problems with Single Interest Scales: Implications of the General Factor

    ERIC Educational Resources Information Center

    Tracey, Terence J. G.

    2012-01-01

    The presence of the general factor in interest and self-efficacy assessment and its meaning are reviewed. The general factor is found in all interest and self-efficacy assessment and has been viewed as (a) a nuisance factor with little effect on assessment, (b) a variable having substantive meaning and thus worthy of including in interpretation,…

  4. Investigating the Problem of Skill Generalization: Literature Review III.

    ERIC Educational Resources Information Center

    Haring, Norris

    The third in a series of literature reviews, this monograph presents three articles on skill generalization among individuals with severe disabilities. Kathleen A. Liberty analyzes the results of 15 studies to determine how teaching self-control affected students' performance in training and generalization, "Behavior-Control of Stimulus Events to…

  5. Parallel tridiagonal equation solvers

    NASA Technical Reports Server (NTRS)

    Stone, H. S.

    1974-01-01

    Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

  6. Amesos2 Templated Direct Sparse Solver Package

    Energy Science and Technology Software Center (ESTSC)

    2011-05-24

    Amesos2 is a templated direct sparse solver package. Amesos2 provides interfaces to direct sparse solvers, rather than providing native solver capabilities. Amesos2 is a derivative work of the Trilinos package Amesos.

  7. Top Element Problem and Macneille Completions of Generalized Effect Algebras

    NASA Astrophysics Data System (ADS)

    RieČanová, Z.; Kalina, M.

    2014-10-01

    Effect algebras (EAs), introduced by D. J. Foulis and M. K. Bennett, as common generalizations of Boolean algebras, orthomodular lattices and MV-algebras, are nondistributive algebraic structures including unsharp elements. Their unbounded versions, called generalized effect algebras, are posets which may have or may have not an EA-MacNeille completion, or cannot be embedded into any complete effect algebra. We give a necessary and sufficient condition for a generalized effect algebra to have an EA-MacNeille completion. Some examples are provided.

  8. An analysis of cognitive growth of undergraduate students in a problem-centered general chemistry laboratory curriculum

    NASA Astrophysics Data System (ADS)

    Szeto, Alan Ka-Fai

    This study explored how undergraduate students in a new problem-centered General Chemistry Laboratory curriculum achieved cognitive growth. The new curriculum had three instructional segments: the highly-structured, semi-structured, and open-ended segments. The pedagogical approaches adopted were expository, guided-inquiry, and open-inquiry styles, respectively. Sixty-seven first-year undergraduate students who enrolled in the course in Spring semester, 2000, at Columbia University and three Ph.D.-level chemistry experts were included in the study. A qualitative approach was used including data collection through "think-aloud" problem solving; however, quantitative data such as test scores were also used. The findings from this study confirmed that chemistry experts possessed sophisticated and domain-specific conceptual knowledge structures; they mobilized and applied conceptual knowledge in conjunction with use of heuristics, tacit knowledge, and experience in authentic problem solving. They validated the new curriculum design in preparing students for inquiry-type of problem solving. For novices, solving of semi-structured before ill-structured problems had a positive effect on the solvers' chance of success in solving the latter type of problems as their abilities to mobilize and apply conceptual knowledge and use effective strategies appeared to be critical for successful problem solving. Students in the new course curriculum had grown cognitively as evidenced by their performance on the Case Study projects and Final Examination. High academic achievers were found to perform well independently while the medium and relatively low academic achievers should benefit from sustained and intensive instruction. It is proposed that ill-structured problems should be used to assess and identify the best from the better students. Finally, it was found that no significant change in students' attitudes had resulted from their curriculum experience. Gender and cognitive style

  9. On a problem of Berenstein-Gay and its generalizations

    NASA Astrophysics Data System (ADS)

    Volchkov, Valerii V.; Volchkov, Vitaly V.

    2010-09-01

    We obtain a solution of the Berenstein-Gay problem on the local analogue of spectral analysis on Riemannian symmetric spaces X of rank 1. The proof is based on constructing transmutation maps connected with eigenfunction expansions of the Laplace-Beltrami operator on X.

  10. Awareness during general anesthesia: new technology for an old problem.

    PubMed

    Halliburton, J R

    1998-05-01

    The possibility of awareness during general anesthesia causes apprehension for the patient and the Certified Registered Nurse Anesthetist (CRNA). The goals of general anesthesia are to prevent the sensation of pain and produce a state of sedation, hypnosis, and unconsciousness so the patient will not remember the surgical procedure. An inadequate level of anesthesia can result in patient awareness during surgery. The current practice of anesthesia relies on indirect hemodynamic measurements such as blood pressure and heart rate to monitor the sedative hypnotic state of the patient's brain during general anesthesia. Hemodynamic responses are not reliable for predicting awareness just as blood pressure and heart rate are not indicative of consciousness. Electroencephalogram (EEG) waveforms are known to be affected by anesthetics. Characteristic EEG waveforms are a direct indication of the patient's level of consciousness. Unprocessed and computer-processed EEG recordings have been used in an attempt to monitor the patient's level of consciousness during general anesthesia. A raw or unprocessed EEG recording to monitor the level of consciousness during general anesthesia is problematic. The EEG signal is complex, affected by artifact, and it requires a dedicated interpreter. Conventional processed EEG monitoring systems are problematic because of the complexity of the equipment and technical difficulty of reading the EEG recording. The purpose of this article is to describe the history of awareness during anesthesia and introduce a new processed EEG monitor, the Bispectral Index (BIS) (Aspect Medical Systems, Inc., Natick, MA) with implications for future clinical use and research. PMID:9726194

  11. The Nonlinear Stokes Problem with General Potentials Having Superquadratic Growth

    NASA Astrophysics Data System (ADS)

    Breit, Dominic; Fuchs, Martin

    2011-09-01

    We discuss partial regularity results concerning local minimizers {u : mathbb{R}^3 supset Ω rightarrow mathbb{R}^3} of variational integrals of the form intlimits_{Ω}left\\{h(|\\varepsilon(w)|) - f \\cdot wright\\} dx defined on appropriate classes of solenoidal fields, where h is a N-function of rather general type. As a byproduct we obtain a theorem on partial C 1-regularity for weak solutions of certain non-uniformly elliptic Stokes-type systems modelling generalized Newtonian fluids.

  12. General aviation aircraft interior noise problem: Some suggested solutions

    NASA Technical Reports Server (NTRS)

    Roskam, J.; Navaneethan, R.

    1984-01-01

    Laboratory investigation of sound transmission through panels and the use of modern data analysis techniques applied to actual aircraft is used to determine methods to reduce general aviation interior noise. The experimental noise reduction characteristics of stiffened flat and curved panels with damping treatment are discussed. The experimental results of double-wall panels used in the general aviation industry are given. The effects of skin panel material, fiberglass insulation and trim panel material on the noise reduction characteristics of double-wall panels are investigated. With few modifications, the classical sound transmission theory can be used to design the interior noise control treatment of aircraft. Acoustic intensity and analysis procedures are included.

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

  14. General Systems Theory Approaches to Organizations: Some Problems in Application

    ERIC Educational Resources Information Center

    Peery, Newman S., Jr.

    1975-01-01

    Considers the limitations of General Systems Theory (GST) as a major paradigm within administrative theory and concludes that most systems formulations overemphasize growth and show little appreciation for intraorganizational conflict, diversity of values, and political action within organizations. Suggests that these limitations are mainly due to…

  15. Addition of equilibrium air to an upwind Navier-Stokes code and other first steps toward a more generalized flow solver

    NASA Technical Reports Server (NTRS)

    Rosen, Bruce S.

    1991-01-01

    An upwind three-dimensional volume Navier-Stokes code is modified to facilitate modeling of complex geometries and flow fields represented by proposed National Aerospace Plane concepts. Code enhancements include an equilibrium air model, a generalized equilibrium gas model and several schemes to simplify treatment of complex geometric configurations. The code is also restructured for inclusion of an arbitrary number of independent and dependent variables. This latter capability is intended for eventual use to incorporate nonequilibrium/chemistry gas models, more sophisticated turbulence and transition models, or other physical phenomena which will require inclusion of additional variables and/or governing equations. Comparisons of computed results with experimental data and results obtained using other methods are presented for code validation purposes. Good correlation is obtained for all of the test cases considered, indicating the success of the current effort.

  16. Handling Vacuum Regions in a Hybrid Plasma Solver

    NASA Astrophysics Data System (ADS)

    Holmström, M.

    2013-04-01

    In a hybrid plasma solver (particle ions, fluid mass-less electrons) regions of vacuum, or very low charge density, can cause problems since the evaluation of the electric field involves division by charge density. This causes large electric fields in low density regions that can lead to numerical instabilities. Here we propose a self consistent handling of vacuum regions for hybrid solvers. Vacuum regions can be considered having infinite resistivity, and in this limit Faraday's law approaches a magnetic diffusion equation. We describe an algorithm that solves such a diffusion equation in regions with charge density below a threshold value. We also present an implementation of this algorithm in a hybrid plasma solver, and an application to the interaction between the Moon and the solar wind. We also discuss the implementation of hyperresistivity for smoothing the electric field in a PIC solver.

  17. Parallel iterative solvers and preconditioners using approximate hierarchical methods

    SciTech Connect

    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.

  18. Casimir problem of spherical dielectrics: numerical evaluation for general permittivities.

    PubMed

    Brevik, I; Aarseth, J B; Høye, J S

    2002-08-01

    The Casimir mutual free energy F for a system of two dielectric concentric nonmagnetic spherical bodies is calculated, at arbitrary temperatures. The present paper is a continuation of an earlier investigation [Phys. Rev. E 63, 051101 (2001)], in which F was evaluated in full only for the case of ideal metals (refractive index n= infinity ). Here, analogous results are presented for dielectrics, for some chosen values of n. Our basic calculational method stems from quantum statistical mechanics. The Debye expansions for the Riccati-Bessel functions when carried out to a high order are found to be very useful in practice (thereby overflow/underflow problems are easily avoided), and also to give accurate results even for the lowest values of l down to l=1. Another virtue of the Debye expansions is that the limiting case of metals becomes quite amenable to an analytical treatment in spherical geometry. We first discuss the zero-frequency TE mode problem from a mathematical viewpoint and then, as a physical input, invoke the actual dispersion relations. The result of our analysis, based upon the adoption of the Drude dispersion relation at low frequencies, is that the zero-frequency TE mode does not contribute for a real metal. Accordingly, F turns out in this case to be only one-half of the conventional value at high temperatures. The applicability of the Drude model in this context has, however, been questioned recently, and we do not aim at a complete discussion of this issue here. Existing experiments are low-temperature experiments, and are so far not accurate enough to distinguish between the different predictions. We also calculate explicitly the contribution from the zero-frequency mode for a dielectric. For a dielectric, this zero-frequency problem is absent. PMID:12241249

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

  20. Euler solvers for transonic applications

    NASA Technical Reports Server (NTRS)

    Vanleer, Bram

    1989-01-01

    The 1980s may well be called the Euler era of applied aerodynamics. Computer codes based on discrete approximations of the Euler equations are now routinely used to obtain solutions of transonic flow problems in which the effects of entropy and vorticity production are significant. Such codes can even predict separation from a sharp edge, owing to the inclusion of artificial dissipation, intended to lend numerical stability to the calculation but at the same time enforcing the Kutta condition. One effect not correctly predictable by Euler codes is the separation from a smooth surface, and neither is viscous drag; for these some form of the Navier-Stokes equation is needed. It, therefore, comes as no surprise to observe that the Navier-Stokes has already begun before Euler solutions were fully exploited. Moreover, most numerical developments for the Euler equations are now constrained by the requirement that the techniques introduced, notably artificial dissipation, must not interfere with the new physics added when going from an Euler to a full Navier-Stokes approximation. In order to appreciate the contributions of Euler solvers to the understanding of transonic aerodynamics, it is useful to review the components of these computational tools. Space discretization, time- or pseudo-time marching and boundary procedures, the essential constituents are discussed. The subject of grid generation and grid adaptation to the solution are touched upon only where relevant. A list of unanswered questions and an outlook for the future are covered.

  1. Application of generalized separation of variables to solving mixed problems with irregular boundary conditions

    NASA Astrophysics Data System (ADS)

    Gasymov, E. A.; Guseinova, A. O.; Gasanova, U. N.

    2016-07-01

    One of the methods for solving mixed problems is the classical separation of variables (the Fourier method). If the boundary conditions of the mixed problem are irregular, this method, generally speaking, is not applicable. In the present paper, a generalized separation of variables and a way of application of this method to solving some mixed problems with irregular boundary conditions are proposed. Analytical representation of the solution to this irregular mixed problem is obtained.

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

  3. General approach to the problem of disruption forces in tokamaks

    NASA Astrophysics Data System (ADS)

    Pustovitov, V. D.

    2015-09-01

    An approach for calculating the force on the vessel wall during plasma disruptions in tokamaks is proposed. It is mainly based on the Maxwell equations and, therefore, is general. Another essential element is the integral force balance on the plasma that strongly constrains the possible solutions. The derived expressions are valid at any disruption scenario and finally give the net forces in terms of the magnetic perturbations behind the wall. The result can be used with magnetic measurements alone. It shows that the geometrical inhomogeneity of the wall and its resistivity are the key factors determining the direction and amplitude of the force.

  4. AN ADAPTIVE PARTICLE-MESH GRAVITY SOLVER FOR ENZO

    SciTech Connect

    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.

  5. MILAMIN 2 - Fast MATLAB FEM solver

    NASA Astrophysics Data System (ADS)

    Dabrowski, Marcin; Krotkiewski, Marcin; Schmid, Daniel W.

    2013-04-01

    MILAMIN is a free and efficient MATLAB-based two-dimensional FEM solver utilizing unstructured meshes [Dabrowski et al., G-cubed (2008)]. The code consists of steady-state thermal diffusion and incompressible Stokes flow solvers implemented in approximately 200 lines of native MATLAB code. The brevity makes the code easily customizable. An important quality of MILAMIN is speed - it can handle millions of nodes within minutes on one CPU core of a standard desktop computer, and is faster than many commercial solutions. The new MILAMIN 2 allows three-dimensional modeling. It is designed as a set of functional modules that can be used as building blocks for efficient FEM simulations using MATLAB. The utilities are largely implemented as native MATLAB functions. For performance critical parts we use MUTILS - a suite of compiled MEX functions optimized for shared memory multi-core computers. The most important features of MILAMIN 2 are: 1. Modular approach to defining, tracking, and discretizing the geometry of the model 2. Interfaces to external mesh generators (e.g., Triangle, Fade2d, T3D) and mesh utilities (e.g., element type conversion, fast point location, boundary extraction) 3. Efficient computation of the stiffness matrix for a wide range of element types, anisotropic materials and three-dimensional problems 4. Fast global matrix assembly using a dedicated MEX function 5. Automatic integration rules 6. Flexible prescription (spatial, temporal, and field functions) and efficient application of Dirichlet, Neuman, and periodic boundary conditions 7. Treatment of transient and non-linear problems 8. Various iterative and multi-level solution strategies 9. Post-processing tools (e.g., numerical integration) 10. Visualization primitives using MATLAB, and VTK export functions We provide a large number of examples that show how to implement a custom FEM solver using the MILAMIN 2 framework. The examples are MATLAB scripts of increasing complexity that address a given

  6. Quantitative analysis of numerical solvers for oscillatory biomolecular system models

    PubMed Central

    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

  7. Aeronautic instruments. Section I : general classification of instruments and problems including bibliography

    NASA Technical Reports Server (NTRS)

    Hersey, Mayo D

    1923-01-01

    This report is intended as a technical introduction to the series of reports on aeronautic instruments. It presents a discussion of those subjects which are common to all instruments. First, a general classification is given, embracing all types of instruments used in aeronautics. Finally, a classification is given of the various problems confronted by the instrument expert and investigator. In this way the following groups of problems are brought up for consideration: problems of mechanical design, human factor, manufacturing problems, supply and selection of instruments, problems concerning the technique of testing, problems of installation, problems concerning the use of instruments, problems of maintenance, and physical research problems. This enumeration of problems which are common to instruments in general serves to indicate the different points of view which should be kept in mind in approaching the study of any particular instrument.

  8. [Intestinal helminthiasis--general practice problem of the gastroenterologist].

    PubMed

    Volkheimer, G

    1996-09-01

    In case of nonspecific, not constantly occurring abdominal symptoms the investigator should be aware of invermination, especially when immigrants or tourists returning from far regions complain about diarrheal tendency, stomach ache, nausea or hepatic and biliary symptoms. Intestinal helminthism is spread all over the world. Some of these diseases are limited to warm regions, but they are more and more often seen in our gastroenterological outpatient departments. Nematodes are found most frequently, with a predominance of Ascaris, Trichuris, and Enterobius. But Ancylostoma and Strongyloides are not seldom, too. Concerning Cestodes, Taenia and Vampirolepis are predominant. Trematodes = Fasciola, Echinostoma, Schistosoma are less frequent. Larva migrans, Acanthocephala and Dipylidium sometimes cause considerable diagnostive problems. Classification of macroscopic and microscopic findings is decisive for the therapeutic strategy. For nematodiasis Mebendazole (Vermox, Surfont), Pyrantelembonate (Helmex), Pyrviniumembonate (Molevac, Pyrcon) are effective. Albendazole (Eskazole) is approved for strongyloidiasis. For cestodiasis Niclosamid (Yomesan) and Praziquantel (Cesol) are suited. Higher doses of Praziquantel (Biltricide) are recommended for trematodiasis. During pregnancy and lactation period absorbable anthelmintics have to be avoided. PMID:8975489

  9. Using native plants as problem-solvers

    SciTech Connect

    Harper-Lore, B.L.

    1996-11-01

    The Federal Highway administration encourages state highway agencies to use native plants in erosion control, revegetation, and landscaping solutions. This paper explains both policy reasons and technical reasons for the use of native plants. How native species can be used is shown through a roadside case study. Other applications of native plant use will be explained through a plant community approach. 5 refs., 2 figs.

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

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

  12. The Social Problem Solver for Designing Change.

    ERIC Educational Resources Information Center

    Slawski, Carl

    The aim of this paper is to summarize and tentatively synthesize a number of theories, typologies, and statements about systems and procedures for planned change in small groups, large organizations, and whole societies. Concepts are brought together from psychology, applied sociology, and business management, as well as diplomatic negotiation at…

  13. Implementation of a fully-balanced periodic tridiagonal solver on a parallel distributed memory architecture

    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.

  14. The recognition of family and social problems by general practitioners: towards developing a taxonomy

    PubMed Central

    Metcalfe, D. H. H.

    1978-01-01

    A short feasibility study to investigate the recognition rate and precision of family problems by general practitioners is described. The need for such work in preparing a taxonomy of family and social problems, and the difficulties involved are discussed. Further support by general practitioners is invited. PMID:553169

  15. Error analysis of householder transformations as applied to the standard and generalized eigenvalue problems

    NASA Technical Reports Server (NTRS)

    Ward, R. C.

    1974-01-01

    Backward error analyses of the application of Householder transformations to both the standard and the generalized eigenvalue problems are presented. The analysis for the standard eigenvalue problem determines the error from the application of an exact similarity transformation, and the analysis for the generalized eigenvalue problem determines the error from the application of an exact equivalence transformation. Bounds for the norms of the resulting perturbation matrices are presented and compared with existing bounds when known.

  16. An amoeboid algorithm for solving linear transportation problem

    NASA Astrophysics Data System (ADS)

    Gao, Cai; Yan, Chao; Zhang, Zili; Hu, Yong; Mahadevan, Sankaran; Deng, Yong

    2014-03-01

    Transportation Problem (TP) is one of the basic operational research problems, which plays an important role in many practical applications. In this paper, a bio-inspired mathematical model is proposed to handle the Linear Transportation Problem (LTP) in directed networks by modifying the original amoeba model Physarum Solver. Several examples are used to prove that the provided model can effectively solve Balanced Transportation Problem (BTP), Unbalanced Transportation Problem (UTP), especially the Generalized Transportation Problem (GTP), in a nondiscrete way.

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

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

  19. The Domain Generality--Specificity of Epistemological Beliefs: A Theoretical Problem, a Methodological Problem or Both?

    ERIC Educational Resources Information Center

    Limon, Margarita

    2006-01-01

    Research on epistemological beliefs has clearly increased in the last decade. Even though the construct is clearer and relevant data are being collected, there are important theoretical and methodological issues that need further clarification. One of them is the debate about the domain generality-specificity of epistemological beliefs. I argue…

  20. User documentation for PVODE, an ODE solver for parallel computers

    SciTech Connect

    Hindmarsh, A.C., LLNL

    1998-05-01

    PVODE is a general purpose ordinary differential equation (ODE) solver for stiff and nonstiff ODES It is based on CVODE [5] [6], which is written in ANSI- standard C PVODE uses MPI (Message-Passing Interface) [8] and a revised version of the vector module in CVODE to achieve parallelism and portability PVODE is intended for the SPMD (Single Program Multiple Data) environment with distributed memory, in which all vectors are identically distributed across processors In particular, the vector module is designed to help the user assign a contiguous segment of a given vector to each of the processors for parallel computation The idea is for each processor to solve a certain fixed subset of the ODES To better understand PVODE, we first need to understand CVODE and its historical background The ODE solver CVODE, which was written by Cohen and Hindmarsh, combines features of two earlier Fortran codes, VODE [l] and VODPK [3] Those two codes were written by Brown, Byrne, and Hindmarsh. Both use variable-coefficient multi-step integration methods, and address both stiff and nonstiff systems (Stiffness is defined as the presence of one or more very small damping time constants ) VODE uses direct linear algebraic techniques to solve the underlying banded or dense linear systems of equations in conjunction with a modified Newton method in the stiff ODE case On the other hand, VODPK uses a preconditioned Krylov iterative method [2] to solve the underlying linear system User-supplied preconditioners directly address the dominant source of stiffness Consequently, CVODE implements both the direct and iterative methods Currently, with regard to the nonlinear and linear system solution, PVODE has three method options available. functional iteration, Newton iteration with a diagonal approximate Jacobian, and Newton iteration with the iterative method SPGMR (Scaled Preconditioned Generalized Minimal Residual method) Both CVODE and PVODE are written in such a way that other linear

  1. Sleep problems in general practice: a national survey of assessment and treatment routines of general practitioners in Norway.

    PubMed

    Sivertsen, Børge; Nordhus, Inger H; Bjorvatn, Bjørn; Pallesen, Ståle

    2010-03-01

    The aim of the current national survey of all general practitioners (GPs) practising in Norway was to explore assessment, treatment practice and perceived efficacy of treatment of sleep problems in general practice. A short questionnaire, including self-report measures of the frequency and routines of treatment and assessment of sleep problems, was sent to all 4049 GPs in Norway, of whom 1465 (36.7%) provided valid responses. The prevalence of sleep problems among patients in general practice was estimated to be 11.2%, of which almost two-thirds were believed to be caused by a medical condition. Anamnestic information and blood tests were the most common assessment of sleep problems, whereas GPs rarely referred patients to all-night polysomnographic recording. Sleep hygiene advices were the most commonly used treatment strategy, whereas hypnotics were believed to have the best short-term efficacy. Antidepressives were considered to be the best option for long-term management of sleep problems. About one-third of the patients were prescribed benzodiazepines or 'Z-drugs' for more than 6 months. This study demonstrates that sleep problems are recognized by GPs, but despite evidence that non-pharmacological treatment is superior in the long-term management of insomnia, the current study shows that hypnotics are still considered by GPs to be the most successful treatment. PMID:19732316

  2. A Look at the Generalized Heron Problem through the Lens of Majorization-Minimization

    PubMed Central

    Chi, Eric C.; Lange, Kenneth

    2013-01-01

    In a recent issue of this journal, Mordukhovich, Nam, and Salinas pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem, one is given k + 1 closed convex sets in ℝd equipped with its Euclidean norm and asked to find the point in the last set such that the sum of the distances to the first k sets is minimal. In later work, the authors generalize the Heron problem even further, relax its convexity assumptions, study its theoretical properties, and pursue subgradient algorithms for solving the convex case. Here, we revisit the original problem solely from the numerical perspective. By exploiting the majorization-minimization (MM) principle of computational statistics and rudimentary techniques from differential calculus, we are able to construct a very fast algorithm for solving the Euclidean version of the generalized Heron problem. PMID:25242816

  3. A multiple right hand side iterative solver for history matching

    SciTech Connect

    Killough, J.E.; Sharma, Y.; Dupuy, A.; Bissell, R.; Wallis, J.

    1995-12-31

    History matching of oil and gas reservoirs can be accelerated by directly calculating the gradients of observed quantities (e.g., well pressure) with respect to the adjustable reserve parameters (e.g., permeability). This leads to a set of linear equations which add a significant overhead to the full simulation run without gradients. Direct Gauss elimination solvers can be used to address this problem by performing the factorization of the matrix only once and then reusing the factor matrix for the solution of the multiple right hand sides. This is a limited technique, however. Experience has shown that problems with greater than few thousand cells may not be practical for direct solvers because of computation time and memory limitations. This paper discusses the implementation of a multiple right hand side iterative linear equation solver (MRHS) for a system of adjoint equations to significantly enhance the performance of a gradient simulator.

  4. Study of general practice consultations and menopausal problems. Oxford General Practitioners Menopause Study Group.

    PubMed Central

    Barlow, D H; Brockie, J A; Rees, C M

    1991-01-01

    OBJECTIVE--To investigate the nature of work related to the menopause in general practice. DESIGN--Questionnaire study over six months among general practitioners after each consultation with a woman aged 40-69 at which issues related to the climacteric had been discussed. SETTING--9 General practices in the Oxford area. SUBJECTS--416 Women who had 572 consultations. MAIN OUTCOME MEASURES--Age, menopausal state, and first or subsequent consultation. Symptoms were classified together with the treatment and the outcome of the consultation. RESULTS--The consultation rate varied greatly between practices, the overall rate being 4.4%. There were many premenopausal women and women in their 60s presenting; women with hysterectomies presented more often--36% (37/103) of women with hysterectomies had more than one consultation compared with 26% (38/144) for premenopausal women and 24% (38/155) for postmenopausal women. 409 women had symptoms and 218 were prescribed oestrogen treatment. 156 of the consultations involved discussion and advice only. Only four women were referred to a local specialist clinic. CONCLUSION--There is a low overall use of hormone replacement therapy in the general postmenopausal population despite the recent media coverage of its benefits in the prevention of osteoporosis and subsequent fractures. PMID:1998795

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

  6. A GPU-accelerated flow solver for incompressible two-phase fluid flows

    NASA Astrophysics Data System (ADS)

    Codyer, Stephen; Raessi, Mehdi; Khanna, Gaurav

    2011-11-01

    We present a numerical solver for incompressible, immiscible, two-phase fluid flows that is accelerated by using Graphics Processing Units (GPUs). The Navier-Stokes equations are solved by the projection method, which involves solving a pressure Poisson problem at each time step. A second-order discretization of the Poisson problem leads to a sparse matrix with five and seven diagonals for two- and three-dimensional simulations, respectively. Running a serial linear algebra solver on a single CPU can take 50-99.9% of the total simulation time to solve the above system for pressure. To remove this bottleneck, we utilized the large parallelization capabilities of GPUs; we developed a linear algebra solver based on the conjugate gradient iterative method (CGIM) by using CUDA 4.0 libraries and compared its performance with CUSP, an open-source, GPU library for linear algebra. Compared to running the CGIM solver on a single CPU core, for a 2D case, our GPU solver yields speedups of up to 88x in solver time and 81x overall time on a single GPU card. In 3D cases, the speedups are up to 81x (solver) and 15x (overall). Speedup is faster at higher grid resolutions and our GPU solver outperforms CUSP. Current work examines the acceleration versus a parallel CGIM CPU solver.

  7. Optimising a parallel conjugate gradient solver

    SciTech Connect

    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.

  8. A block iterative LU solver for weakly coupled linear systems. [in fluid dynamics equations

    NASA Technical Reports Server (NTRS)

    Cooke, C. H.

    1977-01-01

    A hybrid technique, called the block iterative LU solver, is proposed for solving the linear equations resulting from a finite element numerical analysis of certain fluid dynamics problems where the equations are weakly coupled between distinct sets of variables. Either the block Jacobi iterative method or the block Gauss-Seidel iterative solver is combined with LU decomposition.

  9. Multilevel solvers of first-order system least-squares for Stokes equations

    SciTech Connect

    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.

  10. The association between childhood autistic traits and adolescent psychotic experiences is explained by general neuropsychiatric problems.

    PubMed

    Cederlöf, Martin; Pettersson, Erik; Sariaslan, Amir; Larsson, Henrik; Östberg, Per; Kelleher, Ian; Långström, Niklas; Gumpert, Clara Hellner; Lundström, Sebastian; Lichtenstein, Paul

    2016-03-01

    Studies suggest associations between childhood autistic traits and adolescent psychotic experiences. However, recent research suggests that a general neuropsychiatric problems factor predicts adverse outcomes better than specific diagnostic entities. To examine if the alleged association between autistic traits and psychotic experiences could rather be explained by a general neuropsychiatric problems factor comprising symptoms of ADHD, tic disorder, developmental coordination disorder, and learning disorder, we conducted a prospective cohort study based on the Child and Adolescent Twin Study in Sweden. In addition, we examined the genetic and environmental influences on the associations. A total of 9,282 twins with data on childhood autistic traits and other neuropsychiatric problems, and follow-up data on psychotic experiences at ages 15 and/or 18 years were included. First, psychotic experiences were regressed on autistic traits and second, the general neuropsychiatric problems factor was added to the model. Auditory hallucinations were analyzed separately from the other psychotic experiences. Finally, twin analyses were employed to disentangle genetic from environmental influences in the observed associations. Replicating prior research, significant associations were found between autistic traits in childhood and auditory hallucinations at ages 15 and 18. However, after controlling for the general neuropsychiatric problems factor, the associations between autistic traits and auditory hallucinations disappeared, whereas the association between the general neuropsychiatric problems factor and auditory hallucinations persisted after controlling for autistic traits. Twin analyses revealed that the association between the general neuropsychiatric problems factor and auditory hallucinations was driven by shared genetic influences. © 2015 Wiley Periodicals, Inc. PMID:26464122

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

  12. A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS

    SciTech Connect

    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.

  13. Sleep Problems Predict and are Predicted by Generalized Anxiety/Depression and Oppositional Defiant Disorder

    PubMed Central

    Shanahan, Lilly; Copeland, William E.; Angold, Adrian; Bondy, Carmen L.; Costello, E. Jane

    2014-01-01

    Objective We tested whether sleep problems co-occur with, precede, and/or follow common psychiatric disorders during childhood and adolescence. We also clarified the role of comorbidity, and tested for specificity of associations among sleep problems and psychiatric disorders. Method Data came from the Great Smoky Mountains Study, a representative population sample of 1,420 children, assessed 4 to 7 times per person between ages 9 and 16 for major DSM-IV disorders and sleep problems. Sleep-related symptoms were removed from diagnostic criteria when applicable. Results Sleep problems during childhood and adolescence were common, with restless sleep and difficulty falling asleep being the most common symptoms. Cross-sectional analyses showed that sleep problems co-occurred with many psychiatric disorders. Longitudinal analyses revealed that sleep problems predicted increases in the prevalence of later generalized anxiety disorder and high generalized anxiety disorder/depression symptoms, and oppositional defiant disorder. In turn, generalized anxiety disorder and/or depression and oppositional defiant disorder predicted increases in sleep problems over time. Conclusions Sleep problems both predict and are predicted by a diagnostic cluster that includes oppositional defiant disorder, generalized anxiety disorder and depression. Screening children for sleep problems could offer promising opportunities for reducing the burden from mental illness during the early life course. PMID:24745954

  14. Consultations for women's health problems: factors influencing women's choice of sex of general practitioner.

    PubMed Central

    van den Brink-Muinen, A; de Bakker, D H; Bensing, J M

    1994-01-01

    AIM. This study set out to examine the degree to which women choose to visit a woman doctor for women's health problems and the determinants of this choice. The differences between women and men doctors with regard to treating women's health problems were also studied. METHOD. Data from the Dutch national survey of general practice were used. All group practices with both women and men general practitioners were selected. Analyses were restricted to consultations among women aged 15-65 years about menstruation, the menopause, vaginal discharge, breast examination and cervical smear tests. RESULts. Given the size of their female practice population, women doctors saw considerably more women with women's health problems than did their male colleagues. Women were more likely to consult a woman general practitioner if she was more available (that is, working longer hours), and younger women were more likely than older women to choose women general practitioners. Sex differences in the treatment of women's health problems were small and mainly related to the verbal part of the consultation: counselling and providing information. The doctors' availability and their certainty about the working diagnosis explained differences in the verbal aspects of consultations. Women general practitioners had longer consultations than their male colleagues mainly because more health problems were presented per consultation. CONCLUSION. In order to increase the possibility of patients choosing women general practitioners, policy should be directed towards the education of more women general practitioners and women general practitioners should be encouraged to work more days a week. PMID:8204333

  15. The Effect of Instruction with Graphing Calculators on How General Mathematics Students Naturalistically Solve Algebraic Problems.

    ERIC Educational Resources Information Center

    Merriweather, Michelle; Tharp, Marcia L.

    1999-01-01

    Focuses on changes in attitude toward mathematics and calculator use and changes in how general mathematics students naturalistically solve algebraic problems. Uses a survey to determine whether a student is rule-based. Concludes that the rule-based students used an equation to solve the algebraic word problem whereas the non-rule-based students…

  16. Some properties of eigenvalues and generalized eigenvectors of one boundary-value problem

    NASA Astrophysics Data System (ADS)

    Olgar, Hayati; Mukhtarov, Oktay; Aydemir, Kadriye

    2016-08-01

    We investigate a discontinuous boundary value problem which consists of a Sturm-Liouville equation with piece-wise continuous potential together with eigenparameter-dependent boundary conditions and supplementary transmission conditions. We establish some spectral properties of the considered problem. In particular it is shown that the generalized eigen-functions form a Riesz basis of the adequate Hilbert space.

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

  18. An Exact Riemann Solver for a Granular Mixture Model with Multiple Solid Components

    NASA Astrophysics Data System (ADS)

    Crochet, Michael; Gonthier, Keith

    2013-06-01

    The solution of the two-phase Riemann problem is an essential component of finite-volume numerical methods applied to hyperbolic systems of multiphase model equations. These are typically used to study deflagration-to-detonation transition in energetic materials, and predict flow field structures associated with the dynamic compaction of gas-granular solid mixtures. A widely-used two-phase model has been extended recently to include an arbitrary number of solid components, which can be used to analyze the thermomechanical behavior of metallized explosives and mixtures containing multiple solid grain sizes. Although a solution to the two-phase Riemann problem has been formulated for gamma-law equations of state, there is currently no available solution for the N-phase analogue in the literature. Here, an extension of the exact two-phase solution to systems containing multiple solid phases is developed, where each phase is governed by general, convex equations of state. The resulting Riemann solver can be used in the verification of existing numerical schemes, and also serve as a framework for the future construction of upwind, Godunov-based numerical methods. A general overview of the solver methodology is given, and three-phase example problems are considered. This work was supported by NSF-IGERT on Computational Fluid Dynamics at Louisiana State University, grant number DGE-0504507.

  19. Laser engine simulation using pressure based Navier-Stokes solver

    NASA Astrophysics Data System (ADS)

    Youssef, Hazim Saad

    1994-03-01

    Analysis of the flow field in a laser engine represents a difficult computational problem involving combinations of complex physical and gas-dynamical processes. Following a brief discussion of these processes a calculation procedure using primitive variables formulation on a nonstaggered grid system is introduced. Based on this procedure, a pressure based Navier-Stokes solver (PBNS) is developed using a generalized curvilinear coordinate system. The solver is first tested in application to a subsonic compressible flow over an insulated flat plate and to a flow in an axisymmetric converging-diverging nozzle. Next, the PBNS code is used to analyze the flowfield and performance of a laser thruster. The physical/numerical model includes the geometric ray tracing for the laser beam, beam power absorption, plasma radiation losses, and plasma thermophysical and optical properties. Equilibrium hydrogen is used as a flowing gas and its properties are calculated using the Hydrogen Properties Calculation (HPC) based on the methods of statistical thermodynamics. Two thrustor configurations, two laser types (CO2 and iodide), various laser power levels, and various injection conditions are tested. The results of these tests include the temperature, pressure, velocity, and Mach number contours, as well as tables of the laser beam power absorbed, radiation losses to the thrustor walls, thrust level, and specific impulse. The maximum specific impulse obtained in these tests is 1537 sec for a CO2 laser thruster and 827 sec for an iodide laser thruster. Up to 100% power absorption can be achieved; however, radiation losses from the hot plasma are quite high disallowing a full conversion of the absorbed power into the thermal energy of the propellant. The PBNS code can be used to study the effects of various design parameters on the performance of a laser thruster and provide guidelines for the preliminary design of a laser engine.

  20. Fast Euler solver for transonic airfoils. I - Theory. II - Applications

    NASA Technical Reports Server (NTRS)

    Dadone, Andrea; Moretti, Gino

    1988-01-01

    Equations written in terms of generalized Riemann variables are presently integrated by inverting six bidiagonal matrices and two tridiagonal matrices, using an implicit Euler solver that is based on the lambda-formulation. The solution is found on a C-grid whose boundaries are very close to the airfoil. The fast solver is then applied to the computation of several flowfields on a NACA 0012 airfoil at various Mach number and alpha values, yielding results that are primarily concerned with transonic flows. The effects of grid fineness and boundary distances are analyzed; the code is found to be robust and accurate, as well as fast.

  1. Management of minor medical problems and trauma: general practice or hospital?

    PubMed Central

    Myers, P

    1982-01-01

    An assessment of the problems for which 1000 consecutive patients attended an accident and emergency department of a district general hospital showed that 54.2% could have been treated by general practitioner. Amongst 150 patients attending hospital for minor problems between the hours of 09:00 and 19:00 on weekdays, the main reason given for not going to a GP was their impression that only in hospital could the required treatment be provided. A postal survey of 50 GPs found that they tended to avoid regularly handling certain specified minor problems which often present to hospital. The current trend away from the community management of such problems is discussed. It is suggested that improving patient education and GPs' incentives, while decreasing list sizes and expanding the primary care team, may encourage the management by GPs of trivial trauma and minor medical problems. PMID:7143339

  2. Coordinate Projection-based Solver for ODE with Invariants

    SciTech Connect

    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.

  3. An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

    PubMed

    Zhao, Yingfeng; Liu, Sanyang

    2016-01-01

    We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient. PMID:27547676

  4. Time-domain Raman analytical forward solvers.

    PubMed

    Martelli, Fabrizio; Binzoni, Tiziano; Sekar, Sanathana Konugolu Venkata; Farina, Andrea; Cavalieri, Stefano; Pifferi, Antonio

    2016-09-01

    A set of time-domain analytical forward solvers for Raman signals detected from homogeneous diffusive media is presented. The time-domain solvers have been developed for two geometries: the parallelepiped and the finite cylinder. The potential presence of a background fluorescence emission, contaminating the Raman signal, has also been taken into account. All the solvers have been obtained as solutions of the time dependent diffusion equation. The validation of the solvers has been performed by means of comparisons with the results of "gold standard" Monte Carlo simulations. These forward solvers provide an accurate tool to explore the information content encoded in the time-resolved Raman measurements. PMID:27607645

  5. Using the scalable nonlinear equations solvers package

    SciTech Connect

    Gropp, W.D.; McInnes, L.C.; Smith, B.F.

    1995-02-01

    SNES (Scalable Nonlinear Equations Solvers) is a software package for the numerical solution of large-scale systems of nonlinear equations on both uniprocessors and parallel architectures. SNES also contains a component for the solution of unconstrained minimization problems, called SUMS (Scalable Unconstrained Minimization Solvers). Newton-like methods, which are known for their efficiency and robustness, constitute the core of the package. As part of the multilevel PETSc library, SNES incorporates many features and options from other parts of PETSc. In keeping with the spirit of the PETSc library, the nonlinear solution routines are data-structure-neutral, making them flexible and easily extensible. This users guide contains a detailed description of uniprocessor usage of SNES, with some added comments regarding multiprocessor usage. At this time the parallel version is undergoing refinement and extension, as we work toward a common interface for the uniprocessor and parallel cases. Thus, forthcoming versions of the software will contain additional features, and changes to parallel interface may result at any time. The new parallel version will employ the MPI (Message Passing Interface) standard for interprocessor communication. Since most of these details will be hidden, users will need to perform only minimal message-passing programming.

  6. On code verification of RANS solvers

    NASA Astrophysics Data System (ADS)

    Eça, L.; Klaij, C. M.; Vaz, G.; Hoekstra, M.; Pereira, F. S.

    2016-04-01

    This article discusses Code Verification of Reynolds-Averaged Navier Stokes (RANS) solvers that rely on face based finite volume discretizations for volumes of arbitrary shape. The study includes test cases with known analytical solutions (generated with the method of manufactured solutions) corresponding to laminar and turbulent flow, with the latter using eddy-viscosity turbulence models. The procedure to perform Code Verification based on grid refinement studies is discussed and the requirements for its correct application are illustrated in a simple one-dimensional problem. It is shown that geometrically similar grids are recommended for proper Code Verification and so the data should not have scatter making the use of least square fits unnecessary. Results show that it may be advantageous to determine the extrapolated error to cell size/time step zero instead of assuming that it is zero, especially when it is hard to determine the asymptotic order of grid convergence. In the RANS examples, several of the features of the ReFRESCO solver are checked including the effects of the available turbulence models in the convergence properties of the code. It is shown that it is required to account for non-orthogonality effects in the discretization of the diffusion terms and that the turbulence quantities transport equations can deteriorate the order of grid convergence of mean flow quantities.

  7. Performance Models for the Spike Banded Linear System Solver

    DOE PAGESBeta

    Manguoglu, Murat; Saied, Faisal; Sameh, Ahmed; Grama, Ananth

    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

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

    demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current

  9. On unstructured grids and solvers

    NASA Technical Reports Server (NTRS)

    Barth, T. J.

    1990-01-01

    The fundamentals and the state-of-the-art technology for unstructured grids and solvers are highlighted. Algorithms and techniques pertinent to mesh generation are discussed. It is shown that grid generation and grid manipulation schemes rely on fast multidimensional searching. Flow solution techniques for the Euler equations, which can be derived from the integral form of the equations are discussed. Sample calculations are also provided.

  10. General practitioners' knowledge of their patients' psychosocial problems: multipractice questionnaire survey.

    PubMed Central

    Gulbrandsen, P.; Hjortdahl, P.; Fugelli, P.

    1997-01-01

    OBJECTIVES: To evaluate general practitioners' knowledge of a range of psychosocial problems among their patients and to explore whether doctors' recognition of psychosocial problems depends on previous general knowledge about the patient or the type of problem or on certain characteristics of the doctor or the patient. DESIGN: Multipractice survey of consecutive adult patients consulting general practitioners. Doctors and patients answered written questions. SETTING: Buskerud county, Norway. SUBJECTS: 1401 adults attending 89 general practitioners during one regular working day in March 1995. MAIN OUTCOME MEASURES: Doctors' knowledge of nine predefined psychosocial problems in patients; these problems were assessed by the patients as affecting their health on the day of consultation; odds ratios for the doctor's recognition of each problem, adjusted for characteristics of patients, doctors, and practices; and the doctor's assessment of previous general knowledge about the patient. RESULTS: Doctors' knowledge of the problems ranged from 53% (108/203) of "stressful working conditions" to 19% (12/63) of a history of "violence or threats." Good previous knowledge of the patient increased the odds for the doctor's recognition of "sorrow," "violence or threats," "substance misuse in close friend or relative," and "difficult conflict with close friend or relative." Age and sex of doctor and patient, patient's educational level and living situation, and location of practice influenced the doctor's awareness. CONCLUSIONS: Variation in the patients' communication abilities, the need for confidence in the doctor-patient relationship before revealing intimate problems, and a tendency for the doctors to be entrapped by their expectations may explain these findings. PMID:9112847