The Human Mind As General Problem Solver
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.
Directory of Open Access Journals (Sweden)
Jürgen eSchmidhuber
2013-06-01
Full Text Available 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. The novel algorithmic framework POWERPLAY (2011 continually 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. Wow-effects are achieved by continually making previously learned skills more efficient such that they require less time and space. New skills may (partially re-use previously learned skills. POWERPLAY's search orders candidate pairs of tasks and solver modifications by their conditional computational (time & space complexity, given the stored experience so far. The new task and its corresponding task-solving skill are those first found and validated. The computational costs of validating new tasks need not grow with task repertoire size. POWERPLAY's ongoing search for novelty keeps breaking the generalization abilities of its present solver. This is related to Goedel's sequence of increasingly powerful formal theories based on adding formerly unprovable statements to the axioms without affecting previously provable theorems. The continually increasing repertoire of problem solving procedures can be exploited by a parallel search for solutions to additional externally posed tasks. POWERPLAY may be viewed as a greedy but practical implementation of basic principles of creativity. A first experimental analysis can be found in separate papers [58, 56, 57].
Differential equations problem solver
Arterburn, David R
2012-01-01
REA's Problem Solvers is a series of useful, practical, and informative study guides. Each title in the series is complete step-by-step solution guide. The Differential Equations Problem Solver enables students to solve difficult problems by showing them step-by-step solutions to Differential Equations problems. The Problem Solvers cover material ranging from the elementary to the advanced and make excellent review books and textbook companions. They're perfect for undergraduate and graduate studies.The Differential Equations Problem Solver is the perfect resource for any class, any exam, and
Modified and fuzzified general problem solver for the 'monkey and banana' problem, 1
International Nuclear Information System (INIS)
Sano, Norihide; Takahashi, Ryoichi.
1991-01-01
The master-and-slave control system should be extensively implemented for the in-service inspection of operating nuclear power stations or the decommission of retired plants. The performance of this system depends on the intelligent slave. In this paper the degree of intelligence is approximated by the given amount of prior knowledge or suggestions. This paper aims at improving the general problem solver (GPS) by incorporating the learning process in order to solve the puzzle of the 'monkey and banana'. The monkey in this puzzle may be a reasonable alternative to represent the intelligent slave. Also, this paper deals with fuzzified problem solving since the master's command is not always crisp to the slave. (author)
Modified and fuzzified general problem solver for 'monkey and banana' problem
International Nuclear Information System (INIS)
Sano, Norihide; Takahashi, Ryoichi.
1994-01-01
Automatic operation is important for the in-service inspection of nuclear power stations of the decommission of retired plants. Master and slave control will be introduced for work-robot control. It is desirable that the slave possess problem-solving capabilities. In this paper we assume that the slave incorporates the general problem solver (GPS) algorithm. In view of having solved the 'monkey and banana' problem, the slave system is regarded as reasonable alternative which incorporates the capability of problem-solving. Basically, the GPS solves a problem by reducing the difference between the initial state and goal state, and hence the performance of GPS depends on selection of the difference to be reduced. The conventional GPS is given the order of importance of the differences in advance. In this study, the GPS was improved by making use of the rules which determine the order. When several choices are available for the given difference, a fuzzified decision to determine the necessary action is made, as demonstrated in this paper. (author)
Modified and fuzzified general problem solver for 'monkey and banana' problem, 2
International Nuclear Information System (INIS)
Sano, Norihide; Takahashi, Ryoichi.
1991-01-01
The automatic operation is important for the in-service inspection of the operating nuclear power station or the decommission of retired plants. The master and slave control will be introduced for work-robot control. It is desirable that the slave involves the capability of problem solving. This paper assumed that the slave involved the general problem solver algorithm. In view of having solved the puzzle of the 'monkey and banana', the slave system is regarded as the reasonable alternative which incorporates the capability of problem solving. Basically, the GPS solves a problem by reducing the difference between an initial state and a goal state, and hence the performance of GPS depends on selecting the difference to be reduced. The usual GPS is given in advance the ordering which indicates the importance of the differences. In this paper, the GPS was improved by making use of the rules which decide the order. When several choices are found on the given difference, the fuzzified decision to determine the action is demonstrated in this paper. (author)
Brouwer-Janse, M.D.
1991-01-01
Most formal problem-solving studies use verbal protocol and observational data of problem solvers working on a task. In user-centred product-design projects, observational studies of users are frequently used too. In the latter case, however, systematic control of conditions, indepth analysis and
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
Electric circuits problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of electric circuits currently av
Advanced calculus problem solver
REA, Editors of
2012-01-01
Each Problem Solver is an insightful and essential study and solution guide chock-full of clear, concise problem-solving gems. All your questions can be found in one convenient source from one of the most trusted names in reference solution guides. More useful, more practical, and more informative, these study aids are the best review books and textbook companions available. Nothing remotely as comprehensive or as helpful exists in their subject anywhere. Perfect for undergraduate and graduate studies.Here in this highly useful reference is the finest overview of advanced calculus currently av
Hayes, John R.
This book, designed for a college course on general problem-solving skills, focuses on skills that can be used by anyone in solving problems that occur in everyday life. Part I considers theory and practice: understanding problems, search, and protocol analysis. Part II discusses memory and knowledge acquisition: the structure of human memory,…
Sherlock Holmes, Master Problem Solver.
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)
Modern solvers for Helmholtz problems
Tang, Jok; Vuik, Kees
2017-01-01
This edited volume offers a state of the art overview of fast and robust solvers for the Helmholtz equation. The book consists of three parts: new developments and analysis in Helmholtz solvers, practical methods and implementations of Helmholtz solvers, and industrial applications. The Helmholtz equation appears in a wide range of science and engineering disciplines in which wave propagation is modeled. Examples are: seismic inversion, ultrasone medical imaging, sonar detection of submarines, waves in harbours and many more. The partial differential equation looks simple but is hard to solve. In order to approximate the solution of the problem numerical methods are needed. First a discretization is done. Various methods can be used: (high order) Finite Difference Method, Finite Element Method, Discontinuous Galerkin Method and Boundary Element Method. The resulting linear system is large, where the size of the problem increases with increasing frequency. Due to higher frequencies the seismic images need to b...
Creativity for Problem Solvers
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
2009-01-01
This paper presents some modern and interdisciplinary concepts about creativity and creative processes specially related to problem solving. Central publications related to the theme are briefly reviewed. Creative tools and approaches suitable to support problem solving are also presented. Finally......, the paper outlines the author’s experiences using creative tools and approaches to: Facilitation of problem solving processes, strategy development in organisations, design of optimisation systems for large scale and complex logistic systems, and creative design of software optimisation for complex non...
A generalized gyrokinetic Poisson solver
International Nuclear Information System (INIS)
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
Test set for initial value problem solvers
W.M. Lioen (Walter); J.J.B. de Swart (Jacques)
1998-01-01
textabstractThe CWI test set for IVP solvers presents a collection of Initial Value Problems to test solvers for implicit differential equations. This test set can both decrease the effort for the code developer to test his software in a reliable way, and cross the bridge between the application
Problem Solvers' Conceptions about Osmosis.
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)
From 'troublemakers' to problem solvers
DEFF Research Database (Denmark)
Frandsen, Martin Severin; Pfeiffer Petersen, Lene
2012-01-01
in a disadvantaged neighbourhood in the suburbs of Copenhagen, designed and constructed colourful and imaginative dustbins to handle problems with local littering. The project was successful in creating an increased local awareness of waste management and reducing the amount of litter. However, the more important...
Fostering Creative Problem Solvers in Higher Education
DEFF Research Database (Denmark)
Zhou, Chunfang
2016-01-01
to meet such challenges. This chapter aims to illustrate how to understand: 1) complexity as the nature of professional practice; 2) creative problem solving as the core skill in professional practice; 3) creativity as interplay between persons and their environment; 4) higher education as the context......Recent studies have emphasized issues of social emergence based on thinking of societies as complex systems. The complexity of professional practice has been recognized as the root of challenges for higher education. To foster creative problem solvers is a key response of higher education in order...... of fostering creative problem solvers; and 5) some innovative strategies such as Problem-Based Learning (PBL) and building a learning environment by Information Communication Technology (ICT) as potential strategies of creativity development. Accordingly, this chapter contributes to bridge the complexity...
Finegold, M.; Mass, R.
1985-01-01
Good problem solvers and poor problem solvers in advanced physics (N=8) were significantly different in their ability in translating, planning, and physical reasoning, as well as in problem solving time; no differences in reliance on algebraic solutions and checking problems were noted. Implications for physics teaching are discussed. (DH)
Aleph Field Solver Challenge Problem Results Summary
Energy Technology Data Exchange (ETDEWEB)
Hooper, Russell [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Moore, Stan Gerald [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-01-01
Aleph models continuum electrostatic and steady and transient thermal fields using a finite-element method. Much work has gone into expanding the core solver capability to support enriched modeling consisting of multiple interacting fields, special boundary conditions and two-way interfacial coupling with particles modeled using Aleph's complementary particle-in-cell capability. This report provides quantitative evidence for correct implementation of Aleph's field solver via order- of-convergence assessments on a collection of problems of increasing complexity. It is intended to provide Aleph with a pedigree and to establish a basis for confidence in results for more challenging problems important to Sandia's mission that Aleph was specifically designed to address.
Parallel Solver for H(div) Problems Using Hybridization and AMG
Energy Technology Data Exchange (ETDEWEB)
Lee, Chak S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-15
In this paper, a scalable parallel solver is proposed for H(div) problems discretized by arbitrary order finite elements on general unstructured meshes. The solver is based on hybridization and algebraic multigrid (AMG). Unlike some previously studied H(div) solvers, the hybridization solver does not require discrete curl and gradient operators as additional input from the user. Instead, only some element information is needed in the construction of the solver. The hybridization results in a H1-equivalent symmetric positive definite system, which is then rescaled and solved by AMG solvers designed for H1 problems. Weak and strong scaling of the method are examined through several numerical tests. Our numerical results show that the proposed solver provides a promising alternative to ADS, a state-of-the-art solver [12], for H(div) problems. In fact, it outperforms ADS for higher order elements.
Metaheuristics progress as real problem solvers
Nonobe, Koji; Yagiura, Mutsunori
2005-01-01
Metaheuristics: Progress as Real Problem Solvers is a peer-reviewed volume of eighteen current, cutting-edge papers by leading researchers in the field. Included are an invited paper by F. Glover and G. Kochenberger, which discusses the concept of Metaheuristic agent processes, and a tutorial paper by M.G.C. Resende and C.C. Ribeiro discussing GRASP with path-relinking. Other papers discuss problem-solving approaches to timetabling, automated planograms, elevators, space allocation, shift design, cutting stock, flexible shop scheduling, colorectal cancer and cartography. A final group of methodology papers clarify various aspects of Metaheuristics from the computational view point.
Scalable Newton-Krylov solver for very large power flow problems
Idema, R.; Lahaye, D.J.P.; Vuik, C.; Van der Sluis, L.
2010-01-01
The power flow problem is generally solved by the Newton-Raphson method with a sparse direct solver for the linear system of equations in each iteration. While this works fine for small power flow problems, we will show that for very large problems the direct solver is very slow and we present
A General Symbolic PDE Solver Generator: Explicit Schemes
Directory of Open Access Journals (Sweden)
K. Sheshadri
2003-01-01
Full Text Available A symbolic solver generator to deal with a system of partial differential equations (PDEs in functions of an arbitrary number of variables is presented; it can also handle arbitrary domains (geometries of the independent variables. Given a system of PDEs, the solver generates a set of explicit finite-difference methods to any specified order, and a Fourier stability criterion for each method. For a method that is stable, an iteration function is generated symbolically using the PDE and its initial and boundary conditions. This iteration function is dynamically generated for every PDE problem, and its evaluation provides a solution to the PDE problem. A C++/Fortran 90 code for the iteration function is generated using the MathCode system, which results in a performance gain of the order of a thousand over Mathematica, the language that has been used to code the solver generator. Examples of stability criteria are presented that agree with known criteria; examples that demonstrate the generality of the solver and the speed enhancement of the generated C++ and Fortran 90 codes are also presented.
Experiences with linear solvers for oil reservoir simulation problems
Energy Technology Data Exchange (ETDEWEB)
Joubert, W.; Janardhan, R. [Los Alamos National Lab., NM (United States); 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.
International Nuclear Information System (INIS)
2005-01-01
This article presents the general problems as natural disasters, consequences of global climate change, public health, the danger of criminal actions, the availability to information about problems of environment
VCODE, Ordinary Differential Equation Solver for Stiff and Non-Stiff Problems
International Nuclear Information System (INIS)
Cohen, Scott D.; Hindmarsh, Alan C.
2001-01-01
1 - Description of program or function: CVODE is a package written in ANSI standard C for solving initial value problems for ordinary differential equations. It solves both stiff and non stiff systems. In the stiff case, it includes a variety of options for treating the Jacobian of the system, including dense and band matrix solvers, and a preconditioned Krylov (iterative) solver. 2 - Method of solution: Integration is by Adams or BDF (Backward Differentiation Formula) methods, at user option. Corrector iteration is by functional iteration or Newton iteration. For the solution of linear systems within Newton iteration, users can select a dense solver, a band solver, a diagonal approximation, or a preconditioned Generalized Minimal Residual (GMRES) solver. In the dense and band cases, the user can supply a Jacobian approximation or let CVODE generate it internally. In the GMRES case, the pre-conditioner is user-supplied
Integrating Problem Solvers from Analogous Markets in New Product Ideation
DEFF Research Database (Denmark)
Franke, Nikolaus; Poetz, Marion; Schreier, Martin
2014-01-01
Who provides better inputs to new product ideation tasks, problem solvers with expertise in the area for which new products are to be developed or problem solvers from “analogous” markets that are distant but share an analogous problem or need? Conventional wisdom appears to suggest that target...... market expertise is indispensable, which is why most managers searching for new ideas tend to stay within their own market context even when they do search outside their firms' boundaries. However, in a unique symmetric experiment that isolates the effect of market origin, we find evidence...... for the opposite: Although solutions provided by problem solvers from analogous markets show lower potential for immediate use, they demonstrate substantially higher levels of novelty. Also, compared to established novelty drivers, this effect appears highly relevant from a managerial perspective: we find...
From Answer-Getters to Problem Solvers
Flynn, Mike
2017-01-01
In some math classrooms, students are taught to follow and memorize procedures to arrive at the correct solution to problems. In this article, author Mike Flynn suggests a way to move beyond answer-getting to true problem solving. He describes an instructional approach called three-act tasks in which students solve an engaging math problem in…
How to become a good problem solver.
Gurden, Dean
2016-09-14
Nurses face many problems in the workplace on a daily basis, so the ability to solve or overcome them is essential to the job. If you are a nursing student and feel you lack problem-solving skills, what kind of help can you get?
Implementation of Generalized Adjoint Equation Solver for DeCART
International Nuclear Information System (INIS)
Han, Tae Young; Cho, Jin Young; Lee, Hyun Chul; Noh, Jae Man
2013-01-01
In this paper, the generalized adjoint solver based on the generalized perturbation theory is implemented on DeCART and the verification calculations were carried out. As the results, the adjoint flux for the general response coincides with the reference solution and it is expected that the solver could produce the parameters for the sensitivity and uncertainty analysis. Recently, MUSAD (Modules of Uncertainty and Sensitivity Analysis for DeCART) was developed for the uncertainty analysis of PMR200 core and the fundamental adjoint solver was implemented into DeCART. However, the application of the code was limited to the uncertainty to the multiplication factor, k eff , because it was based on the classical perturbation theory. For the uncertainty analysis to the general response as like the power density, it is necessary to develop the analysis module based on the generalized perturbation theory and it needs the generalized adjoint solutions from DeCART. In this paper, the generalized adjoint solver is implemented on DeCART and the calculation results are compared with the results by TSUNAMI of SCALE 6.1
Menu-Driven Solver Of Linear-Programming Problems
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).
SolveDB: Integrating Optimization Problem Solvers Into SQL Databases
DEFF Research Database (Denmark)
Siksnys, Laurynas; Pedersen, Torben Bach
2016-01-01
for optimization problems, (2) an extensible infrastructure for integrating different solvers, and (3) query optimization techniques to achieve the best execution performance and/or result quality. Extensive experiments with the PostgreSQL-based implementation show that SolveDB is a versatile tool offering much...
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
Energy Technology Data Exchange (ETDEWEB)
Xu, Jinchao [Pennsylvania State Univ., University Park, PA (United States). Dept. of Mathematics
2014-11-26
In this project, we carried out many studies on adaptive and parallel multilevel methods for numerical modeling for various applications, including Magnetohydrodynamics (MHD) and complex fluids. We have made significant efforts and advances in adaptive multilevel methods of the multiphysics problems: multigrid methods, adaptive finite element methods, and applications.
Problem Solvers: Solutions--Playing Basketball
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…
A distributed-memory hierarchical solver for general sparse linear systems
Energy Technology Data Exchange (ETDEWEB)
Chen, Chao [Stanford Univ., CA (United States). Inst. for Computational and Mathematical Engineering; Pouransari, Hadi [Stanford Univ., CA (United States). Dept. of Mechanical Engineering; Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Center for Computing Research; Boman, Erik G. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Center for Computing Research; Darve, Eric [Stanford Univ., CA (United States). Inst. for Computational and Mathematical Engineering and Dept. of Mechanical Engineering
2017-12-20
We present a parallel hierarchical solver for general sparse linear systems on distributed-memory machines. For large-scale problems, this fully algebraic algorithm is faster and more memory-efficient than sparse direct solvers because it exploits the low-rank structure of fill-in blocks. Depending on the accuracy of low-rank approximations, the hierarchical solver can be used either as a direct solver or as a preconditioner. The parallel algorithm is based on data decomposition and requires only local communication for updating boundary data on every processor. Moreover, the computation-to-communication ratio of the parallel algorithm is approximately the volume-to-surface-area ratio of the subdomain owned by every processor. We also provide various numerical results to demonstrate the versatility and scalability of the parallel algorithm.
A generalized Poisson solver for first-principles device simulations
Energy Technology Data Exchange (ETDEWEB)
Bani-Hashemian, Mohammad Hossein; VandeVondele, Joost, E-mail: joost.vandevondele@mat.ethz.ch [Nanoscale Simulations, ETH Zürich, 8093 Zürich (Switzerland); Brück, Sascha; Luisier, Mathieu [Integrated Systems Laboratory, ETH Zürich, 8092 Zürich (Switzerland)
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.
Parallel Auxiliary Space AMG Solver for $H(div)$ Problems
Energy Technology Data Exchange (ETDEWEB)
Kolev, Tzanio V. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
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.
Comparison of Einstein-Boltzmann solvers for testing general relativity
Bellini, E.; Barreira, A.; Frusciante, N.; Hu, B.; Peirone, S.; Raveri, M.; Zumalacárregui, M.; Avilez-Lopez, A.; Ballardini, M.; Battye, R. A.; Bolliet, B.; Calabrese, E.; Dirian, Y.; Ferreira, P. G.; Finelli, F.; Huang, Z.; Ivanov, M. M.; Lesgourgues, J.; Li, B.; Lima, N. A.; Pace, F.; Paoletti, D.; Sawicki, I.; Silvestri, A.; Skordis, C.; Umiltà, C.; Vernizzi, F.
2018-01-01
We compare Einstein-Boltzmann solvers that include modifications to general relativity and find that, for a wide range of models and parameters, they agree to a high level of precision. We look at three general purpose codes that primarily model general scalar-tensor theories, three codes that model Jordan-Brans-Dicke (JBD) gravity, a code that models f (R ) gravity, a code that models covariant Galileons, a code that models Hořava-Lifschitz gravity, and two codes that model nonlocal models of gravity. Comparing predictions of the angular power spectrum of the cosmic microwave background and the power spectrum of dark matter for a suite of different models, we find agreement at the subpercent level. This means that this suite of Einstein-Boltzmann solvers is now sufficiently accurate for precision constraints on cosmological and gravitational parameters.
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments
International Nuclear Information System (INIS)
Fisicaro, G.; Goedecker, S.; Genovese, L.; Andreussi, O.; Marzari, N.
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
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments.
Fisicaro, G; Genovese, L; Andreussi, O; Marzari, N; Goedecker, S
2016-01-07
The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.
A generalized Poisson and Poisson-Boltzmann solver for electrostatic environments
Energy Technology Data Exchange (ETDEWEB)
Fisicaro, G., E-mail: giuseppe.fisicaro@unibas.ch; Goedecker, S. [Department of Physics, University of Basel, Klingelbergstrasse 82, 4056 Basel (Switzerland); Genovese, L. [University of Grenoble Alpes, CEA, INAC-SP2M, L-Sim, F-38000 Grenoble (France); Andreussi, O. [Institute of Computational Science, Università della Svizzera Italiana, Via Giuseppe Buffi 13, CH-6904 Lugano (Switzerland); Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland); Marzari, N. [Theory and Simulations of Materials (THEOS) and National Centre for Computational Design and Discovery of Novel Materials (MARVEL), École Polytechnique Fédérale de Lausanne, Station 12, CH-1015 Lausanne (Switzerland)
2016-01-07
The computational study of chemical reactions in complex, wet environments is critical for applications in many fields. It is often essential to study chemical reactions in the presence of applied electrochemical potentials, taking into account the non-trivial electrostatic screening coming from the solvent and the electrolytes. As a consequence, the electrostatic potential has to be found by solving the generalized Poisson and the Poisson-Boltzmann equations for neutral and ionic solutions, respectively. In the present work, solvers for both problems have been developed. A preconditioned conjugate gradient method has been implemented for the solution of the generalized Poisson equation and the linear regime of the Poisson-Boltzmann, allowing to solve iteratively the minimization problem with some ten iterations of the ordinary Poisson equation solver. In addition, a self-consistent procedure enables us to solve the non-linear Poisson-Boltzmann problem. Both solvers exhibit very high accuracy and parallel efficiency and allow for the treatment of periodic, free, and slab boundary conditions. The solver has been integrated into the BigDFT and Quantum-ESPRESSO electronic-structure packages and will be released as an independent program, suitable for integration in other codes.
Mathematical Tasks without Words and Word Problems: Perceptions of Reluctant Problem Solvers
Holbert, Sydney Margaret
2013-01-01
This qualitative research study used a multiple, holistic case study approach (Yin, 2009) to explore the perceptions of reluctant problem solvers related to mathematical tasks without words and word problems. Participants were given a choice of working a mathematical task without words or a word problem during four problem-solving sessions. Data…
Teaching problem solving: Don't forget the problem solver(s)
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.
A General Symbolic PDE Solver Generator: Beyond Explicit Schemes
Directory of Open Access Journals (Sweden)
K. Sheshadri
2003-01-01
Full Text Available This paper presents an extension of our Mathematica- and MathCode-based symbolic-numeric framework for solving a variety of partial differential equation (PDE problems. The main features of our earlier work, which implemented explicit finite-difference schemes, include the ability to handle (1 arbitrary number of dependent variables, (2 arbitrary dimensionality, and (3 arbitrary geometry, as well as (4 developing finite-difference schemes to any desired order of approximation. In the present paper, extensions of this framework to implicit schemes and the method of lines are discussed. While C++ code is generated, using the MathCode system for the implicit method, Modelica code is generated for the method of lines. The latter provides a preliminary PDE support for the Modelica language. Examples illustrating the various aspects of the solver generator are presented.
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang
2014-09-26
Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. This presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. The GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.
Composing problem solvers for simulation experimentation: a case study on steady state estimation.
Leye, Stefan; Ewald, Roland; Uhrmacher, Adelinde M
2014-01-01
Simulation experiments involve various sub-tasks, e.g., parameter optimization, simulation execution, or output data analysis. Many algorithms can be applied to such tasks, but their performance depends on the given problem. Steady state estimation in systems biology is a typical example for this: several estimators have been proposed, each with its own (dis-)advantages. Experimenters, therefore, must choose from the available options, even though they may not be aware of the consequences. To support those users, we propose a general scheme to aggregate such algorithms to so-called synthetic problem solvers, which exploit algorithm differences to improve overall performance. Our approach subsumes various aggregation mechanisms, supports automatic configuration from training data (e.g., via ensemble learning or portfolio selection), and extends the plugin system of the open source modeling and simulation framework James II. We show the benefits of our approach by applying it to steady state estimation for cell-biological models.
GASPACHO: a generic automatic solver using proximal algorithms for convex huge optimization problems
Goossens, Bart; Luong, Hiêp; Philips, Wilfried
2017-08-01
Many inverse problems (e.g., demosaicking, deblurring, denoising, image fusion, HDR synthesis) share various similarities: degradation operators are often modeled by a specific data fitting function while image prior knowledge (e.g., sparsity) is incorporated by additional regularization terms. In this paper, we investigate automatic algorithmic techniques for evaluating proximal operators. These algorithmic techniques also enable efficient calculation of adjoints from linear operators in a general matrix-free setting. In particular, we study the simultaneous-direction method of multipliers (SDMM) and the parallel proximal algorithm (PPXA) solvers and show that the automatically derived implementations are well suited for both single-GPU and multi-GPU processing. We demonstrate this approach for an Electron Microscopy (EM) deconvolution problem.
A fast direct solver for boundary value problems on locally perturbed geometries
Zhang, Yabin; Gillman, Adrianna
2018-03-01
Many applications including optimal design and adaptive discretization techniques involve solving several boundary value problems on geometries that are local perturbations of an original geometry. This manuscript presents a fast direct solver for boundary value problems that are recast as boundary integral equations. The idea is to write the discretized boundary integral equation on a new geometry as a low rank update to the discretized problem on the original geometry. Using the Sherman-Morrison formula, the inverse can be expressed in terms of the inverse of the original system applied to the low rank factors and the right hand side. Numerical results illustrate for problems where perturbation is localized the fast direct solver is three times faster than building a new solver from scratch.
A multilevel in space and energy solver for multigroup diffusion eigenvalue problems
Directory of Open Access Journals (Sweden)
Ben C. Yee
2017-09-01
Full Text Available In this paper, we present a new multilevel in space and energy diffusion (MSED method for solving multigroup diffusion eigenvalue problems. The MSED method can be described as a PI scheme with three additional features: (1 a grey (one-group diffusion equation used to efficiently converge the fission source and eigenvalue, (2 a space-dependent Wielandt shift technique used to reduce the number of PIs required, and (3 a multigrid-in-space linear solver for the linear solves required by each PI step. In MSED, the convergence of the solution of the multigroup diffusion eigenvalue problem is accelerated by performing work on lower-order equations with only one group and/or coarser spatial grids. Results from several Fourier analyses and a one-dimensional test code are provided to verify the efficiency of the MSED method and to justify the incorporation of the grey diffusion equation and the multigrid linear solver. These results highlight the potential efficiency of the MSED method as a solver for multidimensional multigroup diffusion eigenvalue problems, and they serve as a proof of principle for future work. Our ultimate goal is to implement the MSED method as an efficient solver for the two-dimensional/three-dimensional coarse mesh finite difference diffusion system in the Michigan parallel characteristics transport code. The work in this paper represents a necessary step towards that goal.
Fourier-Accelerated Nodal Solvers (FANS) for homogenization problems
Leuschner, Matthias; Fritzen, Felix
2017-11-01
Fourier-based homogenization schemes are useful to analyze heterogeneous microstructures represented by 2D or 3D image data. These iterative schemes involve discrete periodic convolutions with global ansatz functions (mostly fundamental solutions). The convolutions are efficiently computed using the fast Fourier transform. FANS operates on nodal variables on regular grids and converges to finite element solutions. Compared to established Fourier-based methods, the number of convolutions is reduced by FANS. Additionally, fast iterations are possible by assembling the stiffness matrix. Due to the related memory requirement, the method is best suited for medium-sized problems. A comparative study involving established Fourier-based homogenization schemes is conducted for a thermal benchmark problem with a closed-form solution. Detailed technical and algorithmic descriptions are given for all methods considered in the comparison. Furthermore, many numerical examples focusing on convergence properties for both thermal and mechanical problems, including also plasticity, are presented.
Critical Thinking and the Development of Innovative Problem Solvers
National Research Council Canada - National Science Library
Drew, Christopher T
2005-01-01
.... This capability can be trained by making Critical Thinking the focus of officer education. Critical Thinking is the general cognitive skill of developing the best solution when there is not a single correct answer...
Implicit solvers for large-scale nonlinear problems
International Nuclear Information System (INIS)
Keyes, David E; Reynolds, Daniel R; Woodward, Carol S
2006-01-01
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
A TFETI domain decomposition solver for elastoplastic problems
Czech Academy of Sciences Publication Activity Database
Čermák, M.; Kozubek, T.; Sysala, Stanislav; Valdman, J.
2014-01-01
Roč. 231, č. 1 (2014), s. 634-653 ISSN 0096-3003 Institutional support: RVO:68145535 Keywords : elastoplasticity * Total FETI domain decomposition method * Finite element method * Semismooth Newton method Subject RIV: BA - General Mathematics Impact factor: 1.551, year: 2014 http://ac.els-cdn.com/S0096300314000253/1-s2.0-S0096300314000253-main.pdf?_tid=33a29cf4-996a-11e3-8c5a-00000aacb360&acdnat=1392816896_4584697dc26cf934dcf590c63f0dbab7
Reimer, Ashton S.; Cheviakov, Alexei F.
2013-03-01
A Matlab-based finite-difference numerical solver for the Poisson equation for a rectangle and a disk in two dimensions, and a spherical domain in three dimensions, is presented. The solver is optimized for handling an arbitrary combination of Dirichlet and Neumann boundary conditions, and allows for full user control of mesh refinement. The solver routines utilize effective and parallelized sparse vector and matrix operations. Computations exhibit high speeds, numerical stability with respect to mesh size and mesh refinement, and acceptable error values even on desktop computers. Catalogue identifier: AENQ_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AENQ_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License v3.0 No. of lines in distributed program, including test data, etc.: 102793 No. of bytes in distributed program, including test data, etc.: 369378 Distribution format: tar.gz Programming language: Matlab 2010a. Computer: PC, Macintosh. Operating system: Windows, OSX, Linux. RAM: 8 GB (8, 589, 934, 592 bytes) Classification: 4.3. Nature of problem: To solve the Poisson problem in a standard domain with “patchy surface”-type (strongly heterogeneous) Neumann/Dirichlet boundary conditions. Solution method: Finite difference with mesh refinement. Restrictions: Spherical domain in 3D; rectangular domain or a disk in 2D. Unusual features: Choice between mldivide/iterative solver for the solution of large system of linear algebraic equations that arise. Full user control of Neumann/Dirichlet boundary conditions and mesh refinement. Running time: Depending on the number of points taken and the geometry of the domain, the routine may take from less than a second to several hours to execute.
Larger groups of passerines are more efficient problem solvers in the wild
Morand-Ferron, Julie; Quinn, John L.
2011-01-01
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
Energy Technology Data Exchange (ETDEWEB)
Bruno, Oscar P., E-mail: obruno@caltech.edu; 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.
Applications of an implicit HLLC-based Godunov solver for steady state hypersonic problems
International Nuclear Information System (INIS)
Link, R.A.; Sharman, B.
2005-01-01
Over the past few years, there has been considerable activity developing research vehicles for studying hypersonic propulsion. Successful launches of the Australian Hyshot and the US Hyper-X vehicles have added a significant amount of flight test data to a field that had previously been limited to numerical simulation. A number of approaches have been proposed for hypersonics propulsion, including attached detonation wave, supersonics combustion, and shock induced combustion. Due to the high cost of developing flight hardware, CFD simulations will continue to be a key tool for investigating the feasibility of these concepts. Capturing the interactions of the vehicle body with the boundary layer and chemical reactions pushes the limits of available modelling tools and computer hardware. Explicit formulations are extremely slow in converging to a steady state; therefore, the use of implicit methods are warranted. An implicit LLC-based Godunov solver has been developed at Martec in collaboration with DRDC Valcartier to solve hypersonic problems with a minimum of CPU time and RAM storage. The solver, Chinook Implicit, is based upon the implicit formulation adopted by Batten et. al. The solver is based on a point implicit Gauss-Seidel method for unstructured grids, and includes fully implicit boundary conditions. Preliminary results for small and large scale inviscid hypersonics problems will be presented. (author)
Wu, Jiayang; Cao, Pan; Hu, Xiaofeng; Jiang, Xinhong; Pan, Ting; Yang, Yuxing; Qiu, Ciyuan; Tremblay, Christine; Su, Yikai
2014-10-20
We propose and experimentally demonstrate an all-optical temporal differential-equation solver that can be used to solve ordinary differential equations (ODEs) characterizing general linear time-invariant (LTI) systems. The photonic device implemented by an add-drop microring resonator (MRR) with two tunable interferometric couplers is monolithically integrated on a silicon-on-insulator (SOI) wafer with a compact footprint of ~60 μm × 120 μm. By thermally tuning the phase shifts along the bus arms of the two interferometric couplers, the proposed device is capable of solving first-order ODEs with two variable coefficients. The operation principle is theoretically analyzed, and system testing of solving ODE with tunable coefficients is carried out for 10-Gb/s optical Gaussian-like pulses. The experimental results verify the effectiveness of the fabricated device as a tunable photonic ODE solver.
Cartesian Mesh Linearized Euler Equations Solver for Aeroacoustic Problems around Full Aircraft
Directory of Open Access Journals (Sweden)
Yuma Fukushima
2015-01-01
Full Text Available The linearized Euler equations (LEEs solver for aeroacoustic problems has been developed on block-structured Cartesian mesh to address complex geometry. Taking advantage of the benefits of Cartesian mesh, we employ high-order schemes for spatial derivatives and for time integration. On the other hand, the difficulty of accommodating curved wall boundaries is addressed by the immersed boundary method. The resulting LEEs solver is robust to complex geometry and numerically efficient in a parallel environment. The accuracy and effectiveness of the present solver are validated by one-dimensional and three-dimensional test cases. Acoustic scattering around a sphere and noise propagation from the JT15D nacelle are computed. The results show good agreement with analytical, computational, and experimental results. Finally, noise propagation around fuselage-wing-nacelle configurations is computed as a practical example. The results show that the sound pressure level below the over-the-wing nacelle (OWN configuration is much lower than that of the conventional DLR-F6 aircraft configuration due to the shielding effect of the OWN configuration.
Liu, Yang
2013-07-01
The computational complexity and memory requirements of multilevel plane wave time domain (PWTD)-accelerated marching-on-in-time (MOT)-based surface integral equation (SIE) solvers scale as O(NtNs(log 2)Ns) and O(Ns 1.5); here N t and Ns denote numbers of temporal and spatial basis functions discretizing the current [Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003]. In the past, serial versions of these solvers have been successfully applied to the analysis of scattering from perfect electrically conducting as well as homogeneous penetrable targets involving up to Ns ≈ 0.5 × 106 and Nt ≈ 10 3. To solve larger problems, parallel PWTD-enhanced MOT solvers are called for. Even though a simple parallelization strategy was demonstrated in the context of electromagnetic compatibility analysis [M. Lu et al., in Proc. IEEE Int. Symp. AP-S, 4, 4212-4215, 2004], by and large, progress in this area has been slow. The lack of progress can be attributed wholesale to difficulties associated with the construction of a scalable PWTD kernel. © 2013 IEEE.
The Problem Solver and The Artisan Designer: Strategies for Utilizing Design Idea Archives
DEFF Research Database (Denmark)
Inie, Nanna; Endo, Allison; Dow, Steven
2018-01-01
This paper presents the results of an extensive qualitative study investigating how professional designers utilize personal idea archives. While we know that designers archive creative ideas in different formats and on different platforms, we know little about if and how designers utilize...... these idea archives in their daily practice. Through a series of interviews (n=20) and walkthroughs of design idea archives, we identified two archetypal strategies. The Problem Solver is concerned with the task at hand, keeps relevant ideas around, and discards them when the ideas have served their purpose...
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.
DEFF Research Database (Denmark)
Andersen, Michael; Abel, Sarah Maria Niebe; Erleben, Kenny
2017-01-01
We address the task of computing solutions for a separating fluid-solid wall boundary condition model. We present an embarrassingly parallel, easy to implement, fluid LCP solver.We are able to use greater domain sizes than previous works have shown, due to our new solver. The solver exploits matr...
Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
Paszyńska, Anna; Jopek, Konrad; Banaś, Krzysztof; Paszyński, Maciej; Gurgul, Piotr; Lenerth, Andrew; Nguyen, Donald; Pingali, Keshav; Dalcind, Lisandro; Calo, Victor M.
2015-01-01
This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.
Telescopic Hybrid Fast Solver for 3D Elliptic Problems with Point Singularities
Paszyńska, Anna
2015-06-01
This paper describes a telescopic solver for two dimensional h adaptive grids with point singularities. The input for the telescopic solver is an h refined two dimensional computational mesh with rectangular finite elements. The candidates for point singularities are first localized over the mesh by using a greedy algorithm. Having the candidates for point singularities, we execute either a direct solver, that performs multiple refinements towards selected point singularities and executes a parallel direct solver algorithm which has logarithmic cost with respect to refinement level. The direct solvers executed over each candidate for point singularity return local Schur complement matrices that can be merged together and submitted to iterative solver. In this paper we utilize a parallel multi-thread GALOIS solver as a direct solver. We use Incomplete LU Preconditioned Conjugated Gradients (ILUPCG) as an iterative solver. We also show that elimination of point singularities from the refined mesh reduces significantly the number of iterations to be performed by the ILUPCG iterative solver.
Collier, Nathan; Dalcin, Lisandro; Calo, Victor M.
2014-01-01
SUMMARY: We compare the computational efficiency of isogeometric Galerkin and collocation methods for partial differential equations in the asymptotic regime. We define a metric to identify when numerical experiments have reached this regime. We then apply these ideas to analyze the performance of different isogeometric discretizations, which encompass C0 finite element spaces and higher-continuous spaces. We derive convergence and cost estimates in terms of the total number of degrees of freedom and then perform an asymptotic numerical comparison of the efficiency of these methods applied to an elliptic problem. These estimates are derived assuming that the underlying solution is smooth, the full Gauss quadrature is used in each non-zero knot span and the numerical solution of the discrete system is found using a direct multi-frontal solver. We conclude that under the assumptions detailed in this paper, higher-continuous basis functions provide marginal benefits.
High-resolution coupled physics solvers for analysing fine-scale nuclear reactor design problems
Mahadevan, Vijay S.; Merzari, Elia; Tautges, Timothy; Jain, Rajeev; Obabko, Aleksandr; Smith, Michael; Fischer, Paul
2014-01-01
An integrated multi-physics simulation capability for the design and analysis of current and future nuclear reactor models is being investigated, to tightly couple neutron transport and thermal-hydraulics physics under the SHARP framework. Over several years, high-fidelity, validated mono-physics solvers with proven scalability on petascale architectures have been developed independently. Based on a unified component-based architecture, these existing codes can be coupled with a mesh-data backplane and a flexible coupling-strategy-based driver suite to produce a viable tool for analysts. The goal of the SHARP framework is to perform fully resolved coupled physics analysis of a reactor on heterogeneous geometry, in order to reduce the overall numerical uncertainty while leveraging available computational resources. The coupling methodology and software interfaces of the framework are presented, along with verification studies on two representative fast sodium-cooled reactor demonstration problems to prove the usability of the SHARP framework. PMID:24982250
Collier, Nathan
2014-09-17
SUMMARY: We compare the computational efficiency of isogeometric Galerkin and collocation methods for partial differential equations in the asymptotic regime. We define a metric to identify when numerical experiments have reached this regime. We then apply these ideas to analyze the performance of different isogeometric discretizations, which encompass C0 finite element spaces and higher-continuous spaces. We derive convergence and cost estimates in terms of the total number of degrees of freedom and then perform an asymptotic numerical comparison of the efficiency of these methods applied to an elliptic problem. These estimates are derived assuming that the underlying solution is smooth, the full Gauss quadrature is used in each non-zero knot span and the numerical solution of the discrete system is found using a direct multi-frontal solver. We conclude that under the assumptions detailed in this paper, higher-continuous basis functions provide marginal benefits.
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.
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…
Energy Technology Data Exchange (ETDEWEB)
Schunert, Sebastian; Wang, Congjian; Wang, Yaqi; Kong, Fande; Ortensi, Javier; Baker, Benjamin; Gleicher, Frederick; DeHart, Mark; Martineau, Richard
2017-04-01
Rattlesnake and MAMMOTH are the designated TREAT analysis tools currently being developed at the Idaho National Laboratory. Concurrent with development of the multi-physics, multi-scale capabilities, sensitivity analysis and uncertainty quantification (SA/UQ) capabilities are required for predicitive modeling of the TREAT reactor. For steady-state SA/UQ, that is essential for setting initial conditions for the transients, generalized perturbation theory (GPT) will be used. This work describes the implementation of a PETSc based solver for the generalized adjoint equations that constitute a inhomogeneous, rank deficient problem. The standard approach is to use an outer iteration strategy with repeated removal of the fundamental mode contamination. The described GPT algorithm directly solves the GPT equations without the need of an outer iteration procedure by using Krylov subspaces that are orthogonal to the operator’s nullspace. Three test problems are solved and provide sufficient verification for the Rattlesnake’s GPT capability. We conclude with a preliminary example evaluating the impact of the Boron distribution in the TREAT reactor using perturbation theory.
Balsara, Dinshaw S.; Nkonga, Boniface
2017-10-01
Just as the quality of a one-dimensional approximate Riemann solver is improved by the inclusion of internal sub-structure, the quality of a multidimensional Riemann solver is also similarly improved. Such multidimensional Riemann problems arise when multiple states come together at the vertex of a mesh. The interaction of the resulting one-dimensional Riemann problems gives rise to a strongly-interacting state. We wish to endow this strongly-interacting state with physically-motivated sub-structure. The fastest way of endowing such sub-structure consists of making a multidimensional extension of the HLLI Riemann solver for hyperbolic conservation laws. Presenting such a multidimensional analogue of the HLLI Riemann solver with linear sub-structure for use on structured meshes is the goal of this work. The multidimensional MuSIC Riemann solver documented here is universal in the sense that it can be applied to any hyperbolic conservation law. The multidimensional Riemann solver is made to be consistent with constraints that emerge naturally from the Galerkin projection of the self-similar states within the wave model. When the full eigenstructure in both directions is used in the present Riemann solver, it becomes a complete Riemann solver in a multidimensional sense. I.e., all the intermediate waves are represented in the multidimensional wave model. The work also presents, for the very first time, an important analysis of the dissipation characteristics of multidimensional Riemann solvers. The present Riemann solver results in the most efficient implementation of a multidimensional Riemann solver with sub-structure. Because it preserves stationary linearly degenerate waves, it might also help with well-balancing. Implementation-related details are presented in pointwise fashion for the one-dimensional HLLI Riemann solver as well as the multidimensional MuSIC Riemann solver.
North Dakota's Centennial Quilt and Problem Solvers: Solutions: The Library Problem
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…
Liu, Yang; Bagci, Hakan; Michielssen, Eric
2013-01-01
numbers of temporal and spatial basis functions discretizing the current [Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003]. In the past, serial versions of these solvers have been successfully applied to the analysis of scattering from
Problem Solving with General Semantics.
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)
DEFF Research Database (Denmark)
Helsgaun, Keld
This report describes the implementation of an extension of the Lin-Kernighan-Helsgaun TSP solver for solving constrained traveling salesman and vehicle routing problems. The extension, which is called LKH-3, is able to solve a variety of well-known problems, including the sequential ordering...... problem (SOP), the traveling repairman problem (TRP), variants of the multiple travel-ing salesman problem (mTSP), as well as vehicle routing problems (VRPs) with capacity, time windows, pickup-and-delivery and distance constraints. The implementation of LKH-3 builds on the idea of transforming...... the problems into standard symmetric traveling salesman problems and handling constraints by means of penalty functions. Extensive testing on benchmark instances from the literature has shown that LKH-3 is effective. Best known solutions are often obtained, and in some cases, new best solutions are found...
Experimental validation of a boundary element solver for exterior acoustic radiation problems
Visser, Rene; Nilsson, A.; Boden, H.
2003-01-01
The relation between harmonic structural vibrations and the corresponding acoustic radiation is given by the Helmholtz integral equation (HIE). To solve this integral equation a new solver (BEMSYS) based on the boundary element method (BEM) has been implemented. This numerical tool can be used for
Directory of Open Access Journals (Sweden)
Jianfei Zhang
2013-01-01
Full Text Available Graphics processing unit (GPU has obtained great success in scientific computations for its tremendous computational horsepower and very high memory bandwidth. This paper discusses the efficient way to implement polynomial preconditioned conjugate gradient solver for the finite element computation of elasticity on NVIDIA GPUs using compute unified device architecture (CUDA. Sliced block ELLPACK (SBELL format is introduced to store sparse matrix arising from finite element discretization of elasticity with fewer padding zeros than traditional ELLPACK-based formats. Polynomial preconditioning methods have been investigated both in convergence and running time. From the overall performance, the least-squares (L-S polynomial method is chosen as a preconditioner in PCG solver to finite element equations derived from elasticity for its best results on different example meshes. In the PCG solver, mixed precision algorithm is used not only to reduce the overall computational, storage requirements and bandwidth but to make full use of the capacity of the GPU devices. With SBELL format and mixed precision algorithm, the GPU-based L-S preconditioned CG can get a speedup of about 7–9 to CPU-implementation.
Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María
2014-06-01
We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the
An Exact, Compressible One-Dimensional Riemann Solver for General, Convex Equations of State
Energy Technology Data Exchange (ETDEWEB)
Kamm, James Russell [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2015-03-05
This note describes an algorithm with which to compute numerical solutions to the one- dimensional, Cartesian Riemann problem for compressible flow with general, convex equations of state. While high-level descriptions of this approach are to be found in the literature, this note contains most of the necessary details required to write software for this problem. This explanation corresponds to the approach used in the source code that evaluates solutions for the 1D, Cartesian Riemann problem with a JWL equation of state in the ExactPack package [16, 29]. Numerical examples are given with the proposed computational approach for a polytropic equation of state and for the JWL equation of state.
An evaluation of parallel multigrid as a solver and a preconditioner for singular perturbed problems
Energy Technology Data Exchange (ETDEWEB)
Oosterlee, C.W. [Inst. for Algorithms and Scientific Computing, Sankt Augustin (Germany); Washio, T. [C& C Research Lab., Sankt Augustin (Germany)
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.
Burtyka, Filipp
2018-03-01
The paper firstly considers the problem of finding solvents for arbitrary unilateral polynomial matrix equations with second-order matrices over prime finite fields from the practical point of view: we implement the solver for this problem. The solver’s algorithm has two step: the first is finding solvents, having Jordan Normal Form (JNF), the second is finding solvents among the rest matrices. The first step reduces to the finding roots of usual polynomials over finite fields, the second is essentially exhaustive search. The first step’s algorithms essentially use the polynomial matrices theory. We estimate the practical duration of computations using our software implementation (for example that one can’t construct unilateral matrix polynomial over finite field, having any predefined number of solvents) and answer some theoretically-valued questions.
Discrete adjoint of fractional step Navier-Stokes solver in generalized coordinates
Wang, Mengze; Mons, Vincent; Zaki, Tamer
2017-11-01
Optimization and control in transitional and turbulent flows require evaluation of gradients of the flow state with respect to the problem parameters. Using adjoint approaches, these high-dimensional gradients can be evaluated with a similar computational cost as the forward Navier-Stokes simulations. The adjoint algorithm can be obtained by discretizing the continuous adjoint Navier-Stokes equations or by deriving the adjoint to the discretized Navier-Stokes equations directly. The latter algorithm is necessary when the forward-adjoint relations must be satisfied to machine precision. In this work, our forward model is the fractional step solution to the Navier-Stokes equations in generalized coordinates, proposed by Rosenfeld, Kwak & Vinokur. We derive the corresponding discrete adjoint equations. We also demonstrate the accuracy of the combined forward-adjoint model, and its application to unsteady wall-bounded flows. This work has been partially funded by the Office of Naval Research (Grant N00014-16-1-2542).
International Nuclear Information System (INIS)
Bakhos, Tania; Saibaba, Arvind K.; Kitanidis, Peter K.
2015-01-01
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
Energy Technology Data Exchange (ETDEWEB)
Bakhos, Tania, E-mail: taniab@stanford.edu [Institute for Computational and Mathematical Engineering, Stanford University (United States); Saibaba, Arvind K. [Department of Electrical and Computer Engineering, Tufts University (United States); Kitanidis, Peter K. [Institute for Computational and Mathematical Engineering, Stanford University (United States); Department of Civil and Environmental Engineering, Stanford University (United States)
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.
Measuring the Level of Transfer Learning by an AP Physics Problem-Solver
National Research Council Canada - National Science Library
Klenk, Matthew; Forbus, Ken
2007-01-01
.... We approach this problem by focusing on model formulation, i.e., how to move from the unruly, broad set of concepts used in everyday life to a concise, formal vocabulary of abstractions that can be used effectively for problem solving...
On a construction of fast direct solvers
Czech Academy of Sciences Publication Activity Database
Práger, Milan
2003-01-01
Roč. 48, č. 3 (2003), s. 225-236 ISSN 0862-7940 Institutional research plan: CEZ:AV0Z1019905; CEZ:AV0Z1019905 Keywords : Poisson equation * boundary value problem * fast direct solver Subject RIV: BA - General Mathematics
On generalized operator quasi-equilibrium problems
Kum, Sangho; Kim, Won Kyu
2008-09-01
In this paper, we will introduce the generalized operator equilibrium problem and generalized operator quasi-equilibrium problem which generalize the operator equilibrium problem due to Kazmi and Raouf [K.R. Kazmi, A. Raouf, A class of operator equilibrium problems, J. Math. Anal. Appl. 308 (2005) 554-564] into multi-valued and quasi-equilibrium problems. Using a Fan-Browder type fixed point theorem in [S. Park, Foundations of the KKM theory via coincidences of composites of upper semicontinuous maps, J. Korean Math. Soc. 31 (1994) 493-519] and an existence theorem of equilibrium for 1-person game in [X.-P. Ding, W.K. Kim, K.-K. Tan, Equilibria of non-compact generalized games with L*-majorized preferences, J. Math. Anal. Appl. 164 (1992) 508-517] as basic tools, we prove new existence theorems on generalized operator equilibrium problem and generalized operator quasi-equilibrium problem which includes operator equilibrium problems.
Constraint-based solver for the Military unit path finding problem
CSIR Research Space (South Africa)
Leenen, L
2010-04-01
Full Text Available -based approach because it requires flexibility in modelling. The authors formulate the MUPFP as a constraint satisfaction problem and a constraint-based extension of the search algorithm. The concept demonstrator uses a provided map, for example taken from Google...
International Nuclear Information System (INIS)
Li Jiequan; Li Qibing; Xu Kun
2011-01-01
The generalized Riemann problem (GRP) scheme for the Euler equations and gas-kinetic scheme (GKS) for the Boltzmann equation are two high resolution shock capturing schemes for fluid simulations. The difference is that one is based on the characteristics of the inviscid Euler equations and their wave interactions, and the other is based on the particle transport and collisions. The similarity between them is that both methods can use identical MUSCL-type initial reconstructions around a cell interface, and the spatial slopes on both sides of a cell interface involve in the gas evolution process and the construction of a time-dependent flux function. Although both methods have been applied successfully to the inviscid compressible flow computations, their performances have never been compared. Since both methods use the same initial reconstruction, any difference is solely coming from different underlying mechanism in their flux evaluation. Therefore, such a comparison is important to help us to understand the correspondence between physical modeling and numerical performances. Since GRP is so faithfully solving the inviscid Euler equations, the comparison can be also used to show the validity of solving the Euler equations itself. The numerical comparison shows that the GRP exhibits a slightly better computational efficiency, and has comparable accuracy with GKS for the Euler solutions in 1D case, but the GKS is more robust than GRP. For the 2D high Mach number flow simulations, the GKS is absent from the shock instability and converges to the steady state solutions faster than the GRP. The GRP has carbuncle phenomena, likes a cloud hanging over exact Riemann solvers. The GRP and GKS use different physical processes to describe the flow motion starting from a discontinuity. One is based on the assumption of equilibrium state with infinite number of particle collisions, and the other starts from the non-equilibrium free transport process to evolve into an
CIP - a new numerical solver for general nonlinear hyperbolic equations in multi-dimension
International Nuclear Information System (INIS)
Yabe, Takashi; Takewaki, Hideaki.
1986-12-01
A new method CIP (Cubic-Interpolated Pseudo-particle) to solve hyperbolic equations is proposed. The method gives a stable and less diffusive result for square wave propagation compared with FCT (Flux-Corrected Transport) and a better result for propagation of a sine wave with a discontinuity. The scheme is extended to nonlinear and multi-dimensional problems. (orig.) [de
Community matrons as problem-solvers for people living with multi-co-morbid disease.
Randall, Sue; Thunhurst, Colin; Furze, Gill
2016-12-02
Working with patients in their own homes gives community matrons an advantage of seeing patients in the context of their everyday lives. This allows comprehensive assessment of need with an aim of promoting health or promoting stability for people living with chronic disease. Complex issues are resolved through problem-solving and this can result in patients being maintained in their own homes and thus in reduced unplanned hospitalisation. Data were collected from participants using semi-structured interviews and audio diaries. The sample comprised professionals: CMs (n=21), managers (n=4), former commissioners (n=2) and GPs (n=3); and patients (n=10) and their family carers (n=5). In this article, data from community matrons is discussed. Community matrons often drew on the social determinants model of health to problem solve and to create meaningful strategies that work for patients in their care. Raising awareness of the high-level skills of community matrons and promoting appreciation of the importance of a social determinants model of health is important in explaining why nurses are such a crucial element of the primary health care workforce.
Numerical and computational efficiency of solvers for two-phase problems
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Boyanova, P.; Kronbichler, M.; Neytcheva, M.; Wu, X.
2013-01-01
Roč. 65, č. 3 (2013), s. 301-314 ISSN 0898-1221 Institutional support: RVO:68145535 Keywords : Cahn–Hilliard equation * preconditioning * Inexact Newton method * Quasi- Newton method * parallel tests Subject RIV: BA - General Mathematics Impact factor: 1.996, year: 2013 http://ac.els-cdn.com/S0898122112004191/1-s2.0-S0898122112004191-main.pdf?_tid=e77dd742-63a2-11e2-9070-00000aab0f02&acdnat=1358756389_e11eaef264d0bac8123c4a00be3f6efa
Institutions and risk management: problem-solvers or blame-shifters?
International Nuclear Information System (INIS)
Hood, Ch.; Rothstein, H.
1998-01-01
This paper draws on research on comparative risk regulation regimes (RRRs) in the UK to offer some general reflection on the institutional effects to attempts to increase openness in risk regulation and management. Increasing openness is defined for this purpose as involving some or all of the following three elements: greater transparency in procedure; wider participation in some or all elements of RRRs; heightened accountability in terms of pressures and obligations on the part of those responsible for regulating and managing risks to explain and justify behaviour to others
Dimensional reduction of a generalized flux problem
International Nuclear Information System (INIS)
Moroz, A.
1992-01-01
In this paper, a generalized flux problem with Abelian and non-Abelian fluxes is considered. In the Abelian case we shall show that the generalized flux problem for tight-binding models of noninteracting electrons on either 2n- or (2n + 1)-dimensional lattice can always be reduced to an n-dimensional hopping problem. A residual freedom in this reduction enables one to identify equivalence classes of hopping Hamiltonians which have the same spectrum. In the non-Abelian case, the reduction is not possible in general unless the flux tensor factorizes into an Abelian one times are element of the corresponding algebra
Algorithm for the Stochastic Generalized Transportation Problem
Directory of Open Access Journals (Sweden)
Marcin Anholcer
2012-01-01
Full Text Available The equalization method for the stochastic generalized transportation problem has been presented. The algorithm allows us to find the optimal solution to the problem of minimizing the expected total cost in the generalized transportation problem with random demand. After a short introduction and literature review, the algorithm is presented. It is a version of the method proposed by the author for the nonlinear generalized transportation problem. It is shown that this version of the method generates a sequence of solutions convergent to the KKT point. This guarantees the global optimality of the obtained solution, as the expected cost functions are convex and twice differentiable. The computational experiments performed for test problems of reasonable size show that the method is fast. (original abstract
A generalization of the convex Kakeya problem
Ahn, Heekap; Bae, Sangwon; Cheong, Otfried; Gudmundsson, Joachim; Tokuyama, Takeshi; Vigneron, Antoine E.
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya's problem
T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2
International Nuclear Information System (INIS)
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
Generalized network improvement and packing problems
Holzhauser, Michael
2016-01-01
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms. Contents Fractional Packing and Parametric Search Frameworks Budget-Constrained Minimum Cost Flows: The Continuous Case Budget-Constrained Minimum Cost Flows: The Discrete Case Generalized Processing Networks Convex Generalized Flows Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The Author Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.
International Nuclear Information System (INIS)
Anton, Luis; MartI, Jose M; Ibanez, Jose M; Aloy, Miguel A.; Mimica, Petar; Miralles, Juan A.
2010-01-01
We obtain renormalized sets of right and left eigenvectors of the flux vector Jacobians of the relativistic MHD equations, which are regular and span a complete basis in any physical state including degenerate ones. The renormalization procedure relies on the characterization of the degeneracy types in terms of the normal and tangential components of the magnetic field to the wave front in the fluid rest frame. Proper expressions of the renormalized eigenvectors in conserved variables are obtained through the corresponding matrix transformations. Our work completes previous analysis that present different sets of right eigenvectors for non-degenerate and degenerate states, and can be seen as a relativistic generalization of earlier work performed in classical MHD. Based on the full wave decomposition (FWD) provided by the renormalized set of eigenvectors in conserved variables, we have also developed a linearized (Roe-type) Riemann solver. Extensive testing against one- and two-dimensional standard numerical problems allows us to conclude that our solver is very robust. When compared with a family of simpler solvers that avoid the knowledge of the full characteristic structure of the equations in the computation of the numerical fluxes, our solver turns out to be less diffusive than HLL and HLLC, and comparable in accuracy to the HLLD solver. The amount of operations needed by the FWD solver makes it less efficient computationally than those of the HLL family in one-dimensional problems. However, its relative efficiency increases in multidimensional simulations.
Prevalence of alcohol problems in general practice
DEFF Research Database (Denmark)
Rambaldi, A; Todisco, N; Gluud, C
1996-01-01
The Michigan Alcoholism Screening Test (MAST) and the response to a question about heavy alcohol consumption were used to assess the prevalence of alcohol problems in consecutive patients (77 males and 46 females) consulting a general practitioner in an urban area in the South of Italy (Castellam...... as a screening question in order to detect alcohol problems and give advice regarding reduction of alcohol consumption....
High performance simplex solver
Huangfu, Qi
2013-01-01
The dual simplex method is frequently the most efficient technique for solving linear programming (LP) problems. This thesis describes an efficient implementation of the sequential dual simplex method and the design and development of two parallel dual simplex solvers. In serial, many advanced techniques for the (dual) simplex method are implemented, including sparse LU factorization, hyper-sparse linear system solution technique, efficient approaches to updating LU factors and...
Generalized production planning problem under interval uncertainty
Directory of Open Access Journals (Sweden)
Samir A. Abass
2010-06-01
Full Text Available Data in many real life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb. We consider the generalized production planning problem with interval data. The interval data are in both of the objective function and constraints. The existing results concerning the qualitative and quantitative analysis of basic notions in parametric production planning problem. These notions are the set of feasible parameters, the solvability set and the stability set of the first kind.
A general heuristic for genome rearrangement problems.
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.
Generalized Riemann problem for reactive flows
International Nuclear Information System (INIS)
Ben-Artzi, M.
1989-01-01
A generalized Riemann problem is introduced for the equations of reactive non-viscous compressible flow in one space dimension. Initial data are assumed to be linearly distributed on both sides of a jump discontinuity. The resolution of the singularity is studied and the first-order variation (in time) of flow variables is given in exact form. copyright 1989 Academic Press, Inc
Generalized Benders’ Decomposition for topology optimization problems
DEFF Research Database (Denmark)
Munoz Queupumil, Eduardo Javier; Stolpe, Mathias
2011-01-01
) problems with discrete design variables to global optimality. We present the theoretical aspects of the method, including a proof of finite convergence and conditions for obtaining global optimal solutions. The method is also linked to, and compared with, an Outer-Approximation approach and a mixed 0......–1 semi definite programming formulation of the considered problem. Several ways to accelerate the method are suggested and an implementation is described. Finally, a set of truss topology optimization problems are numerically solved to global optimality.......This article considers the non-linear mixed 0–1 optimization problems that appear in topology optimization of load carrying structures. The main objective is to present a Generalized Benders’ Decomposition (GBD) method for solving single and multiple load minimum compliance (maximum stiffness...
Lobb's Generalization of Catalan's Parenthesization Problem
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…
Generalized Darcy–Oseen resolvent problem
Czech Academy of Sciences Publication Activity Database
Medková, Dagmar; Ptashnyk, M.; Varnhorn, W.
2016-01-01
Roč. 39, č. 6 (2016), s. 1621-1630 ISSN 0170-4214 Institutional support: RVO:67985840 Keywords : Darcy-Oseen resolvent problem * semipermeable membrane * Brinkman-Darcy equations * fluid flow between free-fluid domains and porous media Subject RIV: BA - General Mathematics Impact factor: 1.017, year: 2016 http://onlinelibrary.wiley.com/doi/10.1002/mma.3872/abstract
A generalization of the convex Kakeya problem
Ahn, Heekap
2012-01-01
We consider the following geometric alignment problem: Given a set of line segments in the plane, find a convex region of smallest area that contains a translate of each input segment. This can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be turned through 360 degrees within this region. Our main result is an optimal Θ(n log n)-time algorithm for our geometric alignment problem, when the input is a set of n line segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then the optimum placement is when the midpoints of the segments coincide. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of any rotated copy of G. © 2012 Springer-Verlag Berlin Heidelberg.
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.
PROBLEMS OF GENERAL PRACTICE IN RURAL CALIFORNIA
Carey, Hollis L.; Andrews, Carroll B.
1949-01-01
Medical care for rural populations is an important problem facing the medical profession nationally and locally. The mechanism for solution lies in the existing American Medical Association and California Medical Association committees on rural medical service and further development of “local health councils.” Additional emphasis on training of physicians for general practice is essential through medical school graduate and postgraduate periods. The problem of providing additional adequately equipped and staffed hospitals must receive much consideration. Recognizing that passiveness invites aggressive non-medical agencies to foster bureaucratic dictation inimical to the practice of medicine, the rural physician must act through medical and community organizations to correct weaknesses in the structure of medical practice. PMID:18116230
Gambling Problems in the General Danish Population
DEFF Research Database (Denmark)
Harrison, Glenn W.; Jessen, Lasse J.; Lau, Morten
We compare several popular survey instruments for measuring gambling behavior and gambling propensity to assess if they differ in their classification of individuals in the general adult Danish population. We also examine correlations with standard survey instruments for alcohol use, anxiety......, depression and impulsivity. A feature of our design is that nobody was excluded on the basis of their response to a “trigger,” “gateway” or “diagnostic item” question about previous gambling history. Our sample consists of 8,405 adult Danes. We administered the Focal Adult Gambling Screen to all subjects...... and estimate prevalence of gambling problems using sample weights and controlling for sample selection. We find that 95.4% of the population has no detectable risk, 2.9% has an early risk, 0.8% has an intermediate risk, 0.7% has an advanced risk, and 0.2% can be classified as problem gamblers...
Self-correcting Multigrid Solver
International Nuclear Information System (INIS)
Lewandowski, Jerome L.V.
2004-01-01
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
Anholonomic Cauchy problem in general relativity
International Nuclear Information System (INIS)
Stachel, J.
1980-01-01
The Lie derivative approach to the Cauchy problem in general relativity is applied to the evolution along an arbitrary timelike vector field for the case where the dynamical degrees of freedom are chosen as the (generally anholonomic) metric of the hypersurface elements orthogonal to the vector field. Generalizations of the shear, rotation, and acceleration are given for a nonunit timelike vector field, and applied to the three-plus-one breakup of the Riemann tensor into components parallel and orthogonal to the vector field, resulting in the anholonomic Gauss--Codazzi equations. A similar breakup of the Einstein field equations results in the form of the constraint and evolution equations for the anholonomic case. The results are applied to the case of a space--time with a timelike Killing vector field (stationary field) to demonstrate their utility. Other possible applications, such as in the numerical integration of the field equations, are mentioned. Definitions are given of three-index shear, rotation, and acceleration tensors, and their use in a two-plus-two decomposition of the Riemann tensor and field equations is indicated
A Projection free method for Generalized Eigenvalue Problem with a nonsmooth Regularizer.
Hwang, Seong Jae; Collins, Maxwell D; Ravi, Sathya N; Ithapu, Vamsi K; Adluru, Nagesh; Johnson, Sterling C; Singh, Vikas
2015-12-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.
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…
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,…
A generalization of the convex Kakeya problem
Ahn, Heekap
2013-09-19
Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya\\'s problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal Θ(nlogn)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instead of its area, then placing the segments with their midpoint at the origin and taking their convex hull results in an optimal solution. Finally, we show that for any compact convex figure G, the smallest enclosing disk of G is a smallest-perimeter region containing a translate of every rotated copy of G. © 2013 Springer Science+Business Media New York.
A Test Set for stiff Initial Value Problem Solvers in the open source software R: Package deTestSet
Mazzia, F.; Cash, J.R.; Soetaert, K.
2012-01-01
In this paper we present the R package deTestSet that includes challenging test problems written as ordinary differential equations (ODEs), differential algebraic equations (DAEs) of index up to 3 and implicit differential equations (IDES). In addition it includes 6 new codes to solve initial value
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…
On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
Czech Academy of Sciences Publication Activity Database
Kočvara, Michal; Stingl, M.
2007-01-01
Roč. 109, 2-3 (2007), s. 413-444 ISSN 0025-5610 R&D Projects: GA AV ČR IAA1075402 Institutional research plan: CEZ:AV0Z10750506 Keywords : semidefinite programming * iterative methods * preconditioned conjugate gradient s * augmented lagrangian methods Subject RIV: BA - General Mathematics Impact factor: 1.475, year: 2007
Ergü l, Ö zgü r; Feki, Saber; Al-Jarro, Ahmed; Clo, Alain M.; Bagci, Hakan
2014-01-01
-level approach, utilizing the OpenACC directive-based parallel programming model, is used to minimize two often-faced challenges in GPU programming: developer productivity and code portability. The MOT-TDVIE solver code, originally developed for CPUs
Dynamic problem of generalized thermoelastic diffusive medium
Energy Technology Data Exchange (ETDEWEB)
Kumar, Rajneesh; Kansal, Tarun [Kurukshetra University, Kurukshetra (India)
2010-01-15
The equations of generalized thermoelastic diffusion, based on the theory of Lord and Shulman with one relaxation time, are derived for anisotropic media with rotation. The variational principle and reciprocity theorem for the governing equations are derived. The propagation of leaky Rayleigh waves in a viscous fluid layer overlying a homogeneous isotropic, generalized thermoelastic diffusive half space with rotating frame of reference is studied
Directory of Open Access Journals (Sweden)
Christian F. Janßen
2015-07-01
Full Text Available This contribution is dedicated to demonstrating the high potential and manifold applications of state-of-the-art computational fluid dynamics (CFD tools for free-surface flows in civil and environmental engineering. All simulations were performed with the academic research code ELBE (efficient lattice boltzmann environment, http://www.tuhh.de/elbe. The ELBE code follows the supercomputing-on-the-desktop paradigm and is especially designed for local supercomputing, without tedious accesses to supercomputers. ELBE uses graphics processing units (GPU to accelerate the computations and can be used in a single GPU-equipped workstation of, e.g., a design engineer. The code has been successfully validated in very different fields, mostly related to naval architecture and mechanical engineering. In this contribution, we give an overview of past and present applications with practical relevance for civil engineers. The presented applications are grouped into three major categories: (i tsunami simulations, considering wave propagation, wave runup, inundation and debris flows; (ii dam break simulations; and (iii numerical wave tanks for the calculation of hydrodynamic loads on fixed and moving bodies. This broad range of applications in combination with accurate numerical results and very competitive times to solution demonstrates that modern CFD tools in general, and the ELBE code in particular, can be a helpful design tool for civil and environmental engineers.
General inverse problems for regular variation
DEFF Research Database (Denmark)
Damek, Ewa; Mikosch, Thomas Valentin; Rosinski, Jan
2014-01-01
Regular variation of distributional tails is known to be preserved by various linear transformations of some random structures. An inverse problem for regular variation aims at understanding whether the regular variation of a transformed random object is caused by regular variation of components ...
The Twin Prime Problem and Generalizations
Indian Academy of Sciences (India)
IAS Admin
theory. Though several sophisticated tools were discov- ered, the problem defied many attempts to ... number theory and algebraic geometry. Thus ... goal to discuss some of these below. ..... values of d) ϱ2(d) by setting ϱ2(p) = νp(H) − 1 and.
Cinema, Fermi Problems and General Education
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…
General Research and Development problems in dismantling
International Nuclear Information System (INIS)
Lorin, C.
1993-01-01
R and D studies for dismantling nuclear facilities have been conducted in several domains: safety evaluation (3D cameras, gamma camera, gamma low level control bench, alpha measures); general studies (such as the Baladin software, an expert system for dismantling); decontamination techniques (utilisation of acid or base liquids, laser, ...); cutting techniques and tools (remote controlled grinder, remote controlled robot, carrier crane); robotics for remote operations and handling; waste processing
Parallel Symmetric Eigenvalue Problem Solvers
2015-05-01
Research” and the use of copyright material. Approved by Major Professor(s): Approved by: Head of the Departmental Graduate Program Date Alicia Marie... matrix . . . . . . . . . . . . . . . . . 106 8.15 Sparsity patterns for the Nastran benchmark of order 1.5 million . . . . 108 8.16 Sparsity patterns...magnitude eigenvalues of a given matrix pencil (A,B) along with their associated eigenvectors. Computing the smallest eigenvalues is more difficult
Using a general problem-solving strategy to promote transfer.
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. PsycINFO Database Record (c) 2014 APA, all rights reserved.
Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Vassilevski, Panayot S.; Villa, Umberto
2017-01-01
discretizations on general unstructured grids for a large class of nonlinear partial differential equations, including saddle point problems. The approximation properties of the coarse spaces ensure that our FAS approach for general unstructured meshes leads to optimal mesh-independent convergence rates similar...... to those achieved by geometric FAS on a nested hierarchy of refined meshes. In the numerical results, Newton’s method and Picard iterations with state-of-the-art inner linear solvers are compared to our FAS algorithm for the solution of a nonlinear saddle point problem arising from porous media flow...
Approximate Riemann solver for the two-fluid plasma model
International Nuclear Information System (INIS)
Shumlak, U.; Loverich, J.
2003-01-01
An algorithm is presented for the simulation of plasma dynamics using the two-fluid plasma model. The two-fluid plasma model is more general than the magnetohydrodynamic (MHD) model often used for plasma dynamic simulations. The two-fluid equations are derived in divergence form and an approximate Riemann solver is developed to compute the fluxes of the electron and ion fluids at the computational cell interfaces and an upwind characteristic-based solver to compute the electromagnetic fields. The source terms that couple the fluids and fields are treated implicitly to relax the stiffness. The algorithm is validated with the coplanar Riemann problem, Langmuir plasma oscillations, and the electromagnetic shock problem that has been simulated with the MHD plasma model. A numerical dispersion relation is also presented that demonstrates agreement with analytical plasma waves
A high-performance Riccati based solver for tree-structured quadratic programs
DEFF Research Database (Denmark)
Frison, Gianluca; Kouzoupis, Dimitris; Diehl, Moritz
2017-01-01
the online solution of such problems challenging and the development of tailored solvers crucial. In this paper, an interior point method is presented that can solve Quadratic Programs (QPs) arising in multi-stage MPC efficiently by means of a tree-structured Riccati recursion and a high-performance linear...... algebra library. A performance comparison with code-generated and general purpose sparse QP solvers shows that the computation times can be significantly reduced for all problem sizes that are practically relevant in embedded MPC applications. The presented implementation is freely available as part...
Strong Duality and Optimality Conditions for Generalized Equilibrium Problems
Directory of Open Access Journals (Sweden)
D. H. Fang
2013-01-01
Full Text Available We consider a generalized equilibrium problem involving DC functions. By using the properties of the epigraph of the conjugate functions, some sufficient and/or necessary conditions for the weak and strong duality results and optimality conditions for generalized equilibrium problems are provided.
Comparing direct and iterative equation solvers in a large structural analysis software system
Poole, E. L.
1991-01-01
Two direct Choleski equation solvers and two iterative preconditioned conjugate gradient (PCG) equation solvers used in a large structural analysis software system are described. The two direct solvers are implementations of the Choleski method for variable-band matrix storage and sparse matrix storage. The two iterative PCG solvers include the Jacobi conjugate gradient method and an incomplete Choleski conjugate gradient method. The performance of the direct and iterative solvers is compared by solving several representative structural analysis problems. Some key factors affecting the performance of the iterative solvers relative to the direct solvers are identified.
Problem solving therapy - use and effectiveness in general practice.
Pierce, David
2012-09-01
Problem solving therapy (PST) is one of the focused psychological strategies supported by Medicare for use by appropriately trained general practitioners. This article reviews the evidence base for PST and its use in the general practice setting. Problem solving therapy involves patients learning or reactivating problem solving skills. These skills can then be applied to specific life problems associated with psychological and somatic symptoms. Problem solving therapy is suitable for use in general practice for patients experiencing common mental health conditions and has been shown to be as effective in the treatment of depression as antidepressants. Problem solving therapy involves a series of sequential stages. The clinician assists the patient to develop new empowering skills, and then supports them to work through the stages of therapy to determine and implement the solution selected by the patient. Many experienced GPs will identify their own existing problem solving skills. Learning about PST may involve refining and focusing these skills.
Ltaief, Hatem
2012-01-01
This paper proposes an efficient implementation of the generalized symmetric eigenvalue problem on multicore architecture. Based on a four-stage approach and tile algorithms, the original problem is first transformed into a standard symmetric eigenvalue problem by computing the Cholesky factorization of the right hand side symmetric definite positive matrix (first stage), and applying the inverse of the freshly computed triangular Cholesky factors to the original dense symmetric matrix of the problem (second stage). Calculating the eigenpairs of the resulting problem is then equivalent to the eigenpairs of the original problem. The computation proceeds by reducing the updated dense symmetric matrix to symmetric band form (third stage). The band structure is further reduced by applying a bulge chasing procedure, which annihilates the extra off-diagonal entries using orthogonal transformations (fourth stage). More details on the third and fourth stage can be found in Haidar et al. [Accepted at SC\\'11, November 2011]. The eigenvalues are then calculated from the tridiagonal form using the standard LAPACK QR algorithm (i.e., DTSEQR routine), while the complex and challenging eigenvector computations will be addressed in a companion paper. The tasks from the various stages can concurrently run in an out-of-order fashion. The data dependencies are cautiously tracked by the dynamic runtime system environment QUARK, which ensures the dependencies are not violated for numerical correctness purposes. The obtained tile four-stage generalized symmetric eigenvalue solver significantly outperforms the state-of-the-art numerical libraries (up to 21-fold speed up against multithreaded LAPACK with optimized multithreaded MKL BLAS and up to 4-fold speed up against the corresponding routine from the commercial numerical software Intel MKL) on four sockets twelve cores AMD system with a 24000×24000 matrix size. © 2012 The authors and IOS Press. All rights reserved.
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Energy Technology Data Exchange (ETDEWEB)
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
A Novel Interactive MINLP Solver for CAPE Applications
DEFF Research Database (Denmark)
Henriksen, Jens Peter; Støy, S.; Russel, Boris Mariboe
2000-01-01
This paper presents an interactive MINLP solver that is particularly suitable for solution of process synthesis, design and analysis problems. The interactive MINLP solver is based on the decomposition based MINLP algorithms, where a NLP sub-problem is solved in the innerloop and a MILP master pr...
Computational Complexity of Some Problems on Generalized Cellular Automations
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2012-03-01
Full Text Available We prove that the preimage problem of a generalized cellular automation is NP-hard. The results of this work are important for supporting the security of the ciphers based on the cellular automations.
Procrustes Problems for General, Triangular, and Symmetric Toeplitz Matrices
Directory of Open Access Journals (Sweden)
Juan Yang
2013-01-01
Full Text Available The Toeplitz Procrustes problems are the least squares problems for the matrix equation AX=B over some Toeplitz matrix sets. In this paper the necessary and sufficient conditions are obtained about the existence and uniqueness for the solutions of the Toeplitz Procrustes problems when the unknown matrices are constrained to the general, the triangular, and the symmetric Toeplitz matrices, respectively. The algorithms are designed and the numerical examples show that these algorithms are feasible.
Higher-Order Generalized Invexity in Control Problems
Directory of Open Access Journals (Sweden)
S. K. Padhan
2011-01-01
Full Text Available We introduce a higher-order duality (Mangasarian type and Mond-Weir type for the control problem. Under the higher-order generalized invexity assumptions on the functions that compose the primal problems, higher-order duality results (weak duality, strong duality, and converse duality are derived for these pair of problems. Also, we establish few examples in support of our investigation.
Ergül, Özgür
2014-04-01
Graphics processing units (GPUs) are gradually becoming mainstream in high-performance computing, as their capabilities for enhancing performance of a large spectrum of scientific applications to many fold when compared to multi-core CPUs have been clearly identified and proven. In this paper, implementation and performance-tuning details for porting an explicit marching-on-in-time (MOT)-based time-domain volume-integral-equation (TDVIE) solver onto GPUs are described in detail. To this end, a high-level approach, utilizing the OpenACC directive-based parallel programming model, is used to minimize two often-faced challenges in GPU programming: developer productivity and code portability. The MOT-TDVIE solver code, originally developed for CPUs, is annotated with compiler directives to port it to GPUs in a fashion similar to how OpenMP targets multi-core CPUs. In contrast to CUDA and OpenCL, where significant modifications to CPU-based codes are required, this high-level approach therefore requires minimal changes to the codes. In this work, we make use of two available OpenACC compilers, CAPS and PGI. Our experience reveals that different annotations of the code are required for each of the compilers, due to different interpretations of the fairly new standard by the compiler developers. Both versions of the OpenACC accelerated code achieved significant performance improvements, with up to 30× speedup against the sequential CPU code using recent hardware technology. Moreover, we demonstrated that the GPU-accelerated fully explicit MOT-TDVIE solver leveraged energy-consumption gains of the order of 3× against its CPU counterpart. © 2014 IEEE.
A general approach to posterior contraction in nonparametric inverse problems
Knapik, Bartek; Salomond, Jean Bernard
In this paper, we propose a general method to derive an upper bound for the contraction rate of the posterior distribution for nonparametric inverse problems. We present a general theorem that allows us to derive contraction rates for the parameter of interest from contraction rates of the related
Numerical solution of pipe flow problems for generalized Newtonian fluids
International Nuclear Information System (INIS)
Samuelsson, K.
1993-01-01
In this work we study the stationary laminar flow of incompressible generalized Newtonian fluids in a pipe with constant arbitrary cross-section. The resulting nonlinear boundary value problems can be written in a variational formulation and solved using finite elements and the augmented Lagrangian method. The solution of the boundary value problem is obtained by finding a saddle point of the augmented Lagrangian. In the algorithm the nonlinear part of the equations is treated locally and the solution is obtained by iteration between this nonlinear problem and a global linear problem. For the solution of the linear problem we use the SSOR preconditioned conjugate gradient method. The approximating problem is solved on a sequence of adaptively refined grids. A scheme for adjusting the value of the crucial penalization parameter of the augmented Lagrangian is proposed. Applications to pipe flow and a problem from the theory of capacities are given. (author) (34 refs.)
Generalized Nash equilibrium problems, bilevel programming and mpec
Lalitha, CS
2017-01-01
The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC). These problems interact through their mathematical analysis as well as their applications. The primary aim of the book is to present the modern tool of variational analysis and optimization, which are used to analyze these three classes of problems. All contributing authors are respected academicians, scientists and researchers from around the globe. These contributions are based on the lectures delivered by experts at CIMPA School, held at the University of Delhi, India, from 25 November–6 December 2013, and peer-reviewed by international experts. The book contains five chapters. Chapter 1 deals with nonsmooth, nonconvex bilevel optimization problems whose feasible set is described by using the graph of the solution set mapping of a parametric optimization problem. Chapter 2 describes a constraint qualification to MPECs considere...
Wavelet-Based Poisson Solver for Use in Particle-in-Cell Simulations
Terzic, Balsa; Mihalcea, Daniel; Pogorelov, Ilya V
2005-01-01
We report on a successful implementation of a wavelet-based Poisson solver for use in 3D particle-in-cell simulations. One new aspect of our algorithm is its ability to treat the general (inhomogeneous) Dirichlet boundary conditions. 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 modelling of the Fermilab/NICADD and AES/JLab photoinjectors.
Wavelet-based Poisson Solver for use in Particle-In-Cell Simulations
International Nuclear Information System (INIS)
Terzic, B.; Mihalcea, D.; Bohn, C.L.; Pogorelov, I.V.
2005-01-01
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
Generalized coherent states for the Coulomb problem in one dimension
International Nuclear Information System (INIS)
Nouri, S.
2002-01-01
A set of generalized coherent states for the one-dimensional Coulomb problem in coordinate representation is constructed. At first, we obtain a mapping for proper transformation of the one-dimensional Coulomb problem into a nonrotating four-dimensional isotropic harmonic oscillator in the hyperspherical space, and the generalized coherent states for the one-dimensional Coulomb problem is then obtained in exact closed form. This exactly soluble model can provide an adequate means for a quantum coherency description of the Coulomb problem in one dimension, sample for coherent aspects of the exciton model in one-dimension example in high-temperature superconductivity, semiconductors, and polymers. Also, it can be useful for investigating the coherent scattering of the Coulomb particles in one dimension
Benchmarking optimization solvers for structural topology optimization
DEFF Research Database (Denmark)
Rojas Labanda, Susana; Stolpe, Mathias
2015-01-01
solvers in IPOPT and FMINCON, and the sequential quadratic programming method in SNOPT, are benchmarked on the library using performance profiles. Whenever possible the methods are applied to both the nested and the Simultaneous Analysis and Design (SAND) formulations of the problem. The performance...
DEFF Research Database (Denmark)
Bjørner, Nikolaj; Dung, Phan Anh; Fleckenstein, Lars
2015-01-01
vZ is a part of the SMT solver Z3. It allows users to pose and solve optimization problems modulo theories. Many SMT applications use models to provide satisfying assignments, and a growing number of these build on top of Z3 to get optimal assignments with respect to objective functions. vZ provi...
Two-dimensional time dependent Riemann solvers for neutron transport
International Nuclear Information System (INIS)
Brunner, Thomas A.; Holloway, James Paul
2005-01-01
A two-dimensional Riemann solver is developed for the spherical harmonics approximation to the time dependent neutron transport equation. The eigenstructure of the resulting equations is explored, giving insight into both the spherical harmonics approximation and the Riemann solver. The classic Roe-type Riemann solver used here was developed for one-dimensional problems, but can be used in multidimensional problems by treating each face of a two-dimensional computation cell in a locally one-dimensional way. Several test problems are used to explore the capabilities of both the Riemann solver and the spherical harmonics approximation. The numerical solution for a simple line source problem is compared to the analytic solution to both the P 1 equation and the full transport solution. A lattice problem is used to test the method on a more challenging problem
Investigation of Free Particle Propagator with Generalized Uncertainty Problem
International Nuclear Information System (INIS)
Hassanabadi, H.; Ghobakhloo, F.
2016-01-01
We consider the Schrödinger equation with a generalized uncertainty principle for a free particle. We then transform the problem into a second-order ordinary differential equation and thereby obtain the corresponding propagator. The result of ordinary quantum mechanics is recovered for vanishing minimal length parameter.
A generalization of the finiteness problem in local cohomology ...
Indian Academy of Sciences (India)
(Math. Sci.) Vol. 119, No. 2, April 2009, pp. 159–164. © Printed in India. A generalization of the finiteness problem in local cohomology modules. AMIR MAFI. Department of Mathematics, University of Kurdistan, P.O. Box 416, Sanandaj, Iran. Institute for Studies in Theoretical Physics and Mathematics, P.O. Box 19395-5746,.
Problem-Based Learning in a General Psychology Course.
Willis, Sandra A.
2002-01-01
Describes the adoption of problem-based learning (PBL) techniques in a general psychology course. States that the instructor used a combination of techniques, including think-pair-share, lecture/discussion, and PBL. Notes means and standard deviations for graded components of PBL format versus lecture/discussion format. (Contains 18 references.)…
Energy-momentum distribution: A crucial problem in general relativity
Sharif, M.; Fatima, T.
2005-01-01
This paper is aimed to elaborate the problem of energy–momentum in general relativity. In this connection, we use the prescriptions of Einstein, Landau–Lifshitz, Papapetrou and Möller to compute the energy–momentum densities for two exact solutions of Einstein field equations. The space–times under
Municipal solid waste management problems: an applied general equilibrium analysis
Bartelings, H.
2003-01-01
Keywords: Environmental policy; General equilibrium modeling; Negishi format; Waste management policies; Market distortions.
About 40% of the entire budget spent on environmental problems in the
Jacobi-Davidson methods for generalized MHD-eigenvalue problems
J.G.L. Booten; D.R. Fokkema; G.L.G. Sleijpen; H.A. van der Vorst (Henk)
1995-01-01
textabstractA Jacobi-Davidson algorithm for computing selected eigenvalues and associated eigenvectors of the generalized eigenvalue problem $Ax = lambda Bx$ is presented. In this paper the emphasis is put on the case where one of the matrices, say the B-matrix, is Hermitian positive definite. The
Czech Academy of Sciences Publication Activity Database
Hnětynková, Iveta; Plešinger, M.; Strakoš, Z.
2015-01-01
Roč. 36, č. 2 (2015), s. 417-434 ISSN 0895-4798 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) EE2.3.30.0065; GA MŠk(CZ) LL1202 Keywords : total least squares problem * multiple right-hand sides * core problem * Golub-Kahan bidiagonalization * generalized Jacobi matrices Subject RIV: BA - General Mathematics Impact factor: 1.883, year: 2015
Application of Neutrosophic Set Theory in Generalized Assignment Problem
Directory of Open Access Journals (Sweden)
Supriya Kar
2015-09-01
Full Text Available This paper presents the application of Neutrosophic Set Theory (NST in solving Generalized Assignment Problem (GAP. GAP has been solved earlier under fuzzy environment. NST is a generalization of the concept of classical set, fuzzy set, interval-valued fuzzy set, intuitionistic fuzzy set. Elements of Neutrosophic set are characterized by a truth-membership function, falsity and also indeterminacy which is a more realistic way of expressing the parameters in real life problem. Here the elements of the cost matrix for the GAP are considered as neutrosophic elements which have not been considered earlier by any other author. The problem has been solved by evaluating score function matrix and then solving it by Extremum Difference Method (EDM [1] to get the optimal assignment. The method has been demonstrated by a suitable numerical example.
Polymorphic Uncertain Linear Programming for Generalized Production Planning Problems
Directory of Open Access Journals (Sweden)
Xinbo Zhang
2014-01-01
Full Text Available A polymorphic uncertain linear programming (PULP model is constructed to formulate a class of generalized production planning problems. In accordance with the practical environment, some factors such as the consumption of raw material, the limitation of resource and the demand of product are incorporated into the model as parameters of interval and fuzzy subsets, respectively. Based on the theory of fuzzy interval program and the modified possibility degree for the order of interval numbers, a deterministic equivalent formulation for this model is derived such that a robust solution for the uncertain optimization problem is obtained. Case study indicates that the constructed model and the proposed solution are useful to search for an optimal production plan for the polymorphic uncertain generalized production planning problems.
Stochastic programming problems with generalized integrated chance constraints
Czech Academy of Sciences Publication Activity Database
Branda, Martin
2012-01-01
Roč. 61, č. 8 (2012), s. 949-968 ISSN 0233-1934 R&D Projects: GA ČR GAP402/10/1610 Grant - others:SVV(CZ) 261315/2010 Institutional support: RVO:67985556 Keywords : chance constraints * integrated chance constraints * penalty functions * sample approximations * blending problem Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 0.707, year: 2012 http://library.utia.cas.cz/separaty/2012/E/branda-stochastic programming problems with generalized integrated.pdf
A New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
Directory of Open Access Journals (Sweden)
Fatemeh Mohammad
2014-05-01
Full Text Available In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem $Ax = \\lambda Bx$[Q.~Ye and P.~Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011 1697-1715]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
Problem drinking - detection and assessment in general practice.
Demirkol, Apo; Haber, Paul; Conigrave, Katherine
2011-08-01
Alcohol has long been an integral part of the social life of many Australians. However, alcohol is associated with significant harm to drinkers, and also to nondrinkers. This article explores the role of the general practitioner in the detection and assessment of problem drinking. Excessive alcohol use is a major public health problem and the majority of people who drink excessively go undetected. General practitioners are in a good position to detect excessive alcohol consumption; earlier intervention can help improve outcomes. AUDIT-C is an effective screening tool for the detection of problem drinking. National Health and Medical Research Council guidelines suggest that no more than two standard drinks on each occasion will keep lifetime risk of death from alcohol related disease or injury at a low level. Once an alcohol problem is detected it is important to assess for alcohol dependence, other substance use, motivation to change, psychiatric comorbidities and examination and investigation findings that may be associated with excessive alcohol use. A comprehensive assessment of the impact and risk of harm of the patient's drinking to themselves and others is vital, and may require several consultations.
Lonigan, Christopher J; Spiegel, Jamie A; Goodrich, J Marc; Morris, Brittany M; Osborne, Colleen M; Lerner, Matthew D; Phillips, Beth M
2017-11-01
Findings from prior research have consistently indicated significant associations between self-regulation and externalizing behaviors. Significant associations have also been reported between children's language skills and both externalizing behaviors and self-regulation. Few studies to date, however, have examined these relations longitudinally, simultaneously, or with respect to unique clusters of externalizing problems. The current study examined the influence of preschool self-regulation on general and specific externalizing behavior problems in early elementary school and whether these relations were independent of associations between language, self-regulation, and externalizing behaviors in a sample of 815 children (44% female). Additionally, given a general pattern of sex differences in the presentations of externalizing behavior problems, self-regulation, and language skills, sex differences for these associations were examined. Results indicated unique relations of preschool self-regulation and language with both general externalizing behavior problems and specific problems of inattention. In general, self-regulation was a stronger longitudinal correlate of externalizing behavior for boys than it was for girls, and language was a stronger longitudinal predictor of hyperactive/impulsive behavior for girls than it was for boys.
International Nuclear Information System (INIS)
Hofer, E.
1981-01-01
Simulations in thermo- and fluiddynamics often require the numerical solution of large initial value problems with stiffness caused by eigenvalues close to the imaginary axis. The regions of absolute stability of the most widely used ordinary differential equation (ODE) solvers, for stiff problems, do not properly account for this. The paper introduces a general purpose ODE-solver with considerably larger stability regions. Its reliability is illustrated by test problems, with complex eigenvalues, from a well known test package. Applications in large codes, for simulations in thermo- and fluiddynamics, demonstrate its practical usability. (orig.) [de
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Ibeid, Huda; Yokota, Rio; Keyes, David E.
2014-01-01
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
Fast Multipole-Based Preconditioner for Sparse Iterative Solvers
Ibeid, Huda
2014-05-04
Among optimal hierarchical algorithms for the computational solution of elliptic problems, the Fast Multipole Method (FMM) stands out for its adaptability to emerging architectures, having high arithmetic intensity, tunable accuracy, and relaxed global synchronization requirements. We demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, it is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity architecture supercomputers.
An Enhanced Genetic Algorithm for the Generalized Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
H. Jafarzadeh
2017-12-01
Full Text Available The generalized traveling salesman problem (GTSP deals with finding the minimum-cost tour in a clustered set of cities. In this problem, the traveler is interested in finding the best path that goes through all clusters. As this problem is NP-hard, implementing a metaheuristic algorithm to solve the large scale problems is inevitable. The performance of these algorithms can be intensively promoted by other heuristic algorithms. In this study, a search method is developed that improves the quality of the solutions and competition time considerably in comparison with Genetic Algorithm. In the proposed algorithm, the genetic algorithms with the Nearest Neighbor Search (NNS are combined and a heuristic mutation operator is applied. According to the experimental results on a set of standard test problems with symmetric distances, the proposed algorithm finds the best solutions in most cases with the least computational time. The proposed algorithm is highly competitive with the published until now algorithms in both solution quality and running time.
A Generalized Cauchy Distribution Framework for Problems Requiring Robust Behavior
Directory of Open Access Journals (Sweden)
Carrillo RafaelE
2010-01-01
Full Text Available 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.
A General Solution Framework for Component-Commonality Problems
Directory of Open Access Journals (Sweden)
Nils Boysen
2009-05-01
Full Text Available Component commonality - the use of the same version of a component across multiple products - is being increasingly considered as a promising way to offer high external variety while retaining low internal variety in operations. However, increasing commonality has both positive and negative cost effects, so that optimization approaches are required to identify an optimal commonality level. As components influence to a greater or lesser extent nearly every process step along the supply chain, it is not surprising that a multitude of diverging commonality problems is being investigated in literature, each of which are developing a specific algorithm designed for the respective commonality problem being considered. The paper on hand aims at a general framework which is flexible and efficient enough to be applied to a wide range of commonality problems. Such a procedure based on a two-stage graph approach is presented and tested. Finally, flexibility of the procedure is shown by customizing the framework to account for different types of commonality problems.
Generalized Artificial Life Structure for Time-dependent Problems
Institute of Scientific and Technical Information of China (English)
TSAU Minhe; KAO Weiwen; CHANG Albert
2009-01-01
In recent years, more attention has been paid on artificial life researches. Artificial life(AL) is a research on regulating gene parameters of digital organisms under complicated problematic environments through natural selections and evolutions to achieve the final emergence of intelligence. Most recent studies focused on solving certain real problems by artificial life methods, yet without much address on the AL life basic mechanism. The real problems are often very complicated, and the proposed methods sometimes seem too simple to handle those problems. This study proposed a new approach in AL research, named "generalized artificial life structure(GALS)", in which the traditional "gene bits" in genetic algorithms is first replaced by "gene parameters", which could appear anywhere in GALS. A modeling procedure is taken to normalize the input data, and AL "tissue" is innovated to make AL more complex. GALS is anticipated to contribute significantly to the fitness of AL evolution. The formation of"tissue" begins with some different AL basic cells, and then tissue is produced by the casual selections of one or several of these cells. As a result, the gene parameters, represented by "tissues", could become highly diversified. This diversification should have obvious effects on improving gene fitness. This study took the innovative method of GALS in a stock forecasting problem under a carefully designed manipulating platform. And the researching results verify that the GALS is successful in improving the gene evolution fitness.
The problem of time quantum mechanics versus general relativity
Anderson, Edward
2017-01-01
This book is a treatise on time and on background independence in physics. It first considers how time is conceived of in each accepted paradigm of physics: Newtonian, special relativity, quantum mechanics (QM) and general relativity (GR). Substantial differences are moreover uncovered between what is meant by time in QM and in GR. These differences jointly source the Problem of Time: Nine interlinked facets which arise upon attempting concurrent treatment of the QM and GR paradigms, as is required in particular for a background independent theory of quantum gravity. A sizeable proportion of current quantum gravity programs - e.g. geometrodynamical and loop quantum gravity approaches to quantum GR, quantum cosmology, supergravity and M-theory - are background independent in this sense. This book's foundational topic is thus furthermore of practical relevance in the ongoing development of quantum gravity programs. This book shows moreover that eight of the nine facets of the Problem of Time already occur upon ...
Spectrum of general surgical problems in the developmentally disabled adults
International Nuclear Information System (INIS)
Khalid, K.; Al-Salamah, Saleh M.
2006-01-01
This study highlights the spectrum of general surgical problems necessitating admission on intellectually disabled adult patients. Problems encountered in the management and the ways to overcome various difficulties are highlighted. Prospective collection of data on 63 consecutive developmentally disabled adult patients admitted to the Department of General Surgery, Riyadh Medical Complex (RMC), Riyadh, Kingdom of Saudi Arabia for various indications from January 2000 through December 2004. Demographic details, clinical presentation, diagnostic modalities, associated physical and neurological disabilities, coexisting medical condition, treatment options, morbidity and mortality were analyzed. Various difficulties encountered during the management and mean to overcome these problems are addressed. Sixty-three patients accounted for 71 admissions. Mean age was 26.7 years with a male preponderance (4.25:1). Fifty-four patients were admitted for various emergency conditions. History of pica could be obtained in 33% of the cases. Twenty-seven patients were admitted for acute abdomen. Volvulus of the colon (22.2%) and pseudo-obstruction (18.5%) were the most common causes of acute abdomen. Twenty-one patients were admitted with upper gastrointestinal bleeding. Reflux esophagitis was the most common cause of bleeding (62%). Overall morbidity was 41% for emergency admissions and 22% for elective surgery. Hospital mortality was 21.4% for emergency surgery. There was no death in elective cases. Developmentally disabled patients comprise a special class of patients with peculiar management problems. The treating clinician should be aware of various unexpected conditions not found as frequently in the normal patient population. Apparent lack of pain does not exclude an acute emergency. Possible surgical condition should be suspected if there is vomiting, abdominal distension, fever, increased irritability of recent onset. Male gender and history of pica are added risk factors
Comparison of open-source linear programming solvers.
Energy Technology Data Exchange (ETDEWEB)
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin David.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
Directory of Open Access Journals (Sweden)
X. Zhao
2012-01-01
Full Text Available A combined interior point homotopy continuation method is proposed for solving general multiobjective programming problem. We prove the existence and convergence of a smooth homotopy path from almost any interior initial interior point to a solution of the KKT system under some basic assumptions.
Non-integrability of the generalized spring-pendulum problem
International Nuclear Information System (INIS)
Maciejewski, Andrzej J; Przybylska, Maria; Weil, Jacques-Arthur
2004-01-01
We investigate a generalization of the three-dimensional spring-pendulum system. The problem depends on two real parameters (k, a), where k is the Young modulus of the spring and a describes the nonlinearity of elastic forces. We show that this system is not integrable when k ≠ -a. We carefully investigated the case k = -a when the necessary condition for integrability given by the Morales-Ruiz-Ramis theory is satisfied. We discuss an application of the higher order variational equations for proving the non-integrability in this case
van der Schoot, M.; Bakker Arkema, A.H.; Horsley, T.M.; van Lieshout, E.C.D.M.
2009-01-01
This study examined the effects of consistency (relational term consistent vs. inconsistent with required arithmetic operation) and markedness (relational term unmarked ['more than'] vs. marked ['less than']) on word problem solving in 10-12 years old children differing in problem-solving skill. The
Mathematical programming solver based on local search
Gardi, Frédéric; Darlay, Julien; Estellon, Bertrand; Megel, Romain
2014-01-01
This book covers local search for combinatorial optimization and its extension to mixed-variable optimization. Although not yet understood from the theoretical point of view, local search is the paradigm of choice for tackling large-scale real-life optimization problems. Today's end-users demand interactivity with decision support systems. For optimization software, this means obtaining good-quality solutions quickly. Fast iterative improvement methods, like local search, are suited to satisfying such needs. Here the authors show local search in a new light, in particular presenting a new kind of mathematical programming solver, namely LocalSolver, based on neighborhood search. First, an iconoclast methodology is presented to design and engineer local search algorithms. The authors' concern about industrializing local search approaches is of particular interest for practitioners. This methodology is applied to solve two industrial problems with high economic stakes. Software based on local search induces ex...
Use of Tabu Search in a Solver to Map Complex Networks onto Emulab Testbeds
National Research Council Canada - National Science Library
MacDonald, Jason E
2007-01-01
The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources...
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, Huda
2016-12-07
Exascale systems are predicted to have approximately one billion cores, assuming Gigahertz cores. Limitations on affordable network topologies for distributed memory systems of such massive scale bring new challenges to the currently dominant parallel programing model. Currently, there are many efforts to evaluate the hardware and software bottlenecks of exascale designs. It is therefore of interest to model application performance and to understand what changes need to be made to ensure extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM as an elliptic PDE solver have opened the possibility to use it as a preconditioner for even a broader range of applications. In this thesis, we (i) discuss the challenges for FMM on current parallel computers and future exascale architectures, with a focus on inter-node communication, and develop a performance model that considers the communication patterns of the FMM for spatially quasi-uniform distributions, (ii) employ this performance model to guide performance and scaling improvement of FMM for all-atom molecular dynamics simulations of uniformly distributed particles, and (iii) demonstrate that, beyond its traditional use as a solver in problems for which explicit free-space kernel representations are available, the FMM has applicability as a preconditioner in finite domain elliptic boundary value problems, by equipping it with boundary integral capability for satisfying conditions at finite boundaries and by wrapping it in a Krylov method for extensibility to more general operators. Compared with multilevel methods, FMM is capable of comparable algebraic convergence rates down to the truncation error of the discretized PDE, and it has superior multicore and distributed memory scalability properties on commodity
Evolving effective incremental SAT solvers with GP
Bader, Mohamed; Poli, R.
2008-01-01
Hyper-Heuristics could simply be defined as heuristics to choose other heuristics, and it is a way of combining existing heuristics to generate new ones. In a Hyper-Heuristic framework, the framework is used for evolving effective incremental (Inc*) solvers for SAT. We test the evolved heuristics (IncHH) against other known local search heuristics on a variety of benchmark SAT problems.
PARETO OPTIMAL SOLUTIONS FOR MULTI-OBJECTIVE GENERALIZED ASSIGNMENT PROBLEM
Directory of Open Access Journals (Sweden)
S. Prakash
2012-01-01
Full Text Available
ENGLISH ABSTRACT: The Multi-Objective Generalized Assignment Problem (MGAP with two objectives, where one objective is linear and the other one is non-linear, has been considered, with the constraints that a job is assigned to only one worker – though he may be assigned more than one job, depending upon the time available to him. An algorithm is proposed to find the set of Pareto optimal solutions of the problem, determining assignments of jobs to workers with two objectives without setting priorities for them. The two objectives are to minimise the total cost of the assignment and to reduce the time taken to complete all the jobs.
AFRIKAANSE OPSOMMING: ‘n Multi-doelwit veralgemeende toekenningsprobleem (“multi-objective generalised assignment problem – MGAP” met twee doelwitte, waar die een lineêr en die ander nielineêr is nie, word bestudeer, met die randvoorwaarde dat ‘n taak slegs toegedeel word aan een werker – alhoewel meer as een taak aan hom toegedeel kan word sou die tyd beskikbaar wees. ‘n Algoritme word voorgestel om die stel Pareto-optimale oplossings te vind wat die taaktoedelings aan werkers onderhewig aan die twee doelwitte doen sonder dat prioriteite toegeken word. Die twee doelwitte is om die totale koste van die opdrag te minimiseer en om die tyd te verminder om al die take te voltooi.
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.
A Comparison of Monte Carlo and Deterministic Solvers for keff and Sensitivity Calculations
Energy Technology Data Exchange (ETDEWEB)
Haeck, Wim [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Parsons, Donald Kent [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); White, Morgan Curtis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Saller, Thomas [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Favorite, Jeffrey A. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2017-12-12
Verification and validation of our solutions for calculating the neutron reactivity for nuclear materials is a key issue to address for many applications, including criticality safety, research reactors, power reactors, and nuclear security. Neutronics codes solve variations of the Boltzmann transport equation. The two main variants are Monte Carlo versus deterministic solutions, e.g. the MCNP [1] versus PARTISN [2] codes, respectively. There have been many studies over the decades that examined the accuracy of such solvers and the general conclusion is that when the problems are well-posed, either solver can produce accurate results. However, the devil is always in the details. The current study examines the issue of self-shielding and the stress it puts on deterministic solvers. Most Monte Carlo neutronics codes use continuous-energy descriptions of the neutron interaction data that are not subject to this effect. The issue of self-shielding occurs because of the discretisation of data used by the deterministic solutions. Multigroup data used in these solvers are the average cross section and scattering parameters over an energy range. Resonances in cross sections can occur that change the likelihood of interaction by one to three orders of magnitude over a small energy range. Self-shielding is the numerical effect that the average cross section in groups with strong resonances can be strongly affected as neutrons within that material are preferentially absorbed or scattered out of the resonance energies. This affects both the average cross section and the scattering matrix.
ELSI: A unified software interface for Kohn-Sham electronic structure solvers
Yu, Victor Wen-zhe; Corsetti, Fabiano; García, Alberto; Huhn, William P.; Jacquelin, Mathias; Jia, Weile; Lange, Björn; Lin, Lin; Lu, Jianfeng; Mi, Wenhui; Seifitokaldani, Ali; Vázquez-Mayagoitia, Álvaro; Yang, Chao; Yang, Haizhao; Blum, Volker
2018-01-01
Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. Comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.
International Nuclear Information System (INIS)
Turinsky, P.J.; Al-Chalabi, R.M.K.; Engrand, P.; Sarsour, H.N.; Faure, F.X.; Guo, W.
1994-06-01
NESTLE is a FORTRAN77 code that solves the few-group neutron diffusion equation utilizing the Nodal Expansion Method (NEM). NESTLE can solve the eigenvalue (criticality); eigenvalue adjoint; external fixed-source steady-state; or external fixed-source. or eigenvalue initiated transient problems. The code name NESTLE originates from the multi-problem solution capability, abbreviating Nodal Eigenvalue, Steady-state, Transient, Le core Evaluator. The eigenvalue problem allows criticality searches to be completed, and the external fixed-source steady-state problem can search to achieve a specified power level. Transient problems model delayed neutrons via precursor groups. Several core properties can be input as time dependent. Two or four energy groups can be utilized, with all energy groups being thermal groups (i.e. upscatter exits) if desired. Core geometries modelled include Cartesian and Hexagonal. Three, two and one dimensional models can be utilized with various symmetries. The non-linear iterative strategy associated with the NEM method is employed. An advantage of the non-linear iterative strategy is that NSTLE can be utilized to solve either the nodal or Finite Difference Method representation of the few-group neutron diffusion equation
Origins and development of the Cauchy problem in general relativity
International Nuclear Information System (INIS)
Ringström, Hans
2015-01-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
International Nuclear Information System (INIS)
Koteras, J.R.
1996-01-01
The prediction of stresses and displacements around tunnels buried deep within the earth is an important class of geomechanics problems. The material behavior immediately surrounding the tunnel is typically nonlinear. The surrounding mass, even if it is nonlinear, can usually be characterized by a simple linear elastic model. The finite element method is best suited for modeling nonlinear materials of limited volume, while the boundary element method is well suited for modeling large volumes of linear elastic material. A computational scheme that couples the finite element and boundary element methods would seem particularly useful for geomechanics problems. A variety of coupling schemes have been proposed, but they rely on direct solution methods. Direct solution techniques have large storage requirements that become cumbersome for large-scale three-dimensional problems. An alternative to direct solution methods is iterative solution techniques. A scheme has been developed for coupling the finite element and boundary element methods that uses an iterative solution method. This report shows that this coupling scheme is valid for problems where nonlinear material behavior occurs in the finite element region
An efficient iterative method for the generalized Stokes problem
Energy Technology Data Exchange (ETDEWEB)
Sameh, A. [Univ. of Minnesota, Twin Cities, MN (United States); Sarin, V. [Univ. of Illinois, Urbana, IL (United States)
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.
A robust multilevel simultaneous eigenvalue solver
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.
Parallel iterative solvers and preconditioners using approximate hierarchical methods
Energy Technology Data Exchange (ETDEWEB)
Grama, A.; Kumar, V.; Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)
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.
International Nuclear Information System (INIS)
Le Quere, P.; Weisman, C.; Paillere, H.; Vierendeels, J.; Dick, E.; Becker, R.; Braack, M.; Locke, J.
2005-01-01
Heat transfer by natural convection and conduction in enclosures occurs in numerous practical situations including the cooling of nuclear reactors. For large temperature difference, the flow becomes compressible with a strong coupling between the continuity, the momentum and the energy equations through the equation of state, and its properties (viscosity, heat conductivity) also vary with the temperature, making the Boussinesq flow approximation inappropriate and inaccurate. There are very few reference solutions in the literature on non-Boussinesq natural convection flows. We propose here a test case problem which extends the well-known De Vahl Davis differentially heated square cavity problem to the case of large temperature differences for which the Boussinesq approximation is no longer valid. The paper is split in two parts: in this first part, we propose as yet unpublished reference solutions for cases characterized by a non-dimensional temperature difference of 0.6, Ra 10 6 (constant property and variable property cases) and Ra = 10 7 (variable property case). These reference solutions were produced after a first international workshop organized by Cea and LIMSI in January 2000, in which the above authors volunteered to produce accurate numerical solutions from which the present reference solutions could be established. (authors)
Riemann solvers and undercompressive shocks of convex FPU chains
International Nuclear Information System (INIS)
Herrmann, Michael; Rademacher, Jens D M
2010-01-01
We consider FPU-type atomic chains with general convex potentials. The naive continuum limit in the hyperbolic space–time scaling is the p-system of mass and momentum conservation. We systematically compare Riemann solutions to the p-system with numerical solutions to discrete Riemann problems in FPU chains, and argue that the latter can be described by modified p-system Riemann solvers. We allow the flux to have a turning point, and observe a third type of elementary wave (conservative shocks) in the atomistic simulations. These waves are heteroclinic travelling waves and correspond to non-classical, undercompressive shocks of the p-system. We analyse such shocks for fluxes with one or more turning points. Depending on the convexity properties of the flux we propose FPU-Riemann solvers. Our numerical simulations confirm that Lax shocks are replaced by so-called dispersive shocks. For convex–concave flux we provide numerical evidence that convex FPU chains follow the p-system in generating conservative shocks that are supersonic. For concave–convex flux, however, the conservative shocks of the p-system are subsonic and do not appear in FPU-Riemann solutions
ALPS - A LINEAR PROGRAM SOLVER
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.
Some problems in generalized electromagnetic thermoelasticity and wave propagation
International Nuclear Information System (INIS)
Mohamed, S.E.S.
2012-01-01
The first chapter contains a review of the classical theory of elasticity, the theory of thermodynamics, the theory of uncoupled thermoelasticity, the coupled theory of thermoelasticity, the generalized theory of thermoelasticity with one relaxation time, electromagneto thermoelasticity and an introduction to wave propagation in elastic media. Chapter two is devoted to the study of wave propagation for a problem of an infinitely long solid conducting circular cylinder whose lateral surface is traction free and subjected to a known surrounding temperatures in the presence of a uniform magnetic field in the direction of the axis of the cylinder. Laplace transform techniques are used to derive the solution in the Laplace transform domain. The inversion process is carried out using asymptotic expansions valid for short tines. Numerical results are computed for the temperature, displacement, stress,induced magnetic field and induced electric field distributions. The chapter contains also a study of the wave propagation in the elastic medium. In chapter three, we consider the two-dimensional problem of an infinitely long conducting solid cylinder. The lateral surface of the cylinder is taken to be traction free and is subjected to a known temperature distribution independent of z in the presence of a uniform magnetic field in the direction of the axis of the cylinder. Laplace transform techniques are used. The inversion process is carried out using a numerical method based on Fourier series expansions. Numerical results are computed and represented graphically. The chapter contains also a study of the wave propagation in the elastic medium. In chapter four, we consider a two-dimensional problem for an infinity long cylinder. The lateral surface of the cylinder is taken to be traction free and is subjected to a known temperature distribution independent of φ in the presence of a uniform electric field in the direction of the binomial of the cylinder axis. Laplace and
Limited Data Problems for the Generalized Radon Transform in Rn
DEFF Research Database (Denmark)
Frikel, Jürgen; Quinto, Eric Todd
2016-01-01
We consider the generalized Radon transform (defined in terms of smooth weight functions) on hyperplanes in Rn. We analyze general filtered backprojection type reconstruction methods for limited data with filters given by general pseudodifferential operators. We provide microlocal characterizations...
Abstract generalized vector quasi-equilibrium problems in noncompact Hadamard manifolds
Directory of Open Access Journals (Sweden)
Haishu Lu
2017-05-01
Full Text Available Abstract This paper deals with the abstract generalized vector quasi-equilibrium problem in noncompact Hadamard manifolds. We prove the existence of solutions to the abstract generalized vector quasi-equilibrium problem under suitable conditions and provide applications to an abstract vector quasi-equilibrium problem, a generalized scalar equilibrium problem, a scalar equilibrium problem, and a perturbed saddle point problem. Finally, as an application of the existence of solutions to the generalized scalar equilibrium problem, we obtain a weakly mixed variational inequality and two mixed variational inequalities. The results presented in this paper unify and generalize many known results in the literature.
Good, L. H.; Erickson, A.
2016-02-01
Academic learning and research experiences alone cannot prepare our emerging ocean leaders to take on the challenges facing our oceans. Developing solutions that incorporate environmental and ocean sciences necessitates an interdisciplinary approach, requiring emerging leaders to be able to work in collaborative knowledge to action systems, rather than on micro-discipline islands. Professional and informal learning experiences can enhance graduate marine education by helping learners gain the communication, collaboration, and innovative problem-solving skills necessary for them to interact with peers at the interface of science and policy. These rich experiences can also provide case-based and hands-on opportunities for graduate learners to explore real-world examples of ocean science, policy, and management in action. However, academic programs are often limited in their capacity to offer such experiences as a part of a traditional curriculum. Rather than expecting learners to rely on their academic training, one approach is to encourage and support graduates to seek professional development beyond their university's walls, and think more holistically about their learning as it relates to their career interests. During this session we discuss current thinking around the professional learning needs of emerging ocean leaders, what this means for academic epistemologies, and examine initial evaluation outcomes from activities in our cross-campus consortium model in Monterey Bay, California. This innovative model includes seven regional academic institutions working together to develop an interdisciplinary ocean community and increase access to professional development opportunities to better prepare regional ocean-interested graduate students and early career researchers as future leaders.
Constraint Solver Techniques for Implementing Precise and Scalable Static Program Analysis
DEFF Research Database (Denmark)
Zhang, Ye
solver using unification we could make a program analysis easier to design and implement, much more scalable, and still as precise as expected. We present an inclusion constraint language with the explicit equality constructs for specifying program analysis problems, and a parameterized framework...... developers to build reliable software systems more quickly and with fewer bugs or security defects. While designing and implementing a program analysis remains a hard work, making it both scalable and precise is even more challenging. In this dissertation, we show that with a general inclusion constraint...... data flow analyses for C language, we demonstrate a large amount of equivalences could be detected by off-line analyses, and they could then be used by a constraint solver to significantly improve the scalability of an analysis without sacrificing any precision....
A General Theory of Markovian Time Inconsistent Stochastic Control Problems
DEFF Research Database (Denmark)
Björk, Tomas; Murgochi, Agatha
We develop a theory for stochastic control problems which, in various ways, are time inconsistent in the sense that they do not admit a Bellman optimality principle. We attach these problems by viewing them within a game theoretic framework, and we look for Nash subgame perfect equilibrium points...... examples of time inconsistency in the literature are easily seen to be special cases of the present theory. We also prove that for every time inconsistent problem, there exists an associated time consistent problem such that the optimal control and the optimal value function for the consistent problem...
PCX, Interior-Point Linear Programming Solver
International Nuclear Information System (INIS)
Czyzyk, J.
2004-01-01
1 - Description of program or function: PCX solves linear programming problems using the Mehrota predictor-corrector interior-point algorithm. PCX can be called as a subroutine or used in stand-alone mode, with data supplied from an MPS file. The software incorporates modules that can be used separately from the linear programming solver, including a pre-solve routine and data structure definitions. 2 - Methods: The Mehrota predictor-corrector method is a primal-dual interior-point method for linear programming. The starting point is determined from a modified least squares heuristic. Linear systems of equations are solved at each interior-point iteration via a sparse Cholesky algorithm native to the code. A pre-solver is incorporated in the code to eliminate inefficiencies in the user's formulation of the problem. 3 - Restriction on the complexity of the problem: There are no size limitations built into the program. The size of problem solved is limited by RAM and swap space on the user's computer
SOCIAL NETWORK OPTIMIZATION A NEW METHAHEURISTIC FOR GENERAL OPTIMIZATION PROBLEMS
Directory of Open Access Journals (Sweden)
Hassan Sherafat
2017-12-01
Full Text Available In the recent years metaheuristics were studied and developed as powerful technics for hard optimization problems. Some of well-known technics in this field are: Genetic Algorithms, Tabu Search, Simulated Annealing, Ant Colony Optimization, and Swarm Intelligence, which are applied successfully to many complex optimization problems. In this paper, we introduce a new metaheuristic for solving such problems based on social networks concept, named as Social Network Optimization – SNO. We show that a wide range of np-hard optimization problems may be solved by SNO.
Institutional Problems and Solutions of General Education in Chinese Universities
Meng, Weiqing; Huang, Wei
2018-01-01
Embedding general education in the Chinese university education system is a considerably complex systemic project, and a lack of institutional arrangements beneficial to general education has always been a key barrier in implementation. Currently, the main institutional restricting factors for university general education include substantial…
Efficient Implementation of the Riccati Recursion for Solving Linear-Quadratic Control Problems
DEFF Research Database (Denmark)
Frison, Gianluca; Jørgensen, John Bagterp
2013-01-01
In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is typically the main computational effort at each iteration....... In this paper, we compare a number of solvers for an extended formulation of the LQ control problem: a Riccati recursion based solver can be considered the best choice for the general problem with dense matrices. Furthermore, we present a novel version of the Riccati solver, that makes use of the Cholesky...... factorization of the Pn matrices to reduce the number of flops. When combined with regularization and mixed precision, this algorithm can solve large instances of the LQ control problem up to 3 times faster than the classical Riccati solver....
Directory of Open Access Journals (Sweden)
Mohammed Zia
2018-03-01
Full Text Available The Equality-Generalized Travelling Salesman Problem (E-GTSP, which is an extension of the Travelling Salesman Problem (TSP, is stated as follows: given groups of points within a city, like banks, supermarkets, etc., find a minimum cost Hamiltonian cycle that visits each group exactly once. It can model many real-life combinatorial optimization scenarios more efficiently than TSP. This study presents five spatially driven search-algorithms for possible transformation of E-GTSP to TSP by considering the spatial spread of points in a given urban city. Presented algorithms are tested over 15 different cities, classified by their street-network’s fractal-dimension. Obtained results denote that the R-Search algorithm, which selects the points from each group based on their radial separation with respect to the start–end point, is the best search criterion for any E-GTSP to TSP conversion modelled for a city street network. An 8.8% length error has been reported for this algorithm.
Parallel linear solvers for simulations of reactor thermal hydraulics
International Nuclear Information System (INIS)
Yan, Y.; Antal, S.P.; Edge, B.; Keyes, D.E.; Shaver, D.; Bolotnov, I.A.; Podowski, M.Z.
2011-01-01
The state-of-the-art multiphase fluid dynamics code, NPHASE-CMFD, performs multiphase flow simulations in complex domains using implicit nonlinear treatment of the governing equations and in parallel, which is a very challenging environment for the linear solver. The present work illustrates how the Portable, Extensible Toolkit for Scientific Computation (PETSc) and scalable Algebraic Multigrid (AMG) preconditioner from Hypre can be utilized to construct robust and scalable linear solvers for the Newton correction equation obtained from the discretized system of governing conservation equations in NPHASE-CMFD. The overall long-tem objective of this work is to extend the NPHASE-CMFD code into a fully-scalable solver of multiphase flow and heat transfer problems, applicable to both steady-state and stiff time-dependent phenomena in complete fuel assemblies of nuclear reactors and, eventually, the entire reactor core (such as the Virtual Reactor concept envisioned by CASL). This campaign appropriately begins with the linear algebraic equation solver, which is traditionally a bottleneck to scalability in PDE-based codes. The computational complexity of the solver is usually superlinear in problem size, whereas the rest of the code, the “physics” portion, usually has its complexity linear in the problem size. (author)
Microbes: uranium miners, money makers, problem solvers
International Nuclear Information System (INIS)
Williamson, A.L.; Payne, R.; Kerr, F.; Hall, S.; Spiers, G.A.
2010-01-01
Bioleaching, the microbial dissolution of minerals, is potentially useful in exploiting a variety of ore deposits, including the lower-grade uraniferous quartz-pebble conglomerate beds of the Quirke Syncline, Elliot Lake, Ontario. The metabolism of chemolithotropic bacterium Acidithiobacillus ferrooxidans is dependent on its ability to derive energy and reducing power from the oxidation of ferrous iron. The characteristics of this bacterium, in particular the ability to oxidize both iron and sulphur with an associated high tolerance of low acidity, allow the organism to contribute significantly to bioleaching processes. Under ideal conditions, A. ferrooxidans promotes the oxidation of iron-containing sulphide ore materials, breaking their crystal structure and promoting the dissolution of iron, base metals, as well as uranium, rare earth elements and associated elements of toxicological interest such as arsenic and selenium. The current study documents an overview of the recovery of uranium and rare earth elements to solution, plus investigates the acid generating potential of the solid residues from a series of environmentally controlled, biologically-mediated uranium ore extraction experiments. The findings will be used in the design of larger scale bioleaching experiments to further assess the potential for success of bioleaching as a metallurgical extraction technique potentially leading to minimum maintenance decommissioning strategies for the ore deposits of the Quirke Syncline. (author)
Equipping the Enterprise Interoperability Problem Solver
Oude Luttighuis, Paul; Folmer, Erwin Johan Albert; Charalabidis, Yannis
2010-01-01
The maturity of the enterprise interoperability field does not match the importance attached to it by many, both in the public as well as the private community. A host of models, paradigms, designs, standards, methods, and instruments seems to be available, but many of them are only used in rather
Microbes: uranium miners, money makers, problem solvers
Energy Technology Data Exchange (ETDEWEB)
Williamson, A.L., E-mail: awilliamson@mirarco.org [MIRARCO, Sudbury, ON (Canada); Laurentian Univ., Sudbury, ON (Canada); Payne, R.; Kerr, F. [Pele Mountain Resources Inc., Toronto, ON (Canada); Hall, S. [Laurentian Univ., Sudbury, ON (Canada); Spiers, G.A. [MIRARCO, Sudbury, ON (Canada); Laurentian Univ., Sudbury, ON (Canada)
2010-07-01
Bioleaching, the microbial dissolution of minerals, is potentially useful in exploiting a variety of ore deposits, including the lower-grade uraniferous quartz-pebble conglomerate beds of the Quirke Syncline, Elliot Lake, Ontario. The metabolism of chemolithotropic bacterium Acidithiobacillus ferrooxidans is dependent on its ability to derive energy and reducing power from the oxidation of ferrous iron. The characteristics of this bacterium, in particular the ability to oxidize both iron and sulphur with an associated high tolerance of low acidity, allow the organism to contribute significantly to bioleaching processes. Under ideal conditions, A. ferrooxidans promotes the oxidation of iron-containing sulphide ore materials, breaking their crystal structure and promoting the dissolution of iron, base metals, as well as uranium, rare earth elements and associated elements of toxicological interest such as arsenic and selenium. The current study documents an overview of the recovery of uranium and rare earth elements to solution, plus investigates the acid generating potential of the solid residues from a series of environmentally controlled, biologically-mediated uranium ore extraction experiments. The findings will be used in the design of larger scale bioleaching experiments to further assess the potential for success of bioleaching as a metallurgical extraction technique potentially leading to minimum maintenance decommissioning strategies for the ore deposits of the Quirke Syncline. (author)
Molecular biology problem solver: a laboratory guide
National Research Council Canada - National Science Library
Gerstein, Alan S
2001-01-01
... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Chapter 1. Preparing for Success in the Laboratory Phillip P. Franciskovich . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter 2. Getting What You Need...
Refined isogeometric analysis for a preconditioned conjugate gradient solver
Garcia, Daniel
2018-02-12
Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.
Investigating the Problem of Skill Generalization: Literature Review III.
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…
A branch-and-cut-and-price algorithm for the mixed capacitated general routing problem
DEFF Research Database (Denmark)
Bach, Lukas; Wøhlk, Sanne; Lysgaard, Jens
2016-01-01
In this paper, we consider the Mixed Capacitated General Routing Problem which is a combination of the Capacitated Vehicle Routing Problem and the Capacitated Arc Routing Problem. The problem is also known as the Node, Edge, and Arc Routing Problem. We propose a Branch-and-Cut-and-Price algorithm...
On generalizations of network design problems with degree bounds
Bansal, N.; Khandekar, R.; Könemann, J.; Nagarajan, V.; Peis, B.
2013-01-01
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum
On generalizations of network design problems with degree bounds
N. Bansal (Nikhil); R. Khandekar; J. Könemann (Jochen); V. Nagarajan; B. Peis
2013-01-01
htmlabstractIterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in
Optimal portfolio selection for general provisioning and terminal wealth problems
van Weert, K.; Dhaene, J.; Goovaerts, M.
2010-01-01
In Dhaene et al. (2005), multiperiod portfolio selection problems are discussed, using an analytical approach to find optimal constant mix investment strategies in a provisioning or a savings context. In this paper we extend some of these results, investigating some specific, real-life situations.
Optimal portfolio selection for general provisioning and terminal wealth problems
van Weert, K.; Dhaene, J.; Goovaerts, M.
2009-01-01
In Dhaene et al. (2005), multiperiod portfolio selection problems are discussed, using an analytical approach to find optimal constant mix investment strategies in a provisioning or savings context. In this paper we extend some of these results, investigating some specific, real-life situations. The
On a problem of Berenstein-Gay and its generalizations
International Nuclear Information System (INIS)
Volchkov, Valerii V; Volchkov, Vitaly V
2010-01-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.
High-Performance Small-Scale Solvers for Moving Horizon Estimation
DEFF Research Database (Denmark)
Frison, Gianluca; Vukov, Milan; Poulsen, Niels Kjølstad
2015-01-01
implementation techniques focusing on small-scale problems. The proposed MHE solver is implemented using custom linear algebra routines and is compared against implementations using BLAS libraries. Additionally, the MHE solver is interfaced to a code generation tool for nonlinear model predictive control (NMPC...
Investigation on the Use of a Multiphase Eulerian CFD solver to simulate breaking waves
DEFF Research Database (Denmark)
Tomaselli, Pietro D.; Christensen, Erik Damgaard
2015-01-01
investigation on a CFD model capable of handling this problem. The model is based on a solver, available in the open-source CFD toolkit OpenFOAM, which combines the Eulerian multi-fluid approach for dispersed flows with a numerical interface sharpening method. The solver, enhanced with additional formulations...
Optimising a parallel conjugate gradient solver
Energy Technology Data Exchange (ETDEWEB)
Field, M.R. [O`Reilly Institute, Dublin (Ireland)
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.
Contribution of radiobiology to the problem of general fitness
International Nuclear Information System (INIS)
Vacha, J.
1976-01-01
On the basis of the present scarce literary data it can be taken as proved that between the numerous properties of the organism usually considered as biologically valuable (high fertility, longevity, higher body weight, resistance to fasting, radiation, and infection agents, certain favorable parameters of CNS) there exist many single and multiple positive correlations. The existence of these correlations allows for the introduction of the working concept of general fitness, stimulating further interdisciplinary research in this field important both in practice and theory. Most correlated manifestations of fitness demonstrated a masked influence of the organism's genotype even though the manner of this manifestation on the phenotype level remains considerably obscure. The efficiency of the haematopoietic system is doubtless one of the mechanisms of general fitness; it is determined by the very complex coordination of several cytokinetic parameters. Important factors are the efficiency of regulation mechanisms at CNS level, the endocrine system, and the regulators of cell populations. Generally highest fitness is connected with a ''balanced'' regulation type, which is characterized by optimal activation of the homeostatic regulation mechanism. In studying the causes of general fitness a systems approach is inevitable which evaluates the levels of individual factors not ''mechanically'' or linearly but from the point of view of the needs of the whole organism and with the application of concepts established by the systems theory (e.g. by the theory of automatic regulation). The sensitivity of an organism to irradiation with ionizing radiation turns out to be a suitable criterion of its general fitness. (author)
Infrared problems in two-dimensional generalized σ-models
International Nuclear Information System (INIS)
Curci, G.; Paffuti, G.
1989-01-01
We study the correlations of the energy-momentum tensor for classically conformally invariant generalized σ-models in the Wilson operator-product-expansion approach. We find that these correlations are, in general, infrared divergent. The absence of infrared divergences is obtained, as one can expect, for σ-models on a group manifold or for σ-models with a string-like interpretation. Moreover, the infrared divergences spoil the naive scaling arguments used by Zamolodchikov in the demonstration of the C-theorem. (orig.)
The global existence problem and cosmic censorship in general relativity
International Nuclear Information System (INIS)
Moncrief, V.; Eardley, D.M.
1981-01-01
Two global existence conjectures for the Einstein equations are formulated and their relevance to the cosmic censorship conjecture discussed. It is argued that the reformulation of the cosmic censorship conjecture as a global existence problem renders it more amenable to direct analytical attack. To demonstrate the facility of this approach the cosmological version of the global existence conjecture is proved for the Gowdy spacetimes on T 3 X R. (author)
General problems of dynamics and control of vibratory gyroscopes
CSIR Research Space (South Africa)
Shatalov, MY
2008-05-01
Full Text Available A general model of operation of vibratory gyroscopes, which is applicable to a broad class of instruments, including cylindrical, disc and micro-machined gyros, is formulated on the basis of analysis of dynamics and control of a hemispherical...
General Systems Theory Approaches to Organizations: Some Problems in Application
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…
The problem of diagnostic variability in general practice.
Crombie, D L; Cross, K W; Fleming, D M
1992-08-01
The aim was to examine the scale, source, and relevance of variation between general practices in respect of the rates with which patients consulted with illnesses falling in each of several diagnostic groups. This study involved a general practice morbidity survey conducted over two years, 1970-72. All patients who consulted their general practitioners were identified and the number of these who consulted with diagnoses attributable to each of the 18 main chapters of the International classification of diseases were counted. Patients who consulted for more than one diagnosis within a chapter were counted once only; those who consulted for one or more diagnoses in each of several chapters were counted once for each chapter. This was a national survey involving general practitioners in England and Wales. The study involved 214,524 patients from 53 selected general practices (115 doctors) who were registered with their general practitioners for the whole of the year 1970-71 and for whom their morbidity data had been linked with their social data from the 1971 census. Using the numbers of patients on the practice lists as denominators, practice patient consulting rates (PPCR) were calculated for each practice and for each ICD chapter. Variability in chapter PPCR was examined by calculating coefficients of variation and, after allowance for random variation, coefficients of residual variation. There were large interpractice (doctor) variations in all chapter rates. These variations were only marginally attributable to: chance; different age, sex and social class mixes of practice populations; geographical locations; and practice organisation. The rates were, however, consistent from one year to the next for any one practice. Approximately half of the interpractice (doctor) diagnostic variability was associated with overall patient consulting behaviour. When the effects of this behaviour were discounted, any major residual diagnostic variability was confined largely to
International Nuclear Information System (INIS)
Lozano, Juan-Andres; Garcia-Herranz, Nuria; Ahnert, Carol; Aragones, Jose-Maria
2008-01-01
In this work we address the development and implementation of the analytic coarse-mesh finite-difference (ACMFD) method in a nodal neutron diffusion solver called ANDES. The first version of the solver is implemented in any number of neutron energy groups, and in 3D Cartesian geometries; thus it mainly addresses PWR and BWR core simulations. The details about the generalization to multigroups and 3D, as well as the implementation of the method are given. The transverse integration procedure is the scheme chosen to extend the ACMFD formulation to multidimensional problems. The role of the transverse leakage treatment in the accuracy of the nodal solutions is analyzed in detail: the involved assumptions, the limitations of the method in terms of nodal width, the alternative approaches to implement the transverse leakage terms in nodal methods - implicit or explicit -, and the error assessment due to transverse integration. A new approach for solving the control rod 'cusping' problem, based on the direct application of the ACMFD method, is also developed and implemented in ANDES. The solver architecture turns ANDES into an user-friendly, modular and easily linkable tool, as required to be integrated into common software platforms for multi-scale and multi-physics simulations. ANDES can be used either as a stand-alone nodal code or as a solver to accelerate the convergence of whole core pin-by-pin code systems. The verification and performance of the solver are demonstrated using both proof-of-principle test cases and well-referenced international benchmarks
An h-adaptive finite element solver for the calculations of the electronic structures
International Nuclear Information System (INIS)
Bao Gang; Hu Guanghui; Liu Di
2012-01-01
In this paper, a framework of using h-adaptive finite element method for the Kohn–Sham equation on the tetrahedron mesh is presented. The Kohn–Sham equation is discretized by the finite element method, and the h-adaptive technique is adopted to optimize the accuracy and the efficiency of the algorithm. The locally optimal block preconditioned conjugate gradient method is employed for solving the generalized eigenvalue problem, and an algebraic multigrid preconditioner is used to accelerate the solver. A variety of numerical experiments demonstrate the effectiveness of our algorithm for both the all-electron and the pseudo-potential calculations.
Multilevel solvers of first-order system least-squares for Stokes equations
Energy Technology Data Exchange (ETDEWEB)
Lai, Chen-Yao G. [National Chung Cheng Univ., Chia-Yi (Taiwan, Province of China)
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.
Iterative solvers in forming process simulations
van den Boogaard, Antonius H.; Rietman, Bert; Huetink, Han
1998-01-01
The use of iterative solvers in implicit forming process simulations is studied. The time and memory requirements are compared with direct solvers and assessed in relation with the rest of the Newton-Raphson iteration process. It is shown that conjugate gradient{like solvers with a proper
Neurotoxicity of general anesthetics: A modern view of the problem
Directory of Open Access Journals (Sweden)
A. M. Ovezov
2015-01-01
Full Text Available All general anesthetics routinely used in clinical practice are noted to have a neurotoxic effect on the brain in different animal species including primates. The negative effects observed both in young and sexually mature animals include apoptotic neuronal cell death, suppression of neurogenesis and gliogenesis, neuroinflammation, as well as learning and memory impairments. A number of epidemiologic surveys have established an association between anesthesia in patients younger than 3 to 4 years and subsequent learning disabilities and language disorders whereas others have not found this link. In middle-aged and elderly patients, anesthesia is frequently associated with the development of postoperative cognitive dysfunction. The key component of its pathogenesis (general anesthesia itself or other factors, such as operative injury, an inflammatory response, pain syndrome, intraoperative complications, underlying disease in a patient remains unelucidated. It is concluded that there is a need for additional experimental and clinical studies of the pathogenesis of these undesirable phenomena to be prevented and corrected.
International Nuclear Information System (INIS)
Zakharov, A.V.; Singatullin, R.S.
1981-01-01
The inverse problem is solved in general relativity theory (GRT) consisting in determining the metric and potentials of an electromagnetic field by their values in the nonsingular point of the V 4 space and present functions, being the generalized momenta of a test charged particle. The Hamilton-Jacobi equation for a test charged particle in GRT is used. The general form of the generalized momentum dependence on the initial values is determined. It is noted that the inverse problem solution of dynamics in GRT contains arbitrariness which depends on the choice of the metric and potential values of the electromagnetic field in the nonsingular point [ru
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, Huda
2016-01-01
extrapolated scalability. Fast multipole methods (FMM) were originally developed for accelerating N-body problems for particle-based methods in astrophysics and molecular dynamics. FMM is more than an N-body solver, however. Recent efforts to view the FMM
LAPACKrc: Fast linear algebra kernels/solvers for FPGA accelerators
International Nuclear Information System (INIS)
Gonzalez, Juan; Nunez, Rafael C
2009-01-01
We present LAPACKrc, a family of FPGA-based linear algebra solvers able to achieve more than 100x speedup per commodity processor on certain problems. LAPACKrc subsumes some of the LAPACK and ScaLAPACK functionalities, and it also incorporates sparse direct and iterative matrix solvers. Current LAPACKrc prototypes demonstrate between 40x-150x speedup compared against top-of-the-line hardware/software systems. A technology roadmap is in place to validate current performance of LAPACKrc in HPC applications, and to increase the computational throughput by factors of hundreds within the next few years.
Fast Laplace solver approach to pore-scale permeability
Arns, C. H.; Adler, P. M.
2018-02-01
We introduce a powerful and easily implemented method to calculate the permeability of porous media at the pore scale using an approximation based on the Poiseulle equation to calculate permeability to fluid flow with a Laplace solver. The method consists of calculating the Euclidean distance map of the fluid phase to assign local conductivities and lends itself naturally to the treatment of multiscale problems. We compare with analytical solutions as well as experimental measurements and lattice Boltzmann calculations of permeability for Fontainebleau sandstone. The solver is significantly more stable than the lattice Boltzmann approach, uses less memory, and is significantly faster. Permeabilities are in excellent agreement over a wide range of porosities.
A RADIATION TRANSFER SOLVER FOR ATHENA USING SHORT CHARACTERISTICS
International Nuclear Information System (INIS)
Davis, Shane W.; Stone, James M.; Jiang Yanfei
2012-01-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.
Advanced Algebraic Multigrid Solvers for Subsurface Flow Simulation
Chen, Meng-Huo
2015-09-13
In this research we are particularly interested in extending the robustness of multigrid solvers to encounter complex systems related to subsurface reservoir applications for flow problems in porous media. In many cases, the step for solving the pressure filed in subsurface flow simulation becomes a bottleneck for the performance of the simulator. For solving large sparse linear system arising from MPFA discretization, we choose multigrid methods as the linear solver. The possible difficulties and issues will be addressed and the corresponding remedies will be studied. As the multigrid methods are used as the linear solver, the simulator can be parallelized (although not trivial) and the high-resolution simulation become feasible, the ultimately goal which we desire to achieve.
An efficient spectral crystal plasticity solver for GPU architectures
Malahe, Michael
2018-03-01
We present a spectral crystal plasticity (CP) solver for graphics processing unit (GPU) architectures that achieves a tenfold increase in efficiency over prior GPU solvers. The approach makes use of a database containing a spectral decomposition of CP simulations performed using a conventional iterative solver over a parameter space of crystal orientations and applied velocity gradients. The key improvements in efficiency come from reducing global memory transactions, exposing more instruction-level parallelism, reducing integer instructions and performing fast range reductions on trigonometric arguments. The scheme also makes more efficient use of memory than prior work, allowing for larger problems to be solved on a single GPU. We illustrate these improvements with a simulation of 390 million crystal grains on a consumer-grade GPU, which executes at a rate of 2.72 s per strain step.
General principles of neurotransmitter detection. Problems and application to catecholamines
International Nuclear Information System (INIS)
Taxi, Jacques
1976-01-01
The use of radioautography for neurotransmitter studies requires two preliminary conditions (in addition to the availability of tritiated molecules): there must be a selective uptake of the neurotransmitter itself, or of a related substance (precursor or false transmitter); the labelled substance must be preserved in situ by fixation and must not be removed by further treatments. Since the putative neurotransmitters are generally small, hydrosoluble molecules, they can be maintained in situ only if they are bound to structure made insoluble by the fixative. The technical indications are summarized so that the successive stages of experimentation can be considered in an attempt to answer the major questions posed by the experimenter
Ltaief, Hatem; Luszczek, Piotr R.; Haidar, Azzam; Dongarra, Jack
2012-01-01
This paper proposes an efficient implementation of the generalized symmetric eigenvalue problem on multicore architecture. Based on a four-stage approach and tile algorithms, the original problem is first transformed into a standard symmetric
Zantinge, E.M.; Verhaak, P.F.M.; Bakker, D.H. de; Kerssens, J.J.; Meer, K. van der; Bensing, J.M.
2007-01-01
OBJECTIVE: To investigate if general practitioners (GPs) with a higher workload are less inclined to encourage their patients to disclose psychological problems, and are less aware of their patients' psychological problems. METHODS: Data from 2095 videotaped consultations from a representative
General problems specific to hot nuclear materials research facilities
International Nuclear Information System (INIS)
Bart, G.
1996-01-01
During the sixties, governments have installed hot nuclear materials research facilities to characterize highly radioactive materials, to describe their in-pile behaviour, to develop and test new reactor core components, and to provide the industry with radioisotopes. Since then, the attitude towards the nuclear option has drastically changed and resources have become very tight. Within the changed political environment, the national research centres have defined new objectives. Given budgetary constraints, nuclear facilities have to co-operate internationally and to look for third party research assignments. The paper discusses the problems and needs within experimental nuclear research facilities as well as industrial requirements. Special emphasis is on cultural topics (definition of the scope of nuclear research facilities, the search for competitive advantages, and operational requirements), social aspects (overageing of personnel, recruitment, and training of new staff), safety related administrative and technical issues, and research needs for expertise and state of the art analytical infrastructure
General review on climate change problems: causes, potential effects
International Nuclear Information System (INIS)
Martellet, J.
1991-01-01
Greenhouse gases and greenhouse effect principles are reviewed and climate changes due to the human activities are discussed: identification of gases, human or natural causes, composition evolution in the atmosphere and relative roles of greenhouse gases. The various tools and calculations methods for evaluating the climate change due to greenhouse effect are presented. Several problems are stated: evolution of the climate structure in 2030, variations of the climatic extremes and the extreme phenomena, augmentation or diminution of the storms on a warmed planet, long term evolution of the climate. Some consequences of a climate change are reviewed: sea level raising, climate change effects on ecosystems. Precision and validity of these predictions are discussed; recommendations for diminishing the uncertainties are proposed
MINOS: A simplified Pn solver for core calculation
International Nuclear Information System (INIS)
Baudron, A.M.; Lautard, J.J.
2007-01-01
This paper describes a new generation of the neutronic core solver MINOS resulting from developments done in the DESCARTES project. For performance reasons, the numerical method of the existing MINOS solver in the SAPHYR system has been reused in the new system. It is based on the mixed-dual finite element approximation of the simplified transport equation. We have extended the previous method to the treatment of unstructured geometries composed by quadrilaterals, allowing us to treat geometries where fuel pins are exactly represented. For Cartesian geometries, the solver takes into account assembly discontinuity coefficients in the simplified P n context. The solver has been rewritten in C + + programming language using an object-oriented design. Its general architecture was reconsidered in order to improve its capability of evolution and its maintainability. Moreover, the performance of the previous version has been improved mainly regarding the matrix construction time; this result improves significantly the performance of the solver in the context of industrial application requiring thermal-hydraulic feedback and depletion calculations. (authors)
On a covariant 2+2 formulation of the initial value problem in general relativity
International Nuclear Information System (INIS)
Smallwood, J.
1980-03-01
The initial value problems in general relativity are considered from a geometrical standpoint with especial reference to the development of a covariant 2+2 formalism in which space-time is foliated by space-like 2-surfaces under the headings; the Cauchy problem in general relativity, the covariant 3+1 formulation of the Cauchy problem, characteristic and mixed initial value problems, on locally imbedding a family of null hypersurfaces, the 2+2 formalism, the 2+2 formulation of the Cauchy problem, the 2+2 formulation of the characteristic and mixed initial value problems, and a covariant Lagrangian 2+2 formulation. (U.K.)
Directory of Open Access Journals (Sweden)
Vahid Dadashi
2016-02-01
Full Text Available Abstract This paper is dedicated to the introduction a new class of equilibrium problems named generalized multivalued equilibrium-like problems which includes the classes of hemiequilibrium problems, equilibrium-like problems, equilibrium problems, hemivariational inequalities, and variational inequalities as special cases. By utilizing the auxiliary principle technique, some new predictor-corrector iterative algorithms for solving them are suggested and analyzed. The convergence analysis of the proposed iterative methods requires either partially relaxed monotonicity or jointly pseudomonotonicity of the bifunctions involved in generalized multivalued equilibrium-like problem. Results obtained in this paper include several new and known results as special cases.
General solution to the E-B mixing problem
International Nuclear Information System (INIS)
Smith, Kendrick M.; Zaldarriaga, Matias
2007-01-01
We derive a general ansatz for optimizing pseudo-C l estimators used to measure cosmic microwave background anisotropy power spectra, and apply it to the recently proposed pure pseudo-C l formalism, to obtain an estimator which achieves near-optimal B-mode power spectrum errors for any specified noise distribution while minimizing leakage from ambiguous modes. Our technique should be relevant for upcoming cosmic microwave background polarization experiments searching for B-mode polarization. We compare our technique both to the theoretical limits based on a full Fisher matrix calculation and to the standard pseudo-C l technique. We demonstrate it by applying it to a fiducial survey with realistic inhomogeneous noise, complex boundaries, point source masking, and a noise level comparable to what is expected for next-generation experiments (∼5.75 μK-arcmin). For such an experiment our technique could improve the constraints on the amplitude of a gravity wave background by over a factor of 10 compared to what could be obtained using ordinary pseudo-C l , coming quite close to saturating the theoretical limit. Constraints on the amplitude of the lensing B-modes are improved by about a factor of 3
Generalized information theory: aims, results, and open problems
International Nuclear Information System (INIS)
Klir, George J.
2004-01-01
The principal purpose of this paper is to present a comprehensive overview of generalized information theory (GIT): a research program whose objective is to develop a broad treatment of uncertainty-based information, not restricted to classical notions of uncertainty. After a brief overview of classical information theories, a broad framework for formalizing uncertainty and the associated uncertainty-based information of a great spectrum of conceivable types is sketched. The various theories of imprecise probabilities that have already been developed within this framework are then surveyed, focusing primarily on some important unifying principles applying to all these theories. This is followed by introducing two higher levels of the theories of imprecise probabilities: (i) the level of measuring the amount of relevant uncertainty (predictive, retrodictive, prescriptive, diagnostic, etc.) in any situation formalizable in each given theory, and (ii) the level of some methodological principles of uncertainty, which are contingent upon the capability to measure uncertainty and the associated uncertainty-based information. Various issues regarding both the measurement of uncertainty and the uncertainty principles are discussed. Again, the focus is on unifying principles applicable to all the theories. Finally, the current status of GIT is assessed and future research in the area is discussed
The Vehicle Routing Problem with Time Windows and Temporal Dependencies
DEFF Research Database (Denmark)
Rasmussen, Matias Sevel; Dohn, Anders Høeg; Larsen, Jesper
to be scheduled with a certain slack between them. They refer to the vehicle problem as having interdependent time windows. Temporal dependencies have been modeled for a home care routing problem in a mixed integer programming model (MIP) which was solved with a standard MIP solver. An application with general...
Ekici, Didem Inel
2016-01-01
This study aimed to determine Turkish junior high-school students' perceptions of the general problem-solving process. The Turkish junior high-school students' perceptions of the general problem-solving process were examined in relation to their gender, grade level, age and their grade point with regards to the science course identified in the…
Implementation and testing of a multivariate inverse radiation transport solver
International Nuclear Information System (INIS)
Mattingly, John; Mitchell, Dean J.
2012-01-01
Detection, identification, and characterization of special nuclear materials (SNM) all face the same basic challenge: to varying degrees, each must infer the presence, composition, and configuration of the SNM by analyzing a set of measured radiation signatures. Solutions to this problem implement inverse radiation transport methods. Given a set of measured radiation signatures, inverse radiation transport estimates properties of the source terms and transport media that are consistent with those signatures. This paper describes one implementation of a multivariate inverse radiation transport solver. The solver simultaneously analyzes gamma spectrometry and neutron multiplicity measurements to fit a one-dimensional radiation transport model with variable layer thicknesses using nonlinear regression. The solver's essential components are described, and its performance is illustrated by application to benchmark experiments conducted with plutonium metal. - Highlights: ► Inverse problems, specifically applied to identifying and characterizing radiation sources . ► Radiation transport. ► Analysis of gamma spectroscopy and neutron multiplicity counting measurements. ► Experimental testing of the inverse solver against measurements of plutonium.
Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis
Kuźnik, Krzysztof; Paszyński, Maciej; Calo, Victor M.
2012-01-01
at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar
High order Poisson Solver for unbounded flows
DEFF Research Database (Denmark)
Hejlesen, Mads Mølholm; Rasmussen, Johannes Tophøj; Chatelain, Philippe
2015-01-01
This paper presents a high order method for solving the unbounded Poisson equation on a regular mesh using a Green’s function solution. The high order convergence was achieved by formulating mollified integration kernels, that were derived from a filter regularisation of the solution field....... The method was implemented on a rectangular domain using fast Fourier transforms (FFT) to increase computational efficiency. The Poisson solver was extended to directly solve the derivatives of the solution. This is achieved either by including the differential operator in the integration kernel...... the equations of fluid mechanics as an example, but can be used in many physical problems to solve the Poisson equation on a rectangular unbounded domain. For the two-dimensional case we propose an infinitely smooth test function which allows for arbitrary high order convergence. Using Gaussian smoothing...
Directory of Open Access Journals (Sweden)
Phayap Katchang
2010-01-01
Full Text Available The purpose of this paper is to investigate the problem of finding a common element of the set of solutions for mixed equilibrium problems, the set of solutions of the variational inclusions with set-valued maximal monotone mappings and inverse-strongly monotone mappings, and the set of fixed points of a family of finitely nonexpansive mappings in the setting of Hilbert spaces. We propose a new iterative scheme for finding the common element of the above three sets. Our results improve and extend the corresponding results of the works by Zhang et al. (2008, Peng et al. (2008, Peng and Yao (2009, as well as Plubtieng and Sriprad (2009 and some well-known results in the literature.
Motivation, Challenge, and Opportunity of Successful Solvers on an Innovation Platform
DEFF Research Database (Denmark)
Hossain, Mokter
2017-01-01
. The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...... other experts, the ability to work in a diverse environment, options of work after retirement and from distant locations, and a new source of income....
DEFF Research Database (Denmark)
Hossain, Mokter
2018-01-01
. The main motivational factors of successful solvers engaged in problem solving are money, learning, fun, sense of achievement, passion, and networking. Major challenges solvers face include unclear or insufficient problem description, lack of option for communication, language barrier, time zone...... other experts, the ability to work in a diverse environment, options of work after retirement and from distant locations, and a new source of income....
Robust large-scale parallel nonlinear solvers for simulations.
Energy Technology Data Exchange (ETDEWEB)
Bader, Brett William; Pawlowski, Roger Patrick; Kolda, Tamara Gibson (Sandia National Laboratories, Livermore, CA)
2005-11-01
existing linear solver, which makes it simple to write and easily portable. However, the method usually takes twice as long to solve as Newton-GMRES on general problems because it solves two linear systems at each iteration. In this paper, we discuss modifications to Bouaricha's method for a practical implementation, including a special globalization technique and other modifications for greater efficiency. We present numerical results showing computational advantages over Newton-GMRES on some realistic problems. We further discuss a new approach for dealing with singular (or ill-conditioned) matrices. In particular, we modify an algorithm for identifying a turning point so that an increasingly ill-conditioned Jacobian does not prevent convergence.
Minos: a SPN solver for core calculation in the DESCARTES system
International Nuclear Information System (INIS)
Baudron, A.M.; Lautard, J.J.
2005-01-01
This paper describes a new development of a neutronic core solver done in the context of a new generation neutronic reactor computational system, named DESCARTES. For performance reasons, the numerical method of the existing MINOS solver in the SAPHYR system has been reused in the new system. It is based on the mixed dual finite element approximation of the simplified transport equation. The solver takes into account assembly discontinuity coefficients (ADF) in the simplified transport equation (SPN) context. The solver has been rewritten in C++ programming language using an object oriented design. Its general architecture was reconsidered in order to improve its capability of evolution and its maintainability. Moreover, the performances of the old version have been improved mainly regarding the matrix construction time; this result improves significantly the performance of the solver in the context of industrial application requiring thermal hydraulic feedback and depletion calculations. (authors)
International Nuclear Information System (INIS)
Olivieri, E.; Scoppola, E.
1996-01-01
In this paper we consider aperiodic ergodic Markov chains with transition probabilities exponentially small in a large parameter β. We extend to the general, not necessarily reversible case the analysis, started in part I of this work, of the first exit problem from a general domain Q containing many stable equilibria (attracting equilibrium points for the β = ∞ dynamics). In particular we describe the tube of typical trajectories during the first excursion outside Q
An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU
International Nuclear Information System (INIS)
Yoon, Jong Seon; Choi, Hyoung Gwon; Jeon, Byoung Jin
2017-01-01
The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.
An Investigation of the Performance of the Colored Gauss-Seidel Solver on CPU and GPU
Energy Technology Data Exchange (ETDEWEB)
Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of)
2017-02-15
The performance of the colored Gauss–Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss–Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss–Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.
Migration of vectorized iterative solvers to distributed memory architectures
Energy Technology Data Exchange (ETDEWEB)
Pommerell, C. [AT& T Bell Labs., Murray Hill, NJ (United States); Ruehl, R. [CSCS-ETH, Manno (Switzerland)
1994-12-31
Both necessity and opportunity motivate the use of high-performance computers for iterative linear solvers. Necessity results from the size of the problems being solved-smaller problems are often better handled by direct methods. Opportunity arises from the formulation of the iterative methods in terms of simple linear algebra operations, even if this {open_quote}natural{close_quotes} parallelism is not easy to exploit in irregularly structured sparse matrices and with good preconditioners. As a result, high-performance implementations of iterative solvers have attracted a lot of interest in recent years. Most efforts are geared to vectorize or parallelize the dominating operation-structured or unstructured sparse matrix-vector multiplication, or to increase locality and parallelism by reformulating the algorithm-reducing global synchronization in inner products or local data exchange in preconditioners. Target architectures for iterative solvers currently include mostly vector supercomputers and architectures with one or few optimized (e.g., super-scalar and/or super-pipelined RISC) processors and hierarchical memory systems. More recently, parallel computers with physically distributed memory and a better price/performance ratio have been offered by vendors as a very interesting alternative to vector supercomputers. However, programming comfort on such distributed memory parallel processors (DMPPs) still lags behind. Here the authors are concerned with iterative solvers and their changing computing environment. In particular, they are considering migration from traditional vector supercomputers to DMPPs. Application requirements force one to use flexible and portable libraries. They want to extend the portability of iterative solvers rather than reimplementing everything for each new machine, or even for each new architecture.
Directory of Open Access Journals (Sweden)
Lu-Chuan Ceng
2014-01-01
Full Text Available We first introduce and analyze one multistep iterative algorithm by hybrid shrinking projection method for finding a solution of the system of generalized equilibria with constraints of several problems: the generalized mixed equilibrium problem, finitely many variational inclusions, the minimization problem for a convex and continuously Fréchet differentiable functional, and the fixed-point problem of an asymptotically strict pseudocontractive mapping in the intermediate sense in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another multistep iterative algorithm involving no shrinking projection method and derive its weak convergence under mild assumptions.
General volumes in the Orlicz-Brunn-Minkowski theory and a related Minkowski Problem I
Gardner, Richard J.; Hug, Daniel; Weil, Wolfgang; Xing, Sudan; Ye, Deping
2018-01-01
The general volume of a star body, a notion that includes the usual volume, the $q$th dual volumes, and many previous types of dual mixed volumes, is introduced. A corresponding new general dual Orlicz curvature measure is defined that specializes to the $(p,q)$-dual curvature measures introduced recently by Lutwak, Yang, and Zhang. General variational formulas are established for the general volume of two types of Orlicz linear combinations. One of these is applied to the Minkowski problem f...
A Rule-Based Local Search Algorithm for General Shift Design Problems in Airport Ground Handling
DEFF Research Database (Denmark)
Clausen, Tommy
We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework with mul......We consider a generalized version of the shift design problem where shifts are created to cover a multiskilled demand and fit the parameters of the workforce. We present a collection of constraints and objectives for the generalized shift design problem. A local search solution framework...... with multiple neighborhoods and a loosely coupled rule engine based on simulated annealing is presented. Computational experiments on real-life data from various airport ground handling organization show the performance and flexibility of the proposed algorithm....
Cohen-Schotanus, Janke; Muijtjens, Arno M. M.; Schonrock-Adema, Johanna; Geertsma, Jelle; van der Vleuten, Cees P. M.
OBJECTIVE: To test hypotheses regarding the longitudinal effects of problem-based learning (PBL) and conventional learning relating to students' appreciation of the curriculum, self-assessment of general competencies, summative assessment of clinical competence and indicators of career development.
Generalized ladder operators for the Dirac-Coulomb problem via SUSY QM
International Nuclear Information System (INIS)
Rodrigues, R. de Lima; Universidade Federal de Campina Grande, PB
2003-12-01
The supersymmetry in quantum mechanics and shape invariance condition are applied as an algebraic method to solving the Dirac-Coulomb problem. The ground state and the excited states are investigated via new generalized ladder operators. (author)
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
DEFF Research Database (Denmark)
Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter
The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...... are compared to FAS on a nonlinear saddle point problem with applications to porous media flow. It is demonstrated that FAS is faster than Newton’s method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate...
Jump as Far as You Can [Problem Solvers: Problem
Bofferding, Laura; Yigit, Melike
2013-01-01
The standing long jump was an Olympic event until 1912. In 1904, Ray Ewry set the world record for the longest standing long jump, which was about 11.5 feet, or 138 inches. Although the standing long jump is no longer an Olympic event, the Norwegians still include it in their National Competition, and Arne Tvervaag set a new world record at about…
A Study of Some General Problems of Dieudonné-Rashevski Type
Directory of Open Access Journals (Sweden)
Ariana Pitea
2012-01-01
Full Text Available We use a method of investigation based on employing adequate variational calculus techniques in the study of some generalized Dieudonné-Rashevski problems. This approach allows us to state and prove optimality conditions for such kind of vector multitime variational problems, with mixed isoperimetric constraints. We state and prove efficiency conditions and develop a duality theory.
Zwaanswijk, M.; Verhaak, P.F.M.; Ende, J. van der; Bensing, J.M.; Verhulst, F.C.
2005-01-01
BACKGROUND: Child and adolescent psychological problems are rarely brought to the attention of GPs. Children and adolescents with psychological problems who do visit their GP are seldom identified as such by GPs. OBJECTIVE: To investigate in a general population sample of 2,449 Dutch children and
Czech Academy of Sciences Publication Activity Database
Dilna, N.; Rontó, András
2008-01-01
Roč. 133, č. 4 (2008), s. 435-445 ISSN 0862-7959 R&D Projects: GA ČR(CZ) GA201/06/0254 Institutional research plan: CEZ:AV0Z10190503 Keywords : functional differential equation * Cauchy problem * initial value problem * differential inequality Subject RIV: BA - General Mathematics
International Nuclear Information System (INIS)
Salamon, P.; Bernholc, J.; Berry, R.S.; Carrera-Patino, M.E.; Andresen, B.
1990-01-01
A new generalization of the Plateau problem that includes the constraint of enclosing a given region is introduced. Physically, the problem is important insofar as it bears on sintering processes and the structure of wetted porous media. Some primal and dual characterizations of the solutions are offered and aspects of the problem are illustrated in one and two dimensions in order to clarify the combinatorial elements and demonstrate the importance of numerous local minima
The wetted solid - a generalization of Plateau's problem and its implications for sintered materials
International Nuclear Information System (INIS)
Salomon, P.; Berry, R.S.; Carrera-Patino, M.E.; Chicago Univ., IL; Andresen, B.
1988-01-01
We introduce a new generalization of the Plateau problem which includes the constraint of enclosing a given region. Physically the problem is important insofar as it bears on sintering processes and on the structure of wetted porous media. Some primal and dual characterizations of the solutions are offered, and aspects of the problem are illustrated in one and two dimensions in order to clarify the combinatorial elements and to demonstrate the importance of numerous local minima. (orig.)
Multiscale Universal Interface: A concurrent framework for coupling heterogeneous solvers
Energy Technology Data Exchange (ETDEWEB)
Tang, Yu-Hang, E-mail: yuhang_tang@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Kudo, Shuhei, E-mail: shuhei-kudo@outlook.jp [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe, 657-8501 (Japan); Bian, Xin, E-mail: xin_bian@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Li, Zhen, E-mail: zhen_li@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Karniadakis, George Em, E-mail: george_karniadakis@brown.edu [Division of Applied Mathematics, Brown University, Providence, RI (United States); Collaboratory on Mathematics for Mesoscopic Modeling of Materials, Pacific Northwest National Laboratory, Richland, WA 99354 (United States)
2015-09-15
Graphical abstract: - Abstract: Concurrently coupled numerical simulations using heterogeneous solvers are powerful tools for modeling multiscale phenomena. However, major modifications to existing codes are often required to enable such simulations, posing significant difficulties in practice. In this paper we present a C++ library, i.e. the Multiscale Universal Interface (MUI), which is capable of facilitating the coupling effort for a wide range of multiscale simulations. The library adopts a header-only form with minimal external dependency and hence can be easily dropped into existing codes. A data sampler concept is introduced, combined with a hybrid dynamic/static typing mechanism, to create an easily customizable framework for solver-independent data interpretation. The library integrates MPI MPMD support and an asynchronous communication protocol to handle inter-solver information exchange irrespective of the solvers' own MPI awareness. Template metaprogramming is heavily employed to simultaneously improve runtime performance and code flexibility. We validated the library by solving three different multiscale problems, which also serve to demonstrate the flexibility of the framework in handling heterogeneous models and solvers. In the first example, a Couette flow was simulated using two concurrently coupled Smoothed Particle Hydrodynamics (SPH) simulations of different spatial resolutions. In the second example, we coupled the deterministic SPH method with the stochastic Dissipative Particle Dynamics (DPD) method to study the effect of surface grafting on the hydrodynamics properties on the surface. In the third example, we consider conjugate heat transfer between a solid domain and a fluid domain by coupling the particle-based energy-conserving DPD (eDPD) method with the Finite Element Method (FEM)
Decision Engines for Software Analysis Using Satisfiability Modulo Theories Solvers
Bjorner, Nikolaj
2010-01-01
The area of software analysis, testing and verification is now undergoing a revolution thanks to the use of automated and scalable support for logical methods. A well-recognized premise is that at the core of software analysis engines is invariably a component using logical formulas for describing states and transformations between system states. The process of using this information for discovering and checking program properties (including such important properties as safety and security) amounts to automatic theorem proving. In particular, theorem provers that directly support common software constructs offer a compelling basis. Such provers are commonly called satisfiability modulo theories (SMT) solvers. Z3 is a state-of-the-art SMT solver. It is developed at Microsoft Research. It can be used to check the satisfiability of logical formulas over one or more theories such as arithmetic, bit-vectors, lists, records and arrays. The talk describes some of the technology behind modern SMT solvers, including the solver Z3. Z3 is currently mainly targeted at solving problems that arise in software analysis and verification. It has been applied to various contexts, such as systems for dynamic symbolic simulation (Pex, SAGE, Vigilante), for program verification and extended static checking (Spec#/Boggie, VCC, HAVOC), for software model checking (Yogi, SLAM), model-based design (FORMULA), security protocol code (F7), program run-time analysis and invariant generation (VS3). We will describe how it integrates support for a variety of theories that arise naturally in the context of the applications. There are several new promising avenues and the talk will touch on some of these and the challenges related to SMT solvers. Proceedings
International Nuclear Information System (INIS)
Jia, Jingfei; Kim, Hyun K.; Hielscher, Andreas H.
2015-01-01
It is well known that radiative transfer equation (RTE) provides more accurate tomographic results than its diffusion approximation (DA). However, RTE-based tomographic reconstruction codes have limited applicability in practice due to their high computational cost. In this article, we propose a new efficient method for solving the RTE forward problem with multiple light sources in an all-at-once manner instead of solving it for each source separately. To this end, we introduce here a novel linear solver called block biconjugate gradient stabilized method (block BiCGStab) that makes full use of the shared information between different right hand sides to accelerate solution convergence. Two parallelized block BiCGStab methods are proposed for additional acceleration under limited threads situation. We evaluate the performance of this algorithm with numerical simulation studies involving the Delta–Eddington approximation to the scattering phase function. The results show that the single threading block RTE solver proposed here reduces computation time by a factor of 1.5–3 as compared to the traditional sequential solution method and the parallel block solver by a factor of 1.5 as compared to the traditional parallel sequential method. This block linear solver is, moreover, independent of discretization schemes and preconditioners used; thus further acceleration and higher accuracy can be expected when combined with other existing discretization schemes or preconditioners. - Highlights: • We solve the multiple-right-hand-side problem in DOT with a block BiCGStab method. • We examine the CPU times of the block solver and the traditional sequential solver. • The block solver is faster than the sequential solver by a factor of 1.5–3.0. • Multi-threading block solvers give additional speedup under limited threads situation.
Consultations for mental problems in general practices with and without mental health nurses.
Magnée, T.; Beurs, D. de; Verhaak, P.
2016-01-01
Background & Aim: It seems cost-effective to provide mental health care to patient with mild mental problems in general practices instead of in specialized care, but general practitioners (GPs) often lack time or expertise. Since 2008, Dutch GPs have been collaborating with nurses with mental health
Reduction of the general Spitzer-Haerm problem in plasma physics
International Nuclear Information System (INIS)
Ferreira, A.
1988-01-01
The general Spitzer-Haerm problem is unfolded through a redefinition of the dependent variable into two separate simpler problems. The first takes the form of a second order differential equation, and the second, that of an integration over the solution of the first problem, which provides the distribution function or, directly, the current and the heat flow. It is shown that the current and the heat flow can in general by synthesized from the solutions of the differential equation for two specific forms of the driving term. (author)
Generalizing the classical fixed-centres problem in a non-Hamiltonian way
International Nuclear Information System (INIS)
Albouy, A; Stuchi, T J
2004-01-01
The problem of two gravitational (or Coulombian) fixed centres is a classical integrable problem, stated and integrated by Euler in 1760. The integrability is due to the unexpected first integral G. We introduce some straightforward generalizations of the problem that still have the generalization of G as a first integral, but do not possess the energy integral. We present some numerical integrations showing the main features of their dynamics. In the domain of bounded orbits the behaviour of these a priori non-Hamiltonian systems is very similar to the behaviour of usual near-integrable systems
Hidayati, H.; Ramli, R.
2018-04-01
This paper aims to provide a description of the implementation of Physic Problem Solving strategy combined with concept maps in General Physics learning at Department of Physics, Universitas Negeri Padang. Action research has been conducted in two cycles where each end of the cycle is reflected and improved for the next cycle. Implementation of Physics Problem Solving strategy combined with concept map can increase student activity in solving general physics problem with an average increase of 15% and can improve student learning outcomes from 42,7 in the cycle I become 62,7 in cycle II in general physics at the Universitas Negeri Padang. In the future, the implementation of Physic Problem Solving strategy combined with concept maps will need to be considered in Physics courses.
Algebraic structures in generalized Clifford analysis and applications to boundary value problems
Directory of Open Access Journals (Sweden)
José Játem
2015-12-01
Full Text Available The present article has a threefold purpose: First it is a survey of the algebraic structures of generalized Clifford-type algebras and shows the main results of the corresponding Clifford-type analysis and its application to boundary value problems known so far. Second it is aimed to implement algorithms to provide the fast and accurate computation of boundary value problems for inhomogeneous equations in the framework of the generalized Clifford analysis. Finally it is also aimed to encourage the development of a generalized discrete Clifford analysis.
The impact of improved sparse linear solvers on industrial engineering applications
Energy Technology Data Exchange (ETDEWEB)
Heroux, M. [Cray Research, Inc., Eagan, MN (United States); Baddourah, M.; Poole, E.L.; Yang, Chao Wu
1996-12-31
There are usually many factors that ultimately determine the quality of computer simulation for engineering applications. Some of the most important are the quality of the analytical model and approximation scheme, the accuracy of the input data and the capability of the computing resources. However, in many engineering applications the characteristics of the sparse linear solver are the key factors in determining how complex a problem a given application code can solve. Therefore, the advent of a dramatically improved solver often brings with it dramatic improvements in our ability to do accurate and cost effective computer simulations. In this presentation we discuss the current status of sparse iterative and direct solvers in several key industrial CFD and structures codes, and show the impact that recent advances in linear solvers have made on both our ability to perform challenging simulations and the cost of those simulations. We also present some of the current challenges we have and the constraints we face in trying to improve these solvers. Finally, we discuss future requirements for sparse linear solvers on high performance architectures and try to indicate the opportunities that exist if we can develop even more improvements in linear solver capabilities.
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.
Vol. 1: Physics of Elementary Particles and Quantum Field Theory. General Problems
International Nuclear Information System (INIS)
Sitenko, A.
1993-01-01
Problems of modern physics and the situation with physical research in Ukraine are considered. Programme of the conference includes scientific and general problems. Its proceedings are published in 6 volumes. The papers presented in this volume refer to elementary particle physics and quantum field theory. The main attention is paid to the following problems: - development of science in Ukraine and its role in the state structures; - modern state of scientific research in Ukraine; - education and training of specialists; - history of Ukrainian physics and contribution of Ukrainian scientists in the world science; - problems of the Ukrainian scientific terminology
Rosendal, Marianne; Vedsted, Peter; Christensen, Kaj Sparle; Moth, Grete
2013-03-01
To estimate the frequency of psychological and social classification codes employed by general practitioners (GPs) and to explore the extent to which GPs ascribed health problems to biomedical, psychological, or social factors. A cross-sectional survey based on questionnaire data from GPs. Setting. Danish primary care. 387 GPs and their face-to-face contacts with 5543 patients. GPs registered consecutive patients on registration forms including reason for encounter, diagnostic classification of main problem, and a GP assessment of biomedical, psychological, and social factors' influence on the contact. The GP-stated reasons for encounter largely overlapped with their classification of the managed problem. Using the International Classification of Primary Care (ICPC-2-R), GPs classified 600 (11%) patients with psychological problems and 30 (0.5%) with social problems. Both codes for problems/complaints and specific disorders were used as the GP's diagnostic classification of the main problem. Two problems (depression and acute stress reaction/adjustment disorder) accounted for 51% of all psychological classifications made. GPs generally emphasized biomedical aspects of the contacts. Psychological aspects were given greater importance in follow-up consultations than in first-episode consultations, whereas social factors were rarely seen as essential to the consultation. Psychological problems are frequently seen and managed in primary care and most are classified within a few diagnostic categories. Social matters are rarely considered or classified.
Two Efficient Generalized Laguerre Spectral Algorithms for Fractional Initial Value Problems
Directory of Open Access Journals (Sweden)
D. Baleanu
2013-01-01
Full Text Available We present a direct solution technique for approximating linear multiterm fractional differential equations (FDEs on semi-infinite interval, using generalized Laguerre polynomials. We derive the operational matrix of Caputo fractional derivative of the generalized Laguerre polynomials which is applied together with generalized Laguerre tau approximation for implementing a spectral solution of linear multiterm FDEs on semi-infinite interval subject to initial conditions. The generalized Laguerre pseudo-spectral approximation based on the generalized Laguerre operational matrix is investigated to reduce the nonlinear multiterm FDEs and its initial conditions to nonlinear algebraic system, thus greatly simplifying the problem. Through several numerical examples, we confirm the accuracy and performance of the proposed spectral algorithms. Indeed, the methods yield accurate results, and the exact solutions are achieved for some tested problems.
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. © 2015 Wiley Periodicals, Inc.
Scalable parallel prefix solvers for discrete ordinates transport
International Nuclear Information System (INIS)
Pautz, S.; Pandya, T.; Adams, M.
2009-01-01
The well-known 'sweep' algorithm for inverting the streaming-plus-collision term in first-order deterministic radiation transport calculations has some desirable numerical properties. However, it suffers from parallel scaling issues caused by a lack of concurrency. The maximum degree of concurrency, and thus the maximum parallelism, grows more slowly than the problem size for sweeps-based solvers. We investigate a new class of parallel algorithms that involves recasting the streaming-plus-collision problem in prefix form and solving via cyclic reduction. This method, although computationally more expensive at low levels of parallelism than the sweep algorithm, offers better theoretical scalability properties. Previous work has demonstrated this approach for one-dimensional calculations; we show how to extend it to multidimensional calculations. Notably, for multiple dimensions it appears that this approach is limited to long-characteristics discretizations; other discretizations cannot be cast in prefix form. We implement two variants of the algorithm within the radlib/SCEPTRE transport code library at Sandia National Laboratories and show results on two different massively parallel systems. Both the 'forward' and 'symmetric' solvers behave similarly, scaling well to larger degrees of parallelism then sweeps-based solvers. We do observe some issues at the highest levels of parallelism (relative to the system size) and discuss possible causes. We conclude that this approach shows good potential for future parallel systems, but the parallel scalability will depend heavily on the architecture of the communication networks of these systems. (authors)
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
Pavarino, L.F.; Scacchi, S.; Zampini, Stefano
2015-01-01
The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.
Newton-Krylov-BDDC solvers for nonlinear cardiac mechanics
Pavarino, L.F.
2015-07-18
The aim of this work is to design and study a Balancing Domain Decomposition by Constraints (BDDC) solver for the nonlinear elasticity system modeling the mechanical deformation of cardiac tissue. The contraction–relaxation process in the myocardium is induced by the generation and spread of the bioelectrical excitation throughout the tissue and it is mathematically described by the coupling of cardiac electro-mechanical models consisting of systems of partial and ordinary differential equations. In this study, the discretization of the electro-mechanical models is performed by Q1 finite elements in space and semi-implicit finite difference schemes in time, leading to the solution of a large-scale linear system for the bioelectrical potentials and a nonlinear system for the mechanical deformation at each time step of the simulation. The parallel mechanical solver proposed in this paper consists in solving the nonlinear system with a Newton-Krylov-BDDC method, based on the parallel solution of local mechanical problems and a coarse problem for the so-called primal unknowns. Three-dimensional parallel numerical tests on different machines show that the proposed parallel solver is scalable in the number of subdomains, quasi-optimal in the ratio of subdomain to mesh sizes, and robust with respect to tissue anisotropy.
IGA-ADS: Isogeometric analysis FEM using ADS solver
Łoś, Marcin M.; Woźniak, Maciej; Paszyński, Maciej; Lenharth, Andrew; Hassaan, Muhamm Amber; Pingali, Keshav
2017-08-01
In this paper we present a fast explicit solver for solution of non-stationary problems using L2 projections with isogeometric finite element method. The solver has been implemented within GALOIS framework. It enables parallel multi-core simulations of different time-dependent problems, in 1D, 2D, or 3D. We have prepared the solver framework in a way that enables direct implementation of the selected PDE and corresponding boundary conditions. In this paper we describe the installation, implementation of exemplary three PDEs, and execution of the simulations on multi-core Linux cluster nodes. We consider three case studies, including heat transfer, linear elasticity, as well as non-linear flow in heterogeneous media. The presented package generates output suitable for interfacing with Gnuplot and ParaView visualization software. The exemplary simulations show near perfect scalability on Gilbert shared-memory node with four Intel® Xeon® CPU E7-4860 processors, each possessing 10 physical cores (for a total of 40 cores).
A parallel direct solver for the self-adaptive hp Finite Element Method
Paszyński, Maciej R.
2010-03-01
In this paper we present a new parallel multi-frontal direct solver, dedicated for the hp Finite Element Method (hp-FEM). The self-adaptive hp-FEM generates in a fully automatic mode, a sequence of hp-meshes delivering exponential convergence of the error with respect to the number of degrees of freedom (d.o.f.) as well as the CPU time, by performing a sequence of hp refinements starting from an arbitrary initial mesh. The solver constructs an initial elimination tree for an arbitrary initial mesh, and expands the elimination tree each time the mesh is refined. This allows us to keep track of the order of elimination for the solver. The solver also minimizes the memory usage, by de-allocating partial LU factorizations computed during the elimination stage of the solver, and recomputes them for the backward substitution stage, by utilizing only about 10% of the computational time necessary for the original computations. The solver has been tested on 3D Direct Current (DC) borehole resistivity measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements of various sizes and polynomial orders of approximation varying from p = 1 to p = 9. From the presented experiments it follows that the parallel solver scales well up to the maximum number of utilized processors. The limit for the solver scalability is the maximum sequential part of the algorithm: the computations of the partial LU factorizations over the longest path, coming from the root of the elimination tree down to the deepest leaf. © 2009 Elsevier Inc. All rights reserved.
The problem of general Radon representation for an arbitrary Hausdorff space
Zakharov, V. K.; Mikhalev, A. V.
1999-10-01
After the fundamental work of Riesz, Radon and Hausdorff in the period 1909-1914, the following problem of general Radon representation emerged: for any Hausdorff space find the space of linear functionals that are integrally representable by Radon measures. In the early 1950s, a partial solution of this problem (the bijective version) for locally compact spaces was obtained by Halmos, Hewitt, Edwards, Bourbaki and others. For bounded Radon measures on a Tychonoff space, the problem of isomorphic Radon representation was solved in 1956 by Prokhorov. In this paper we give a possible solution of the problem of general Radon representation. To do this, we use the family of metasemicontinuous functions with compact support and the class of thin functionals. We present bijective and isomorphic versions of the solution (Theorems 1 and 2 of §2.5). To get the isomorphic version, we introduce the family of Radon bimeasures.
The problem of general Radon representation for an arbitrary Hausdorff space
Energy Technology Data Exchange (ETDEWEB)
Zakharov, V K [St Petersburg State University of Technology and Design (Russian Federation); Mikhalev, A V [M.V. Lomonosov Moscow State University, Moscow (Russian Federation)
1999-10-31
After the fundamental work of Riesz, Radon and Hausdorff in the period 1909-1914, the following problem of general Radon representation emerged: for any Hausdorff space find the space of linear functionals that are integrally representable by Radon measures. In the early 1950s, a partial solution of this problem (the bijective version) for locally compact spaces was obtained by Halmos, Hewitt, Edwards, Bourbaki and others. For bounded Radon measures on a Tychonoff space, the problem of isomorphic Radon representation was solved in 1956 by Prokhorov. In this paper we give a possible solution of the problem of general Radon representation. To do this, we use the family of metasemicontinuous functions with compact support and the class of thin functionals. We present bijective and isomorphic versions of the solution (Theorems 1 and 2 of paragraph 2.5). To get the isomorphic version, we introduce the family of Radon bimeasures.
The problem of general Radon representation for an arbitrary Hausdorff space
International Nuclear Information System (INIS)
Zakharov, V K; Mikhalev, A V
1999-01-01
After the fundamental work of Riesz, Radon and Hausdorff in the period 1909-1914, the following problem of general Radon representation emerged: for any Hausdorff space find the space of linear functionals that are integrally representable by Radon measures. In the early 1950s, a partial solution of this problem (the bijective version) for locally compact spaces was obtained by Halmos, Hewitt, Edwards, Bourbaki and others. For bounded Radon measures on a Tychonoff space, the problem of isomorphic Radon representation was solved in 1956 by Prokhorov. In this paper we give a possible solution of the problem of general Radon representation. To do this, we use the family of metasemicontinuous functions with compact support and the class of thin functionals. We present bijective and isomorphic versions of the solution (Theorems 1 and 2 of paragraph 2.5). To get the isomorphic version, we introduce the family of Radon bimeasures
Parallelization of mathematical library for generalized eigenvalue problem for real band matrices
International Nuclear Information System (INIS)
Tanaka, Yasuhisa.
1997-05-01
This research has focused on a parallelization of the mathematical library for a generalized eigenvalue problem for real band matrices on IBM SP and Hitachi SR2201. The origin of the library is LASO (Lanczos Algorithm with Selective Orthogonalization), which was developed on the basis of Block Lanczos method for standard eigenvalue problem for real band matrices at Texas University. We adopted D.O.F. (Degree Of Freedom) decomposition method for a parallelization of this library, and evaluated its parallel performance. (author)
Directory of Open Access Journals (Sweden)
Valeriy Yu. Bykov
2010-08-01
Full Text Available In the article the problems, which appear under the creation of monitoring systems concerning the condition of informatization of general educational institutions, such as definition of monitoring object and list of parameters that will be traced during the monitoring, technologies of obtaining and actualization of data parameters, that are to be monitored, formats of data submission and ways of its processing, monitoring time period etc. are considered. In the article some decision of these problems are offered. Here is also mentioned the data of some characteristics and possibilities of the creation of monitoring systems concerning the condition of informatization of general educational institutions in Ukraine.
International Nuclear Information System (INIS)
Hindmarsh, A.D.; Brown, P.N.
1996-01-01
1 - Description of program or function: LSODKR is a new initial value ODE solver for stiff and non-stiff systems. It is a variant of the LSODPK and LSODE solvers, intended mainly for large stiff systems. The main differences between LSODKR and LSODE are the following: a) for stiff systems, LSODKR uses a corrector iteration composed of Newton iteration and one of four preconditioned Krylov subspace iteration methods. The user must supply routines for the preconditioning operations, b) within the corrector iteration, LSODKR does automatic switching between functional (fix point) iteration and modified Newton iteration, c) LSODKR includes the ability to find roots of given functions of the solution during the integration. 2 - Method of solution: Integration is by Adams or BDF (Backward Differentiation Formula) methods, at user option. Corrector iteration is by Newton or fix point iteration, determined dynamically. Linear system solution is by a preconditioned Krylov iteration, selected by user from Incomplete Orthogonalization Method, Generalized Minimum Residual Method, and two variants of Preconditioned Conjugate Gradient Method. Preconditioning is to be supplied by the user. 3 - Restrictions on the complexity of the problem: None
Evolution of general surgical problems in patients with left ventricular assist devices.
McKellar, Stephen H; Morris, David S; Mauermann, William J; Park, Soon J; Zietlow, Scott P
2012-11-01
Left ventricular assist devices (LVADs) are increasingly used to treat patients with end-stage heart failure. These patients may develop acute noncardiac surgical problems around the time of LVAD implantation or, as survival continues to improve, chronic surgical problems as ambulatory patients remote from the LVAD implant. Previous reports of noncardiac surgical problems in LVAD patients included patients with older, first-generation devices and do not address newer, second-generation devices. We describe the frequency and management of noncardiac surgical problems encountered during LVAD support with these newer-generation devices to assist noncardiac surgeons involved in the care of patients with LVADs. We retrospectively reviewed the medical records of consecutive patients receiving LVADs at our institution. We collected data for any consultation by noncardiac surgeons within the scope of general surgery during LVAD support and subsequent treatment. Ninety-nine patients received implantable LVADs between 2003 and 2009 (first-generation, n = 19; second-generation, n = 80). Excluding intestinal hemorrhage, general surgical opinions were rendered for 34 patients with 49 problems, mostly in the acute recovery phase after LVAD implantation. Of those, 27 patients underwent 28 operations. Respiratory failure and intra-abdominal pathologies were the most common problems addressed, and LVAD rarely precluded operation. Patients with second-generation LVADs were more likely to survive hospitalization (P = .04) and develop chronic, rather than emergent, surgical problems. Patients with LVADs frequently require consultation from noncardiac surgeons within the scope of general surgeons and often require operation. Patients with second-generation LVADs are more likely to become outpatients and develop more elective surgical problems. Noncardiac surgeons will be increasingly involved in caring for patients with LVADs and should anticipate the problems unique to this patient
A Nonlinear Modal Aeroelastic Solver for FUN3D
Goldman, Benjamin D.; Bartels, Robert E.; Biedron, Robert T.; Scott, Robert C.
2016-01-01
A nonlinear structural solver has been implemented internally within the NASA FUN3D computational fluid dynamics code, allowing for some new aeroelastic capabilities. Using a modal representation of the structure, a set of differential or differential-algebraic equations are derived for general thin structures with geometric nonlinearities. ODEPACK and LAPACK routines are linked with FUN3D, and the nonlinear equations are solved at each CFD time step. The existing predictor-corrector method is retained, whereby the structural solution is updated after mesh deformation. The nonlinear solver is validated using a test case for a flexible aeroshell at transonic, supersonic, and hypersonic flow conditions. Agreement with linear theory is seen for the static aeroelastic solutions at relatively low dynamic pressures, but structural nonlinearities limit deformation amplitudes at high dynamic pressures. No flutter was found at any of the tested trajectory points, though LCO may be possible in the transonic regime.
A Survey of Solver-Related Geometry and Meshing Issues
Masters, James; Daniel, Derick; Gudenkauf, Jared; Hine, David; Sideroff, Chris
2016-01-01
There is a concern in the computational fluid dynamics community that mesh generation is a significant bottleneck in the CFD workflow. This is one of several papers that will help set the stage for a moderated panel discussion addressing this issue. Although certain general "rules of thumb" and a priori mesh metrics can be used to ensure that some base level of mesh quality is achieved, inadequate consideration is often given to the type of solver or particular flow regime on which the mesh will be utilized. This paper explores how an analyst may want to think differently about a mesh based on considerations such as if a flow is compressible vs. incompressible or hypersonic vs. subsonic or if the solver is node-centered vs. cell-centered. This paper is a high-level investigation intended to provide general insight into how considering the nature of the solver or flow when performing mesh generation has the potential to increase the accuracy and/or robustness of the solution and drive the mesh generation process to a state where it is no longer a hindrance to the analysis process.
Generalized Pattern Search methods for a class of nonsmooth optimization problems with structure
Bogani, C.; Gasparo, M. G.; Papini, A.
2009-07-01
We propose a Generalized Pattern Search (GPS) method to solve a class of nonsmooth minimization problems, where the set of nondifferentiability is included in the union of known hyperplanes and, therefore, is highly structured. Both unconstrained and linearly constrained problems are considered. At each iteration the set of poll directions is enforced to conform to the geometry of both the nondifferentiability set and the boundary of the feasible region, near the current iterate. This is the key issue to guarantee the convergence of certain subsequences of iterates to points which satisfy first-order optimality conditions. Numerical experiments on some classical problems validate the method.
Control of error and convergence in ODE solvers
International Nuclear Information System (INIS)
Gustafsson, K.
1992-03-01
Feedback is a general principle that can be used in many different contexts. In this thesis it is applied to numerical integration of ordinary differential equations. An advanced integration method includes parameters and variables that should be adjusted during the execution. In addition, the integration method should be able to automatically handle situations such as: initialization, restart after failures, etc. In this thesis we regard the algorithms for parameter adjustment and supervision as a controller. The controlled measures different variable that tell the current status of the integration, and based on this information it decides how to continue. The design of the controller is vital in order to accurately and efficiently solve a large class of ordinary differential equations. The application of feedback control may appear farfetched, but numerical integration methods are in fact dynamical systems. This is often overlooked in traditional numerical analysis. We derive dynamic models that describe the behavior of the integration method as well as the standard control algorithms in use today. Using these models it is possible to analyze properties of current algorithms, and also explain some generally observed misbehaviors. Further, we use the acquired insight to derive new and improved control algorithms, both for explicit and implicit Runge-Kutta methods. In the explicit case, the new controller gives good overall performance. In particular it overcomes the problem with oscillating stepsize sequence that is often experienced when the stepsize is restricted by numerical stability. The controller for implicit methods is designed so that it tracks changes in the differential equation better than current algorithms. In addition, it includes a new strategy for the equation solver, which allows the stepsize to vary more freely. This leads to smoother error control without excessive operations on the iteration matrix. (87 refs.) (au)
International Nuclear Information System (INIS)
Schulze-Halberg, Axel
2010-01-01
We study Green's functions of the generalized Sturm-Liouville problems that are related to each other by Darboux -equivalently, supersymmetrical - transformations. We establish an explicit relation between the corresponding Green's functions and derive a simple formula for their trace. The class of equations considered here includes the conventional Schroedinger equation and generalizations, such as for position-dependent mass and with linearly energy-dependent potential, as well as the stationary Fokker-Planck equation.
Shen, Peiping; Zhang, Tongli; Wang, Chunfeng
2017-01-01
This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.
General versus executive cognitive ability in pupils with ADHD and with milder attention problems
Directory of Open Access Journals (Sweden)
Ek U
2013-01-01
Full Text Available Ulla Ek,1 Joakim Westerlund,2 Elisabeth Fernell31Department of Special Education, 2Department of Psychology, Stockholm University, Stockholm, 3Gillberg Neuropsychiatry Centre, Sahlgrenska Academy, University of Gothenburg and the Research and Development Centre, Skaraborg Hospital Skövde, SwedenBackground: The aim of this study was to analyze two main types of cognitive domains in school children with different types and severities of attention-related problems. The cognitive domains examined were general cognitive ability and executive abilities.Methods: Three different clinical samples of pupils with school problems were analyzed to assess their cognitive Wechsler Intelligence Scale for Children profiles. In particular, the general cognitive ability index and the executive markers (ie, verbal memory index and processing speed index were of interest. Of the total sample (n = 198, two main groups were contrasted; one met the full criteria for attention deficit hyperactivity disorder (ADHD/subthreshold ADHD, and one was comprised of those with milder attention problems, insufficient to meet the criteria for ADHD/subthreshold ADHD.Results: It could be demonstrated that both groups had a significantly higher score on the general cognitive ability index than on measures of working memory and processing speed. This difference was more pronounced for boys.Conclusion: These types of cognitive differences need to be considered in children with different kinds of learning, behavior, and attention problems; this is also true for children presenting with an average general intelligence quotient and with milder attention problems. Current educational expectations are demanding for children with mild difficulties, and such cognitive information will add to the understanding of the child's learning problems, hopefully leading to a better adapted education than that conventionally available.Keywords: working memory, processing speed, children, learning and
Directory of Open Access Journals (Sweden)
Hutton Catherine
2007-05-01
Full Text Available Abstract Background Psychological problems present a huge burden of illness in our community and GPs are the main providers of care. There is evidence that longer consultations in general practice are associated with improved quality of care; but this needs to be balanced against the fact that doctor time is a limited resource and longer consultations may lead to reduced access to health care. The aim of this research was to conduct a systematic literature review to determine whether management of psychological problems in general practice is associated with an increased consultation length and to explore whether longer consultations are associated with better health outcomes for patients with psychological problems. Methods A search was conducted on Medline (Ovid databases up to7 June 2006. The following search terms, were used: general practice or primary health care (free text or family practice (MeSH AND consultation length or duration (free text or time factors (MeSH AND depression or psychological problems or depressed (free text. A similar search was done in Web of Science, Pubmed, Google Scholar, and Cochrane Library and no other papers were found. Studies were included if they contained data comparing consultation length and management or detection of psychological problems in a general practice or primary health care setting. The studies were read and categories developed to enable systematic data extraction and synthesis. Results 29 papers met the inclusion criteria. Consultations with a recorded diagnosis of a psychological problem were reported to be longer than those with no recorded psychological diagnosis. It is not clear if this is related to the extra time or the consultation style. GPs reported that time pressure is a major barrier to treating depression. There was some evidence that increased consultation length is associated with more accurate diagnosis of psychological problems. Conclusion Further research is needed to
Energy Technology Data Exchange (ETDEWEB)
Park, Sun Ho [Korea Maritime and Ocean University, Busan (Korea, Republic of); Rhee, Shin Hyung [Seoul National University, Seoul (Korea, Republic of)
2015-08-15
Incompressible flow solvers are generally used for numerical analysis of cavitating flows, but with limitations in handling compressibility effects on vapor phase. To study compressibility effects on vapor phase and cavity interface, pressure-based incompressible and isothermal compressible flow solvers based on a cell-centered finite volume method were developed using the OpenFOAM libraries. To validate the solvers, cavitating flow around a hemispherical head-form body was simulated and validated against the experimental data. The cavity shedding behavior, length of a re-entrant jet, drag history, and the Strouhal number were compared between the two solvers. The results confirmed that computations of the cavitating flow including compressibility effects improved the reproduction of cavitation dynamics.
Wang, XiaoLiang; Li, JiaChun
2017-12-01
A new solver based on the high-resolution scheme with novel treatments of source terms and interface capture for the Savage-Hutter model is developed to simulate granular avalanche flows. The capability to simulate flow spread and deposit processes is verified through indoor experiments of a two-dimensional granular avalanche. Parameter studies show that reduction in bed friction enhances runout efficiency, and that lower earth pressure restraints enlarge the deposit spread. The April 9, 2000, Yigong avalanche in Tibet, China, is simulated as a case study by this new solver. The predicted results, including evolution process, deposit spread, and hazard impacts, generally agree with site observations. It is concluded that the new solver for the Savage-Hutter equation provides a comprehensive software platform for granular avalanche simulation at both experimental and field scales. In particular, the solver can be a valuable tool for providing necessary information for hazard forecasts, disaster mitigation, and countermeasure decisions in mountainous areas.
User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver). Version 1.
Reddy, C. J.
2000-01-01
PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.
Variational P1 approximations of general-geometry multigroup transport problems
International Nuclear Information System (INIS)
Rulko, R.P.; Tomasevic, D.; Larsen, E.W.
1995-01-01
A variational approximation is developed for general-geometry multigroup transport problems with arbitrary anisotropic scattering. The variational principle is based on a functional that approximates a reaction rate in a subdomain of the system. In principle, approximations that result from this functional ''optimally'' determine such reaction rates. The functional contains an arbitrary parameter α and requires the approximate solutions of a forward and an adjoint transport problem. If the basis functions for the forward and adjoint solutions are chosen to be linear functions of the angular variable Ω, the functional yields the familiar multigroup P 1 equations for all values of α. However, the boundary conditions that result from the functional depend on α. In particular, for problems with vacuum boundaries, one obtains the conventional mixed boundary condition, but with an extrapolation distance that depends continuously on α. The choice α = 0 yields a generalization of boundary conditions derived earlier by Federighi and Pomraning for a more limited class of problems. The choice α = 1 yields a generalization of boundary conditions derived previously by Davis for monoenergetic problems. Other boundary conditions are obtained by choosing different values of α. The authors discuss this indeterminancy of α in conjunction with numerical experiments
A general solution of the plane problem in thermoelasticity in polar coordinates
International Nuclear Information System (INIS)
Tabakman, H.D.; Lin, Y.J.
1977-01-01
A general solution, in polar coordinates, of the plane problem in thermoelasticity is obtained in terms of a stress and displacement function. The solution is valid for arbitrary temperature distribution T(r,theta). The characteristic feature of the paper is the forthright determination of the displacement components brought about by the introduction of a displacement function. (Auth.)
A general solution of the plane problem thermoelasticity in polar coordinates
International Nuclear Information System (INIS)
Tabakman, H.D.; Lin, Y.J.
1977-01-01
A general solution, in polar coordinates, of the plane problem in thermoelasticity is obtained in terms of a stress and displacement function. The solution is valid for arbitrary temperature distribution T(r, theta). The characteristic feature of the paper is the forthright determination of the displacement components brought about by the introduction of a displacement function
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
DEFF Research Database (Denmark)
Bektas, Tolga; Erdogan, Günes; Røpke, Stefan
2011-01-01
The Generalized Vehicle Routing Problem (GVRP) consists of nding a set of routes for a number of vehicles with limited capacities on a graph with the vertices partitioned into clusters with given demands such that the total cost of travel is minimized and all demands are met. This paper offers four...
A Note on the Dual of an Unconstrained (Generalized) Geometric Programming Problem
J.B.G. Frenk (Hans); G.J. Still
2005-01-01
textabstractIn this note we show that the strong duality theorem of an unconstrained (generalized) geometric programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian duality result. Contrary to [1] we also consider the case that the set C is compact and
Barbagallo, Annamaria; Di Meglio, Guglielmo; Mauro, Paolo
2017-07-01
The aim of the paper is to study, in a Hilbert space setting, a general random oligopolistic market equilibrium problem in presence of both production and demand excesses and to characterize the random Cournot-Nash equilibrium principle by means of a stochastic variational inequality. Some existence results are presented.
Rossi, N. F.; Giacheti, C. M.
2017-01-01
Background: Williams syndrome (WS) phenotype is described as unique and intriguing. The aim of this study was to investigate the associations between speech-language abilities, general cognitive functioning and behavioural problems in individuals with WS, considering age effects and speech-language characteristics of WS sub-groups. Methods: The…
Development of RBDGG Solver and Its Application to System Reliability Analysis
International Nuclear Information System (INIS)
Kim, Man Cheol
2010-01-01
For the purpose of making system reliability analysis easier and more intuitive, RBDGG (Reliability Block diagram with General Gates) methodology was introduced as an extension of the conventional reliability block diagram. The advantage of the RBDGG methodology is that the structure of a RBDGG model is very similar to the actual structure of the analyzed system, and therefore the modeling of a system for system reliability and unavailability analysis becomes very intuitive and easy. The main idea of the development of the RBDGG methodology is similar with that of the development of the RGGG (Reliability Graph with General Gates) methodology, which is an extension of a conventional reliability graph. The newly proposed methodology is now implemented into a software tool, RBDGG Solver. RBDGG Solver was developed as a WIN32 console application. RBDGG Solver receives information on the failure modes and failure probabilities of each component in the system, along with the connection structure and connection logics among the components in the system. Based on the received information, RBDGG Solver automatically generates a system reliability analysis model for the system, and then provides the analysis results. In this paper, application of RBDGG Solver to the reliability analysis of an example system, and verification of the calculation results are provided for the purpose of demonstrating how RBDGG Solver is used for system reliability analysis
NITSOL: A Newton iterative solver for nonlinear systems
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States); Walker, H.F. [Utah State Univ., Logan, UT (United States)
1996-12-31
Newton iterative methods, also known as truncated Newton methods, are implementations of Newton`s method in which the linear systems that characterize Newton steps are solved approximately using iterative linear algebra methods. Here, we outline a well-developed Newton iterative algorithm together with a Fortran implementation called NITSOL. The basic algorithm is an inexact Newton method globalized by backtracking, in which each initial trial step is determined by applying an iterative linear solver until an inexact Newton criterion is satisfied. In the implementation, the user can specify inexact Newton criteria in several ways and select an iterative linear solver from among several popular {open_quotes}transpose-free{close_quotes} Krylov subspace methods. Jacobian-vector products used by the Krylov solver can be either evaluated analytically with a user-supplied routine or approximated using finite differences of function values. A flexible interface permits a wide variety of preconditioning strategies and allows the user to define a preconditioner and optionally update it periodically. We give details of these and other features and demonstrate the performance of the implementation on a representative set of test problems.
Generalization of the Fourier Convergence Analysis in the Neutron Diffusion Eigenvalue Problem
International Nuclear Information System (INIS)
Lee, Hyun Chul; Noh, Jae Man; Joo, Hyung Kook
2005-01-01
Fourier error analysis has been a standard technique for the stability and convergence analysis of linear and nonlinear iterative methods. Lee et al proposed new 2- D/1-D coupling methods and demonstrated several advantages of the new methods by performing a Fourier convergence analysis of the methods as well as two existing methods for a fixed source problem. We demonstrated the Fourier convergence analysis of one of the 2-D/1-D coupling methods applied to a neutron diffusion eigenvalue problem. However, the technique cannot be used directly to analyze the convergence of the other 2-D/1-D coupling methods since some algorithm-specific features were used in our previous study. In this paper we generalized the Fourier convergence analysis technique proposed and analyzed the convergence of the 2-D/1-D coupling methods applied to a neutron diffusion Eigenvalue problem using the generalized technique
Matlab Geochemistry: An open source geochemistry solver based on MRST
McNeece, C. J.; Raynaud, X.; Nilsen, H.; Hesse, M. A.
2017-12-01
The study of geological systems often requires the solution of complex geochemical relations. To address this need we present an open source geochemical solver based on the Matlab Reservoir Simulation Toolbox (MRST) developed by SINTEF. The implementation supports non-isothermal multicomponent aqueous complexation, surface complexation, ion exchange, and dissolution/precipitation reactions. The suite of tools available in MRST allows for rapid model development, in particular the incorporation of geochemical calculations into transport simulations of multiple phases, complex domain geometry and geomechanics. Different numerical schemes and additional physics can be easily incorporated into the existing tools through the object-oriented framework employed by MRST. The solver leverages the automatic differentiation tools available in MRST to solve arbitrarily complex geochemical systems with any choice of species or element concentration as input. Four mathematical approaches enable the solver to be quite robust: 1) the choice of chemical elements as the basis components makes all entries in the composition matrix positive thus preserving convexity, 2) a log variable transformation is used which transfers the nonlinearity to the convex composition matrix, 3) a priori bounds on variables are calculated from the structure of the problem, constraining Netwon's path and 4) an initial guess is calculated implicitly by sequentially adding model complexity. As a benchmark we compare the model to experimental and semi-analytic solutions of the coupled salinity-acidity transport system. Together with the reservoir simulation capabilities of MRST the solver offers a promising tool for geochemical simulations in reservoir domains for applications in a diversity of fields from enhanced oil recovery to radionuclide storage.
A theory of general solutions of 3D problems in 1D hexagonal quasicrystals
International Nuclear Information System (INIS)
Gao Yang; Xu Sipeng; Zhao Baosheng
2008-01-01
A theory of general solutions of three-dimensional (3D) problems is developed for the coupled equilibrium equations in 1D hexagonal quasicrystals (QCs), and two new general solutions, which are called generalized Lekhnitskii-Hu-Nowacki (LHN) and Elliott-Lodge (E-L) solutions, respectively, are presented based on three theorems. As a special case, the generalized LHN solution is obtained from our previous general solution by introducing three high-order displacement functions. For further simplification, considering three cases in which three characteristic roots are distinct or possibly equal to each other, the generalized E-L solution shall take different forms, and be expressed in terms of four quasi-harmonic functions which are very simple and useful. It is proved that the general solution presented by Peng and Fan is consistent with one case of the generalized E-L solution, while does not include the other two cases. It is important to note that generalized LHN and E-L solutions are complete in z-convex domains, while incomplete in the usual non-z-convex domains
Directory of Open Access Journals (Sweden)
Nurdan Cetin
2014-01-01
Full Text Available We consider a multiobjective linear fractional transportation problem (MLFTP with several fractional criteria, such as, the maximization of the transport profitability like profit/cost or profit/time, and its two properties are source and destination. Our aim is to introduce MLFTP which has not been studied in literature before and to provide a fuzzy approach which obtain a compromise Pareto-optimal solution for this problem. To do this, first, we present a theorem which shows that MLFTP is always solvable. And then, reducing MLFTP to the Zimmermann’s “min” operator model which is the max-min problem, we construct Generalized Dinkelbach’s Algorithm for solving the obtained problem. Furthermore, we provide an illustrative numerical example to explain this fuzzy approach.
Systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces
Directory of Open Access Journals (Sweden)
Cho Yeol
2011-01-01
Full Text Available Abstract In this paper, the existing theorems and methods for finding solutions of systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces are studied. To overcome the difficulties, due to the presence of a proper convex lower semi-continuous function, φ and a mapping g, which appeared in the considered problem, we have used some applications of the resolvent operator technique. We would like to point out that although many authors have proved results for finding solutions of the systems of nonlinear set-valued (mixed variational inequalities problems, it is clear that it cannot be directly applied to the problems that we have considered in this paper because of φ and g. 2000 AMS Subject Classification: 47H05; 47H09; 47J25; 65J15.
Lagro-Janssen, T L; Smits, A J; Van Weel, C
1990-01-01
In the context of a large scale survey of health problems in women aged 50 to 65 years, a study was undertaken on the effects of incontinence on daily life. For this purpose 1442 women randomly selected from the practice files of 75 general practitioners in the eastern part of the Netherlands were interviewed at home (response rate 60%). In cases of moderate or severe incontinence the general practitioner of the woman concerned was asked whether this problem had been diagnosed in general practice. Incontinence was reported in 22.5% of the women. Overall, 77.8% of the women did not feel worried about it and 75.4% did not feel restricted in their activities; even for women with severe incontinence (daily frequency and needing protective pads) only 15.6% experienced much worry and 15.7% much restriction. About a third of the women with incontinence (32.0%) had been identified by their general practitioner. The greater the worries and restrictions owing to incontinence, the greater the chance that the incontinence was known to the general practitioner concerned. Only a small minority of the women who felt severely restricted were not identified by their general practitioner. There was a positive relation between recognized incontinence and a history of hysterectomy. This study contradicts the image of the incontinent woman as isolated and helpless; most women in this study seemed able to cope. PMID:2121179
Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems
Chávez, Gustavo
2017-12-15
We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.
Accelerated Cyclic Reduction: A Distributed-Memory Fast Solver for Structured Linear Systems
Chá vez, Gustavo; Turkiyyah, George; Zampini, Stefano; Ltaief, Hatem; Keyes, David E.
2017-01-01
We present Accelerated Cyclic Reduction (ACR), a distributed-memory fast solver for rank-compressible block tridiagonal linear systems arising from the discretization of elliptic operators, developed here for three dimensions. Algorithmic synergies between Cyclic Reduction and hierarchical matrix arithmetic operations result in a solver that has O(kNlogN(logN+k2)) arithmetic complexity and O(k Nlog N) memory footprint, where N is the number of degrees of freedom and k is the rank of a block in the hierarchical approximation, and which exhibits substantial concurrency. We provide a baseline for performance and applicability by comparing with the multifrontal method with and without hierarchical semi-separable matrices, with algebraic multigrid and with the classic cyclic reduction method. Over a set of large-scale elliptic systems with features of nonsymmetry and indefiniteness, the robustness of the direct solvers extends beyond that of the multigrid solver, and relative to the multifrontal approach ACR has lower or comparable execution time and size of the factors, with substantially lower numerical ranks. ACR exhibits good strong and weak scaling in a distributed context and, as with any direct solver, is advantageous for problems that require the solution of multiple right-hand sides. Numerical experiments show that the rank k patterns are of O(1) for the Poisson equation and of O(n) for the indefinite Helmholtz equation. The solver is ideal in situations where low-accuracy solutions are sufficient, or otherwise as a preconditioner within an iterative method.
Parallelization of the preconditioned IDR solver for modern multicore computer systems
Bessonov, O. A.; Fedoseyev, A. I.
2012-10-01
This paper present the analysis, parallelization and optimization approach for the large sparse matrix solver CNSPACK for modern multicore microprocessors. CNSPACK is an advanced solver successfully used for coupled solution of stiff problems arising in multiphysics applications such as CFD, semiconductor transport, kinetic and quantum problems. It employs iterative IDR algorithm with ILU preconditioning (user chosen ILU preconditioning order). CNSPACK has been successfully used during last decade for solving problems in several application areas, including fluid dynamics and semiconductor device simulation. However, there was a dramatic change in processor architectures and computer system organization in recent years. Due to this, performance criteria and methods have been revisited, together with involving the parallelization of the solver and preconditioner using Open MP environment. Results of the successful implementation for efficient parallelization are presented for the most advances computer system (Intel Core i7-9xx or two-processor Xeon 55xx/56xx).
Frequent attenders in general practice: problem solving treatment provided by nurses [ISRCTN51021015
Directory of Open Access Journals (Sweden)
van Oppen P
2005-10-01
Full Text Available Abstract Background There is a need for assistance from primary care mental health workers in general practice in the Netherlands. General practitioners (GPs experience an overload of frequent attenders suffering from psychological problems. Problem Solving Treatment (PST is a brief psychological treatment tailored for use in a primary care setting. PST is provided by nurses, and earlier research has shown that it is a treatment at least as effective as usual care. However, research outcomes are not totally satisfying. This protocol describes a randomized clinical trial on the effectiveness of PST provided by nurses for patients in general practice. The results of this study, which currently being carried out, will be presented as soon as they are available. Methods/design This study protocol describes the design of a randomized controlled trial to investigate the effectiveness and cost-effectiveness of PST and usual care compared to usual care only. Patients, 18 years and older, who present psychological problems and are frequent attenders in general practice are recruited by the research assistant. The participants receive questionnaires at baseline, after the intervention, and again after 3 months and 9 months. Primary outcome is the reduction of symptoms, and other outcomes measured are improvement in problem solving skills, psychological and physical well being, daily functioning, social support, coping styles, problem evaluation and health care utilization. Discussion Our results may either confirm that PST in primary care is an effective way of dealing with emotional disorders and a promising addition to the primary care in the UK and USA, or may question this assumption. This trial will allow an evaluation of the effects of PST in practical circumstances and in a rather heterogeneous group of primary care patients. This study delivers scientific support for this use and therefore indications for optimal treatment and referral.
Generalized multiscale finite element methods for problems in perforated heterogeneous domains
Chung, Eric T.
2015-06-08
Complex processes in perforated domains occur in many real-world applications. These problems are typically characterized by physical processes in domains with multiple scales. Moreover, these problems are intrinsically multiscale and their discretizations can yield very large linear or nonlinear systems. In this paper, we investigate multiscale approaches that attempt to solve such problems on a coarse grid by constructing multiscale basis functions in each coarse grid, where the coarse grid can contain many perforations. In particular, we are interested in cases when there is no scale separation and the perforations can have different sizes. In this regard, we mention some earlier pioneering works, where the authors develop multiscale finite element methods. In our paper, we follow Generalized Multiscale Finite Element Method (GMsFEM) and develop a multiscale procedure where we identify multiscale basis functions in each coarse block using snapshot space and local spectral problems. We show that with a few basis functions in each coarse block, one can approximate the solution, where each coarse block can contain many small inclusions. We apply our general concept to (1) Laplace equation in perforated domains; (2) elasticity equation in perforated domains; and (3) Stokes equations in perforated domains. Numerical results are presented for these problems using two types of heterogeneous perforated domains. The analysis of the proposed methods will be presented elsewhere. © 2015 Taylor & Francis
International Nuclear Information System (INIS)
Navarro, V.; Alonso, J.; Asensio, L.; Yustres, A.; Pintado, X.
2012-01-01
Document available in extended abstract form only. The use of numerical methods, especially the Finite Element Method (FEM), for solving boundary problems in Unsaturated Soil Mechanics has experienced significant progress. Several codes, both built mainly for research purposes and commercial software, are now available. In the last years, Multi-physic Partial Differentiation Equation Solvers (MPDES) have turned out to be an interesting proposal. In this family of solvers, the user defines the governing equations and the behaviour models, generally using a computer algebra environment. The code automatically assembles and solves the equation systems, saving the user having to redefine the structures of memory storage or to implement solver algorithms. The user can focus on the definition of the physics of the problem, while it is possible to couple virtually any physical or chemical process that can be described by a PDE. This can be done, for instance, in COMSOL Multiphysics (CM). Nonetheless, the versatility of CM is compromised by the impossibility to implement models with variables defined by implicit functions. Elasto-plastic models involve an implicit coupling among stress increments, plastic strains and plastic variables increments. For this reason, they cannot be implemented in CM in a straightforward way. This means a very relevant limitation for the use of this tool in the analysis of geomechanical boundary value problems. In this work, a strategy to overcome this problem using the multi-physics concept is presented. A mixed method is proposed, considering the constitutive stresses, the pre-consolidation pressure and the plastic variables as main unknowns of the model. Mixed methods usually present stability problems. However, the algorithmics present in CM include several numerical strategies to minimise this kind of problems. Besides, CM is based on the application of the FEM with Lagrange multipliers, an approach that significantly contributes stability
Variational methods for problems from plasticity theory and for generalized Newtonian fluids
Fuchs, Martin
2000-01-01
Variational methods are applied to prove the existence of weak solutions for boundary value problems from the deformation theory of plasticity as well as for the slow, steady state flow of generalized Newtonian fluids including the Bingham and Prandtl-Eyring model. For perfect plasticity the role of the stress tensor is emphasized by studying the dual variational problem in appropriate function spaces. The main results describe the analytic properties of weak solutions, e.g. differentiability of velocity fields and continuity of stresses. The monograph addresses researchers and graduate students interested in applications of variational and PDE methods in the mechanics of solids and fluids.
Domain decomposition solvers for nonlinear multiharmonic finite element equations
Copeland, D. M.
2010-01-01
In many practical applications, for instance, in computational electromagnetics, the excitation is time-harmonic. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple elliptic equation for the amplitude. This is true for linear problems, but not for nonlinear problems. However, due to the periodicity of the solution, we can expand the solution in a Fourier series. Truncating this Fourier series and approximating the Fourier coefficients by finite elements, we arrive at a large-scale coupled nonlinear system for determining the finite element approximation to the Fourier coefficients. The construction of fast solvers for such systems is very crucial for the efficiency of this multiharmonic approach. In this paper we look at nonlinear, time-harmonic potential problems as simple model problems. We construct and analyze almost optimal solvers for the Jacobi systems arising from the Newton linearization of the large-scale coupled nonlinear system that one has to solve instead of performing the expensive time-integration procedure. © 2010 de Gruyter.
General practice-based clinical trials in Germany - a problem analysis
Directory of Open Access Journals (Sweden)
Hummers-Pradier Eva
2012-11-01
Full Text Available Abstract Background In Germany, clinical trials and comparative effectiveness studies in primary care are still very rare, while their usefulness has been recognised in many other countries. A network of researchers from German academic general practice has explored the reasons for this discrepancy. Methods Based on a comprehensive literature review and expert group discussions, problem analyses as well as structural and procedural prerequisites for a better implementation of clinical trials in German primary care are presented. Results In Germany, basic biomedical science and technology is more reputed than clinical or health services research. Clinical trials are funded by industry or a single national programme, which is highly competitive, specialist-dominated, exclusive of pilot studies, and usually favours innovation rather than comparative effectiveness studies. Academic general practice is still not fully implemented, and existing departments are small. Most general practitioners (GPs work in a market-based, competitive setting of small private practices, with a high case load. They have no protected time or funding for research, and mostly no research training or experience. Good Clinical Practice (GCP training is compulsory for participation in clinical trials. The group defined three work packages to be addressed regarding clinical trials in German general practice: (1 problem analysis, and definition of (2 structural prerequisites and (3 procedural prerequisites. Structural prerequisites comprise specific support facilities for general practice-based research networks that could provide practices with a point of contact. Procedural prerequisites consist, for example, of a summary of specific relevant key measures, for example on a web platform. The platform should contain standard operating procedures (SOPs, templates, checklists and other supporting materials for researchers. Conclusion All in all, our problem analyses revealed that
Generalized Roe's numerical scheme for a two-fluid model
International Nuclear Information System (INIS)
Toumi, I.; Raymond, P.
1993-01-01
This paper is devoted to a mathematical and numerical study of a six equation two-fluid model. We will prove that the model is strictly hyperbolic due to the inclusion of the virtual mass force term in the phasic momentum equations. The two-fluid model is naturally written under a nonconservative form. To solve the nonlinear Riemann problem for this nonconservative hyperbolic system, a generalized Roe's approximate Riemann solver, is used, based on a linearization of the nonconservative terms. A Godunov type numerical scheme is built, using this approximate Riemann solver. 10 refs., 5 figs,
Generalization of the geometric optical series approach for nonadiabatic scattering problems
International Nuclear Information System (INIS)
Herman, M.F.
1982-01-01
The geometric optical series approach of Bremmer is generalized for multisurface nonadiabatic scattering problems. This method yields the formal solution of the Schroedinger equation as an infinite series of multiple integrals. The zeroth order term corresponds to WKB propagation on a single adiabatic surface, while the general Nth order term involves N reflections and/or transitions between surfaces accompanied by ''free,'' single surface semiclassical propagation between the points of reflection and transition. Each term is integrated over all possible transition and reflection points. The adiabatic and diabatic limits of this expression are discussed. Numerical results, in which all reflections are ignored, are presented for curve crossing and noncrossing problems. These results are compared to exact quantum results and are shown to be highly accurate
Domain decomposed preconditioners with Krylov subspace methods as subdomain solvers
Energy Technology Data Exchange (ETDEWEB)
Pernice, M. [Univ. of Utah, Salt Lake City, UT (United States)
1994-12-31
Domain decomposed preconditioners for nonsymmetric partial differential equations typically require the solution of problems on the subdomains. Most implementations employ exact solvers to obtain these solutions. Consequently work and storage requirements for the subdomain problems grow rapidly with the size of the subdomain problems. Subdomain solves constitute the single largest computational cost of a domain decomposed preconditioner, and improving the efficiency of this phase of the computation will have a significant impact on the performance of the overall method. The small local memory available on the nodes of most message-passing multicomputers motivates consideration of the use of an iterative method for solving subdomain problems. For large-scale systems of equations that are derived from three-dimensional problems, memory considerations alone may dictate the need for using iterative methods for the subdomain problems. In addition to reduced storage requirements, use of an iterative solver on the subdomains allows flexibility in specifying the accuracy of the subdomain solutions. Substantial savings in solution time is possible if the quality of the domain decomposed preconditioner is not degraded too much by relaxing the accuracy of the subdomain solutions. While some work in this direction has been conducted for symmetric problems, similar studies for nonsymmetric problems appear not to have been pursued. This work represents a first step in this direction, and explores the effectiveness of performing subdomain solves using several transpose-free Krylov subspace methods, GMRES, transpose-free QMR, CGS, and a smoothed version of CGS. Depending on the difficulty of the subdomain problem and the convergence tolerance used, a reduction in solution time is possible in addition to the reduced memory requirements. The domain decomposed preconditioner is a Schur complement method in which the interface operators are approximated using interface probing.
A high performance dual revised simplex solver
Hall, Julian; Huangfu, Qi
2012-01-01
When solving families of related linear programming (LP) problems and many classes of single LP problems, the simplex method is the preferred computational technique. Hitherto there has been no efficient parallel implementation of the simplex method that gives good speed-up on general, large sparse LP problems. This paper presents a variant of the dual simplex method and a prototype parallelisation scheme. The resulting implementation, ParISS, is efficient when run in serial and offers modest...
Collier, Nathan; Pardo, David; Dalcí n, Lisandro D.; Paszyński, Maciej R.; Calo, Victor M.
2012-01-01
We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.
Collier, Nathan
2012-03-01
We study the performance of direct solvers on linear systems of equations resulting from isogeometric analysis. The problem of choice is the canonical Laplace equation in three dimensions. From this study we conclude that for a fixed number of unknowns and polynomial degree of approximation, a higher degree of continuity k drastically increases the CPU time and RAM needed to solve the problem when using a direct solver. This paper presents numerical results detailing the phenomenon as well as a theoretical analysis that explains the underlying cause. © 2011 Elsevier B.V.
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf
2010-01-01
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.
Modelo de selección de cartera con Solver
Directory of Open Access Journals (Sweden)
P. Fogués Zornoza
2012-04-01
Full Text Available In this paper, we present an example of linear optimization in the context of degrees in Economics or Business Administration and Management. We show techniques that enable students to go deep and investigate in real problems that have been modelled using the Excel platform. The model shown here has been developed by a student and it consists in minimizing the absolute deviations over the average expected return of a portfolio of securities, using the solver tool that it is included in this software.
Inverse planning for x-ray rotation therapy: a general solution of the inverse problem
International Nuclear Information System (INIS)
Oelfke, U.; Bortfeld, T.
1999-01-01
Rotation therapy with photons is currently under investigation for the delivery of intensity modulated radiotherapy (IMRT). An analytical approach for inverse treatment planning of this radiotherapy technique is described. The inverse problem for the delivery of arbitrary 2D dose profiles is first formulated and then solved analytically. In contrast to previously applied strategies for solving the inverse problem, it is shown that the most general solution for the fluence profiles consists of two independent solutions of different parity. A first analytical expression for both fluence profiles is derived. The mathematical derivation includes two different strategies, an elementary expansion of fluence and dose into polynomials and a more practical approach in terms of Fourier transforms. The obtained results are discussed in the context of previous work on this problem. (author)
Reply to C. M. Will on the axially symmetric two-body problem in general relativity
International Nuclear Information System (INIS)
Cooperstock, F.I.; Lim, P.H.
1985-01-01
The recent paper by Will (1983) is considered which purports to demonstrate that the gravitational radiation which the authors had computed from their model two-body free-fall system is consistent with the so-called quadrupole formula. It is shown that in fact the system presented by Will is different from the authors and that the illegitimate application of the quadrupole formula to the authors system leads to a smaller flux than that which is correctly deduced using general relativity and a proper consideration of nonlinearities. It is demonstrated that a judicious choice of stress release is propagated through the bodies as a superposition of plane and spherical waves leading to pressure fluctuations to the order in question. This underlines the essential distinction between the authors problem and the Will problem. Various aspects of the problem are also discussed. 25 references
An analogue of Morse theory for planar linear networks and the generalized Steiner problem
International Nuclear Information System (INIS)
Karpunin, G A
2000-01-01
A study is made of the generalized Steiner problem: the problem of finding all the locally minimal networks spanning a given boundary set (terminal set). It is proposed to solve this problem by using an analogue of Morse theory developed here for planar linear networks. The space K of all planar linear networks spanning a given boundary set is constructed. The concept of a critical point and its index is defined for the length function l of a planar linear network. It is shown that locally minimal networks are local minima of l on K and are critical points of index 1. The theorem is proved that the sum of the indices of all the critical points is equal to χ(K)=1. This theorem is used to find estimates for the number of locally minimal networks spanning a given boundary set
Energy Technology Data Exchange (ETDEWEB)
Stathopoulos, A.; Fischer, C.F. [Vanderbilt Univ., Nashville, TN (United States); Saad, Y.
1994-12-31
The solution of the large, sparse, symmetric eigenvalue problem, Ax = {lambda}x, is central to many scientific applications. Among many iterative methods that attempt to solve this problem, the Lanczos and the Generalized Davidson (GD) are the most widely used methods. The Lanczos method builds an orthogonal basis for the Krylov subspace, from which the required eigenvectors are approximated through a Rayleigh-Ritz procedure. Each Lanczos iteration is economical to compute but the number of iterations may grow significantly for difficult problems. The GD method can be considered a preconditioned version of Lanczos. In each step the Rayleigh-Ritz procedure is solved and explicit orthogonalization of the preconditioned residual ((M {minus} {lambda}I){sup {minus}1}(A {minus} {lambda}I)x) is performed. Therefore, the GD method attempts to improve convergence and robustness at the expense of a more complicated step.
A complete basis for a perturbation expansion of the general N-body problem
International Nuclear Information System (INIS)
Laing, W Blake; Kelle, David W; Dunn, Martin; Watson, Deborah K
2009-01-01
We discuss a basis set developed to calculate perturbation coefficients in an expansion of the general N-body problem. This basis has two advantages. First, the basis is complete order-by-order for the perturbation series. Second, the number of independent basis tensors spanning the space for a given order does not scale with N, the number of particles, despite the generality of the problem. At first order, the number of basis tensors is 25 for all N, i.e. the problem scales as N 0 , although one would initially expect an N 6 scaling at first order. The perturbation series is expanded in inverse powers of the spatial dimension. This results in a maximally symmetric configuration at lowest order which has a point group isomorphic with the symmetric group, S N . The resulting perturbation series is order-by-order invariant under the N! operations of the S N point group which is responsible for the slower than exponential growth of the basis. In this paper, we demonstrate the completeness of the basis and perform the first test of this formalism through first order by comparing to an exactly solvable fully interacting problem of N particles with a two-body harmonic interaction potential
Using SPARK as a Solver for Modelica
Energy Technology Data Exchange (ETDEWEB)
Wetter, Michael; Wetter, Michael; Haves, Philip; Moshier, Michael A.; Sowell, Edward F.
2008-06-30
Modelica is an object-oriented acausal modeling language that is well positioned to become a de-facto standard for expressing models of complex physical systems. To simulate a model expressed in Modelica, it needs to be translated into executable code. For generating run-time efficient code, such a translation needs to employ algebraic formula manipulations. As the SPARK solver has been shown to be competitive for generating such code but currently cannot be used with the Modelica language, we report in this paper how SPARK's symbolic and numerical algorithms can be implemented in OpenModelica, an open-source implementation of a Modelica modeling and simulation environment. We also report benchmark results that show that for our air flow network simulation benchmark, the SPARK solver is competitive with Dymola, which is believed to provide the best solver for Modelica.
New iterative solvers for the NAG Libraries
Energy Technology Data Exchange (ETDEWEB)
Salvini, S.; Shaw, G. [Numerical Algorithms Group Ltd., Oxford (United Kingdom)
1996-12-31
The purpose of this paper is to introduce the work which has been carried out at NAG Ltd to update the iterative solvers for sparse systems of linear equations, both symmetric and unsymmetric, in the NAG Fortran 77 Library. Our current plans to extend this work and include it in our other numerical libraries in our range are also briefly mentioned. We have added to the Library the new Chapter F11, entirely dedicated to sparse linear algebra. At Mark 17, the F11 Chapter includes sparse iterative solvers, preconditioners, utilities and black-box routines for sparse symmetric (both positive-definite and indefinite) linear systems. Mark 18 will add solvers, preconditioners, utilities and black-boxes for sparse unsymmetric systems: the development of these has already been completed.
s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
Energy Technology Data Exchange (ETDEWEB)
Williams, Samuel [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Lijewski, Mike [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Almgren, Ann [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Straalen, Brian Van [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Carson, Erin [Univ. of California, Berkeley, CA (United States); Knight, Nicholas [Univ. of California, Berkeley, CA (United States); Demmel, James [Univ. of California, Berkeley, CA (United States)
2014-08-14
Geometric multigrid solvers within adaptive mesh refinement (AMR) applications often reach a point where further coarsening of the grid becomes impractical as individual sub domain sizes approach unity. At this point the most common solution is to use a bottom solver, such as BiCGStab, to reduce the residual by a fixed factor at the coarsest level. Each iteration of BiCGStab requires multiple global reductions (MPI collectives). As the number of BiCGStab iterations required for convergence grows with problem size, and the time for each collective operation increases with machine scale, bottom solves in large-scale applications can constitute a significant fraction of the overall multigrid solve time. In this paper, we implement, evaluate, and optimize a communication-avoiding s-step formulation of BiCGStab (CABiCGStab for short) as a high-performance, distributed-memory bottom solver for geometric multigrid solvers. This is the first time s-step Krylov subspace methods have been leveraged to improve multigrid bottom solver performance. We use a synthetic benchmark for detailed analysis and integrate the best implementation into BoxLib in order to evaluate the benefit of a s-step Krylov subspace method on the multigrid solves found in the applications LMC and Nyx on up to 32,768 cores on the Cray XE6 at NERSC. Overall, we see bottom solver improvements of up to 4.2x on synthetic problems and up to 2.7x in real applications. This results in as much as a 1.5x improvement in solver performance in real applications.
Approximation in generalized Hardy classes and resolution of inverse problems for tokamaks
International Nuclear Information System (INIS)
Fisher, Y.
2011-11-01
This thesis concerns both the theoretical and constructive resolution of inverse problems for isotropic diffusion equation in planar domains, simply and doubly connected. From partial Cauchy boundary data (potential, flux), we look for those quantities on the remaining part of the boundary, where no information is available, as well as inside the domain. The proposed approach proceeds by considering solutions to the diffusion equation as real parts of complex valued solutions to some conjugated Beltrami equation. These particular generalized analytic functions allow to introduce Hardy classes, where the inverse problem is stated as a best constrained approximation issue (bounded extrema problem), and thereby is regularized. Hence, existence and smoothness properties, together with density results of traces on the boundary, ensure well-posedness. An application is studied, to a free boundary problem for a magnetically confined plasma in the tokamak Tore Supra (CEA Cadarache France). The resolution of the approximation problem on a suitable basis of functions (toroidal harmonics) leads to a qualification criterion for the estimated plasma boundary. A descent algorithm makes it decrease, and refines the estimations. The method does not require any integration of the solution in the overall domain. It furnishes very accurate numerical results, and could be extended to other devices, like JET or ITER. (author)
Cafesat: A modern sat solver for scala
Blanc Régis
2013-01-01
We present CafeSat a SAT solver written in the Scala programming language. CafeSat is a modern solver based on DPLL and featuring many state of the art techniques and heuristics. It uses two watched literals for Boolean constraint propagation conict driven learning along with clause deletion a restarting strategy and the VSIDS heuristics for choosing the branching literal. CafeSat is both sound and complete. In order to achieve reasonable performance low level and hand tuned data structures a...
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
Directory of Open Access Journals (Sweden)
Roberto Amadini
2016-06-01
Full Text Available In the context of Constraint Programming, a portfolio approach exploits the complementary strengths of a portfolio of different constraint solvers. The goal is to predict and run the best solver(s of the portfolio for solving a new, unseen problem. In this work we reproduce, simulate, and evaluate the performance of different portfolio approaches on extensive benchmarks of Constraint Satisfaction Problems. Empirical results clearly show the benefits of portfolio solvers in terms of both solved instances and solving time.
Still a difficult business? Negotiating alcohol-related problems in general practice consultations.
Rapley, Tim; May, Carl; Frances Kaner, Eileen
2006-11-01
This paper describes general practitioners' (GPs) experiences of detecting and managing alcohol and alcohol-related problems in consultations. We undertook qualitative research in two phases in the North-East of England. Initially, qualitative interviews with 29 GPs explored their everyday work with patients with alcohol-related issues. We then undertook group interviews--two with GPs and one with a primary care team--where they discussed and challenged findings of the interviews. The GPs reported routinely discussing alcohol with patients with a range of alcohol-related problems. GPs believed that this work is important, but felt that until patients were willing to accept that their alcohol consumption was problematic they could achieve very little. They tentatively introduced alcohol as a potential problem, re-introduced the topic periodically, and then waited until the patient decided to change their behaviour. They were aware that they could identify and manage more patients. A lack of time and having to work with the multiple problems that patients brought to consultations were the main factors that stopped GPs managing more risky drinkers. Centrally, we compared the results of our study with [Thom, B., & Tellez, C. (1986). A difficult business-Detecting and managing alcohol-problems in general-practice. British Journal of Addiction, 81, 405-418] seminal study that was undertaken 20 years ago. We show how the intellectual, moral, emotional and practical difficulties that GPs currently face are quite similar to those faced by GPs from 20 years ago. As the definition of what could constitute abnormal alcohol consumption has expanded, so the range of consultations that they may have to negotiate these difficulties in has also expanded.
International Nuclear Information System (INIS)
Burger, Joanna; Myers, O.; Boring, C.S.; Dixon, C.; Lord, C.; Ramos, R.; Shukla, S.; Gochfeld, Michael
2004-01-01
Perceptions about general environmental problems, governmental spending for these problems, and major concerns about the US Department of Energy's Los Alamos National Laboratory (LANL) were examined by interviewing 356 people attending a gun show in Albuquerque, New Mexico. The hypothesis that there are differences in these three areas as a function of ethnicity was examined. We predicted that if differences existed, they would exist for all three evaluations (general environmental problems, government spending, and environmental concerns about LANL). However, this was not the case; there were fewer ethnic differences concerning LANL. Hispanics rated most general environmental problems higher than Whites and rated their willingness to expend federal funds higher than Whites, although all groups gave a lower score on willingness than on concern. Further, the congruence between these two types of ratings was higher for Hispanics than for others. In general, the concerns expressed by subjects about LANL showed few ethnic differences, and everyone was most concerned about contamination. These data indicate that Hispanics attending a gun show are equally or more concerned than others about environmental problems generally but are not more concerned about LANL. The data can be useful for developing future research and stewardship plans and for understanding general environmental problems and their relationship to concerns about LANL. More generally, they indicate that the attitudes and perceptions of Hispanics deserve increased study in a general population
Tree-based solvers for adaptive mesh refinement code FLASH - I: gravity and optical depths
Wünsch, R.; Walch, S.; Dinnbier, F.; Whitworth, A.
2018-04-01
We describe an OctTree algorithm for the MPI parallel, adaptive mesh refinement code FLASH, which can be used to calculate the gas self-gravity, and also the angle-averaged local optical depth, for treating ambient diffuse radiation. The algorithm communicates to the different processors only those parts of the tree that are needed to perform the tree-walk locally. The advantage of this approach is a relatively low memory requirement, important in particular for the optical depth calculation, which needs to process information from many different directions. This feature also enables a general tree-based radiation transport algorithm that will be described in a subsequent paper, and delivers excellent scaling up to at least 1500 cores. Boundary conditions for gravity can be either isolated or periodic, and they can be specified in each direction independently, using a newly developed generalization of the Ewald method. The gravity calculation can be accelerated with the adaptive block update technique by partially re-using the solution from the previous time-step. Comparison with the FLASH internal multigrid gravity solver shows that tree-based methods provide a competitive alternative, particularly for problems with isolated or mixed boundary conditions. We evaluate several multipole acceptance criteria (MACs) and identify a relatively simple approximate partial error MAC which provides high accuracy at low computational cost. The optical depth estimates are found to agree very well with those of the RADMC-3D radiation transport code, with the tree-solver being much faster. Our algorithm is available in the standard release of the FLASH code in version 4.0 and later.
Educational Level, Underachievement, and General Mental Health Problems in 10,866 Adolescents.
Tempelaar, Wanda M; de Vos, Nelleke; Plevier, Carolien M; van Gastel, Willemijn A; Termorshuizen, Fabian; MacCabe, James H; Boks, Marco P M
2017-08-01
Previous research suggests that cognitive functioning is associated with the risk of several adult psychiatric disorders. In this study we investigated whether adolescents who perform worse than expected at secondary school are at a higher risk for general mental health problems. In a cross-sectional survey comprising 10,866 Dutch adolescents aged 13 to 16 years, underachievement at secondary school was defined as the discrepancy between predicted school grade and actual grade 1 or 3 years later. Mental health problems were assessed using the Strengths and Difficulties Questionnaire. We investigated the association of underachievement with mental health problems using logistic regression, adjusting for potential confounders. Underachievement was associated with general psychopathology in pupils aged 13 to 14 years (odds ratio [OR], 1.86; 95% confidence interval [CI], 1.47-2.37) and in pupils aged 15 to 16 years (OR, 2.05; 95% CI, 1.67-2.52) in a multivariate analysis including sociodemographic factors. The association between underachievement and mental health problems was attenuated when school factors such as teacher advice and interaction between underachievement and teacher advice were added, but underachievement remained significantly associated with mental health problems in adolescents in the higher educational tracks (pupils aged 13-14 years: OR, 2.22; 95% CI, 1.07-4.60 and OR, 2.41; 95% CI, 1.10-5.30, age 15-16 years: OR, 2.63; 95% CI, 1.38-5.03). In the multivariate analysis including the interaction between underachievement and teacher advice, a significant interaction effect occurs between underachievement and teacher advice in the higher tracks. Values of OR and CI are given for each significant interaction term. In the younger age group (pupils aged 13-14 years) this results in 2 sets of OR and CI. This association was most pronounced for the hyperactivity subscale of the Strengths and Difficulties Questionnaire. Underachievement at secondary school
International Nuclear Information System (INIS)
Kates, R.E.
1979-01-01
This thesis shows that a small body with possibly strong internal gravity moves through an empty region of a curved, and not necessarily asymptotically flat, external spacetime on an approximate geodesic. By approximate geodesic, the following is meant: Suppose the ratio epsilon = m/L 1 - where m is the body's mass and L is a curvature reference length of the external field - is a small parameter. Then the body's worldline deviates from a geodesic only by distances of at most THETA(epsilon) L over times of order L. The worldline is calculated directly from the Einstein field equation using a singular perturbation technique that has been generalized from the method of matched asymptotic expansions. The need for singular perturbation techniques has long been appreciated in fluid mechanics, where they are now standard procedure in problems in which the straightforward expansion in powers of a small parameter fails to give a correct qualitative picture. In part I of this thesis, singular perturbations on manifolds are formulated in a coordinate-free way suitable for treating problems in general relativity and other field theories. Most importantly for this thesis, the coordinate-free formulation of singular perturbations given in part I is essential for treatment of the problem of motion in part II
A Generalized Ant Colony Algorithm for Job一shop Scheduling Problem
Directory of Open Access Journals (Sweden)
ZHANG Hong-Guo
2017-02-01
Full Text Available Aiming at the problem of ant colony algorithm for solving Job一shop scheduling problem. Considering the complexity of the algorithm that uses disjunctive graph to describe the relationship between workpiece processing. To solve the problem of optimal solution，a generalized ant colony algorithm is proposed. Under the premise of considering constrained relationship between equipment and process，the pheromone update mechanism is applied to solve Job-shop scheduling problem，so as to improve the quality of the solution. In order to improve the search efficiency，according to the state transition rules of ant colony algorithm，this paper makes a detailed study on the selection and improvement of the parameters in the algorithm，and designs the pheromone update strategy. Experimental results show that a generalized ant colony algorithm is more feasible and more effective. Compared with other algorithms in the literature，the results prove that the algorithm improves in computing the optimal solution and convergence speed.
Energy Technology Data Exchange (ETDEWEB)
Bordner, J.; Saied, F. [Univ. of Illinois, Urbana, IL (United States)
1996-12-31
GLab3D is an enhancement of an interactive environment (MGLab) for experimenting with iterative solvers and multigrid algorithms. It is implemented in MATLAB. The new version has built-in 3D elliptic pde`s and several iterative methods and preconditioners that were not available in the original version. A sparse direct solver option has also been included. The multigrid solvers have also been extended to 3D. The discretization and pde domains are restricted to standard finite differences on the unit square/cube. The power of this software studies in the fact that no programming is needed to solve, for example, the convection-diffusion equation in 3D with TFQMR and a customized V-cycle preconditioner, for a variety of problem sizes and mesh Reynolds, numbers. In addition to the graphical user interface, some sample drivers are included to show how experiments can be composed using the underlying suite of problems and solvers.
Efficient generalized Golub-Kahan based methods for dynamic inverse problems
Chung, Julianne; Saibaba, Arvind K.; Brown, Matthew; Westman, Erik
2018-02-01
We consider efficient methods for computing solutions to and estimating uncertainties in dynamic inverse problems, where the parameters of interest may change during the measurement procedure. Compared to static inverse problems, incorporating prior information in both space and time in a Bayesian framework can become computationally intensive, in part, due to the large number of unknown parameters. In these problems, explicit computation of the square root and/or inverse of the prior covariance matrix is not possible, so we consider efficient, iterative, matrix-free methods based on the generalized Golub-Kahan bidiagonalization that allow automatic regularization parameter and variance estimation. We demonstrate that these methods for dynamic inversion can be more flexible than standard methods and develop efficient implementations that can exploit structure in the prior, as well as possible structure in the forward model. Numerical examples from photoacoustic tomography, space-time deblurring, and passive seismic tomography demonstrate the range of applicability and effectiveness of the described approaches. Specifically, in passive seismic tomography, we demonstrate our approach on both synthetic and real data. To demonstrate the scalability of our algorithm, we solve a dynamic inverse problem with approximately 43 000 measurements and 7.8 million unknowns in under 40 s on a standard desktop.
A general approach to regularizing inverse problems with regional data using Slepian wavelets
Michel, Volker; Simons, Frederik J.
2017-12-01
Slepian functions are orthogonal function systems that live on subdomains (for example, geographical regions on the Earth’s surface, or bandlimited portions of the entire spectrum). They have been firmly established as a useful tool for the synthesis and analysis of localized (concentrated or confined) signals, and for the modeling and inversion of noise-contaminated data that are only regionally available or only of regional interest. In this paper, we consider a general abstract setup for inverse problems represented by a linear and compact operator between Hilbert spaces with a known singular-value decomposition (svd). In practice, such an svd is often only given for the case of a global expansion of the data (e.g. on the whole sphere) but not for regional data distributions. We show that, in either case, Slepian functions (associated to an arbitrarily prescribed region and the given compact operator) can be determined and applied to construct a regularization for the ill-posed regional inverse problem. Moreover, we describe an algorithm for constructing the Slepian basis via an algebraic eigenvalue problem. The obtained Slepian functions can be used to derive an svd for the combination of the regionalizing projection and the compact operator. As a result, standard regularization techniques relying on a known svd become applicable also to those inverse problems where the data are regionally given only. In particular, wavelet-based multiscale techniques can be used. An example for the latter case is elaborated theoretically and tested on two synthetic numerical examples.
Zalaletdinov, R. M.
1998-04-01
The averaging problem in general relativity is briefly discussed. A new setting of the problem as that of macroscopic description of gravitation is proposed. A covariant space-time averaging procedure is described. The structure of the geometry of macroscopic space-time, which follows from averaging Cartan's structure equations, is described and the correlation tensors present in the theory are discussed. The macroscopic field equations (averaged Einstein's equations) derived in the framework of the approach are presented and their structure is analysed. The correspondence principle for macroscopic gravity is formulated and a definition of the stress-energy tensor for the macroscopic gravitational field is proposed. It is shown that the physical meaning of using Einstein's equations with a hydrodynamic stress-energy tensor in looking for cosmological models means neglecting all gravitational field correlations. The system of macroscopic gravity equations to be solved when the correlations are taken into consideration is given and described.
Multigrid method applied to the solution of an elliptic, generalized eigenvalue problem
Energy Technology Data Exchange (ETDEWEB)
Alchalabi, R.M. [BOC Group, Murray Hill, NJ (United States); Turinsky, P.J. [North Carolina State Univ., Raleigh, NC (United States)
1996-12-31
The work presented in this paper is concerned with the development of an efficient MG algorithm for the solution of an elliptic, generalized eigenvalue problem. The application is specifically applied to the multigroup neutron diffusion equation which is discretized by utilizing the Nodal Expansion Method (NEM). The underlying relaxation method is the Power Method, also known as the (Outer-Inner Method). The inner iterations are completed using Multi-color Line SOR, and the outer iterations are accelerated using Chebyshev Semi-iterative Method. Furthermore, the MG algorithm utilizes the consistent homogenization concept to construct the restriction operator, and a form function as a prolongation operator. The MG algorithm was integrated into the reactor neutronic analysis code NESTLE, and numerical results were obtained from solving production type benchmark problems.
Application of alternating decision trees in selecting sparse linear solvers
Bhowmick, Sanjukta; Eijkhout, Victor; Freund, Yoav; Fuentes, Erika; Keyes, David E.
2010-01-01
The solution of sparse linear systems, a fundamental and resource-intensive task in scientific computing, can be approached through multiple algorithms. Using an algorithm well adapted to characteristics of the task can significantly enhance the performance, such as reducing the time required for the operation, without compromising the quality of the result. However, the best solution method can vary even across linear systems generated in course of the same PDE-based simulation, thereby making solver selection a very challenging problem. In this paper, we use a machine learning technique, Alternating Decision Trees (ADT), to select efficient solvers based on the properties of sparse linear systems and runtime-dependent features, such as the stages of simulation. We demonstrate the effectiveness of this method through empirical results over linear systems drawn from computational fluid dynamics and magnetohydrodynamics applications. The results also demonstrate that using ADT can resolve the problem of over-fitting, which occurs when limited amount of data is available. © 2010 Springer Science+Business Media LLC.
Learning to Solve Problems by Searching for Macro-Operators
1983-07-01
executing generalized robot plans. Aritificial Intelligence 3:25 1-288, 1972. [Frey 821 Frey, Alexander Ii. Jr., and David Singmaster. Handbook of Cubik...and that searching for macros may be a useful general learning paradigm. 1.1. Introduction One view of die die field of artificial intelligence is that... intelligence literature [Schofield 67, Gaschnig 79, Ericsson 761 and provides one of the simplest examples of the operation of the Macro Problem Solver. It
ALAM/CLAM and some applications of computer algebra systems to problems in general relativity
International Nuclear Information System (INIS)
Russell-Clark, R.A.
1973-01-01
This paper is divided into three parts. Part A presents a historical survey of the development of the system, a brief description of its features and, finally, a critical assessment. ALAM and CLAM have been used in many problems in General Relativity; the vast majority of these belong to a set of standard calculations termed ''metric applications''. However, four large non-standard applications have been attempted successfully and these are described in Part B. CAMAL is the only other system which has been used extensively for work in relativity. CAMAL has played an important role in two research projects and details of these are given in Part C
Comparison of three-dimensional ocean general circulation models on a benchmark problem
International Nuclear Information System (INIS)
Chartier, M.
1990-12-01
A french and an american Ocean General Circulation Models for deep-sea disposal of radioactive wastes are compared on a benchmark test problem. Both models are three-dimensional. They solve the hydrostatic primitive equations of the ocean with two different finite difference techniques. Results show that the dynamics simulated by both models are consistent. Several methods for the running of a model from a known state are tested in the French model: the diagnostic method, the prognostic method, the acceleration of convergence and the robust-diagnostic method
International Nuclear Information System (INIS)
Dattoli, G.; Torre, A.; Mancho, A.M.
2000-01-01
The theory of generalized Bessel functions has found significant applications in the analysis of radiation phenomena, associated with charges moving in magnetic devices. In this paper we exploit the monomiality principle to discuss the theory of two-variable Laguerre polynomials and introduce the associated Laguerre-Bessel functions. We study their properties (addition and multiplication theorems, generating function, recurrence relations and so on) and discuss the link with the ordinary case. The usefulness of the obtained results to treat problems relevant to the paraxial propagation of electromagnetic waves is also discussed.
Random matrix analysis of the QCD sign problem for general topology
International Nuclear Information System (INIS)
Bloch, Jacques; Wettig, Tilo
2009-01-01
Motivated by the important role played by the phase of the fermion determinant in the investigation of the sign problem in lattice QCD at nonzero baryon density, we derive an analytical formula for the average phase factor of the fermion determinant for general topology in the microscopic limit of chiral random matrix theory at nonzero chemical potential, for both the quenched and the unquenched case. The formula is a nontrivial extension of the expression for zero topology derived earlier by Splittorff and Verbaarschot. Our analytical predictions are verified by detailed numerical random matrix simulations of the quenched theory.
Conformal changes of metrics and the initial-value problem of general relativity
International Nuclear Information System (INIS)
Mielke, E.W.
1977-01-01
Conformal techniques are reviewed with respect to applications to the initial-value problem of general relativity. Invariant transverse traceless decompositions of tensors, one of its main tools, are related to representations of the group of 'conformeomorphisms' acting on the space of all Riemannian metrics on M. Conformal vector fields, a kernel in the decomposition, are analyzed on compact manifolds with constant scalar curvature. The realization of arbitrary functions as scalar curvature of conformally equivalent metrics, a generalization of Yamabe's (Osaka Math. J.; 12:12 (1960)) conjecture, is applied to the Hamiltonian constraint and to the issue of positive energy of gravitational fields. Various approaches to the solution of the initial-value equations produced by altering the scaling behaviour of the second fundamental form are compared. (author)
Multi-choice stochastic transportation problem involving general form of distributions.
Quddoos, Abdul; Ull Hasan, Md Gulzar; Khalid, Mohammad Masood
2014-01-01
Many authors have presented studies of multi-choice stochastic transportation problem (MCSTP) where availability and demand parameters follow a particular probability distribution (such as exponential, weibull, cauchy or extreme value). In this paper an MCSTP is considered where availability and demand parameters follow general form of distribution and a generalized equivalent deterministic model (GMCSTP) of MCSTP is obtained. It is also shown that all previous models obtained by different authors can be deduced with the help of GMCSTP. MCSTP with pareto, power function or burr-XII distributions are also considered and equivalent deterministic models are obtained. To illustrate the proposed model two numerical examples are presented and solved using LINGO 13.0 software package.
Some aspects of the inverse problem for general first order systems
International Nuclear Information System (INIS)
Sarlet, W.; Cantrijn, F.
1978-01-01
In this paper we investigate the most general systems of first-order ordinary differential equations which satisfy the integrability conditions of the inverse problem for canonical formulations, i.e., are derivable from a variational principle. It is shown that they have a structure which is invariant under arbitrary coordinate-transformations. A special class of transformations, called identity-isotopic transformations, is described. It is illustrated how these transformations share all properties with classical canonical transformations except one: the solutions of the system, viewed as transformations from the set of initial values, generally are not identity-isotopic. This failure is shown to be due to the explicit time-dependence of the functions which characterise the system, and the special role of this time-dependence is further clarified using the possibility of a reduction to conventional Hamiltonian systems. All properties are derived here within the framework of an analytic treatment of a system of differential equations
Iterative linear solvers in a 2D radiation-hydrodynamics code: Methods and performance
International Nuclear Information System (INIS)
Baldwin, C.; Brown, P.N.; Falgout, R.; Graziani, F.; Jones, J.
1999-01-01
Computer codes containing both hydrodynamics and radiation play a central role in simulating both astrophysical and inertial confinement fusion (ICF) phenomena. A crucial aspect of these codes is that they require an implicit solution of the radiation diffusion equations. The authors present in this paper the results of a comparison of five different linear solvers on a range of complex radiation and radiation-hydrodynamics problems. The linear solvers used are diagonally scaled conjugate gradient, GMRES with incomplete LU preconditioning, conjugate gradient with incomplete Cholesky preconditioning, multigrid, and multigrid-preconditioned conjugate gradient. These problems involve shock propagation, opacities varying over 5--6 orders of magnitude, tabular equations of state, and dynamic ALE (Arbitrary Lagrangian Eulerian) meshes. They perform a problem size scalability study by comparing linear solver performance over a wide range of problem sizes from 1,000 to 100,000 zones. The fundamental question they address in this paper is: Is it more efficient to invert the matrix in many inexpensive steps (like diagonally scaled conjugate gradient) or in fewer expensive steps (like multigrid)? In addition, what is the answer to this question as a function of problem size and is the answer problem dependent? They find that the diagonally scaled conjugate gradient method performs poorly with the growth of problem size, increasing in both iteration count and overall CPU time with the size of the problem and also increasing for larger time steps. For all problems considered, the multigrid algorithms scale almost perfectly (i.e., the iteration count is approximately independent of problem size and problem time step). For pure radiation flow problems (i.e., no hydrodynamics), they see speedups in CPU time of factors of ∼15--30 for the largest problems, when comparing the multigrid solvers relative to diagonal scaled conjugate gradient
A generalized electro-magneto-thermo-elastic problem for an infinitely long solid cylinder
International Nuclear Information System (INIS)
Tianhu, H.; Xiaogeng, T.; Yapeng, S.; Tianhu, H.
2005-01-01
The theory of generalized thermoelasticity, based on the theory of Lord and Shulman with one relaxation time, is used to study the electro-magneto-thermo-elastic interactions in an infinitely long perfectly conducting solid cylinder subjected to a thermal shock on its surface when the cylinder and its adjoining vacuum is subjected to a uniform axial magnetic field. The cylinder deforms because of thermal shock, and due to the application of the magnetic field, there result an induced magnetic and an induced electric field in the cylinder. The Maxwell's equations are formulated and the generalized electro-magneto-thermo-elastic coupled governing equations are established. By means of the Laplace transform and numerical Laplace inversion the problem is solved. The distributions of the considered temperature, stress, displacement, induced magnetic and electric field are represented graphically. From the distributions, it can be found the electromagnetic-thermoelastic coupled effects and the wave type heat propagation in the medium. This indicates that the generalized heat conduction mechanism is completely different from the classic Fourier's in essence. In generalized thermoelasticity theory heat propagates as a wave with finite velocity instead of infinite velocity in medium. (authors)
Extending the Finite Domain Solver of GNU Prolog
Bloemen, Vincent; Diaz, Daniel; van der Bijl, Machiel; Abreu, Salvador; Ströder, Thomas; Swift, Terrance
This paper describes three significant extensions for the Finite Domain solver of GNU Prolog. First, the solver now supports negative integers. Second, the solver detects and prevents integer overflows from occurring. Third, the internal representation of sparse domains has been redesigned to
Mataka, Lloyd M.; Cobern, William W.; Grunert, Megan L.; Mutambuki, Jacinta; Akom, George
2014-01-01
This study investigate the effectiveness of adding an "explicit general problem solving teaching strategy" (EGPS) to guided inquiry (GI) on pre-service elementary school teachers' ability to solve heat transfer problems. The pre-service elementary teachers in this study were enrolled in two sections of a chemistry course for pre-service…
Rouinfar, Amy; Agra, Elise; Larson, Adam M; Rebello, N Sanjay; Loschky, Lester C
2014-01-01
This study investigated links between visual attention processes and conceptual problem solving. This was done by overlaying visual cues on conceptual physics problem diagrams to direct participants' attention to relevant areas to facilitate problem solving. Participants (N = 80) individually worked through four problem sets, each containing a diagram, while their eye movements were recorded. Each diagram contained regions that were relevant to solving the problem correctly and separate regions related to common incorrect responses. Problem sets contained an initial problem, six isomorphic training problems, and a transfer problem. The cued condition saw visual cues overlaid on the training problems. Participants' verbal responses were used to determine their accuracy. This study produced two major findings. First, short duration visual cues which draw attention to solution-relevant information and aid in the organizing and integrating of it, facilitate both immediate problem solving and generalization of that ability to new problems. Thus, visual cues can facilitate re-representing a problem and overcoming impasse, enabling a correct solution. Importantly, these cueing effects on problem solving did not involve the solvers' attention necessarily embodying the solution to the problem, but were instead caused by solvers attending to and integrating relevant information in the problems into a solution path. Second, this study demonstrates that when such cues are used across multiple problems, solvers can automatize the extraction of problem-relevant information extraction. These results suggest that low-level attentional selection processes provide a necessary gateway for relevant information to be used in problem solving, but are generally not sufficient for correct problem solving. Instead, factors that lead a solver to an impasse and to organize and integrate problem information also greatly facilitate arriving at correct solutions.
International Nuclear Information System (INIS)
Minesaki, Yukitaka
2013-01-01
For the restricted three-body problem, we propose an accurate orbital integration scheme that retains all conserved quantities of the two-body problem with two primaries and approximately preserves the Jacobi integral. The scheme is obtained by taking the limit as mass approaches zero in the discrete-time general three-body problem. For a long time interval, the proposed scheme precisely reproduces various periodic orbits that cannot be accurately computed by other generic integrators
High-performance small-scale solvers for linear Model Predictive Control
DEFF Research Database (Denmark)
Frison, Gianluca; Sørensen, Hans Henrik Brandenborg; Dammann, Bernd
2014-01-01
, with the two main research areas of explicit MPC and tailored on-line MPC. State-of-the-art solvers in this second class can outperform optimized linear-algebra libraries (BLAS) only for very small problems, and do not explicitly exploit the hardware capabilities, relying on compilers for that. This approach...
A parallel direct solver for the self-adaptive hp Finite Element Method
Paszyński, Maciej R.; Pardo, David; Torres-Verdí n, Carlos; Demkowicz, Leszek F.; Calo, Victor M.
2010-01-01
measurement simulations problems. We measure the execution time and memory usage of the solver over a large regular mesh with 1.5 million degrees of freedom as well as on the highly non-regular mesh, generated by the self-adaptive h p-FEM, with finite elements
Bruce, David G; Paley, Glenys A; Underwood, Peter J; Roberts, David; Steed, Duncan
2002-08-19
To investigate the circumstances that led general practitioners to refer dementia sufferers and their carers to community support services. Qualitative study using semi-structured interviews, carried out between 1 September 1999 and 30 April 2000. 21 live-in carers of patients with dementia referred for the first time to a Western Australian metropolitan Aged Care Assessment Team, and 19 of their referring general practitioners. Most referrals occurred after the carers had been experiencing carer stress, and were precipitated by crisis situations. Carers failed to discuss their difficulties with the referring GP for a variety of reasons, including the belief that they should cope because it was their duty. The doctors found it difficult to know how the carers were coping or when to intervene, and some carers tended to resist their attempts to help. Time constraints were a significant problem for both groups. Attitudinal barriers in both carers of patients with dementia and GPs, combined with time constraints, often lead to inadequate assessment of carer problems. While it is important that strategies to improve communication between carers and GPs are developed, it would be sensible for GPs to assume that dementia carers are at risk of carer stress and should be encouraged to use community care services.
Directory of Open Access Journals (Sweden)
J.D. Quintana
2016-12-01
Full Text Available Over the years, there has been an evolution in the manner in which we perform traditional tasks. Nowadays, almost every simple action that we can think about involves the connection among two or more devices. It is desirable to have a high quality connection among devices, by using electronic or optical signals. Therefore, it is really important to have a reliable connection among terminals in the network. However, the transmission of the signal deteriorates when increasing the distance among devices. There exists a special piece of equipment that we can deploy in a network, called regenerator, which is able to restore the signal transmitted through it, in order to maintain its quality. Deploying a regenerator in a network is generally expensive, so it is important to minimize the number of regenerators used. In this paper we focus on the Generalized Regenerator Location Problem (GRLP, which tries to inÂnd the minimum number of regenerators that must be deployed in a network in order to have a reliable communication without loss of quality. We present a GRASP metaheuristic in order to inÂnd good solutions for the GRLP. The results obtained by the proposal are compared with the best previous methods for this problem. We conduct an extensive computational experience with 60 large and challenging instances, emerging the proposed method as the best performing one. This fact is inÂnally supported by non-parametric statistical tests.
Balancing Energy and Performance in Dense Linear System Solvers for Hybrid ARM+GPU platforms
Directory of Open Access Journals (Sweden)
Juan P. Silva
2016-04-01
Full Text Available The high performance computing community has traditionally focused uniquely on the reduction of execution time, though in the last years, the optimization of energy consumption has become a main issue. A reduction of energy usage without a degradation of performance requires the adoption of energy-efficient hardware platforms accompanied by the development of energy-aware algorithms and computational kernels. The solution of linear systems is a key operation for many scientific and engineering problems. Its relevance has motivated an important amount of work, and consequently, it is possible to find high performance solvers for a wide variety of hardware platforms. In this work, we aim to develop a high performance and energy-efficient linear system solver. In particular, we develop two solvers for a low-power CPU-GPU platform, the NVIDIA Jetson TK1. These solvers implement the Gauss-Huard algorithm yielding an efficient usage of the target hardware as well as an efficient memory access. The experimental evaluation shows that the novel proposal reports important savings in both time and energy-consumption when compared with the state-of-the-art solvers of the platform.
Lin, John J. H.; Lin, Sunny S. J.
2018-01-01
To deepen our understanding of those aspects of problems that cause the most difficulty for solvers, this study integrated eye-tracking with handwriting devices to investigate problem solvers' online processes while solving geometry problems. We are interested in whether the difference between successful and unsuccessful solvers can be identified…
Yihaa Roodhiyah, Lisa’; Tjong, Tiffany; Nurhasan; Sutarno, D.
2018-04-01
The late research, linear matrices of vector finite element in two dimensional(2-D) magnetotelluric (MT) responses modeling was solved by non-sparse direct solver in TE mode. Nevertheless, there is some weakness which have to be improved especially accuracy in the low frequency (10-3 Hz-10-5 Hz) which is not achieved yet and high cost computation in dense mesh. In this work, the solver which is used is sparse direct solver instead of non-sparse direct solverto overcome the weaknesses of solving linear matrices of vector finite element metod using non-sparse direct solver. Sparse direct solver will be advantageous in solving linear matrices of vector finite element method because of the matrix properties which is symmetrical and sparse. The validation of sparse direct solver in solving linear matrices of vector finite element has been done for a homogen half-space model and vertical contact model by analytical solution. Thevalidation result of sparse direct solver in solving linear matrices of vector finite element shows that sparse direct solver is more stable than non-sparse direct solver in computing linear problem of vector finite element method especially in low frequency. In the end, the accuracy of 2D MT responses modelling in low frequency (10-3 Hz-10-5 Hz) has been reached out under the efficient allocation memory of array and less computational time consuming.
Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
Directory of Open Access Journals (Sweden)
Alex Biryukov
2017-04-01
Full Text Available Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice protection tools, but the requirement for fast verification so far has made it an easy prey for GPU-, ASIC-, and botnet-equipped users. The attempts to rely on memory-intensive computations in order to remedy the disparity between architectures have resulted in slow or broken schemes. In this paper we solve this open problem and show how to construct an asymmetric proof-of-work (PoW based on a computationally-hard problem, which requires a great deal of memory to generate a proof (called a ”memory-hardness” feature but is instant to verify. Our primary proposal, Equihash, is a PoW based on the generalized birthday problem and enhanced Wagner’s algorithm for it. We introduce the new technique of algorithm binding to prevent cost amortization and demonstrate that possible parallel implementations are constrained by memory bandwidth. Our scheme has tunable and steep time-space tradeoffs, which impose large computational penalties if less memory is used. Our solution is practical and ready to deploy: a reference implementation of a proof-of-work requiring 700 MB of RAM runs in 15 seconds on a 2.1 GHz CPU, increases the computations by a factor of 1000 if memory is halved, and presents a proof of just 120 bytes long.
An analysis of the Rayleigh–Stokes problem for a generalized second-grade fluid
Bazhlekova, Emilia
2014-11-26
© 2014, The Author(s). We study the Rayleigh–Stokes problem for a generalized second-grade fluid which involves a Riemann–Liouville fractional derivative in time, and present an analysis of the problem in the continuous, space semidiscrete and fully discrete formulations. We establish the Sobolev regularity of the homogeneous problem for both smooth and nonsmooth initial data v, including v∈^{L2}(Ω). A space semidiscrete Galerkin scheme using continuous piecewise linear finite elements is developed, and optimal with respect to initial data regularity error estimates for the finite element approximations are derived. Further, two fully discrete schemes based on the backward Euler method and second-order backward difference method and the related convolution quadrature are developed, and optimal error estimates are derived for the fully discrete approximations for both smooth and nonsmooth initial data. Numerical results for one- and two-dimensional examples with smooth and nonsmooth initial data are presented to illustrate the efficiency of the method, and to verify the convergence theory.
An analysis of the Rayleigh–Stokes problem for a generalized second-grade fluid
Bazhlekova, Emilia; Jin, Bangti; Lazarov, Raytcho; Zhou, Zhi
2014-01-01
© 2014, The Author(s). We study the Rayleigh–Stokes problem for a generalized second-grade fluid which involves a Riemann–Liouville fractional derivative in time, and present an analysis of the problem in the continuous, space semidiscrete and fully discrete formulations. We establish the Sobolev regularity of the homogeneous problem for both smooth and nonsmooth initial data v, including v∈^{L2}(Ω). A space semidiscrete Galerkin scheme using continuous piecewise linear finite elements is developed, and optimal with respect to initial data regularity error estimates for the finite element approximations are derived. Further, two fully discrete schemes based on the backward Euler method and second-order backward difference method and the related convolution quadrature are developed, and optimal error estimates are derived for the fully discrete approximations for both smooth and nonsmooth initial data. Numerical results for one- and two-dimensional examples with smooth and nonsmooth initial data are presented to illustrate the efficiency of the method, and to verify the convergence theory.
The general linear thermoelastic end problem for solid and hollow cylinders
International Nuclear Information System (INIS)
Thompson, J.J.; Chen, P.Y.P.
1977-01-01
This paper reports on three topics arising from work in progress on theoretical and computational aspects of the utilization of self equilibrating and load stress systems, to solve thermoelastic problems of finite, or semi-infinite, solid or hollow circular cylinders, with particular reference to the pellets, rods, tubes and shells with arbitrary internal heat generation encountered in Nuclear Reactor Technology. Specifically the work is aimed at the evaluation of stress intensification factors in the end elastic boundary layer region, due to various thermal and mechanical end load conditions, in relation to the external, exact stress solutions, which satisfy conditions on the curved surfaces only and are valid over the remainder of the cylindrical body. More generally, it is possible, at least for symmetric thermoelastic problems, to derive exact external solutions, using self equilibrating end load systems, which describe the stress/displacement state completely as a combination of a simple local plane strain solution and a correction dependent on the magnitude of axial thermal gradients. Thus plane strain, and self equilibrating end load systems are sufficient for the complete external and boundary layer solution of a finite cylindrical body. This formulation is capable of further extension, e.g., to concentric multi-region problems, and provides a useful approach to the study of local stress intensification factors due to thermal perturbations
International Nuclear Information System (INIS)
Brassier, Stephane
1998-01-01
The Magnetohydrodynamic (MHD) equations represent the coupling between fluid dynamics equations and Maxwell's equations. We consider here a new MHD model with two temperatures. A Roe scheme is first constructed in the one dimensional case, for a multi-species model and a general equation of state. The multidimensional case is treated thanks to the Powell approach. The notion of Roe-Powell matrix, generalization of the notion of Roe matrix for multidimensional MHD, allows us to develop an original scheme on a curvilinear grid. We focus on a second part on the modelling of a Plasma Opening Switch (POS). A front-tracking method is first set up, in order to correctly handle the deformation of the front between the vacuum and the plasma. Besides, by taking into account a general Ohm's law, we have to deal with the Hall effect, which leads to nonlinear transport equations with discontinuous coefficients. Several numerical schemes are proposed and tested on a variety of test cases. This work has allowed us to construct an industrial MHD code, intended to handle complex flows and in particular to correctly simulate the behaviour of the POS. (author) [fr
A Direct Elliptic Solver Based on Hierarchically Low-Rank Schur Complements
Chávez, Gustavo
2017-03-17
A parallel fast direct solver for rank-compressible block tridiagonal linear systems is presented. Algorithmic synergies between Cyclic Reduction and Hierarchical matrix arithmetic operations result in a solver with O(Nlog2N) arithmetic complexity and O(NlogN) memory footprint. We provide a baseline for performance and applicability by comparing with well-known implementations of the $$\\\\mathcal{H}$$ -LU factorization and algebraic multigrid within a shared-memory parallel environment that leverages the concurrency features of the method. Numerical experiments reveal that this method is comparable with other fast direct solvers based on Hierarchical Matrices such as $$\\\\mathcal{H}$$ -LU and that it can tackle problems where algebraic multigrid fails to converge.
International Nuclear Information System (INIS)
Hindmarsh, A.C.; Petzold, L.R.
2005-01-01
1 - Description of program or function: LSODKR is a new initial value ODE solver for stiff and non-stiff systems. It is a variant of the LSODPK and LSODE solvers, intended mainly for large stiff systems. The main differences between LSODKR and LSODE are the following: a) for stiff systems, LSODKR uses a corrector iteration composed of Newton iteration and one of four preconditioned Krylov subspace iteration methods. The user must supply routines for the preconditioning operations, b) within the corrector iteration, LSODKR does automatic switching between functional (fix point) iteration and modified Newton iteration, The nonlinear iteration method-switching differs from the method-switching in LSODA and LSODAR, but provides similar savings by using the cheaper method in the non-stiff regions of the problem. c) LSODKR includes the ability to find roots of given functions of the solution during the integration. d) LSODKR also improves on the Krylov methods in LSODPK by offering the option to save and reuse the approximate Jacobian data underlying the pre-conditioner. The LSODKR source is commented extensively to facilitate modification. Both a single-precision version and a double-precision version are available. 2 - Methods: It is assumed that the ODEs are given explicitly, so that the system can be written in the form dy/dt = f(t,y), where y is the vector of dependent variables, and t is the independent variable. Integration is by Adams or BDF (Backward Differentiation Formula) methods, at user option. Corrector iteration is by Newton or fix point iteration, determined dynamically. Linear system solution is by a preconditioned Krylov iteration, selected by user from Incomplete Orthogonalization Method, Generalized Minimum Residual Method, and two variants of Preconditioned Conjugate Gradient Method. Preconditioning is to be supplied by the user
Algorithms for parallel flow solvers on message passing architectures
Vanderwijngaart, Rob F.
1995-01-01
The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those
Diffusion of Zonal Variables Using Node-Centered Diffusion Solver
Energy Technology Data Exchange (ETDEWEB)
Yang, T B
2007-08-06
Tom Kaiser [1] has done some preliminary work to use the node-centered diffusion solver (originally developed by T. Palmer [2]) in Kull for diffusion of zonal variables such as electron temperature. To avoid numerical diffusion, Tom used a scheme developed by Shestakov et al. [3] and found their scheme could, in the vicinity of steep gradients, decouple nearest-neighbor zonal sub-meshes leading to 'alternating-zone' (red-black mode) errors. Tom extended their scheme to couple the sub-meshes with appropriate chosen artificial diffusion and thereby solved the 'alternating-zone' problem. Because the choice of the artificial diffusion coefficient could be very delicate, it is desirable to use a scheme that does not require the artificial diffusion but still able to avoid both numerical diffusion and the 'alternating-zone' problem. In this document we present such a scheme.
A comparison of viscous-plastic sea ice solvers with and without replacement pressure
Kimmritz, Madlen; Losch, Martin; Danilov, Sergey
2017-07-01
Recent developments of the explicit elastic-viscous-plastic (EVP) solvers call for a new comparison with implicit solvers for the equations of viscous-plastic sea ice dynamics. In Arctic sea ice simulations, the modified and the adaptive EVP solvers, and the implicit Jacobian-free Newton-Krylov (JFNK) solver are compared against each other. The adaptive EVP method shows convergence rates that are generally similar or even better than those of the modified EVP method, but the convergence of the EVP methods is found to depend dramatically on the use of the replacement pressure (RP). Apparently, using the RP can affect the pseudo-elastic waves in the EVP methods by introducing extra non-physical oscillations so that, in the extreme case, convergence to the VP solution can be lost altogether. The JFNK solver also suffers from higher failure rates with RP implying that with RP the momentum equations are stiffer and more difficult to solve. For practical purposes, both EVP methods can be used efficiently with an unexpectedly low number of sub-cycling steps without compromising the solutions. The differences between the RP solutions and the NoRP solutions (when the RP is not being used) can be reduced with lower thresholds of viscous regularization at the cost of increasing stiffness of the equations, and hence the computational costs of solving them.
ODEPACK, Initial Value Problems of Ordinary Differential Equation System
International Nuclear Information System (INIS)
Hindmarsh, A.C.; Petzold, L.R.
2005-01-01
I - Description of program or function: ODEPACK is a collection of Fortran solvers for the initial value problem for ordinary differential equation systems. It consists of nine solvers, namely a basic solver called LSODE and eight variants of it -- LSODES, LSODA, LSODAR, LSODPK, LSODKR, LSODI, LSOIBT, and LSODIS. The collection is suitable for both stiff and non-stiff systems. It includes solvers for systems given in explicit form, dy/dt = f(t,y), and also solvers for systems given in linearly implicit form, A(t,y) dy/dt = g(t,y). Two of the solvers use general sparse matrix solvers for the linear systems that arise. Two others use iterative (preconditioned Krylov) methods instead of direct methods for these linear systems. The most recent addition is LSODIS, which solves implicit problems with general sparse treatment of all matrices involved. The ODEPACK solvers are written in standard Fortran 77, with a few exceptions, and with minimal machine dependencies. There are separate double and single precision versions of ODEPACK. The actual solver names are those given above with a prefix of D- or S- for the double or single precision version, respectively, i.e. DLSODE/SLSODE, etc. Each solver consists of a main driver subroutine having the same name as the solver and some number of subordinate routines. For each solver, there is also a demonstration program, which solves one or two simple problems in a somewhat self-checking manner. A. Solvers for explicitly given systems. For each of the following solvers, it is assumed that the ODEs are given explicitly, so that the system can be written in the form dy/dt = f(t,y), where y is the vector of dependent variables, and t is the independent variable. 1. LSODE (Livermore Solver for Ordinary Differential Equations) is the basic solver of the collection. It solves stiff and non-stiff systems of the form dy/dt = f. In the stiff case, it treats the Jacobian matrix df/dy as either a dense (full) or a banded matrix, and as
Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers
Woźniak, Maciej
2014-06-01
In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.
Computational cost estimates for parallel shared memory isogeometric multi-frontal solvers
Woźniak, Maciej; Kuźnik, Krzysztof M.; Paszyński, Maciej R.; Calo, Victor M.; Pardo, D.
2014-01-01
In this paper we present computational cost estimates for parallel shared memory isogeometric multi-frontal solvers. The estimates show that the ideal isogeometric shared memory parallel direct solver scales as O( p2log(N/p)) for one dimensional problems, O(Np2) for two dimensional problems, and O(N4/3p2) for three dimensional problems, where N is the number of degrees of freedom, and p is the polynomial order of approximation. The computational costs of the shared memory parallel isogeometric direct solver are compared with those corresponding to the sequential isogeometric direct solver, being the latest equal to O(N p2) for the one dimensional case, O(N1.5p3) for the two dimensional case, and O(N2p3) for the three dimensional case. The shared memory version significantly reduces both the scalability in terms of N and p. Theoretical estimates are compared with numerical experiments performed with linear, quadratic, cubic, quartic, and quintic B-splines, in one and two spatial dimensions. © 2014 Elsevier Ltd. All rights reserved.
Asynchronous Parallelization of a CFD Solver
Abdi, Daniel S.; Bitsuamlak, Girma T.
2015-01-01
The article of record as published may be found at http://dx.doi.org/10.1155/2015/295393 A Navier-Stokes equations solver is parallelized to run on a cluster of computers using the domain decomposition method. Two approaches of communication and computation are investigated, namely, synchronous and asynchronous methods. Asynchronous communication between subdomains is not commonly used inCFDcodes; however, it has a potential to alleviate scaling bottlenecks incurred due to process...
Chemical Mechanism Solvers in Air Quality Models
Directory of Open Access Journals (Sweden)
John C. Linford
2011-09-01
Full Text Available The solution of chemical kinetics is one of the most computationally intensivetasks in atmospheric chemical transport simulations. Due to the stiff nature of the system,implicit time stepping algorithms which repeatedly solve linear systems of equations arenecessary. This paper reviews the issues and challenges associated with the construction ofefficient chemical solvers, discusses several families of algorithms, presents strategies forincreasing computational efficiency, and gives insight into implementing chemical solverson accelerated computer architectures.
Optimal Stochastic Control Problem for General Linear Dynamical Systems in Neuroscience
Directory of Open Access Journals (Sweden)
Yan Chen
2017-01-01
Full Text Available This paper considers a d-dimensional stochastic optimization problem in neuroscience. Suppose the arm’s movement trajectory is modeled by high-order linear stochastic differential dynamic system in d-dimensional space, the optimal trajectory, velocity, and variance are explicitly obtained by using stochastic control method, which allows us to analytically establish exact relationships between various quantities. Moreover, the optimal trajectory is almost a straight line for a reaching movement; the optimal velocity bell-shaped and the optimal variance are consistent with the experimental Fitts law; that is, the longer the time of a reaching movement, the higher the accuracy of arriving at the target position, and the results can be directly applied to designing a reaching movement performed by a robotic arm in a more general environment.
International Nuclear Information System (INIS)
Kuzovkov, V N
2011-01-01
The goal of this paper is twofold. First, based on the interpretation of a quantum tight-binding model in terms of a classical Hamiltonian map, we consider the Anderson localization (AL) problem as the Fermi-Pasta-Ulam (FPU) effect in a modified dynamical system containing both stable and unstable (inverted) modes. Delocalized states in the AL are analogous to the stable quasi-periodic motion in FPU, whereas localized states are analogous to thermalization, respectively. The second aim is to use the classical Hamilton map for a simplified derivation of exact equations for the localization operator H(z). The latter was presented earlier (Kuzovkov et al 2002 J. Phys.: Condens. Matter 14 13777) treating the AL as a generalized diffusion in a dynamical system. We demonstrate that counter-intuitive results of our studies of the AL are similar to the FPU counter-intuitivity.
Normal Mode Analysis to a Poroelastic Half-Space Problem under Generalized Thermoelasticity
Directory of Open Access Journals (Sweden)
Chunbao Xiong
Full Text Available Abstract The thermo-hydro-mechanical problems associated with a poroelastic half-space soil medium with variable properties under generalized thermoelasticity theory were investigated in this study. By remaining faithful to Biot’s theory of dynamic poroelasticity, we idealized the foundation material as a uniform, fully saturated, poroelastic half-space medium. We first subjected this medium to time harmonic loads consisting of normal or thermal loads, then investigated the differences between the coupled thermohydro-mechanical dynamic models and the thermo-elastic dynamic models. We used normal mode analysis to solve the resulting non-dimensional coupled equations, then investigated the effects that non-dimensional vertical displacement, excess pore water pressure, vertical stress, and temperature distribution exerted on the poroelastic half-space medium and represented them graphically.
Kuzovkov, V. N.
2011-12-01
The goal of this paper is twofold. First, based on the interpretation of a quantum tight-binding model in terms of a classical Hamiltonian map, we consider the Anderson localization (AL) problem as the Fermi-Pasta-Ulam (FPU) effect in a modified dynamical system containing both stable and unstable (inverted) modes. Delocalized states in the AL are analogous to the stable quasi-periodic motion in FPU, whereas localized states are analogous to thermalization, respectively. The second aim is to use the classical Hamilton map for a simplified derivation of exact equations for the localization operator H(z). The latter was presented earlier (Kuzovkov et al 2002 J. Phys.: Condens. Matter 14 13777) treating the AL as a generalized diffusion in a dynamical system. We demonstrate that counter-intuitive results of our studies of the AL are similar to the FPU counter-intuitivity.
An Optimal Order Nonnested Mixed Multigrid Method for Generalized Stokes Problems
Deng, Qingping
1996-01-01
A multigrid algorithm is developed and analyzed for generalized Stokes problems discretized by various nonnested mixed finite elements within a unified framework. It is abstractly proved by an element-independent analysis that the multigrid algorithm converges with an optimal order if there exists a 'good' prolongation operator. A technique to construct a 'good' prolongation operator for nonnested multilevel finite element spaces is proposed. Its basic idea is to introduce a sequence of auxiliary nested multilevel finite element spaces and define a prolongation operator as a composite operator of two single grid level operators. This makes not only the construction of a prolongation operator much easier (the final explicit forms of such prolongation operators are fairly simple), but the verification of the approximate properties for prolongation operators is also simplified. Finally, as an application, the framework and technique is applied to seven typical nonnested mixed finite elements.
A Generalized Measure for the Optimal Portfolio Selection Problem and its Explicit Solution
Directory of Open Access Journals (Sweden)
Zinoviy Landsman
2018-03-01
Full Text Available In this paper, we offer a novel class of utility functions applied to optimal portfolio selection. This class incorporates as special cases important measures such as the mean-variance, Sharpe ratio, mean-standard deviation and others. We provide an explicit solution to the problem of optimal portfolio selection based on this class. Furthermore, we show that each measure in this class generally reduces to the efficient frontier that coincides or belongs to the classical mean-variance efficient frontier. In addition, a condition is provided for the existence of the a one-to-one correspondence between the parameter of this class of utility functions and the trade-off parameter λ in the mean-variance utility function. This correspondence essentially provides insight into the choice of this parameter. We illustrate our results by taking a portfolio of stocks from National Association of Securities Dealers Automated Quotation (NASDAQ.
International Nuclear Information System (INIS)
Sadjadi, Seyed Jafar; Soltani, R.
2009-01-01
We present a heuristic approach to solve a general framework of serial-parallel redundancy problem where the reliability of the system is maximized subject to some general linear constraints. The complexity of the redundancy problem is generally considered to be NP-Hard and the optimal solution is not normally available. Therefore, to evaluate the performance of the proposed method, a hybrid genetic algorithm is also implemented whose parameters are calibrated via Taguchi's robust design method. Then, various test problems are solved and the computational results indicate that the proposed heuristic approach could provide us some promising reliabilities, which are fairly close to optimal solutions in a reasonable amount of time.
LAGRANGE SOLUTIONS TO THE DISCRETE-TIME GENERAL THREE-BODY PROBLEM
International Nuclear Information System (INIS)
Minesaki, Yukitaka
2013-01-01
There is no known integrator that yields exact orbits for the general three-body problem (G3BP). It is difficult to verify whether a numerical procedure yields the correct solutions to the G3BP because doing so requires knowledge of all 11 conserved quantities, whereas only six are known. Without tracking all of the conserved quantities, it is possible to show that the discrete general three-body problem (d-G3BP) yields the correct orbits corresponding to Lagrange solutions of the G3BP. We show that the d-G3BP yields the correct solutions to the G3BP for two special cases: the equilateral triangle and collinear configurations. For the triangular solution, we use the fact that the solution to the three-body case is a superposition of the solutions to the three two-body cases, and we show that the three bodies maintain the same relative distances at all times. To obtain the collinear solution, we assume a specific permutation of the three bodies arranged along a straight rotating line, and we show that the d-G3BP maintains the same distance ratio between two bodies as in the G3BP. Proving that the d-G3BP solutions for these cases are equivalent to those of the G3BP makes it likely that the d-G3BP and G3BP solutions are equivalent in other cases. To our knowledge, this is the first work that proves the equivalence of the discrete solutions and the Lagrange orbits.
A Generalized Mathematical Model for the Fracture Problem of the Suspended Highway
Directory of Open Access Journals (Sweden)
Zhao Ying
2017-01-01
Full Text Available In order to answer dangling fracture problems of highway, the suspended pavement equivalent for non - suspended pavement, through the special boundary conditions has been suspended highway stress field of expression, in accordance with the 3D fracture model of crack formation, and establish a vacant, a general mathematics model for fracture problems of highway and analysis in highway suspended segment weight and vehicle load limit of highway capacity of Pu For overturning road inPu is less than the force of carrying more than compared to the work and fruit Bridge Hydropower Station Road engineering examples to verify suspended highway should force field expressions for the correctness and applicability. The results show that: when the hanging ratio R 0. 243177 limits of Pu design axle load 100kN. When the vertical crack in the vacant in the direction of length greater than 0. 1, the ultimate bearing capacity is less than the design axle load 100kN; when the hanging ratio R is less than 0. 5, the road to local fracture, the ultimate bearing capacity of suspended stress field expressions in solution; when the hanging ratio is greater than or equal to 0. 5, the road does not reach the limit bearing capacity of the whole body; torque shear surface of the effect is far less than the bending moments on shear planes.
Recruitment and retention of general practitioners in the UK: what are the problems and solutions?
Young, R; Leese, B
1999-10-01
Recruitment and retention of general practitioners (GPs) has become an issue of major concern in recent years. However, much of the evidence is anecdotal and some commentators continue to question the scale of workforce problems. Hence, there is a need to establish a clear picture of those instabilities (i.e. imbalances between demand and supply) that do exist in the GP labour market in the UK. Based on a review of the published literature, we identify problems that stem from: (i) the changing social composition of the workforce and the fact that a large proportion of qualified GPs are significantly underutilized within traditional career structures; and (ii) the considerable differences in the ability of local areas to match labour demand and supply. We argue that one way to address these problems would be to encourage greater flexibility in a number of areas highlighted in the literature: (i) time commitment across the working day and week; (ii) long-term career paths; (iii) training and education; and (iv) remuneration and contract conditions. Overall, although the evidence suggests that the predicted 'crisis' has not yet occurred in the GP labour market as a whole, there is no room for lack of imagination in planning terms. Workforce planners continue to emphasize national changes to the medical school intake as the means to balance labour demand and supply between the specialities; however, better retention and deployment of existing GP labour would arguably produce more effective supply-side solutions. In this context, current policy and practice developments (e.g. Primary Care Groups and Primary Care Act Pilot Sites) offer a unique learning base upon which to move forward.
Development of a Cartesian grid based CFD solver (CARBS)
International Nuclear Information System (INIS)
Vaidya, A.M.; Maheshwari, N.K.; Vijayan, P.K.
2013-12-01
Formulation for 3D transient incompressible CFD solver is developed. The solution of variable property, laminar/turbulent, steady/unsteady, single/multi specie, incompressible with heat transfer in complex geometry will be obtained. The formulation can handle a flow system in which any number of arbitrarily shaped solid and fluid regions are present. The solver is based on the use of Cartesian grids. A method is proposed to handle complex shaped objects and boundaries on Cartesian grids. Implementation of multi-material, different types of boundary conditions, thermo physical properties is also considered. The proposed method is validated by solving two test cases. 1 st test case is that of lid driven flow in inclined cavity. 2 nd test case is the flow over cylinder. The 1 st test case involved steady internal flow subjected to WALL boundaries. The 2 nd test case involved unsteady external flow subjected to INLET, OUTLET and FREE-SLIP boundary types. In both the test cases, non-orthogonal geometry was involved. It was found that, under such a wide conditions, the Cartesian grid based code was found to give results which were matching well with benchmark data. Convergence characteristics are excellent. In all cases, the mass residue was converged to 1E-8. Based on this, development of 3D general purpose code based on the proposed approach can be taken up. (author)
Solving the patient zero inverse problem by using generalized simulated annealing
Menin, Olavo H.; Bauch, Chris T.
2018-01-01
Identifying patient zero - the initially infected source of a given outbreak - is an important step in epidemiological investigations of both existing and emerging infectious diseases. Here, the use of the Generalized Simulated Annealing algorithm (GSA) to solve the inverse problem of finding the source of an outbreak is studied. The classical disease natural histories susceptible-infected (SI), susceptible-infected-susceptible (SIS), susceptible-infected-recovered (SIR) and susceptible-infected-recovered-susceptible (SIRS) in a regular lattice are addressed. Both the position of patient zero and its time of infection are considered unknown. The algorithm performance with respect to the generalization parameter q˜v and the fraction ρ of infected nodes for whom infection was ascertained is assessed. Numerical experiments show the algorithm is able to retrieve the epidemic source with good accuracy, even when ρ is small, but present no evidence to support that GSA performs better than its classical version. Our results suggest that simulated annealing could be a helpful tool for identifying patient zero in an outbreak where not all cases can be ascertained.
Two-point boundary value and Cauchy formulations in an axisymmetrical MHD equilibrium problem
International Nuclear Information System (INIS)
Atanasiu, C.V.; Subbotin, A.A.
1999-01-01
In this paper we present two equilibrium solvers for axisymmetrical toroidal configurations, both based on the expansion in poloidal angle method. The first one has been conceived as a two-point boundary value solver in a system of coordinates with straight field lines, while the second one uses a well-conditioned Cauchy formulation of the problem in a general curvilinear coordinate system. In order to check the capability of our moment methods to describe equilibrium accurately, a comparison of the moment solutions with analytical solutions obtained for a Solov'ev equilibrium has been performed. (author)
Sweller, John; Clark, Richard; Kirschner, Paul A.
2010-01-01
Sweller, J., Clark, R., & Kirschner, P. A. (2010). Teaching general problem-solving skills is not a substitute for, or a viable addition to, teaching mathematics. Notices of the American Mathematical Society, 57, 1303-1304.
S.E. Mous (Sabine)
2015-01-01
markdownabstractThis thesis focuses on the neurobiology and neuropsychology of attention-deficit/hyperactivity problems in the general population. The notion that child psychopathology might be better described within a dimensional framework, rather than with clearly defined diagnostic categories,
International Nuclear Information System (INIS)
Nelson, E.M.
1993-12-01
Some two-dimensional finite element electromagnetic field solvers are described and tested. For TE and TM modes in homogeneous cylindrical waveguides and monopole modes in homogeneous axisymmetric structures, the solvers find approximate solutions to a weak formulation of the wave equation. Second-order isoparametric lagrangian triangular elements represent the field. For multipole modes in axisymmetric structures, the solver finds approximate solutions to a weak form of the curl-curl formulation of Maxwell's equations. Second-order triangular edge elements represent the radial (ρ) and axial (z) components of the field, while a second-order lagrangian basis represents the azimuthal (φ) component of the field weighted by the radius ρ. A reduced set of basis functions is employed for elements touching the axis. With this basis the spurious modes of the curl-curl formulation have zero frequency, so spurious modes are easily distinguished from non-static physical modes. Tests on an annular ring, a pillbox and a sphere indicate the solutions converge rapidly as the mesh is refined. Computed eigenvalues with relative errors of less than a few parts per million are obtained. Boundary conditions for symmetric, periodic and symmetric-periodic structures are discussed and included in the field solver. Boundary conditions for structures with inversion symmetry are also discussed. Special corner elements are described and employed to improve the accuracy of cylindrical waveguide and monopole modes with singular fields at sharp corners. The field solver is applied to three problems: (1) cross-field amplifier slow-wave circuits, (2) a detuned disk-loaded waveguide linear accelerator structure and (3) a 90 degrees overmoded waveguide bend. The detuned accelerator structure is a critical application of this high accuracy field solver. To maintain low long-range wakefields, tight design and manufacturing tolerances are required
Toward robust scalable algebraic multigrid solvers
International Nuclear Information System (INIS)
Waisman, Haim; Schroder, Jacob; Olson, Luke; Hiriyur, Badri; Gaidamour, Jeremie; Siefert, Christopher; Hu, Jonathan Joseph; Tuminaro, Raymond Stephen
2010-01-01
This talk highlights some multigrid challenges that arise from several application areas including structural dynamics, fluid flow, and electromagnetics. A general framework is presented to help introduce and understand algebraic multigrid methods based on energy minimization concepts. Connections between algebraic multigrid prolongators and finite element basis functions are made to explored. It is shown how the general algebraic multigrid framework allows one to adapt multigrid ideas to a number of different situations. Examples are given corresponding to linear elasticity and specifically in the solution of linear systems associated with extended finite elements for fracture problems.
A wavelet-based PWTD algorithm-accelerated time domain surface integral equation solver
Liu, Yang
2015-10-26
© 2015 IEEE. The multilevel plane-wave time-domain (PWTD) algorithm allows for fast and accurate analysis of transient scattering from, and radiation by, electrically large and complex structures. When used in tandem with marching-on-in-time (MOT)-based surface integral equation (SIE) solvers, it reduces the computational and memory costs of transient analysis from equation and equation to equation and equation, respectively, where Nt and Ns denote the number of temporal and spatial unknowns (Ergin et al., IEEE Trans. Antennas Mag., 41, 39-52, 1999). In the past, PWTD-accelerated MOT-SIE solvers have been applied to transient problems involving half million spatial unknowns (Shanker et al., IEEE Trans. Antennas Propag., 51, 628-641, 2003). Recently, a scalable parallel PWTD-accelerated MOT-SIE solver that leverages a hiearchical parallelization strategy has been developed and successfully applied to the transient problems involving ten million spatial unknowns (Liu et. al., in URSI Digest, 2013). We further enhanced the capabilities of this solver by implementing a compression scheme based on local cosine wavelet bases (LCBs) that exploits the sparsity in the temporal dimension (Liu et. al., in URSI Digest, 2014). Specifically, the LCB compression scheme was used to reduce the memory requirement of the PWTD ray data and computational cost of operations in the PWTD translation stage.
Seo, Jongmin; Schiavazzi, Daniele; Marsden, Alison
2017-11-01
Cardiovascular simulations are increasingly used in clinical decision making, surgical planning, and disease diagnostics. Patient-specific modeling and simulation typically proceeds through a pipeline from anatomic model construction using medical image data to blood flow simulation and analysis. To provide confidence intervals on simulation predictions, we use an uncertainty quantification (UQ) framework to analyze the effects of numerous uncertainties that stem from clinical data acquisition, modeling, material properties, and boundary condition selection. However, UQ poses a computational challenge requiring multiple evaluations of the Navier-Stokes equations in complex 3-D models. To achieve efficiency in UQ problems with many function evaluations, we implement and compare a range of iterative linear solver and preconditioning techniques in our flow solver. We then discuss applications to patient-specific cardiovascular simulation and how the problem/boundary condition formulation in the solver affects the selection of the most efficient linear solver. Finally, we discuss performance improvements in the context of uncertainty propagation. Support from National Institute of Health (R01 EB018302) is greatly appreciated.
Improving mathematical problem solving : A computerized approach
Harskamp, EG; Suhre, CJM
Mathematics teachers often experience difficulties in teaching students to become skilled problem solvers. This paper evaluates the effectiveness of two interactive computer programs for high school mathematics problem solving. Both programs present students with problems accompanied by instruction
van der Hoorn, Anouk; Oldehinkel, A.J.; Ormel, J.; Bruggeman, R; Uiterwaal, C.S.P.M.; Burger, Huib
2010-01-01
To determine whether the association between non-right-handedness and mental problems among adolescents is specific for psychotic symptoms, we included a group of 2096 adolescents with a mean age of 14 years from the general population. Mental health problems were assessed using the parent,
Generalized Uncertainty Quantification for Linear Inverse Problems in X-ray Imaging
Energy Technology Data Exchange (ETDEWEB)
Fowler, Michael James [Clarkson Univ., Potsdam, NY (United States)
2014-04-25
In industrial and engineering applications, X-ray radiography has attained wide use as a data collection protocol for the assessment of material properties in cases where direct observation is not possible. The direct measurement of nuclear materials, particularly when they are under explosive or implosive loading, is not feasible, and radiography can serve as a useful tool for obtaining indirect measurements. In such experiments, high energy X-rays are pulsed through a scene containing material of interest, and a detector records a radiograph by measuring the radiation that is not attenuated in the scene. One approach to the analysis of these radiographs is to model the imaging system as an operator that acts upon the object being imaged to produce a radiograph. In this model, the goal is to solve an inverse problem to reconstruct the values of interest in the object, which are typically material properties such as density or areal density. The primary objective in this work is to provide quantitative solutions with uncertainty estimates for three separate applications in X-ray radiography: deconvolution, Abel inversion, and radiation spot shape reconstruction. For each problem, we introduce a new hierarchical Bayesian model for determining a posterior distribution on the unknowns and develop efficient Markov chain Monte Carlo (MCMC) methods for sampling from the posterior. A Poisson likelihood, based on a noise model for photon counts at the detector, is combined with a prior tailored to each application: an edge-localizing prior for deconvolution; a smoothing prior with non-negativity constraints for spot reconstruction; and a full covariance sampling prior based on a Wishart hyperprior for Abel inversion. After developing our methods in a general setting, we demonstrate each model on both synthetically generated datasets, including those from a well known radiation transport code, and real high energy radiographs taken at two U. S. Department of Energy
Johnson, David T.
Quantum mechanics is an extremely successful and accurate physical theory, yet since its inception, it has been afflicted with numerous conceptual difficulties. The primary subject of this thesis is the theory of entropic quantum dynamics (EQD), which seeks to avoid these conceptual problems by interpreting quantum theory from an informational perspective. We begin by reviewing Cox's work in describing probability theory as a means of rationally and consistently quantifying uncertainties. We then discuss how probabilities can be updated according to either Bayes' theorem or the extended method of maximum entropy (ME). After that discussion, we review the work of Caticha and Giffin that shows that Bayes' theorem is a special case of ME. This important result demonstrates that the ME method is the general method for updating probabilities. We then review some motivating difficulties in quantum mechanics before discussing Caticha's work in deriving quantum theory from the approach of entropic dynamics, which concludes our review. After entropic dynamics is introduced, we develop the concepts of symmetries and transformations from an informational perspective. The primary result is the formulation of a symmetry condition that any transformation must satisfy in order to qualify as a symmetry in EQD. We then proceed to apply this condition to the extended Galilean transformation. This transformation is of interest as it exhibits features of both special and general relativity. The transformation yields a gravitational potential that arises from an equivalence of information. We conclude the thesis with a discussion of the measurement problem in quantum mechanics. We discuss the difficulties that arise in the standard quantum mechanical approach to measurement before developing our theory of entropic measurement. In entropic dynamics, position is the only observable. We show how a theory built on this one observable can account for the multitude of measurements present in
POSSOL, 2-D Poisson Equation Solver for Nonuniform Grid
International Nuclear Information System (INIS)
Orvis, W.J.
1988-01-01
1 - Description of program or function: POSSOL is a two-dimensional Poisson equation solver for problems with arbitrary non-uniform gridding in Cartesian coordinates. It is an adaptation of the uniform grid PWSCRT routine developed by Schwarztrauber and Sweet at the National Center for Atmospheric Research (NCAR). 2 - Method of solution: POSSOL will solve the Helmholtz equation on an arbitrary, non-uniform grid on a rectangular domain allowing only one type of boundary condition on any one side. It can also be used to handle more than one type of boundary condition on a side by means of a capacitance matrix technique. There are three types of boundary conditions that can be applied: fixed, derivative, or periodic
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan; Kolmbauer, Michael; Langer, Ulrich
2010-01-01
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
Domain Decomposition Solvers for Frequency-Domain Finite Element Equations
Copeland, Dylan
2010-10-05
The paper is devoted to fast iterative solvers for frequency-domain finite element equations approximating linear and nonlinear parabolic initial boundary value problems with time-harmonic excitations. Switching from the time domain to the frequency domain allows us to replace the expensive time-integration procedure by the solution of a simple linear elliptic system for the amplitudes belonging to the sine- and to the cosine-excitation or a large nonlinear elliptic system for the Fourier coefficients in the linear and nonlinear case, respectively. The fast solution of the corresponding linear and nonlinear system of finite element equations is crucial for the competitiveness of this method. © 2011 Springer-Verlag Berlin Heidelberg.
GPU accelerated FDTD solver and its application in MRI.
Chi, J; Liu, F; Jin, J; Mason, D G; Crozier, S
2010-01-01
The finite difference time domain (FDTD) method is a popular technique for computational electromagnetics (CEM). The large computational power often required, however, has been a limiting factor for its applications. In this paper, we will present a graphics processing unit (GPU)-based parallel FDTD solver and its successful application to the investigation of a novel B1 shimming scheme for high-field magnetic resonance imaging (MRI). The optimized shimming scheme exhibits considerably improved transmit B(1) profiles. The GPU implementation dramatically shortened the runtime of FDTD simulation of electromagnetic field compared with its CPU counterpart. The acceleration in runtime has made such investigation possible, and will pave the way for other studies of large-scale computational electromagnetic problems in modern MRI which were previously impractical.
Jump as Far as You Can [Problem Solvers: Solutions
Yigit, Melike; Bofferding, Laura; Warnock, Miranda
2014-01-01
The How Far Do You Think You Can Jump? activity (see EJ1174770) was completed in three different contexts: an after-school mathematics enrichment program at Woodland and Country Schools in Weston, Massachusetts; a small-group pull-out of second graders at Wren Elementary in Piedmont, South Carolina; and a family math night in Lafayette, Indiana.…
Nonlinear Chance Constrained Problems: Optimality Conditions, Regularization and Solvers
Czech Academy of Sciences Publication Activity Database
Adam, Lukáš; Branda, Martin
2016-01-01
Roč. 170, č. 2 (2016), s. 419-436 ISSN 0022-3239 R&D Projects: GA ČR GA15-00735S Institutional support: RVO:67985556 Keywords : Chance constrained programming * Optimality conditions * Regularization * Algorithms * Free MATLAB codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.289, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0460909.pdf
Parallel time domain solvers for electrically large transient scattering problems
Liu, Yang; Yucel, Abdulkadir; Bagcý , Hakan; Michielssen, Eric
2014-01-01
scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary
Overweight in adolescent, psychiatric inpatients: A problem of general or food-specific impulsivity?
Deux, Natalie; Schlarb, Angelika A; Martin, Franziska; Holtmann, Martin; Hebebrand, Johannes; Legenbauer, Tanja
2017-05-01
Adolescent psychiatric patients are vulnerable to weight problems and show an overrepresentation of overweight compared to the healthy population. One potential factor that can contribute to the etiology of overweight is higher impulsivity. As of yet, it is unclear whether it is a general impulse control deficit or weight-related aspects such as lower impulse control in response to food that have an impact on body weight. As this may have therapeutic implications, the current study investigated differences between overweight and non-overweight adolescent psychiatric inpatients (N = 98; aged 12-20) in relation to trait impulsivity and behavioral inhibition performance. The Barratt Impulsiveness Scale and two go/no-go paradigms with neutral and food-related stimulus materials were applied. Results indicated no significant differences concerning trait impulsivity, but revealed that overweight inpatients had significantly more difficulties in inhibition performance (i.e. they reacted more impulsively) in response to both food and neutral stimuli compared to non-overweight inpatients. Furthermore, no specific inhibition deficit for high-caloric vs. low-caloric food cues emerged in overweight inpatients, whereas non-overweight participants showed significantly lower inhibition skills in response to high-caloric than low-caloric food stimuli. The results highlight a rather general, non-food-specific reduced inhibition performance in an overweight adolescent psychiatric population. Further research is necessary to enhance the understanding of the role of impulsivity in terms of body weight status in this high-risk group of adolescent inpatients. Copyright © 2017 Elsevier Ltd. All rights reserved.
International Nuclear Information System (INIS)
Loubere, Raphael; Maire, Pierre-Henri; Vachal, Pavel
2013-01-01
The aim of the present work is the 3D extension of a general formalism to derive a staggered discretization for Lagrangian hydrodynamics on unstructured grids. The classical compatible discretization is used; namely, momentum equation is discretized using the fundamental concept of subcell forces. Specific internal energy equation is obtained using total energy conservation. The subcell force is derived by invoking the Galilean invariance and thermodynamic consistency. A general form of the subcell force is provided so that a cell entropy inequality is satisfied. The subcell force consists of a classical pressure term plus a tensorial viscous contribution proportional to the difference between the node velocity and the cell-centered velocity. This cell-centered velocity is an extra degree of freedom solved with a cell-centered approximate Riemann solver. The second law of thermodynamics is satisfied by construction of the local positive definite subcell tensor involved in the viscous term. A particular expression of this tensor is proposed. A more accurate extension of this discretization both in time and space is also provided using a piecewise linear reconstruction of the velocity field and a predictor-corrector time discretization. Numerical tests are presented in order to assess the efficiency of this approach in 3D. Sanity checks show that the 3D extension of the 2D approach reproduces 1D and 2D results. Finally, 3D problems such as Sedov, Noh, and Saltzman are simulated. (authors)
International Nuclear Information System (INIS)
Fochesato, Ch.; Bouche, D.
2007-01-01
The numerical solution of Maxwell equations is a challenging task. Moreover, the range of applications is very wide: microwave devices, diffraction, to cite a few. As a result, a number of methods have been proposed since the sixties. However, among all these methods, none has proved to be free of drawbacks. The finite difference scheme proposed by Yee in 1966, is well suited for Maxwell equations. However, it only works on cubical mesh. As a result, the boundaries of complex objects are not properly handled by the scheme. When classical nodal finite elements are used, spurious modes appear, which spoil the results of simulations. Edge elements overcome this problem, at the price of rather complex implementation, and computationally intensive simulations. Finite volume methods, either generalizing Yee scheme to a wider class of meshes, or applying to Maxwell equations methods initially used in the field of hyperbolic systems of conservation laws, are also used. Lastly, 'Discontinuous Galerkin' methods, generalizing to arbitrary order of accuracy finite volume methods, have recently been applied to Maxwell equations. In this report, we more specifically focus on the coupling of a Maxwell solver to a PIC (Particle-in-cell) method. We analyze advantages and drawbacks of the most widely used methods: accuracy, robustness, sensitivity to numerical artefacts, efficiency, user judgment. (authors)
Donoghue, John R.
2015-01-01
At the heart of van der Linden's approach to automated test assembly (ATA) is a linear programming/integer programming (LP/IP) problem. A variety of IP solvers are available, ranging in cost from free to hundreds of thousands of dollars. In this paper, I compare several approaches to solving the underlying IP problem. These approaches range from…
AQUASOL: An efficient solver for the dipolar Poisson-Boltzmann-Langevin equation.
Koehl, Patrice; Delarue, Marc
2010-02-14
The Poisson-Boltzmann (PB) formalism is among the most popular approaches to modeling the solvation of molecules. It assumes a continuum model for water, leading to a dielectric permittivity that only depends on position in space. In contrast, the dipolar Poisson-Boltzmann-Langevin (DPBL) formalism represents the solvent as a collection of orientable dipoles with nonuniform concentration; this leads to a nonlinear permittivity function that depends both on the position and on the local electric field at that position. The differences in the assumptions underlying these two models lead to significant differences in the equations they generate. The PB equation is a second order, elliptic, nonlinear partial differential equation (PDE). Its response coefficients correspond to the dielectric permittivity and are therefore constant within each subdomain of the system considered (i.e., inside and outside of the molecules considered). While the DPBL equation is also a second order, elliptic, nonlinear PDE, its response coefficients are nonlinear functions of the electrostatic potential. Many solvers have been developed for the PB equation; to our knowledge, none of these can be directly applied to the DPBL equation. The methods they use may adapt to the difference; their implementations however are PBE specific. We adapted the PBE solver originally developed by Holst and Saied [J. Comput. Chem. 16, 337 (1995)] to the problem of solving the DPBL equation. This solver uses a truncated Newton method with a multigrid preconditioner. Numerical evidences suggest that it converges for the DPBL equation and that the convergence is superlinear. It is found however to be slow and greedy in memory requirement for problems commonly encountered in computational biology and computational chemistry. To circumvent these problems, we propose two variants, a quasi-Newton solver based on a simplified, inexact Jacobian and an iterative self-consistent solver that is based directly on the PBE
General Physical Problems Related to MHD. Shock Tubes. Introduction to Papers in Section 1-b
Energy Technology Data Exchange (ETDEWEB)
NONE
1966-10-15
The papers which will be considered here are Nos. SM-74/26, 134, 172, 182 and 219. Each of the five papers will be discussed in turn, but before beginning this discussion, some general comments concerning shock tube studies of MHD generator plasmas seem in order. There is little doubt that the shock tube is an excellent facility-for the study of the basic processes which occur in the bulk of the plasma. It provides a large flow of uniform plasma with well-controlled properties. Because of the very short operating times, the materials problems, which plague continuously operating facilities, are eliminated. Depending upon the mode of operation of the shock tube, the gas dynamic conditions of an MHD generator may also be simulated more or less well. Three different modes have been used by the authors of the present papers. Abbas and Howatson have carried out their measurements in the driver plasma of an electrical shock tube. Both Zauderer and Mori, Kawada, Yamamoto and Imani have used the more conventional technique of experimenting in the plasma produced by the incident shock. Louis uses the plasma produced by reflection of the shock wave from the tube-end as a plasma source for the MHD channel.
Leigh, Nathan W. C.; Wegsman, Shalma
2018-05-01
We present a formalism for constructing schematic diagrams to depict chaotic three-body interactions in Newtonian gravity. This is done by decomposing each interaction into a series of discrete transformations in energy- and angular momentum-space. Each time a transformation is applied, the system changes state as the particles re-distribute their energy and angular momenta. These diagrams have the virtue of containing all of the quantitative information needed to fully characterize most bound or unbound interactions through time and space, including the total duration of the interaction, the initial and final stable states in addition to every intervening temporary meta-stable state. As shown via an illustrative example for the bound case, prolonged excursions of one of the particles, which by far dominates the computational cost of the simulations, are reduced to a single discrete transformation in energy- and angular momentum-space, thereby potentially mitigating any computational expense. We further generalize our formalism to sequences of (unbound) three-body interactions, as occur in dense stellar environments during binary hardening. Finally, we provide a method for dynamically evolving entire populations of binaries via three-body scattering interactions, using a purely analytic formalism. In principle, the techniques presented here are adaptable to other three-body problems that conserve energy and angular momentum.
International Nuclear Information System (INIS)
Gago-Alonso, A; Santiago-Moreno, L; Piñeiro-Díaz, L R
2008-01-01
We study finite nonlinear dynamical systems that are somehow more general and complex than the relativistic Toda lattice. Our dynamical systems have a matrix representation very similar to the ones that were previously studied. It is defined in terms of a one-parameter family (D(x), M(x)) of matrices, where D(x) is a Hessenberg matrix and M(x) is a lower triangular matrix. The Jordan matrix associated with M −1 (x)D(x) is a constant of motion and the auxiliary spectral data have explicit time evolution. Using the connection between Hessenberg matrices and general orthogonal polynomials we associated to our system a one-parameter family of scalar products that we use to prove the integrability of the system. In particular the inverse transform is given by an orthogonalization process on a given scalar product
Essential imposition of Neumann condition in Galerkin-Legendre elliptic solvers
Auteri, F; Quartapelle, L
2003-01-01
A new Galerkin-Legendre direct spectral solver for the Neumann problem associated with Laplace and Helmholtz operators in rectangular domains is presented. The algorithm differs from other Neumann spectral solvers by the high sparsity of the matrices, exploited in conjunction with the direct product structure of the problem. The homogeneous boundary condition is satisfied exactly by expanding the unknown variable into a polynomial basis of functions which are built upon the Legendre polynomials and have a zero slope at the interval extremes. A double diagonalization process is employed pivoting around the eigenstructure of the pentadiagonal mass matrices in both directions, instead of the full stiffness matrices encountered in the classical variational formulation of the problem with a weak natural imposition of the derivative boundary condition. Nonhomogeneous Neumann data are accounted for by means of a lifting. Numerical results are given to illustrate the performance of the proposed spectral elliptic solv...
Flouri, Eirini; Mavroveli, Stella; Panourgia, Constantina
2013-02-01
Previous studies have established the role of various measures of cognitive functioning in dampening the association between adverse life events ('life stress') and adolescents' emotional and behavioural problems. However, it is not yet clear if general cognitive ability ('intelligence') is a protective factor. In this study of 1,175 10- to 19-year-olds in five secondary schools in England, we explored this issue. We found that even after controlling for sex, age, family poverty, and special educational needs, the association of life stress with emotional, hyperactivity, and conduct problems was significant. General cognitive ability moderated the association between life stress and conduct problems; among adolescents with higher than average general cognitive ability, the association between life stress and conduct problems was non-significant. © 2012 The British Psychological Society.
The Openpipeflow Navier–Stokes solver
Directory of Open Access Journals (Sweden)
Ashley P. Willis
2017-01-01
Full Text Available Pipelines are used in a huge range of industrial processes involving fluids, and the ability to accurately predict properties of the flow through a pipe is of fundamental engineering importance. Armed with parallel MPI, Arnoldi and Newton–Krylov solvers, the Openpipeflow code can be used in a range of settings, from large-scale simulation of highly turbulent flow, to the detailed analysis of nonlinear invariant solutions (equilibria and periodic orbits and their influence on the dynamics of the flow.
New multigrid solver advances in TOPS
International Nuclear Information System (INIS)
Falgout, R D; Brannick, J; Brezina, M; Manteuffel, T; McCormick, S
2005-01-01
In this paper, we highlight new multigrid solver advances in the Terascale Optimal PDE Simulations (TOPS) project in the Scientific Discovery Through Advanced Computing (SciDAC) program. We discuss two new algebraic multigrid (AMG) developments in TOPS: the adaptive smoothed aggregation method (αSA) and a coarse-grid selection algorithm based on compatible relaxation (CR). The αSA method is showing promising results in initial studies for Quantum Chromodynamics (QCD) applications. The CR method has the potential to greatly improve the applicability of AMG
A finite different field solver for dipole modes
International Nuclear Information System (INIS)
Nelson, E.M.
1992-08-01
A finite element field solver for dipole modes in axisymmetric structures has been written. The second-order elements used in this formulation yield accurate mode frequencies with no spurious modes. Quasi-periodic boundaries are included to allow travelling waves in periodic structures. The solver is useful in applications requiring precise frequency calculations such as detuned accelerator structures for linear colliders. Comparisons are made with measurements and with the popular but less accurate field solver URMEL
A finite element field solver for dipole modes
International Nuclear Information System (INIS)
Nelson, E.M.
1992-01-01
A finite element field solver for dipole modes in axisymmetric structures has been written. The second-order elements used in this formulation yield accurate mode frequencies with no spurious modes. Quasi-periodic boundaries are included to allow travelling waves in periodic structures. The solver is useful in applications requiring precise frequency calculations such as detuned accelerator structures for linear colliders. Comparisons are made with measurements and with the popular but less accurate field solver URMEL. (author). 7 refs., 4 figs
Vozmishcheva, Tatiana
2016-09-01
The connection between the problems of celestial mechanics: the Kepler problem, the two-center problem and the two body problem in spaces of constant curvature with the generalized Kepler and Hooke potentials is investigated. The limit passage in the two-center and two body problems in the Lobachevsky space and on a sphere is carried out as λto0 (λ is the curvature of the corresponding space) for the two potentials. The potentials and metrics in spaces under study are written in the gnomonic coordinates. It is shown that as the curvature radius tends to infinity, the generalized gravitational and elastic potentials transform to the Kepler and Hooke forms in the Euclidean space.
Energy Technology Data Exchange (ETDEWEB)
Kinugawa, Tohru, E-mail: kinugawa@phoenix.kobe-u.ac.jp [Institute for Promotion of Higher Education, Kobe University, Kobe 657-8501 (Japan)
2014-02-15
This paper presents a simple but nontrivial generalization of Abel's mechanical problem, based on the extended isochronicity condition and the superposition principle. There are two primary aims. The first one is to reveal the linear relation between the transit-time T and the travel-length X hidden behind the isochronicity problem that is usually discussed in terms of the nonlinear equation of motion (d{sup 2}X)/(dt{sup 2}) +(dU)/(dX) =0 with U(X) being an unknown potential. Second, the isochronicity condition is extended for the possible Abel-transform approach to designing the isochronous trajectories of charged particles in spectrometers and/or accelerators for time-resolving experiments. Our approach is based on the integral formula for the oscillatory motion by Landau and Lifshitz [Mechanics (Pergamon, Oxford, 1976), pp. 27–29]. The same formula is used to treat the non-periodic motion that is driven by U(X). Specifically, this unknown potential is determined by the (linear) Abel transform X(U) ∝ A[T(E)], where X(U) is the inverse function of U(X), A=(1/√(π))∫{sub 0}{sup E}dU/√(E−U) is the so-called Abel operator, and T(E) is the prescribed transit-time for a particle with energy E to spend in the region of interest. Based on this Abel-transform approach, we have introduced the extended isochronicity condition: typically, τ = T{sub A}(E) + T{sub N}(E) where τ is a constant period, T{sub A}(E) is the transit-time in the Abel type [A-type] region spanning X > 0 and T{sub N}(E) is that in the Non-Abel type [N-type] region covering X < 0. As for the A-type region in X > 0, the unknown inverse function X{sub A}(U) is determined from T{sub A}(E) via the Abel-transform relation X{sub A}(U) ∝ A[T{sub A}(E)]. In contrast, the N-type region in X < 0 does not ensure this linear relation: the region is covered with a predetermined potential U{sub N}(X) of some arbitrary choice, not necessarily obeying the Abel-transform relation. In
Three-Dimensional Inverse Transport Solver Based on Compressive Sensing Technique
Cheng, Yuxiong; Wu, Hongchun; Cao, Liangzhi; Zheng, Youqi
2013-09-01
According to the direct exposure measurements from flash radiographic image, a compressive sensing-based method for three-dimensional inverse transport problem is presented. The linear absorption coefficients and interface locations of objects are reconstructed directly at the same time. It is always very expensive to obtain enough measurements. With limited measurements, compressive sensing sparse reconstruction technique orthogonal matching pursuit is applied to obtain the sparse coefficients by solving an optimization problem. A three-dimensional inverse transport solver is developed based on a compressive sensing-based technique. There are three features in this solver: (1) AutoCAD is employed as a geometry preprocessor due to its powerful capacity in graphic. (2) The forward projection matrix rather than Gauss matrix is constructed by the visualization tool generator. (3) Fourier transform and Daubechies wavelet transform are adopted to convert an underdetermined system to a well-posed system in the algorithm. Simulations are performed and numerical results in pseudo-sine absorption problem, two-cube problem and two-cylinder problem when using compressive sensing-based solver agree well with the reference value.
Directory of Open Access Journals (Sweden)
Sánchez Álvarez , I.
1998-01-01
Full Text Available La relevancia de los problemas de optimización en el mundo empresarial ha generado la introducción de herramientas de optimización cada vez más sofisticadas en las últimas versiones de las hojas de cálculo de utilización generalizada. Estas utilidades, conocidas habitualmente como «solvers», constituyen una alternativa a los programas especializados de optimización cuando no se trata de problemas de gran escala, presentado la ventaja de su facilidad de uso y de comunicación con el usuario final. Frontline Systems Inc es la empresa que desarrolla el «solver» de Excel, si bien existen asimismo versiones para Lotus y Quattro Pro con ligeras diferencias de uso. En su dirección de internet (www.frontsys.com se puede obtener información técnica sobre las diferentes versiones de dicha utilidad y diversos aspectos operativos del programa, algunos de los cuales se comentan en este trabajo.
A sparse-grid isogeometric solver
Beck, Joakim
2018-02-28
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A sparse version of IGA solvers
Beck, Joakim
2017-07-30
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A sparse-grid isogeometric solver
Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo
2018-01-01
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A sparse version of IGA solvers
Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo
2017-01-01
Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.
A fast mass spring model solver for high-resolution elastic objects
Zheng, Mianlun; Yuan, Zhiyong; Zhu, Weixu; Zhang, Guian
2017-03-01
Real-time simulation of elastic objects is of great importance for computer graphics and virtual reality applications. The fast mass spring model solver can achieve visually realistic simulation in an efficient way. Unfortunately, this method suffers from resolution limitations and lack of mechanical realism for a surface geometry model, which greatly restricts its application. To tackle these problems, in this paper we propose a fast mass spring model solver for high-resolution elastic objects. First, we project the complex surface geometry model into a set of uniform grid cells as cages through *cages mean value coordinate method to reflect its internal structure and mechanics properties. Then, we replace the original Cholesky decomposition method in the fast mass spring model solver with a conjugate gradient method, which can make the fast mass spring model solver more efficient for detailed surface geometry models. Finally, we propose a graphics processing unit accelerated parallel algorithm for the conjugate gradient method. Experimental results show that our method can realize efficient deformation simulation of 3D elastic objects with visual reality and physical fidelity, which has a great potential for applications in computer animation.
Effects of high-frequency damping on iterative convergence of implicit viscous solver
Nishikawa, Hiroaki; Nakashima, Yoshitaka; Watanabe, Norihiko
2017-11-01
This paper discusses effects of high-frequency damping on iterative convergence of an implicit defect-correction solver for viscous problems. The study targets a finite-volume discretization with a one parameter family of damped viscous schemes. The parameter α controls high-frequency damping: zero damping with α = 0, and larger damping for larger α (> 0). Convergence rates are predicted for a model diffusion equation by a Fourier analysis over a practical range of α. It is shown that the convergence rate attains its minimum at α = 1 on regular quadrilateral grids, and deteriorates for larger values of α. A similar behavior is observed for regular triangular grids. In both quadrilateral and triangular grids, the solver is predicted to diverge for α smaller than approximately 0.5. Numerical results are shown for the diffusion equation and the Navier-Stokes equations on regular and irregular grids. The study suggests that α = 1 and 4/3 are suitable values for robust and efficient computations, and α = 4 / 3 is recommended for the diffusion equation, which achieves higher-order accuracy on regular quadrilateral grids. Finally, a Jacobian-Free Newton-Krylov solver with the implicit solver (a low-order Jacobian approximately inverted by a multi-color Gauss-Seidel relaxation scheme) used as a variable preconditioner is recommended for practical computations, which provides robust and efficient convergence for a wide range of α.
Scalable domain decomposition solvers for stochastic PDEs in high performance computing
International Nuclear Information System (INIS)
Desai, Ajit; Pettit, Chris; Poirel, Dominique; Sarkar, Abhijit
2017-01-01
Stochastic spectral finite element models of practical engineering systems may involve solutions of linear systems or linearized systems for non-linear problems with billions of unknowns. For stochastic modeling, it is therefore essential to design robust, parallel and scalable algorithms that can efficiently utilize high-performance computing to tackle such large-scale systems. Domain decomposition based iterative solvers can handle such systems. And though these algorithms exhibit excellent scalabilities, significant algorithmic and implementational challenges exist to extend them to solve extreme-scale stochastic systems using emerging computing platforms. Intrusive polynomial chaos expansion based domain decomposition algorithms are extended here to concurrently handle high resolution in both spatial and stochastic domains using an in-house implementation. Sparse iterative solvers with efficient preconditioners are employed to solve the resulting global and subdomain level local systems through multi-level iterative solvers. We also use parallel sparse matrix–vector operations to reduce the floating-point operations and memory requirements. Numerical and parallel scalabilities of these algorithms are presented for the diffusion equation having spatially varying diffusion coefficient modeled by a non-Gaussian stochastic process. Scalability of the solvers with respect to the number of random variables is also investigated.
Graph Grammar-Based Multi-Frontal Parallel Direct Solver for Two-Dimensional Isogeometric Analysis
Kuźnik, Krzysztof
2012-06-02
This paper introduces the graph grammar based model for developing multi-thread multi-frontal parallel direct solver for two dimensional isogeometric finite element method. Execution of the solver algorithm has been expressed as the sequence of graph grammar productions. At the beginning productions construct the elimination tree with leaves corresponding to finite elements. Following sequence of graph grammar productions generates element frontal matri-ces at leaf nodes, merges matrices at parent nodes and eliminates rows corresponding to fully assembled degrees of freedom. Finally, there are graph grammar productions responsible for root problem solution and recursive backward substitutions. Expressing the solver algorithm by graph grammar productions allows us to explore the concurrency of the algorithm. The graph grammar productions are grouped into sets of independent tasks that can be executed concurrently. The resulting concurrent multi-frontal solver algorithm is implemented and tested on NVIDIA GPU, providing O(NlogN) execution time complexity where N is the number of degrees of freedom. We have confirmed this complexity by solving up to 1 million of degrees of freedom with 448 cores GPU.
Cho, Yumi
2018-05-01
We study nonlinear elliptic problems with nonstandard growth and ellipticity related to an N-function. We establish global Calderón-Zygmund estimates of the weak solutions in the framework of Orlicz spaces over bounded non-smooth domains. Moreover, we prove a global regularity result for asymptotically regular problems which are getting close to the regular problems considered, when the gradient variable goes to infinity.
Bernede, Adrien; Poëtte, Gaël
2018-02-01
In this paper, we are interested in the resolution of the time-dependent problem of particle transport in a medium whose composition evolves with time due to interactions. As a constraint, we want to use of Monte-Carlo (MC) scheme for the transport phase. A common resolution strategy consists in a splitting between the MC/transport phase and the time discretization scheme/medium evolution phase. After going over and illustrating the main drawbacks of split solvers in a simplified configuration (monokinetic, scalar Bateman problem), we build a new Unsplit MC (UMC) solver improving the accuracy of the solutions, avoiding numerical instabilities, and less sensitive to time discretization. The new solver is essentially based on a Monte Carlo scheme with time dependent cross sections implying the on-the-fly resolution of a reduced model for each MC particle describing the time evolution of the matter along their flight path.
A problem of finding an acceptable variant in generalized project networks
Directory of Open Access Journals (Sweden)
David Blokh
2005-01-01
Full Text Available A project network often has some activities or groups of activities which can be performed at different stages of the project. Then, the problem of finding an optimal/acceptable time or/and optimal/acceptable order of such an activity or a group of activities arises. Such a problem emerges, in particular, in house-building management when the beginnings of some activities may vary in time or/and order. We consider a mathematical formulation of the problem, show its computational complexity, and describe an algorithm for solving the problem.
Piping benchmark problems for the General Electric Advanced Boiling Water Reactor
International Nuclear Information System (INIS)
Bezler, P.; DeGrassi, G.; Braverman, J.; Wang, Y.K.
1993-08-01
To satisfy the need for verification of the computer programs and modeling techniques that will be used to perform the final piping analyses for an advanced boiling water reactor standard design, three benchmark problems were developed. The problems are representative piping systems subjected to representative dynamic loads with solutions developed using the methods being proposed for analysis for the advanced reactor standard design. It will be required that the combined license holders demonstrate that their solutions to these problems are in agreement with the benchmark problem set
Preston, L. A.
2017-12-01
Marine hydrokinetic (MHK) devices offer a clean, renewable alternative energy source for the future. Responsible utilization of MHK devices, however, requires that the effects of acoustic noise produced by these devices on marine life and marine-related human activities be well understood. Paracousti is a 3-D full waveform acoustic modeling suite that can accurately propagate MHK noise signals in the complex bathymetry found in the near-shore to open ocean environment and considers real properties of the seabed, water column, and air-surface interface. However, this is a deterministic simulation that assumes the environment and source are exactly known. In reality, environmental and source characteristics are often only known in a statistical sense. Thus, to fully characterize the expected noise levels within the marine environment, this uncertainty in environmental and source factors should be incorporated into the acoustic simulations. One method is to use Monte Carlo (MC) techniques where simulation results from a large number of deterministic solutions are aggregated to provide statistical properties of the output signal. However, MC methods can be computationally prohibitive since they can require tens of thousands or more simulations to build up an accurate representation of those statistical properties. An alternative method, using the technique of stochastic partial differential equations (SPDE), allows computation of the statistical properties of output signals at a small fraction of the computational cost of MC. We are developing a SPDE solver for the 3-D acoustic wave propagation problem called Paracousti-UQ to help regulators and operators assess the statistical properties of environmental noise produced by MHK devices. In this presentation, we present the SPDE method and compare statistical distributions of simulated acoustic signals in simple models to MC simulations to show the accuracy and efficiency of the SPDE method. Sandia National Laboratories
Hook, Richard J.
1993-01-01
A self-administered problem-solving skill training video for nonclinical families with teens is evaluated. The study focuses on the generalization of skills to naturalistic family conversations and the program's social validity: potential iatrogenic aggravation of family problems, perceived effectiveness, and program enjoyment. Seventy families with young teens were randomly assigned to two treatment groups. One group (skill) viewed a skill training program that included information about ...
Gomez Penedo, Juan Martin; Constantino, Michael J; Coyne, Alice E; Westra, Henny A; Antony, Martin M
2017-10-01
To follow-up a randomized clinical trial that compared the acute and long-term efficacy of 15 sessions of cognitive-behavioral therapy (CBT) versus CBT integrated with motivational interviewing (MI) for severe generalized anxiety disorder (GAD; Westra, Constantino, & Antony, 2016), we (a) characterized the sample's baseline interpersonal problems, and (b) analyzed the role of several theory-relevant problems as moderators of the comparative treatment effects on outcome. We first compared clients' (N = 85) baseline interpersonal problems profile to a general clinical sample. We next conducted piecewise, 2-level growth models to analyze the interactive effects of treatment condition and the hypothesized interpersonal problem indices of nonassertiveness (ranging from low to high), exploitability (ranging from low to high on this specific combination of nonassertiveness and friendliness), and overall agency (ranging from more problems of being too submissive to more problems of being too domineering, including friendly or hostile variants) on acute and follow-up worry reduction. Finally, we conducted hierarchical generalized linear models to examine these interactive effects on the likelihood of achieving clinically meaningful worry reduction across follow-up. As expected, the GAD clients evidenced more nonassertive and exploitable interpersonal problems than the general clinical sample. Also as predicted, clients with more problematic nonassertiveness and low overall agency in their relationships had greater follow-up worry reduction in MI-CBT versus CBT, including to a clinically significant degree for the agency by treatment interaction. GAD-specific interpersonal problems can serve as contextual markers for integrative treatment selection and planning. (PsycINFO Database Record (c) 2017 APA, all rights reserved).
GPU TECHNOLOGIES EMBODIED IN PARALLEL SOLVERS OF LINEAR ALGEBRAIC EQUATION SYSTEMS
Directory of Open Access Journals (Sweden)
Sidorov Alexander Vladimirovich
2012-10-01
Full Text Available The author reviews existing shareware solvers that are operated by graphical computer devices. The purpose of this review is to explore the opportunities and limitations of the above parallel solvers applicable for resolution of linear algebraic problems that arise at Research and Educational Centre of Computer Modeling at MSUCE, and Research and Engineering Centre STADYO. The author has explored new applications of the GPU in the PETSc suite and compared them with the results generated absent of the GPU. The research is performed within the CUSP library developed to resolve the problems of linear algebra through the application of GPU. The author has also reviewed the new MAGMA project which is analogous to LAPACK for the GPU.
Development and verification of the neutron diffusion solver for the GeN-Foam multi-physics platform
International Nuclear Information System (INIS)
Fiorina, Carlo; Kerkar, Nordine; Mikityuk, Konstantin; Rubiolo, Pablo; Pautz, Andreas
2016-01-01
Highlights: • Development and verification of a neutron diffusion solver based on OpenFOAM. • Integration in the GeN-Foam multi-physics platform. • Implementation and verification of acceleration techniques. • Implementation of isotropic discontinuity factors. • Automatic adjustment of discontinuity factors. - Abstract: The Laboratory for Reactor Physics and Systems Behaviour at the PSI and the EPFL has been developing in recent years a new code system for reactor analysis based on OpenFOAM®. The objective is to supplement available legacy codes with a modern tool featuring state-of-the-art characteristics in terms of scalability, programming approach and flexibility. As part of this project, a new solver has been developed for the eigenvalue and transient solution of multi-group diffusion equations. Several features distinguish the developed solver from other available codes, in particular: object oriented programming to ease code modification and maintenance; modern parallel computing capabilities; use of general unstructured meshes; possibility of mesh deformation; cell-wise parametrization of cross-sections; and arbitrary energy group structure. In addition, the solver is integrated into the GeN-Foam multi-physics solver. The general features of the solver and its integration with GeN-Foam have already been presented in previous publications. The present paper describes the diffusion solver in more details and provides an overview of new features recently implemented, including the use of acceleration techniques and discontinuity factors. In addition, a code verification is performed through a comparison with Monte Carlo results for both a thermal and a fast reactor system.
Domain decomposition methods for core calculations using the MINOS solver
International Nuclear Information System (INIS)
Guerin, P.; Baudron, A. M.; Lautard, J. J.
2007-01-01
Cell by cell homogenized transport calculations of an entire nuclear reactor core are currently too expensive for industrial applications, even if a simplified transport (SPn) approximation is used. In order to take advantage of parallel computers, we propose here two domain decomposition methods using the mixed dual finite element solver MINOS. The first one is a modal synthesis method on overlapping sub-domains: several Eigenmodes solutions of a local problem on each sub-domain are taken as basis functions used for the resolution of the global problem on the whole domain. The second one is an iterative method based on non-overlapping domain decomposition with Robin interface conditions. At each iteration, we solve the problem on each sub-domain with the interface conditions given by the solutions on the close sub-domains estimated at the previous iteration. For these two methods, we give numerical results which demonstrate their accuracy and their efficiency for the diffusion model on realistic 2D and 3D cores. (authors)
Population Problems: A Constituent of General Culture in the 21st Century.
Rath, Ferdinand J. C. M.
1993-01-01
Compares modern population problems with those of previous generations. Examines variations in population problems in different countries and world regions and the ways in which demographic events (e.g., rapid population growth or urbanization) in one region affect other regions. Advocates preparing for demographic changes through education. (DMM)
ten Have, M; Oldehinkel, A; Vollebergh, W; Ormel, J
Little is known about the role of personality characteristics in service utilisation for mental health problems. We investigate whether neuroticism: 1) predicts the use of primary and specialised care services for mental health problems, independently of whether a person has an emotional disorder;
A Generalization of the Aumann-Shapley Value for Risk Capital Allocation Problems
Boonen, T.J.; De Waegenaere, A.M.B.; Norde, H.W.
2012-01-01
Abstract: This paper analyzes risk capital allocation problems. For risk capital allocation problems, the aim is to allocate the risk capital of a firm to its divisions. Risk capital allocation is of central importance in risk-based performance measurement. We consider a case in which the aggregate
Brink-Muinen, A. van den; Bakker, D.H. de; 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
General problems associated with the control and safe use of radiation sources (199)
International Nuclear Information System (INIS)
Ahmed, J.U.
1993-01-01
There are problems at various levels in ensuring safety in the use of radiation sources. A relatively new problem that warrants international action is the smuggling of radioactive material across international borders. An international convention on the control and safe use of radiation sources is essential to provide a universally harmonized mechanism for ensuring safety
DEFF Research Database (Denmark)
Bendtsen, Claus; Nielsen, Ole Holm; Hansen, Lars Bruno
2001-01-01
The quantum mechanical ground state of electrons is described by Density Functional Theory, which leads to large minimization problems. An efficient minimization method uses a self-consistent field (SCF) solution of large eigenvalue problems. The iterative Davidson algorithm is often used, and we...
van Weert, K.; Dhaene, J.; Goovaerts, M.
2011-01-01
In this paper we discuss multiperiod portfolio selection problems related to a specific provisioning problem. Our results are an extension of Dhaene et al. (2005) [14], where optimal constant mix investment strategies are obtained in a provisioning and savings context, using an analytical approach
A nodal method applied to a diffusion problem with generalized coefficients
International Nuclear Information System (INIS)
Laazizi, A.; Guessous, N.
1999-01-01
In this paper, we consider second order neutrons diffusion problem with coefficients in L ∞ (Ω). Nodal method of the lowest order is applied to approximate the problem's solution. The approximation uses special basis functions in which the coefficients appear. The rate of convergence obtained is O(h 2 ) in L 2 (Ω), with a free rectangular triangulation. (authors)
Health problems of victims before and after disaster: a longitudinal study in general practice.
Yzermans, C.J.; Donker, G.A.; Kerssens, J.J.; Dirkzwager, A.J.E.; Soeteman, R.J.H.; Veen, P.M.H. ten
2005-01-01
BACKGROUND: We aimed to quantify the health problems and to assess the possible risk factors for developing health problems in persons affected by the explosion of a firework depot at Enschede, The Netherlands, on May 13, 2000. The explosion considerably damaged buildings in the local neighbourhood
CREATE-NL+: A robust control-oriented free boundary dynamic plasma equilibrium solver
Energy Technology Data Exchange (ETDEWEB)
Albanese, R. [Ass. EURATOM/ENEA/CREATE, Universita’ di Napoli “Federico II”, Naples (Italy); Ambrosino, R. [Ass. EURATOM/ENEA/CREATE, Universita’ di Napoli “Parthenope”, Naples (Italy); Mattei, M., E-mail: massimiliano.mattei@unina2.it [Ass. EURATOM/ENEA/CREATE, Seconda Universita’ di Napoli, Naples (Italy)
2015-10-15
CREATE-NL+ is a FEM (Finite Elements Method) solver of the free boundary dynamic plasma equilibrium problem, i.e. the MHD (Magneto Hydro Dynamics) time evolution of 2D axisymmetric plasmas in toroidal nuclear fusion devices, including eddy currents in the passive structures, and feedback control laws for current, position and shape control. This is an improved version of the CREATE-NL code developed in 2002 which was validated on JET and used for the design of the XSC (eXtreme Shape Controller), and for simulation studies on many existing and future tokamaks. A significant improvement was the use of a robust numerical scheme for the calculation of the Jacobian matrix within the Newton based scheme for the solution of the FEM nonlinear algebraic equations. The improved capability of interfacing with other codes, and a general decrease of the computational burden for the simulation of long pulses with small time steps makes this code a flexible tool for the design and testing of magnetic control in a tokamak.
CREATE-NL+: A robust control-oriented free boundary dynamic plasma equilibrium solver
International Nuclear Information System (INIS)
Albanese, R.; Ambrosino, R.; Mattei, M.
2015-01-01
CREATE-NL+ is a FEM (Finite Elements Method) solver of the free boundary dynamic plasma equilibrium problem, i.e. the MHD (Magneto Hydro Dynamics) time evolution of 2D axisymmetric plasmas in toroidal nuclear fusion devices, including eddy currents in the passive structures, and feedback control laws for current, position and shape control. This is an improved version of the CREATE-NL code developed in 2002 which was validated on JET and used for the design of the XSC (eXtreme Shape Controller), and for simulation studies on many existing and future tokamaks. A significant improvement was the use of a robust numerical scheme for the calculation of the Jacobian matrix within the Newton based scheme for the solution of the FEM nonlinear algebraic equations. The improved capability of interfacing with other codes, and a general decrease of the computational burden for the simulation of long pulses with small time steps makes this code a flexible tool for the design and testing of magnetic control in a tokamak.
An efficient preconditioning technique using Krylov subspace methods for 3D characteristics solvers
International Nuclear Information System (INIS)
Dahmani, M.; Le Tellier, R.; Roy, R.; Hebert, A.
2005-01-01
The Generalized Minimal RESidual (GMRES) method, using a Krylov subspace projection, is adapted and implemented to accelerate a 3D iterative transport solver based on the characteristics method. Another acceleration technique called the self-collision rebalancing technique (SCR) can also be used to accelerate the solution or as a left preconditioner for GMRES. The GMRES method is usually used to solve a linear algebraic system (Ax=b). It uses K(r (o) ,A) as projection subspace and AK(r (o) ,A) for the orthogonalization of the residual. This paper compares the performance of these two combined methods on various problems. To implement the GMRES iterative method, the characteristics equations are derived in linear algebra formalism by using the equivalence between the method of characteristics and the method of collision probability to end up with a linear algebraic system involving fluxes and currents. Numerical results show good performance of the GMRES technique especially for the cases presenting large material heterogeneity with a scattering ratio close to 1. Similarly, the SCR preconditioning slightly increases the GMRES efficiency
The Quantum Mechanics Solver How to Apply Quantum Theory to Modern Physics
Basdevant, Jean-Louis
2006-01-01
The Quantum Mechanics Solver grew from topics which are part of the final examination in quantum theory at the Ecole Polytechnique at Palaiseau near Paris, France. The aim of the text is to guide the student towards applying quantum mechanics to research problems in fields such as atomic and molecular physics, condensed matter physics, and laser physics. Advanced undergraduates and graduate students will find a rich and challenging source for improving their skills in this field.
Mang, Andreas; Ruthotto, Lars
2017-01-01
We present an efficient solver for diffeomorphic image registration problems in the framework of Large Deformations Diffeomorphic Metric Mappings (LDDMM). We use an optimal control formulation, in which the velocity field of a hyperbolic PDE needs to be found such that the distance between the final state of the system (the transformed/transported template image) and the observation (the reference image) is minimized. Our solver supports both stationary and non-stationary (i.e., transient or time-dependent) velocity fields. As transformation models, we consider both the transport equation (assuming intensities are preserved during the deformation) and the continuity equation (assuming mass-preservation). We consider the reduced form of the optimal control problem and solve the resulting unconstrained optimization problem using a discretize-then-optimize approach. A key contribution is the elimination of the PDE constraint using a Lagrangian hyperbolic PDE solver. Lagrangian methods rely on the concept of characteristic curves. We approximate these curves using a fourth-order Runge-Kutta method. We also present an efficient algorithm for computing the derivatives of the final state of the system with respect to the velocity field. This allows us to use fast Gauss-Newton based methods. We present quickly converging iterative linear solvers using spectral preconditioners that render the overall optimization efficient and scalable. Our method is embedded into the image registration framework FAIR and, thus, supports the most commonly used similarity measures and regularization functionals. We demonstrate the potential of our new approach using several synthetic and real world test problems with up to 14.7 million degrees of freedom.
Directory of Open Access Journals (Sweden)
Jianke Zhang
2018-01-01
Full Text Available We study in this paper the Atangana-Baleanu fractional derivative of fuzzy functions based on the generalized Hukuhara difference. Under the condition of gH-Atangana-Baleanu fractional differentiability, we prove the generalized necessary and sufficient optimality conditions for problems of the fuzzy fractional calculus of variations with a Lagrange function. The new kernel of gH-Atangana-Baleanu fractional derivative has no singularity and no locality, which was not precisely illustrated in the previous definitions.
Millstein, Daniel J; Orsillo, Susan M; Hayes-Skelton, Sarah A; Roemer, Lizabeth
2015-01-01
To better understand the role interpersonal problems play in response to two treatments for generalized anxiety disorder (GAD); an acceptance-based behavior therapy (ABBT) and applied relaxation (AR), and to examine how the development of mindfulness may be related to change in interpersonal problems over treatment and at follow-up. Eighty-one individuals diagnosed with GAD (65.4% female, 80.2% identified as white, average age 32.92) were randomized to receive 16 sessions of either ABBT or AR. GAD severity, interpersonal problems, and mindfulness were measured at pre-treatment, post-treatment, 6-month follow-up, and 12-month follow-up. Mixed effect regression models did not reveal any significant effects of pre-treatment interpersonal problems on GAD severity over treatment. After controlling for post-treatment GAD severity, remaining post-treatment interpersonal problems predicted 6- but not 12-month GAD severity. Participants in both conditions experienced a large decrease in interpersonal problems over treatment. Increases in mindfulness over treatment and through follow-up were associated with decreases in interpersonal problems, even when accounting for reductions in overall GAD severity. Interpersonal problems may be an important target of treatment in GAD, even if pre-treatment interpersonal problems are not predictive of outcome. Developing mindfulness in individuals with GAD may help ameliorate interpersonal difficulties among this population.
International Nuclear Information System (INIS)
Na, Y. W.; Park, C. E.; Lee, S. Y.
2009-01-01
As a part of the Ministry of Knowledge Economy (MKE) project, 'Development of safety analysis codes for nuclear power plants', KOPEC has been developing the hydraulic solver code package applicable to the safety analyses of nuclear power plants (NPP's). The matrices of the hydraulic solver are usually sparse and may be asymmetric. In the earlier stage of this project, typical direct matrix solver packages MA48 and MA28 had been tested as matrix solver for the hydraulic solver code, SPACE. The selection was based on the reasonably reliable performance experience from their former version MA18 in RELAP computer code. In the later stage of this project, the iterative methodologies have been being tested in the SPACE code. Among a few candidate iterative solution methodologies tested so far, the biconjugate gradient stabilization methodology (BICGSTAB) has shown the best performance in the applicability test and in the application to the SPACE code. Regardless of all the merits of using the direct solver packages, there are some other aspects of tackling the iterative solution methodologies. The algorithm is much simpler and easier to handle. The potential problems related to the robustness of the iterative solution methodologies have been resolved by applying pre-conditioning methods adjusted and modified as appropriate to the application in the SPACE code. The application strategy of conjugate gradient method was introduced in detail by Schewchuk, Golub and Saad in the middle of 1990's. The application of his methodology to nuclear engineering in Korea started about the same time and is still going on and there are quite a few examples of application to neutronics. Besides, Yang introduced a conjugate gradient method programmed in C++ language. The purpose of this study is to assess the performance and behavior of the iterative solution methodology compared to those of the direct solution methodology still being preferred due to its robustness and reliability. The
An accurate, fast, and scalable solver for high-frequency wave propagation
Zepeda-Núñez, L.; Taus, M.; Hewett, R.; Demanet, L.
2017-12-01
In many science and engineering applications, solving time-harmonic high-frequency wave propagation problems quickly and accurately is of paramount importance. For example, in geophysics, particularly in oil exploration, such problems can be the forward problem in an iterative process for solving the inverse problem of subsurface inversion. It is important to solve these wave propagation problems accurately in order to efficiently obtain meaningful solutions of the inverse problems: low order forward modeling can hinder convergence. Additionally, due to the volume of data and the iterative nature of most optimization algorithms, the forward problem must be solved many times. Therefore, a fast solver is necessary to make solving the inverse problem feasible. For time-harmonic high-frequency wave propagation, obtaining both speed and accuracy is historically challenging. Recently, there have been many advances in the development of fast solvers for such problems, including methods which have linear complexity with respect to the number of degrees of freedom. While most methods scale optimally only in the context of low-order discretizations and smooth wave speed distributions, the method of polarized traces has been shown to retain optimal scaling for high-order discretizations, such as hybridizable discontinuous Galerkin methods and for highly heterogeneous (and even discontinuous) wave speeds. The resulting fast and accurate solver is consequently highly attractive for geophysical applications. To date, this method relies on a layered domain decomposition together with a preconditioner applied in a sweeping fashion, which has limited straight-forward parallelization. In this work, we introduce a new version of the method of polarized traces which reveals more parallel structure than previous versions while preserving all of its other advantages. We achieve this by further decomposing each layer and applying the preconditioner to these new components separately and
A comparison of SuperLU solvers on the intel MIC architecture
Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.
2016-10-01
In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.
Directory of Open Access Journals (Sweden)
Antonius J Poot
Full Text Available BACKGROUND: Satisfaction is widely used to evaluate and direct delivery of medical care; a complicated relationship exists between patient satisfaction, morbidity and age. This study investigates the relationships between complexity of health problems and level of patient satisfaction of older persons with their general practitioner (GP and practice. METHODS AND FINDINGS: This study is embedded in the ISCOPE (Integrated Systematic Care for Older Persons study. Enlisted patients aged ≥75 years from 59 practices received a written questionnaire to screen for complex health problems (somatic, functional, psychological and social. For 2664 randomly chosen respondents (median age 82 years; 68% female information was collected on level of satisfaction (satisfied, neutral, dissatisfied with their GP and general practice, and demographic and clinical characteristics including complexity of health problems. Of all participants, 4% was dissatisfied with their GP care, 59% neutral and 37% satisfied. Between these three categories no differences were observed in age, gender, country of birth or education level. The percentage of participants dissatisfied with their GP care increased from 0.4% in those with 0 problem domains to 8% in those with 4 domains, i.e. having complex health problems (p<0.001. Per additional health domain with problems, the risk of being dissatisfied increased 1.7 times (95% CI 1.4-2.14; p<0.001. This was independent of age, gender, and demographic and clinical parameters (adjusted OR 1.4, 95% CI 1.1-1.8; p = 0.021. CONCLUSION: In older persons, dissatisfaction with general practice is strongly correlated with rising complexity of health problems, independent of age, demographic and clinical parameters. It remains unclear whether complexity of health problems is a patient characteristic influencing the perception of care, or whether the care is unable to handle the demands of these patients. Prospective studies are needed to
A Simulated Annealing method to solve a generalized maximal covering location problem
Directory of Open Access Journals (Sweden)
M. Saeed Jabalameli
2011-04-01
Full Text Available The maximal covering location problem (MCLP seeks to locate a predefined number of facilities in order to maximize the number of covered demand points. In a classical sense, MCLP has three main implicit assumptions: all or nothing coverage, individual coverage, and fixed coverage radius. By relaxing these assumptions, three classes of modelling formulations are extended: the gradual cover models, the cooperative cover models, and the variable radius models. In this paper, we develop a special form of MCLP which combines the characteristics of gradual cover models, cooperative cover models, and variable radius models. The proposed problem has many applications such as locating cell phone towers. The model is formulated as a mixed integer non-linear programming (MINLP. In addition, a simulated annealing algorithm is used to solve the resulted problem and the performance of the proposed method is evaluated with a set of randomly generated problems.
Directory of Open Access Journals (Sweden)
Guo Chun Wen
2009-05-01
Full Text Available This article concerns the oblique derivative problems for second-order quasilinear degenerate equations of mixed type with several characteristic boundaries, which include the Tricomi problem as a special case. First we formulate the problem and obtain estimates of its solutions, then we show the existence of solutions by the successive iterations and the Leray-Schauder theorem. We use a complex analytic method: elliptic complex functions are used in the elliptic domain, and hyperbolic complex functions in the hyperbolic domain, such that second-order equations of mixed type with degenerate curve are reduced to the first order mixed complex equations with singular coefficients. An application of the complex analytic method, solves (1.1 below with $m=n=1$, $a=b=0$, which was posed as an open problem by Rassias.
A Mixed Enthalpy-Temperature Finite Element Method For Generalized Phase-Change Problems
DEFF Research Database (Denmark)
krabbenhøft, Kristian; Damkilde, Lars
2003-01-01
In a large number of problems of engineering interest the transition of the material from one phase to another is of vital importance in describing the overall physical behaviour. Common applications include metal casting, freezing and thawing of foodstuffs and other biological materials, ground ...... freezing and solar energy storage. The phase-change problem is characterized by an abrupt change in enthalpy per unit temperature in a narrow temperature range around the freezing point....
Koyanagi, Ai; Stickley, Andrew
2015-12-01
To assess the prevalence of sleep problems and their association with psychotic symptoms using a global database. Community-based cross-sectional study. Data were analyzed from the World Health Organization's World Health Survey (WHS), a population-based survey conducted in 70 countries between 2002 and 2004. 261,547 individuals aged ≥ 18 years from 56 countries. N/A. The presence of psychotic symptoms in the past 12 months was established using 4 questions pertaining to positive symptoms from the psychosis screening module of the Composite International Diagnostic Interview. Sleep problems referred to severe or extreme sleep problems in the past 30 days. Multivariable logistic regression was used to estimate the associations. The overall prevalence of sleep problems was 7.6% and ranged from 1.6% (China) to 18.6% (Morocco). Sleep problems were associated with significantly higher odds for at least one psychotic symptom in the vast majority of countries. In the pooled sample, after adjusting for demographic factors, alcohol consumption, smoking, and chronic medical conditions, having sleep problems resulted in an odds ratio (OR) for at least one psychotic symptom of 2.41 (95% confidence interval [CI] 2.18-2.65). This OR was 1.59 (1.40-1.81) when further adjusted for anxiety and depression. A strong association between sleep problems and psychotic symptoms was observed globally. These results have clinical implications and serve as a basis for future studies to elucidate the causal association between psychotic symptoms and sleep problems. © 2015 Associated Professional Sleep Societies, LLC.
A Mixed Enthalpy-Temperature Finite Element Method For Generalized Phase-Change Problems
DEFF Research Database (Denmark)
krabbenhøft, Kristian; Damkilde, Lars
2003-01-01
In a large number of problems of engineering interest the transition of the material from one phase to another is of vital importance in describing the overall physical behaviour. Common applications include metal casting, freezing and thawing of foodstuffs and other biological materials, ground...... freezing and solar energy storage. The phase-change problem is characterized by an abrupt change in enthalpy per unit temperature in a narrow temperature range around the freezing point....
Extension problem for generalized multi-monogenic functions in Clifford analysis
International Nuclear Information System (INIS)
Tran Quyet Thang.
1992-10-01
The main purpose of this paper is to extend some properties of multi-monogenic functions, which is a generalization of monogenic functions in higher dimensions, for a class of functions satisfying Vekua-type generalized Cauchy-Riemann equations in Clifford Analysis. It is proved that the Hartogs theorem is valid for these functions. (author). 7 refs
Twenty Years of General Education in China: Progress, Problems, and Solutions
Wang, Hongcai; Xie, Debo
2018-01-01
General education is a subject with rich contents and that is highly contested in the field of higher education studies. It has been highly praised for its core concepts such as broad educational targets, liberating educational objectives, and balanced educational content. Looking back at the course of general education in China over the past 20…